Biconnectivity approximations and graph carvings
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Augmenting graphs to meet edge-connectivity requirements
SIAM Journal on Discrete Mathematics
Improved approximation algorithms for uniform connectivity problems
Journal of Algorithms
Optimal transmission ranges for mobile communication in linear multihop packet radio networks
Wireless Networks - Special issue on performance evaluation methods for wireless networks
Dynamic channel allocation for linear macrocellular topology
Proceedings of the 1999 ACM symposium on Applied computing
Power consumption in packet radio networks
Theoretical Computer Science
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Approximation algorithms for minimum-cost k-vertex connected subgraphs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
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
On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Symmetric Connectivity with Minimum Power Consumption in Radio Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
FLSS: a fault-tolerant topology control algorithm for wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Deploying sensor networks with guaranteed capacity and fault tolerance
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Power optimization for connectivity problems
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Fast track article: A cooperative approach for topology control in Wireless Sensor Networks
Pervasive and Mobile Computing
Deploying sensor networks with guaranteed fault tolerance
IEEE/ACM Transactions on Networking (TON)
Discrete PSO-based fault-tolerant topology control scheme in wireless sensor networks
ISICA'10 Proceedings of the 5th international conference on Advances in computation and intelligence
Survivable network design problems in wireless networks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fault-tolerant power-aware topology control for ad-hoc wireless networks
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
Journal of Parallel and Distributed Computing
International Journal of Sensor Networks
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Power optimization in ad hoc wireless network topology control with biconnectivity requirements
Computers and Operations Research
Hi-index | 0.01 |
In ad hoc wireless networks, it is crucial to minimize power consumption while maintaining key network properties. This work studies power assignments of wireless devices that minimize power while maintaining k-fault tolerance. Specifically, we require all links established by this power setting be symmetric and form a k-vertex connected subgraph of the network graph. This problem is known to be NP-hard. We show current heuristic approaches can use arbitrarily more power than the optimal solution. Hence, we seek approximation algorithms for this problem. We present three approximation algorithms. The first algorithm gives an O(kα)-approximation where α is the best approximation factor for the related problem in wired networks (the best α so far is O(log k).) With a more careful analysis, we show our second (slightly more complicated) algorithm is an O(k)-approximation. Our third algorithm assumes that the edge lengths of the network graph form a metric. In this case, we present simple and practical distributed algorithms for the cases of 2- and 3-connectivity with constant approximation factors. We generalize this algorithm to obtain an O(k2c+2)-approximation for general k-connectivity (2≤c≤4 is the power attenuation exponent). Finally, we show that these approximation algorithms compare favorably with existing heuristics. We note that all algorithms presented in this paper can be used to minimize power while maintaining k-edge connectivity with guaranteed approximation factors. Recently, different set of authors used the notion of k-connectivity and the results of this paper to deal with the fault-tolerance issues for static wireless network settings.