Skip to main content

Advertisement

SpringerLink
Log in

Minimum-Energy Broadcasting in Multi-hop Wireless Networks Using a Single Broadcast Tree

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

Abstract

In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the same broadcast tree. Our approach differs from the most commonly used one where the determination of the broadcast tree depends on the source node, thus resulting in different tree construction processes for different source nodes. Using a single broadcast tree simplifies considerably the tree maintenance problem and allows scaling to larger networks. We first show that, using the same broadcast tree, the total power consumed for broadcasting from a given source node is at most twice the total power consumed for broadcasting from any other source node. We next develop a polynomial-time approximation algorithm for the construction of a single broadcast tree. The performance analysis of the algorithm indicates that the total power consumed for broadcasting from any source node is within 2H(n−1) from the optimal, where n is the number of nodes in the network and H(n) is the harmonic function. This approximation ratio is close to the best achievable bound in polynomial time. We also provide a useful relation between the minimum-energy broadcast problem and the minimum spanning tree, which shows that a minimum spanning tree may be a good candidate in sparsely connected networks. The performance of our algorithm is also evaluated numerically with simulations.

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. I.F. Akyildiz et al., Wireless sensor networks: a survey, Computer Networks 38(4) (March 2002) 393–422.

    Article  Google Scholar 

  2. A.J. Goldsmith and S.B. Wicker, Design challenges for energy-constrained ad hoc wireless networks, IEEE Wirel. Commun. 9(4) (Aug. 2002) 8–27.

    Article  Google Scholar 

  3. A. Ephremides, Ad hoc networks: not an ad hoc field anymore, Wirel. Commun. Mob. Comput. 2(5) (Aug. 2002) 441–448.

    Article  Google Scholar 

  4. J.E. Wieselthier, G.D. Nguyen and A. Ephremides, Energy-efficient broadcast and multicast trees in wireless networks, MONET, 7(6) (Dec. 2002) 481–492. A preliminary version of this paper appeared in: xProc. IEEE INFOCOM, March 2000, pp. 585–594.

    Google Scholar 

  5. S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica 20(4) (Apr. 1998) 374–387.

    Article  MathSciNet  Google Scholar 

  6. K.M. Alzoubi, P.-J. Wan and O. Frieder, Distributed heuristics for connected dominating sets in wireless ad hoc networks, J. of Commun. and Networks 4(1) (March 2002) 22–29.

    Google Scholar 

  7. J. Wu, B. Wu and I. Stojmenovic, Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets, Wirel. Commun. Mob. Comput. 3(4) (June 2003) 425–438.

    Article  Google Scholar 

  8. R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall (1993).

  9. A.E.F. Clementi et al., On the complexity of computing minimum energy consumption broadcast subgraphs, in: Proc. Symp. on Theor. Aspects of Comp. Science (Feb. 2001) 121–131.

  10. F. Li and I. Nikolaidis, On minimum-energy broadcasting in all-wireless networks, in: Proc. IEEE Local Computer Networks (Nov. 2001) 193–202.

  11. A. Ahluwalia, E. Modiano and L. Shu, On the complexity and distributed construction of energy-efficient broadcast trees in static ad hoc wireless networks, in: Proc. Conf. on Inform. Sciences and Systems (March 2002).

  12. W. Liang, Constructing minimum-energy broadcast trees in wireless ad hoc networks, in: Proc. ACM MOBIHOC (June 2002) 112–122.

  13. M. Čagalj, J.-P. Hubaux and C. Enz, Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues, in: Proc. ACM MOBICOM (Sep. 2002).

  14. P. -J. Wan et al., Minimum-energy broadcasting in static ad hoc wireless networks, Wirel. Networks, 8(6) (Nov. 2002) 607–617.

    Article  Google Scholar 

  15. A.K. Das et al., Minimum power broadcast trees for wireless networks: integer programming formulations, in: Proc. IEEE INFOCOM (March–Apr. 2003).

  16. X.-Y. Li, Algorithmic, geometric and graph issues in wireless networks, Wirel. Commun. Mob. Comput., 3(2) (March 2003) 119–140.

    Article  Google Scholar 

  17. I. Caragiannis, C. Kaklamanis and P. Kanellopoulos, A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem, Inform. Proc. Letters 86(3) (May 2003) 149–154.

    Article  MathSciNet  Google Scholar 

  18. G. Călinescu et al., Network lifetime and power assignment in ad hoc wireless networks, in: Proc. European Symp. on Algorithms (Sept. 2003) 114–126.

  19. 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) (June 2002) 113–131.

    Article  Google Scholar 

  20. I. Papadimitriou and L. Georgiadis, Energy-aware broadcasting in wireless networks, in: Proc. WiOpt (March 2003) 267–277.

  21. V.V. Vazirani, Approximation Algorithms, Springer-Verlag (2001).

  22. U. Feige, A threshold of ln n for approximating set cover, J. of ACM 45(4) (July 1998) 634–652.

    Article  MathSciNet  Google Scholar 

  23. P. A. Humblet, A distributed algorithm for minimum weight directed spanning trees, IEEE Trans. Commun., 31(6) (June 1983) 756–762.

    Article  Google Scholar 

  24. R. G. Gallager, P. A. Humblet and P. M. Spira, A distributed algorithm for minimum-weight spanning trees, ACM Trans. on Progr. Lang. and Systems 5(1) (Jan. 1983) 66–77.

    Article  Google Scholar 

  25. T. Clausen and P. Jacquet, Optimized link state routing protocol, IETF Internet Draft, draft-ietf-manet-olsr-11.txt, (July 2003) (Work in progress).

Download references

Author information

Authors and Affiliations

  1. Division of Telecommunications, Department of Electrical and Computer Engineering, Aristotle University of Thessaloniki, Greece

    Ioannis Papadimitriou & leonidas Georgiadis

Authors
  1. Ioannis Papadimitriou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. leonidas Georgiadis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ioannis Papadimitriou.

Additional information

A preliminary version of this work appeared in the Proceedings of WiOpt’04: Modeling and Optimization in Mobile, Ad hoc and Wireless Networks, University of Cambridge, UK, March 2004.

Ioannis Papdimitriou was fully supported for this work by the Public Benefit Foundation “ALEXANDER S. ONASSIS”, Athens, Greece.

Ioannis Papadimitriou was born in Veria, Greece, in 1976. He received his five year Diploma from the Department of Electronic and Computer Engineering, Technical University of Crete (Chania), Greece, in 1999 (graduating 2nd in class). He is currently a postgraduate student - Ph.D. candidate at the Telecommunications division, Department of Electrical and Computer Engineering, Aristotle University of Thessaloniki, Greece. His doctoral thesis deals with the design of wireless ad hoc networks. His research interests include broadcast and multicast communication, energy conservation, routing and topology control protocols, MAC layer and QoS issues. During his studies he has been honored with awards and scholarships by the Technical University of Crete, the Hellenic Telecommunications Organization S.A.(OTE S.A.) and Ericsson Hellas S.A. Mr. Papadimitriou has been a member of the Technical Chamber of Greece (TEE) since March 2000, and he has been supported by the Public Benefit Foundation ALEXANDER S. ONASSIS, Athens, Greece, with a scholarship for his doctoral studies from October 2001 to March 2005.

Leonidas Georgiadis received the Diploma degree in electrical engineering from Aristotle University, Thessaloniki, Greece, in 1979, and his M.S. and Ph.D. degrees both in electrical engineering from the University of Connecticut, in 1981 and 1986, respectively. From 1981 to 1983 he was with the Greek army. From 1986 to 1987 he was Research Assistant Professor at the University of Virginia, Charlottesville. In 1987 he joined IBM T.J. Watson Research Center, Yorktown Heights, as a Research Staff Member. Since October 1995, he has been with the Telecommunications Department of Aristotle University, Thessaloniki, Greece. His interests are in the area of wireless networks, high speed networks, distributed systems, routing,scheduling, congestion control, modeling and performance analysis. Prof. Georgiadis is a senior member of IEEE Communications Society. In 1992 he received the IBM Outstanding Innovation Award for his work on goal-oriented workload management for multi-class systems.x

Rights and permissions

Reprints and permissions

About this article

Cite this article

Papadimitriou, I., Georgiadis, l. Minimum-Energy Broadcasting in Multi-hop Wireless Networks Using a Single Broadcast Tree. Mobile Netw Appl 11, 361–375 (2006). https://doi.org/10.1007/s11036-006-5189-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-006-5189-6

Keywords

Search

Navigation