Abstract
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, non-replenishable battery charge. The battery charge is then reduced after each transmission, depending on the transmission distance. One of the major problems in wireless network design is to route network traffic efficiently so as to maximize the network lifetime, i.e., the number of successful transmissions. This problem is known to be NP-Hard for a variety of network operations. In this paper we are interested in two fundamental types of transmissions, broadcast and data gathering.
We provide polynomial time approximation algorithms, with guaranteed performance bounds, for the maximum lifetime problem under two communication models, omnidirectional and unidirectional antennas. We also consider an extended variant of the maximum lifetime problem, which simultaneously satisfies additional constraints, such as bounded hop-diameter and degree of the routing tree, and minimizing the total energy used in a single transmission.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pahlavan, K., Levesque, A.H.: Wireless information networks. Wiley-Interscience, Chichester (1995)
Krumke, S.O., Liu, R., Lloyd, E.L., Marathe, M.V., Ramanathan, R., Ravi, S.S.: Topology control problems under symmetric and asymmetric power thresholds. In: Pierre, S., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2003. LNCS, vol. 2865, pp. 187–198. Springer, Heidelberg (2003)
Ramanathan, R., Hain, R.: Topology control of multihop wireless networks using transmit power adjustment. In: INFOCOM 2000, pp. 404–413 (2000)
Park, J., Sahni, S.: Maximum lifetime broadcasting in wireless networks. IEEE Transactions on Computers 54(9), 1081–1090 (2005)
Orda, A., Yassour, B.-A.: Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas. In: MobiHoc 2005, pp. 426–437 (2005)
Kang, I., Poovendran, R.: Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks. Mobile Networks and Applications 10(6), 879–896 (2005)
Segal, M.: Fast algorithm for multicast and data gathering in wireless networks. Information Processing Letters (2007)
Adamou, M., Sarkar, S.: A framework for optimal battery management for wireless nodes (2002)
Liang, W., Liu, Y.: Online data gathering for maximizing network lifetime in sensor networks. IEEE Transactions on Mobile Computing 6(1), 2–11 (2007)
Kalpakis, K., Dasgupta, K., Namjoshi, P.: Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks. Computer Networks Journal 42(6), 697–716 (2003)
Stanford, J., Tongngam, S.: Approximation algorithm for maximum lifetime in wireless sensor networks with data aggregation. In: SNPD 2006, pp. 273–277 (2006)
Garg, N., Könemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: FOCS 1998, pp. 300–309 (1998)
Chang, J.-H., Tassiulas, L.: Energy conserving routing in wireless ad-hoc networks. In: INFOCOM 2000, pp. 22–31 (2000)
Calinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network lifetime and power assignment in ad hoc wireless networks. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 114–126. Springer, Heidelberg (2003)
Xue, Y., Cui, Y., Nahrstedt, K.: Maximizing lifetime for data aggregation in wireless sensor networks. Mobile Networks and Applications 10(6), 853–864 (2005)
Ambühl, C.: An optimal bound for the mst algorithm to compute energy efficient broadcast trees in wireless networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1139–1150. Springer, Heidelberg (2005)
Caragiannis, I., Flammini, M., Moscardelli, L.: An exponential improvement on the mst heuristic for minimum energy broadcasting in ad hoc wireless networks. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 447–458. Springer, Heidelberg (2007)
Edmonds, J.: Matroid intersection. Annals of discrete Mathematics 4, 185–204 (1979)
Bansal, N., Khandekar, R., Nagarajan, V.: Additive gurantees for degree bounded directed network design. IBM Research Report RC24347 (2008) (to appear in STOC 2008)
Wan, P.-J., Calinescu, G., Li, X., Frieder, O.: Minimum-energy broadcast routing in static ad hoc wireless networks. In: INFOCOM 2001, pp. 1162–1171 (2001)
Sekanina, M.: On the ordering of the set of vertices of a connected graph. Publication of the Faculty of Sciences of the University of Brno 412, 137–142 (1960)
Andreae, T., Bandelt, H.J.: Performance guarantees for approximation algorithms depending on parametrized triangle inequalities. SIAM J. Discret. Math. 8(1), 1–16 (1995)
Shpungin, H., Segal, M.: Low energy construction of fault tolerant topologies in wireless networks. In: DIALM-POMC 2007 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elkin, M., Lando, Y., Nutov, Z., Segal, M., Shpungin, H. (2008). Novel Algorithms for the Network Lifetime Problem in Wireless Settings. In: Coudert, D., Simplot-Ryl, D., Stojmenovic, I. (eds) Ad-hoc, Mobile and Wireless Networks. ADHOC-NOW 2008. Lecture Notes in Computer Science, vol 5198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85209-4_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-85209-4_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85208-7
Online ISBN: 978-3-540-85209-4
eBook Packages: Computer ScienceComputer Science (R0)