Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
Improved approximation algorithms for uniform connectivity problems
Journal of Algorithms
Algorithmic aspects of topology control problems for ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
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
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Range assignment for biconnectivity and k-edge connectivity in wireless ad hoc networks
Mobile Networks and Applications
| Hi-index | 0.01 |
Given the initial energy supplies and the maximal transmission power of the individual nodes in a wireless ad hoc network, a power schedule of duration t for a specified topological property P is a scheduling of the transmission powers of the individual nodes over the period [0, t] such that (1) the total amount of energy consumed by each node during the period [O, t] does not exceed its initial energy supply, (2) the transmission power of each node at any moment in the period [O, t] does not exceed its maximal transmission power, and (3) the produced network topology at any moment in the period [0, t] satisfies the property P. The problem Max-Life Power Schedule for P seeks a power schedule of the maximal duration for P. Let g be the golden ratio (1 + √5)/2, and ε be an arbitrarily positive constant less than one. In this paper, we present a 9g/(1 - ε)2-approximation algorithm for Max-Life Power Schedule for Connectivity, a 36g/(1 - ε)2- approximation algorithm for Max-Life Power Schedule for 2-Node-Connectivity, and a 36g/(1 - ε)2-approximation algorithm for Max-Life Power Schedule for 2-Edge-Connectivity.