Power consumption in packet radio networks
Theoretical Computer Science
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Data Structures and Algorithms
Data Structures and Algorithms
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics
IEEE Transactions on Mobile Computing
Topology Control of Ad Hoc Wireless Networks for Energy Efficiency
IEEE Transactions on Computers
Algorithmic aspects of topology control problems for ad hoc networks
Mobile Networks and Applications
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall/Crc Computer & Information Science Series)
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Topology Control in Wireless Sensor Networks: with a companion simulation tool for teaching and research
Strong minimum energy minimum interference topology in wireless sensor networks
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Strong minimum interference topology for wireless sensor networks
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
| Hi-index | 0.00 |
Given a set of sensors in the plane, the strong minimum energy topology (SMET) problem is to assign transmit power to each sensor such that the resulting topology containing only bidirectional links is strongly connected. This problemis known to be NP-hard. As this problem is verymuch significant from application point of view, several heuristic algorithms have been proposed. In this paper, we propose a new incremental power greedy heuristic for SMET problem, called Kruskal-incremental power greedy heuristic. We compare Kruskal-incremental power greedy heuristic with Prim-incremental power greedy heuristic, one of the most popular heuristics available in the literature, through extensive simulation. The simulation results suggest that Kruskal-incremental power greedy heuristic outperforms on an average the Prim-incremental power greedy heuristic.