The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - July-September (2003 vol.2)
pp: 248-256
ABSTRACT
<p><b>Abstract</b>—Wireless sensor networks have recently attracted lots of research effort due to its wide range of applications. These networks must operate for months or years. However, the sensors are powered by battery, which may not be possible to be recharged after they are deployed. Thus, energy-aware network management is extremely important. In this paper, we study the following problem: Given a set of sensors in the plane, assign transmit power to each sensor such that the induced topology containing only bidirectional links is strongly connected. This problem is significant in both theory and application. We prove its NP-Completeness and propose two heuristics: power assignment based on <it>minimum spanning tree</it> (denoted by MST) and <it>incremental power</it>. We also show that MST heuristic has a performance ratio of 2. Simulation study indicates that the performance of these two heuristics does not differ very much, but, in average, the incremental power heuristic is always better than MST.</p>
INDEX TERMS
Minimum energy topology, power control, wireless sensor networks, NP-Completeness, incremental power heuristic.
CITATION
Xiuzhen Cheng, Bhagirath Narahari, Rahul Simha, Maggie Xiaoyan Cheng, Dan Liu, "Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics", IEEE Transactions on Mobile Computing, vol.2, no. 3, pp. 248-256, July-September 2003, doi:10.1109/TMC.2003.1233530
114 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool