Abstract
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 minimum spanning tree (denoted by MST) and incremental power. 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.
Original language | English (US) |
---|---|
Pages (from-to) | 248-256 |
Number of pages | 9 |
Journal | IEEE Transactions on Mobile Computing |
Volume | 2 |
Issue number | 3 |
DOIs | |
State | Published - Jul 2003 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Software
- Computer Networks and Communications
- Electrical and Electronic Engineering
Keywords
- Incremental power heuristic
- Minimum energy topology
- NP-Completeness
- Power control
- Wireless sensor networks