Skip to main content
SpringerLink
Log in

Maximizing Network Lifetime of Broadcasting Over Wireless Stationary Ad Hoc Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

We investigate the problem of extending the network lifetime of a single broadcast session over wireless stationary ad hoc networks where the hosts are not mobile. We define the network lifetime as the time from network initialization to the first node failure due to battery depletion. We provide through graph theoretic approaches a polynomial-time globally optimal solution, a variant of the minimum spanning tree (MST), to the problem of maximizing the static network lifetime. We make use of this solution to develop a periodic tree update strategy for effective load balancing and show that a significant gain in network lifetime over the optimal static network lifetime can be achieved. We provide extensive comparative simulation studies on parameters such as update interval and control overhead and investigate their impact on the network lifetime. The simulation results are also compared with an upper bound to the network lifetime.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Special issue on challenges in mobile ad hoc networking, IEEE Communications Magazine 39(6) (2001).

  2. Special issue on energy-aware ad hoc wireless networks, IEEE Wireless Communications 9(4) (2002).

  3. Special issue on wireless ad hoc networks, IEEE Journal on Selected Areas in Communications 17(8) (1999).

  4. Special issue on collaborative signal and information processing in microsensor networks, IEEE Signal Processing Magazine 19(2) (2002).

  5. J.E. Wieselthier, G.D. Nguyen and A. Ephremides, On the construction of energy-efficient broadcast and multicast trees in wireless networks, in: Proc. IEEE INFOCOM (2000) pp. 586–594.

  6. A. Ephremides, Energy concerns in wireless networks, IEEE Wireless Communications 9(4) (2002) pp. 48–59.

    Article  Google Scholar 

  7. S. Singh, M. Woo and C.S. Raghavendra, Power-aware routing in mobile ad hoc networks, in: Proc. ACM/IEEE MOBICOM, (Dallas, TX, Oct. 1998) pp. 181–190.

  8. S.-J. Lee, W. Su, J. Hsu, M. Gerla and R. Bagrodia, A performance comparison study of ad hoc wireless multicast protocols, in: Proc. of the IEEE Conference on Computer Communications (INFOCOM 2000) (Tel Aviv, Israel, March 2000) pp. 565–574.

  9. C.-K. Toh, Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks, IEEE Communications Magazine (2001) pp. 138–147.

  10. J.H. Chang and L. Tassiulas, Energy conserving routing in wireless ad-hoc networks, in: INFOCOM '2000 (2000).

  11. V. Rodoplu and T.H. Meng, Minimum energy mobile wireless networks, IEEE J. Selected Areas in Communications 17(8) (1999).

  12. J.E. Wieselthier, G.D. Nguyen and A. Ephremides, Resource management in energy-limited bandwidth-limited, transceiver-limited wireless networks for session-based multicasting, Computer Networks 39(2) (2002) pp. 113–131.

    Article  Google Scholar 

  13. D. Estrin, R. Govindan, J. Heidemann and S. Kumar, Next century challenges: Scalable coordination in sensor networks, in: Proc. of the ACM/ IEEE International Conference on Mobile Computing and Networking (Seattle, Washington, USA, August 1999) pp. 263–270.

    Google Scholar 

  14. R.G. Gallager, P.A. Humblet and P.M. Spira, A distributed algorithm for minimum-weight spanning trees, ACM Trans. on Programming Languages and Systems 5(1) (1983) pp. 66–77.

    Google Scholar 

  15. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, 2nd edition (MIT Press, Cambridge, MA, 1990).

    Google Scholar 

  16. R. Ramanathan and R. Rosales-Hain, Topology control of multihop wireless networks using transmit power adjustment, in: Proc. IEEE INFOCOM 2000 (March 2000).

  17. R. Wattenhofer, L. Li, P. Bahl and Y. Wang, Distributed topology control for power efficient operation in multihop wireless ad hoc networks, in: Proc. IEEE INFOCOM 2001(2001).

  18. B. Chen, K. Jamieson, H. Balakrishnan and R. Morris, SPAN: An energy-efficient coordination algorithms for topology maintenance in ad hoc wireless networks, in: Proc. 7th ACM MOBICOM (Rome, Italy, July 2001).

  19. Q. Li, J. Aslam and D. Rus, Online power-aware routing in wireless ad-hoc network, in: Proc. ACM/IEEE MOBICOM, 2001 (Rome, Italy, July 2001) pp. 97–107.

  20. Y. Xu, J. Heidemann and D. Estrin, Geography-informed energy conservation for ad hoc routing, ACM SIGMOBILE 7/01 Rome, Italy.

  21. P.J. Wan, G. Calinescu, X.Y. Li and O. Frieder, Minimum-energy broadcast routing in static ad hoc wireless networks, in:Proc. IEEE INFOCOM (2001).

  22. B.N. Levine and J.J. Garcia-Luna-Aceves, A comparison of known classes of reliable multicast protocols, in: Proc. International Conference on Network Protocols (ICNP-96) (Columbus, Ohio, Oct. 29–Nov 1, 1996).

  23. C. Ho, K. Obraczka, G. Tsudik and K. Viswanath, Flooding for reliable multicast in multi-hop ad hoc networks, in: ACM Workshop on Discrete Algorithms for Mobility (Aug. 1999).

  24. W.R. Heinzelman, A. Chandrakasan and H. Balakrishnan, Energy-efficient communication protocol for wireless microsensor networks, in: Proc. Hawaii International Conference on System Sciences (Maui, Hawaii, 2000).

  25. A.E.F. Clementi, P. Crescenzi, P. Penna, G. Rossi and P. Vocca, A worst-case analysis of an MST-based heuristic to construct energy-efficient broadcast trees in wireless networks, Technical Report 010 of the Univ. of Rome “Tor Vergata ” (2001).

  26. O. Egecioglu and T. Gonzalez, Minimum-energy broadcast in simple graphs with limited node power, in: Proc. IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2001), Anaheim, CA (Aug. 2001) pp. 334–338.

  27. P.A. Humblet, A distributed algorithm for minimum weight directed spanning trees, IEEE Trans. on Communications COM-31(6) (1983).

  28. Y.J. Chu and T.H. Liu, On the shortest arborescence of a directed graph, Sci. Sinica 14(1965) pp. 1396–1400.

    MathSciNet  Google Scholar 

  29. R.E. Tarjan, Finding optimum branchings, Networks 7(1977) pp. 25– 35.

    MathSciNet  MATH  Google Scholar 

  30. V.Tsiatsis, S. Zimbeck and M. Srivastava, Architectural strategies for energy efficient packet forwarding in wireless sensor networks, in: Proc. ISLPED (2001) pp. 92–95.

  31. M. Adamou and S. Sarkar, A framework for optimal battery management for wireless nodes, in: Proc. of INFOCOM (2002) pp. 1783– 1792.

  32. C.F. Chiasserini and R.R. Rao, Energy efficient battery management in: Proc. of INFOCOM 2000 (Tel Aviv, Israel, March 2000).

  33. V. Raghunathan, C. Schurgers, S. Park and M.B. Srivastava, Energy-aware wireless microsensor networks, IEEE Signal Processing Magazine 19(2) (2002) pp. 40–50.

    Article  Google Scholar 

  34. M. Cagalj, Jean-Pierre Hubaux and C. Enz, Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues, in: MOBICOM'02 (Atlanta, Georgia, USA, Sept. 2002).

  35. I. Kang and R. Poovendran, Maximizing static network lifetime of wireless broadcast adhoc networks, in: IEEE International Conference on Communications (ICC) 2003 (Anchorage, Alaska, May 11–15, 2003).

  36. I. Kang and R. Poovendran, Broadcast with heterogeneous node capability accepted to IEEE Global Telecommunications Conference (Globecom) (Dallas, Texas, Nov. 29–Dec. 03, 2004).

  37. I. Kang and R. Poovendran, On the lifetime extension of energy-constrained multihop broadcast networks, in: IEEE International Joint Conference on Neural Networks (IJCNN) 2002 (Hawaii, USA, May 2002).

  38. D.M. Blough and P. Santi, Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks, in: Proc. ACM MobiCom 2002 Atlanta pp. 183–192.

  39. P. Gupta and P.R. Kumar, Critical power for asymptotic connectivity in wireless networks, in: Stochastic Analysis, Control, Optimization and Applications (Birkhauser, Boston, 1998) pp. 547–566.

    Google Scholar 

  40. R. Weinstock, Calculus of Variations: With Applications to Physics and Engineering, (Dover Publications, 1980).

  41. R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows: Theory, Algorithms and Applications, (Prentice Hall, Upper Saddle River, NJ, 1993).

    Google Scholar 

  42. N. Bulusu, J. Heidemann and D. Estrin, GPS-less low cost outdoor localization for very small devices, IEEE Personal Communications Magazine 7(5) (2000) pp. 28–34.

    Google Scholar 

  43. B. Bui-Xuan, A. Ferreira and A. Jarry, Computing shortest, fastest, and foremost journeys in dynamic networks, International Journal of Foundations of Computer Science 14(2 2003), pp. 267– 285.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, University of Washington, Seattle, WA

    Intae Kang & Radha Poovendran

Authors
  1. Intae Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Radha Poovendran
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Intae Kang.

Additional information

A preliminary version of this paper appeared in IEEE ICC 2003 [35]. This research was funded in part by NSF grant ANI-0093187, ONR award #: N00014-04-1-0479 and Collaborative Technology Alliance (CTA) from ARL under DAAD19-01-2-0011. All statements and opinions are that of the authors and do not represent any position of the U.S government

Intae Kang received his B.S. degree in physics from Seoul National University, Seoul, Korea and M.S. degree in electrical engineering from the Johns Hopkins University, Baltimore, MD. He is currently working toward the Ph.D. degree in the Department of Electrical Engineering at the University of Washington, Seattle, WA.

His current research interests are in the area of ad hoc and sensor networks. In particular, he is interested in energy efficient routing, topology control, medium access control, mobility management, and modeling and performance analysis of network protocols using directional/smart antennas.

Radha Poovendran has been an assistant professor at the Electrical Engineering Department of the University of Washington at Seattle since September 2000. He received his Ph.D. in Electrical Engineering from the University of Maryland, College Park in 1999. His research interests are in the areas of applied cryptography for multiuser environment, wireless networking, and applications of Information Theory to security. He is a recipient of Faculty Early Career Award from the National Science Foundation (2001), Young Investigator Award from the Army Research Office (2002), Young Investigator Award from the Office of Naval Research (2004), and the 2004 Presidential Early Career Award for Scientists and Engineers, for his research contributions in the areas of wired and wireless multiuser security. He is also a co-recipient of the 2002 Outstanding Teaching as well as the Outstanding Advisor Awards from the Department of Electrical Engineering of the University of Washington.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kang, I., Poovendran, R. Maximizing Network Lifetime of Broadcasting Over Wireless Stationary Ad Hoc Networks. Mobile Netw Appl 10, 879–896 (2005). https://doi.org/10.1007/s11036-005-4445-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-005-4445-5

Keywords

Search

Navigation