Algorithmic aspects of topology control problems for ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Topology control for wireless sensor networks
Proceedings of the 9th annual international conference on Mobile computing and 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
Energy-aware topology control for wireless sensor networks using memetic algorithms
Computer Communications
Optimal placement and routing strategies for resilient two-tiered sensor networks
Wireless Communications & Mobile Computing
Relay node placement in large scale wireless sensor networks
Computer Communications
Strong minimum energy minimum interference topology in wireless sensor networks
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Hi-index | 0.00 |
A node in a wireless sensor network typically consists of a micro-controller, a communication device or transceiver, and a battery unit for powering the transceiver and other devices. An important feature of wireless sensor networks is the low power consumption requirement, since these sensor nodes carry generally irreplaceable power sources or batteries. We consider the problem of assigning a power to each node in the network such that the induced connectivity graph is strongly connected with only bidirectional links, and the sum total of powers assigned to all sensor nodes is minimized. This will allow the nodes to communicate with each other, while conserving battery power as much as possible. This problem has been shown to be strongly NP-complete and heuristic approaches for solving this problem have been reported in the literature. In this paper, we establish a lower bound on the optimal power value, and provide a sufficient condition for a minimal spanning tree (MST) based approach to be an optimal solution to the problem. Based on this condition, we propose a novel heuristic approach which computationally outperforms previously reported heuristics.