Abstract
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 \(\mathcal{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 [0, t] does not exceed its initial energy supply, (2) the transmission power of each node at any moment in the period [0, 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 \(\mathcal{P}\). The problem Max-Life Power Schedule for \(\mathcal{P}\) seeks a power schedule of the maximal duration for \(\mathcal{P}\). Let g be the golden ratio \((1+\sqrt{5}) /2\), and ε be an arbitrarily positive constant less than one. In this paper, we present a \(9g/\left(1-\varepsilon\right)^{2}\)-approximation algorithm for Max-Life Power Schedule for Connectivity, a \(36g/\!\left(1-\varepsilon\right)^{2}\)-approximation algorithm for Max-Life Power Schedule for 2-Node-Connectivity, and a \(36g/\!\left(1-\varepsilon\right)^{2}\)-approximation algorithm for Max-Life Power Schedule for 2-Edge-Connectivity.
Similar content being viewed by others
References
D.M. Blough, M. Leoncini, G. Resta and P. Santi, On the symmetric range assignment problem in wireless ad hoc networks, in: Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal, Aug. (2002).
G. Calinescu, S. Kapoor, A. Olshevsky and A. Zelikovsky, Network lifetime and power assignment in ad-hoc wireless networks, in: Proc. of European Symposium on Algorithms, LNCS 2832, Sept. (2003) pp. 114–126.
G. Calinescu, I. Mandoiu and A. Zelikovsky, Symmetric connectivity with minimum power consumption in radio networks, in: Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal, Aug. (2002).
G. Calinescu and P.-J. Wan, Range assignment for biconnectivity and k-edge connectivity in wireless ad hoc Networks, ACM Mobile Networks and Applications, Springer (to appear).
S. Khuller and B. Raghavachari, Improved approximation algorithms for uniform connectivity problems, Journal of Algorithms 21 (1996) 433–450.
S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings, Journal of ACM 41(2) (1994) 214–235.
E. Lloyd, R. Liu, M. Marathe, R. Ramanathan and S.S. Ravi, Algorithmic aspects of topology control problems for ad hoc networks, in: Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (Lausanne, Switzerland) June (2002).
N. Garg and J. Könemann, Faster and simpler algorithms for multicommodity flow and other fractional packing problems, in: Proceedings of the 39th Annual Symposium on Foundations of Computer Science (Palo Alto, CA) Nov. (1998) pp. 300–309.
T.S. Rappaport, Wireless Communications: Principles and Practices (Prentice Hall, 1996).
D.B. West, Introduction to Graph Theory, 2nd edition (Prentice-Hall, 2001).
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported in part by Research Grants Council of Hong Kong under grant number CityU 9041040.
Peng-Jun Wan received his Ph.D. degree from University of Minnesota, MS degree from The Chinese Academy of Science, and BS degree from Tsinghua University. He is currently an Associate Professor in Computer Science at Illinois Institute of Technology, and at City University of Hong Kong. His research interests include wireless networks, optical networks, and algorithm design and analysis.
Chih-Wei Yi received his M.S. and B.S. degrees from National Taiwan University. He is currently a Ph.D. candidate at the Illinois Institute of Technology. His dissertational research focuses on wireless ad hoc networks. He is expected to graduate in 2005.
Rights and permissions
About this article
Cite this article
Wan, PJ., Yi, CW. Max-Life Power Schedule for Connectivity and Biconnectivity in Wireless Ad Hoc Networks. Mobile Netw Appl 10, 997–1004 (2005). https://doi.org/10.1007/s11036-005-4455-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11036-005-4455-3