Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (6876)
- Computer Sciences (6868)
- Databases and Information Systems (2875)
- Software Engineering (2164)
- Artificial Intelligence and Robotics (1253)
-
- Engineering (957)
- Numerical Analysis and Scientific Computing (844)
- Information Security (709)
- Graphics and Human Computer Interfaces (627)
- Social and Behavioral Sciences (570)
- Computer Engineering (512)
- Business (461)
- Operations Research, Systems Engineering and Industrial Engineering (418)
- Theory and Algorithms (387)
- Programming Languages and Compilers (333)
- OS and Networks (259)
- Communication (239)
- Social Media (194)
- Public Affairs, Public Policy and Public Administration (186)
- Data Storage Systems (176)
- Transportation (170)
- Education (152)
- Medicine and Health Sciences (140)
- Digital Communications and Networking (123)
- Management Information Systems (98)
- Computer and Systems Architecture (89)
- International and Area Studies (89)
- Asian Studies (88)
- Health Information Technology (83)
- Technology and Innovation (78)
- Keyword
-
- Deep learning (112)
- Machine learning (107)
- Social media (63)
- Data mining (59)
- Reinforcement learning (58)
-
- Artificial intelligence (55)
- Empirical study (55)
- Deep Learning (49)
- Software engineering (49)
- Optimization (47)
- Privacy (47)
- Task analysis (46)
- Cloud computing (45)
- Online learning (45)
- Visualization (45)
- Neural networks (44)
- Security (43)
- Training (43)
- Feature extraction (42)
- Anomaly detection (41)
- Collaboration (41)
- Singapore (41)
- Twitter (41)
- Large Language Models (36)
- Semantics (36)
- Android (35)
- Natural language processing (35)
- Classification (34)
- Machine Learning (33)
- Blockchain (32)
- Publication Year
- File Type
Articles 6541 - 6570 of 7017
Full-Text Articles in Entire DC Network
A Development Framework For Rapid Metaheuristics Hybridization, Hoong Chuin Lau, M. K. Lim, W. C. Wan, S. Halim
A Development Framework For Rapid Metaheuristics Hybridization, Hoong Chuin Lau, M. K. Lim, W. C. Wan, S. Halim
Research Collection School Of Computing and Information Systems
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to specific problems. For this reason, a software tool for rapid prototyping of algorithms would save considerable resources. This work presents a generic software framework that reduces development time through abstract classes and software reuse, and more importantly, aids design with support of user-defined strategies and hybridization of meta-heuristics. Most interestingly, we propose a novel way of redefining hybridization with the use of the "request and response" metaphor, which form an abstract concept for hybridization. Different hybridization schemes can now be formed …
Shared-Storage Auction Ensures Data Availability, Hady W. Lauw, Siu-Cheung Hui, Edmund M. K. Lai
Shared-Storage Auction Ensures Data Availability, Hady W. Lauw, Siu-Cheung Hui, Edmund M. K. Lai
Research Collection School Of Computing and Information Systems
Most current e-auction systems are based on the client-server architecture. Such centralized systems provide a single point of failure and control. In contrast, peer-to-peer systems permit distributed control and minimize individual node and link failures' impact on the system. The shared-storage-based auction model described decentralizes services among peers to share the required processing load and aggregates peers' resources for common use. The model is based on the principles of local computation at each peer, direct inter-peer communication, and a shared storage space.
A Qualitative Investigation On Consumer Trust In Mobile Commerce, Keng Siau, Hong Sheng, Fiona Fui-Hoon Nah, Sidney A. Davis
A Qualitative Investigation On Consumer Trust In Mobile Commerce, Keng Siau, Hong Sheng, Fiona Fui-Hoon Nah, Sidney A. Davis
Research Collection School Of Computing and Information Systems
Mobile commerce represents a significant development in e-commerce, offering accessibility, ubiquity, mobility, and localisation to users. Despite the potential of mobile commerce, trust is a major obstacle in its adoption and development. Many consumers feel uncomfortable with the idea of conducting commerce over wireless, hand-held devices. The focus of this research is to understand trust in mobile commerce and to identify factors that are important for trust development. The research builds on Siau and Shen's framework which depicts two key factors influencing trust in mobile commerce. This research not only validates and expands on the existing framework, but also provides …
Proxy Signature Scheme With Multiple Original Signers For Wireless E-Commerce Applications, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Proxy Signature Scheme With Multiple Original Signers For Wireless E-Commerce Applications, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Research Collection School Of Computing and Information Systems
In a proxy signature scheme, a user delegates his/her signing capability to another user in such a way that the latter can sign messages on behalf of the former. We propose an efficient and secure proxy signature scheme with multiple original signers. Our scheme is suitable for wireless electronic commerce applications, since the overheads of computation and communication are low. As an example, we present an electronic air ticket booking scheme for wireless customers.
Group-Based Relevance Feedback With Support Vector Machine Ensembles, Steven C. H. Hoi, Michael R. Lyu
Group-Based Relevance Feedback With Support Vector Machine Ensembles, Steven C. H. Hoi, Michael R. Lyu
Research Collection School Of Computing and Information Systems
Support vector machines (SVMs) have become one of the most promising techniques for relevance feedback in content-based image retrieval (CBIR). Typical SVM-based relevance feedback techniquessimply apply the strict binary classifications: positive (relevant) class and negative (irrelevant) class. However, in a real-world relevance feedback task, it is more reasonable and practical to assume the data come from multiple positive classes and one negative class. In order to formulate an effective relevance feedback algorithm, we propose a novel group-based relevance feedback scheme constructed with the SVM ensembles technique. Experiments are conducted to evaluate the performance of our proposed scheme and the traditional …
High Accuracy Classification Of Eeg Signal, Wenjie Xu, Cuitai Guan, Chng Eng Siong, S. Ranganatha, Manoj Thulasidas, Jiankang Wu
High Accuracy Classification Of Eeg Signal, Wenjie Xu, Cuitai Guan, Chng Eng Siong, S. Ranganatha, Manoj Thulasidas, Jiankang Wu
Research Collection School Of Computing and Information Systems
Improving classification accuracy is a key issue to advancing brain computer interface (BCI) research from laboratory to real world applications. This article presents a high accuracy EEC signal classification method using single trial EEC signal to detect left and right finger movement. We apply an optimal temporal filter to remove irrelevant signal and subsequently extract key features from spatial patterns of EEG signal to perform classification. Specifically, the proposed method transforms the original EEG signal into a spatial pattern and applies the RBF feature selection method to generate robust feature. Classification is performed by the SVM and our experimental result …
Investigating Deception In Cyberspace, Holtjona Galanxhi, Fiona Fui-Hoon Nah
Investigating Deception In Cyberspace, Holtjona Galanxhi, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
The use of anthropomorphic avatars provides Internet users the opportunity and freedom to present their desired identity. As cyberspace becomes a heaven for deceptive behavior, human-computer interaction research will need to be carried out to study and understand these deceptive behaviors. The objective of this research is to investigate the behavior of deceivers and truthtellers in the cyberspace environment and to examine how their intention to deceive may influence the choice of their avatars. The effect of using avatars to support communication will also be studied. This research provides insights on communication and trust issues in avatar environments.
Rating Information Security Maturity, Arcot Desai Narasimhalu, Nagarajan Dayasindhu
Rating Information Security Maturity, Arcot Desai Narasimhalu, Nagarajan Dayasindhu
Research Collection School Of Computing and Information Systems
Most CEOs have difficulty relating to the information security investments in their companies. This article presents a summary of a the information security maturity model that the CEOs could use to determine the desired level of investments into information security infrastructure, tools and applications.
Exploiting Information Theory For Adaptive Mobility And Resource Management In Future Cellular Networks, Abhishek Roy, Sajal K. Das, Archan Misra
Exploiting Information Theory For Adaptive Mobility And Resource Management In Future Cellular Networks, Abhishek Roy, Sajal K. Das, Archan Misra
Research Collection School Of Computing and Information Systems
We utilize tools from information theory to develop adaptive algorithms for two key problems in cellular networks: location tracking and resource management. The use of information theory is motivated by the fundamental observation that overheads in many aspects of mobile computing can be traced to the randomness or uncertainty in an individual user's movement behavior. We present a model-independent information-theoretic approach for estimating and managing this uncertainty, and relate it to the entropy or information content of the user's movement process. Information-theoretic mobility management algorithms are very simple, yet reduce overhead by ∼80 percent in simulated scenarios by optimally adapting …
Ltam: A Location-Temporal Authorization Model, Hai Yu, Ee Peng Lim
Ltam: A Location-Temporal Authorization Model, Hai Yu, Ee Peng Lim
Research Collection School Of Computing and Information Systems
This paper describes an authorization model for specifying access privileges of users who make requests to access a set of locations in a building or more generally a physical or virtual infrastructure. In the model, primitive locations can be grouped into composite locations and the connectivities among locations are represented in a multilevel location graph. Authorizations are defined with temporal constraints on the time to enter and leave a location and constraints on the number of times users can access a location. Access control enforcement is conducted by monitoring user movement and checking access requests against an authorization database. The …
Theoretical And Practical Complexity Of Uml, J. Erickson, Keng Siau
Theoretical And Practical Complexity Of Uml, J. Erickson, Keng Siau
Research Collection School Of Computing and Information Systems
Systems have become increasingly complex, and as a result development methods have become more complex as well. The unified modeling language (UML) has been criticized for the often cited and sometimes over-whelming complexity it presents to its users, and those seeking to learn to use it. Using Rossi and Brinkkemper’s (1996) complexity metrics, Siau and Cao (2001) completed a complexity analysis of UML and 36 other modeling techniques, finding that UML is indeed more complex than other techniques. Siau, Erickson and Lee (2002) proposed that Rossi and Brinkkemper’s metrics present the theoretical maximum complexity, known as theoretical complexity. This is …
Sa&D And Database: Should We Be Researching What We Are Teaching?, Jeffrey B. Parson, Akhilesh. Bajaj, Dinesh Batra, Alan Hevner, Keng Siau
Sa&D And Database: Should We Be Researching What We Are Teaching?, Jeffrey B. Parson, Akhilesh. Bajaj, Dinesh Batra, Alan Hevner, Keng Siau
Research Collection School Of Computing and Information Systems
The panel will examine the reasons for the mismatch between SA&D and database teaching and research. The implication of this mismatch on the MIS academic and practitioner communities will also be discussed and debated.
Ica-Fx Features For Classification Of Singing Voice And Instrumental Sound, Tat-Wan Leung, Chong-Wah Ngo, Rynson W. H Lau
Ica-Fx Features For Classification Of Singing Voice And Instrumental Sound, Tat-Wan Leung, Chong-Wah Ngo, Rynson W. H Lau
Research Collection School Of Computing and Information Systems
This paper describes a new approach in locating the segments of singing voice in pop musical songs. Initially, GLR distance measure is employed to temporally detect the boundaries of singing voices and instrumental sounds. ICAFX is then adopted to extract the independent components of acoustic features for SVM classification. Experimental results indicate that ICA-FX can improve the classification performance by significantly reducing the independent components that are not related to class label information.
Transport Logistics Planning With Service-Level Constraints, Hoong Chuin Lau, K. M. Ng, Xintao Wu
Transport Logistics Planning With Service-Level Constraints, Hoong Chuin Lau, K. M. Ng, Xintao Wu
Research Collection School Of Computing and Information Systems
In this paper, we study a logistics problem arising in military transport planning. A military organization operates a large fleet of vehicles in a depot to serve the requests of various operational units. Each request has a fixed start and end time, and is served by a prescribed number of vehicles. We address the following two problems: (1) how many vehicles are at least needed to meet a given service level of requests; and (2) suppose we allow each request to shift its start time by a constant duration, call all the requests be met? A Niche genetic algorithm, together …
Biased Support Vector Machine For Relevance Feedback In Image Retrieval, Steven Hoi, Chi-Hang Chan, Kaizhu Huang, Michael R. Lyu, Irwin King
Biased Support Vector Machine For Relevance Feedback In Image Retrieval, Steven Hoi, Chi-Hang Chan, Kaizhu Huang, Michael R. Lyu, Irwin King
Research Collection School Of Computing and Information Systems
Recently, support vector machines (SVMs) have been engaged on relevance feedback tasks in content-based image retrieval. Typical approaches by SVMs treat the relevance feedback as a strict binary classification problem. However, these approaches do not consider an important issue of relevance feedback, i.e. the unbalanced dataset problem, in which the negative instances largely outnumber the positive instances. For solving this problem, we propose a novel technique to formulate the relevance feedback based on a modified SVM called biased support vector machine (Biased SVM or BSVM). Mathematical formulation and explanations are provided for showing the advantages. Experiments are conducted to evaluate …
A Support-Ordered Trie For Fast Frequent Itemset Discovery, Ee Peng Lim, Yew-Kwong Woon, Wee-Keong Ng
A Support-Ordered Trie For Fast Frequent Itemset Discovery, Ee Peng Lim, Yew-Kwong Woon, Wee-Keong Ng
Research Collection School Of Computing and Information Systems
The importance of data mining is apparent with the advent of powerful data collection and storage tools; raw data is so abundant that manual analysis is no longer possible. Unfortunately, data mining problems are difficult to solve and this prompted the introduction of several novel data structures to improve mining efficiency. Here, we critically examine existing preprocessing data structures used in association rule mining for enhancing performance in an attempt to understand their strengths and weaknesses. Our analyses culminate in a practical structure called the SOTrielT (support-ordered trie itemset) and two synergistic algorithms to accompany it for the fast discovery …
Infosemm: Infosys It Security Maturity Model: A Report, Arcot Desai Narasimhalu, N. Dayasindhu, Raghavan Subramanian
Infosemm: Infosys It Security Maturity Model: A Report, Arcot Desai Narasimhalu, N. Dayasindhu, Raghavan Subramanian
Research Collection School Of Computing and Information Systems
Businesses are faced with a continuing battle related to cyber security related issues ranging from cyber attacks all the way to cyber (information) war. These issues affect result in information, system, reputation, and revenue related risks. These risks arise because of vulnerabilities introduced in three major parts of the enterprise – infrastructure, intelligence and practices. This report provides a rating system for representing the security health of enterprises.
An Empirical Investigation On End-Users’ Acceptance Of Enterprise Systems, Fiona Fui-Hoon Nah, Xin Tan, Soon Hing Teh
An Empirical Investigation On End-Users’ Acceptance Of Enterprise Systems, Fiona Fui-Hoon Nah, Xin Tan, Soon Hing Teh
Research Collection School Of Computing and Information Systems
Despite the huge investments by organizations in ERP implementation, maintenance, and user training, ERP implementation failures and less-than-satisfactory productivity improvements are common. End-users’ reluctance or unwillingness to adopt or use the newly implemented ERP system is often cited as one of the main reasons for ERP failures. To examine factors leading to the lack of end-user acceptance of ERP systems, we reviewed the literature on user adoption of IT in mandatory contexts, developed hypotheses to explain ERP user acceptance, and conducted a survey study to test the hypotheses. In particular, we examined end-users’ attitudes toward system use and symbolic adoption, …
Taking Dcop To The Real World: Efficient Complete Solutions For Distributed Event Scheduling, Rajiv Maheswaran, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Varakantham
Taking Dcop To The Real World: Efficient Complete Solutions For Distributed Event Scheduling, Rajiv Maheswaran, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Distributed Constraint Optimization (DCOP) is an elegant formalism relevant to many areas in multiagent systems, yet complete algorithms have not been pursued for real world applications due to perceived complexity. To capably capture a rich class of complex problem domains, we introduce the Distributed Multi-Event Scheduling (DiMES) framework and design congruent DCOP formulations with binary constraints which are proven to yield the optimal solution. To approach real-world efficiency requirements, we obtain immense speedups by improving communication structure and precomputing best case bounds. Heuristics for generating better communication structures and calculating bound in a distributed manner are provided and tested on …
Notes On Equilibria In Symmetric Games, Shih-Fen Cheng, Daniel M. Reeves, Yevgeniy Vorobeychik, Michael P. Wellman
Notes On Equilibria In Symmetric Games, Shih-Fen Cheng, Daniel M. Reeves, Yevgeniy Vorobeychik, Michael P. Wellman
Research Collection School Of Computing and Information Systems
In a symmetric game, every player is identical with respect to the game rules. We show that a symmetric 2strategy game must have a pure-strategy Nash equilibrium. We also discuss Nash’s original paper and its generalized notion of symmetry in games. As a special case of Nash’s theorem, any finite symmetric game has a symmetric Nash equilibrium. Furthermore, symmetric infinite games with compact, convex strategy spaces and continuous, quasiconcave utility functions have symmetric pure-strategy Nash equilibria. Finally, we discuss how to exploit symmetry for more efficient methods of finding Nash equilibria.
An Interactive Learning Environment For A Dynamic Educational Digital Library, Ee Peng Lim, Dion Hoe-Lian Goh, Yin-Leng Theng, Eng-Kai Suen
An Interactive Learning Environment For A Dynamic Educational Digital Library, Ee Peng Lim, Dion Hoe-Lian Goh, Yin-Leng Theng, Eng-Kai Suen
Research Collection School Of Computing and Information Systems
GeogDL is a digital library of geography examination resources designed to assist students in preparing for a national geography examination in Singapore. We describe an interactive learning environment built into GeogDL that consists of four major components. The practice and review module allows students to attempt individual examination questions, the mock exam provides a simulation of the actual geography examination, the trends analysis tool provides an overview of the types of questions asked in previous examinations, while the contributions module allows students and teachers to create and share knowledge within the digital library.
A Rate-Distortion Framework For Information-Theoretic Mobility Management, Abhishek Roy, Archan Misra, Sajal K. Das
A Rate-Distortion Framework For Information-Theoretic Mobility Management, Abhishek Roy, Archan Misra, Sajal K. Das
Research Collection School Of Computing and Information Systems
A practical information theoretic framework is developed for studying the optimal tradeoff between location update and paging costs in cellular networks. The framework envisions the quantization of location information into a registration area (RA) level granularity, followed by the use of an entropy-coding technique to decrease the location update rate. The rate distortion theory of the lossy quantization is identified as an appropriate measure for capturing the optimal tradeoff between a mobile's update rate and its location uncertainty. Based on LZ-78 compression, two different RA-level location update algorithms (RA-LeZi and LeZi-RA) have been developed, both of which asymptotically approach this …
The Complexity Of Uml: Differentiating Practical And Theoretical Complexity, J. Erickson, Keng Siau
The Complexity Of Uml: Differentiating Practical And Theoretical Complexity, J. Erickson, Keng Siau
Research Collection School Of Computing and Information Systems
UML (Unified Modeling Language) has been criticized for its complexity, relating to users, and those learning to use it. Using Rossi and Brinkkemper’s [9] complexity metrics, Siau and Cao [10] completed a complexity analysis of UML and 36 other modeling techniques, finding that UML is indeed more complex than other techniques. Siau, Erickson and Lee [11] argued that Rossi and Brinkkemper’s metrics present the theoretical maximum complexity, as opposed to a practitioner-based complexity, that must be less than the theoretical maximum. The current research proposes that a subset of UML (a kernel) composed of the most commonly used constructs, would …
Furthering The Understanding Of Practical Complexity: Identifying A Kernel Of Uml, J. Erickson, Keng Siau
Furthering The Understanding Of Practical Complexity: Identifying A Kernel Of Uml, J. Erickson, Keng Siau
Research Collection School Of Computing and Information Systems
The Unified Modeling Language (UML) was adopted by the Object Management Group as the standard visual modeling language for OO systems development. However, UML has been criticized in the literature for its complexity, inconsistent semantics, and ambiguous constructs. A set of complexity indices for UML in aggregate, and the nine diagramming techniques individually, was compiled recently. Since this set of metrics is based on inclusion of all possible constructs in UML, it thus provides an indication of the theoretical (maximum) complexity of the modeling methods. This paper contends that in practice, developers do not use all of the possible diagrams …
Steganographic Schemes For File System And B-Tree, Hwee Hwa Pang, Kian-Lee Tan, Xuan Zhou
Steganographic Schemes For File System And B-Tree, Hwee Hwa Pang, Kian-Lee Tan, Xuan Zhou
Research Collection School Of Computing and Information Systems
While user access control and encryption can protect valuable data from passive observers, these techniques leave visible ciphertexts that are likely to alert an active adversary to the existence of the data. We introduce StegFD, a steganographic file driver that securely hides user-selected files in a file system so that, without the corresponding access keys, an attacker would not be able to deduce their existence. Unlike other steganographic schemes proposed previously, our construction satisfies the prerequisites of a practical file system in ensuring the integrity of the files and maintaining efficient space utilization. We also propose two schemes for implementing …
Modified Art 2a Growing Network Capable Of Generating A Fixed Number Of Nodes, Ji He, Ah-Hwee Tan, Chew-Lim Tan
Modified Art 2a Growing Network Capable Of Generating A Fixed Number Of Nodes, Ji He, Ah-Hwee Tan, Chew-Lim Tan
Research Collection School Of Computing and Information Systems
This paper introduces the Adaptive Resonance Theory under Constraint (ART-C 2A) learning paradigm based on ART 2A, which is capable of generating a user-defined number of recognition nodes through online estimation of an appropriate vigilance threshold. Empirical experiments compare the cluster validity and the learning efficiency of ART-C 2A with those of ART 2A, as well as three closely related clustering methods, namely online K-Means, batch K-Means, and SOM, in a quantitative manner. Besides retaining the online cluster creation capability of ART 2A, ART-C 2A gives the alternative clustering solution, which allows a direct control on the number of output …
Performance Planning, Quality-Of-Service, And Pricing Under Competition, Corinne Touati, Parijat Dube, Laura Wynter
Performance Planning, Quality-Of-Service, And Pricing Under Competition, Corinne Touati, Parijat Dube, Laura Wynter
Research Collection School Of Computing and Information Systems
In this work we model the relationship between the capacity and the Quality of Service (QoS) offered by the firm in a competitive scenario of two firm’s working to maximize their profits. Using simple queueing theoretic models we study the sensitivity of a firm’s market share to price, capacity and market size. Our preliminary studies yield important properties of the equilibrium solution which may further provide important “engineering” guidelines for performance planning and pricing strategies.
A Stage Model For E-Government Implementation, Keng Siau, Y. Long
A Stage Model For E-Government Implementation, Keng Siau, Y. Long
Research Collection School Of Computing and Information Systems
With the advancement of wired and wireless technologies in recent years, the concept of an e-government has attracted increasing interests from both researchers and practitioners. The E-Government Act of 2002 was signed into law by President Bush to encourage government agencies to efficiently and effectively serve their customers over the Web. E-government presents a way for government agencies to use new technologies, such as the Internet, to provide citizens, businesses, and other governments with a more convenient access to government information and services, to improve the quality of services, and to provide greater opportunities for citizens to participate in democratic …
Multi-Period Multi-Dimensional Knapsack Problem And Its Application To Available-To-Promise, Hoong Chuin Lau, M. K. Lim
Multi-Period Multi-Dimensional Knapsack Problem And Its Application To Available-To-Promise, Hoong Chuin Lau, M. K. Lim
Research Collection School Of Computing and Information Systems
This paper is motivated by a recent trend in logistics scheduling, called Available-to-Promise. We model this problem as the multi-period multi-dimensional knapsack problem. We provide some properties for a special case of a single-dimensional problem. Based on insights obtained from these properties, we propose a two-phase heuristics for solving the multi-dimensional problem. We also propose a novel time-based ant colony optimization algorithm. The quality of the solutions generated is verified through experiments, where we demonstrate that the computational time is superior compared with integer programming to achieve solutions that are within a small percentage of the upper bounds.
Power Adaptation Based Optimization For Energy Efficient Reliable Wireless Paths, Suman Banerjee, Archan Misra
Power Adaptation Based Optimization For Energy Efficient Reliable Wireless Paths, Suman Banerjee, Archan Misra
Research Collection School Of Computing and Information Systems
We define a transmission power adaptation-based routing technique that finds optimal paths for minimum energy reliable data transfer in multi-hop wireless networks. This optimal choice of the transmission power depends on the link distance between the two nodes and the channel characteristics. Typical energy efficient routing techniques use a transmission power such that the received signal power at the destination minimally exceeds a desired threshold signal strength level. In this paper we argue that such a choice of the transmission power does not always lead to optimal energy routes, since it does not consider differences in the receiver noise levels.We …