Power consumption in packet radio networks
Theoretical Computer Science
Algorithmic aspects of topology control problems for ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Range assignment for biconnectivity and k-edge connectivity in wireless ad hoc networks
Mobile Networks and Applications
Approximating the minimum number of maximum power users in ad hoc networks
Mobile Networks and Applications
Energy-efficient networking techniques for wireless sensor networks
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
An Iterative Exact Solution for the Dual Power Management Problem in Wireless Sensor Network
Journal of Mathematical Modelling and Algorithms
Network topology models for multihop wireless networks
ISRN Communications and Networking
| Hi-index | 5.23 |
Topology control is one of the major approaches to achieve energy efficiency as well as fault tolerance in wireless networks. In this paper, we study the dual power assignment problem for 2-edge connectivity and 2-vertex connectivity in the symmetric graphical model. The problem has arisen from the following practical origin. In a wireless ad hoc network where each node can switch its transmission power between high-level and low-level, how can we establish a fault-tolerant connected network topology in the most energy-efficient way? Specifically, the objective is to minimize the number of nodes assigned with high power and yet achieve 2-edge connectivity or 2-vertex connectivity. Note that to achieve a minimum number of high-power nodes is harder than an optimization problem in the same model whose objective is to minimize the total power cost. We first address these two optimization problems (2-edge connectivity and 2-vertex connectivity version) under the general graph model. Due to the NP-hardness, we propose an approximation algorithm, called prioritized edge selection algorithm, which achieves a 4-ratio approximation for 2-edge connectivity. After that, we modify the algorithm to solve the problem for 2-vertex connectivity and also achieve the same approximation ratio. We also show that the 4-ratio is tight for our algorithms in both cases.