Skip to main content
SpringerLink
Log in

A scalable, power-efficient broadcast algorithm for wireless networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Scalability and power-efficiency are two of the most important design challenges in wireless ad hoc networks. In this paper, we present a scalable, power-efficient broadcast algorithm for wireless ad hoc networks. We first investigate the trade-off between (i) reaching more nodes in a single hop using higher transmission power and (ii) reaching fewer nodes using lower transmission power and relaying messages through multiple hops. Our analysis indicates that multi-hop broadcast is more power-efficient if α ≥ 2.2, where α is the path loss exponent in the power consumption model P(r,α) = c0⋅ rα+c1. Based on the analysis, we then propose Broadcast over Local Spanning Subgraph (BLSS). In BLSS, an underlying topology is first constructed by a localized topology control algorithm, Fault-Tolerant Local Spanning Subgraph (FLSS). FLSS can preserve k-connectivity of the network, where the value of k determines the degree of fault tolerance. Broadcast messages are then simply relayed through the derived topology in a constrained flooding fashion. BLSS is fully localized, scalable, power-efficient, and fault-tolerant. Simulation results show that the performance of BLSS is comparable to that of centralized algorithms.

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. 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. 36th Annual Conference on Information Sciences and Systems (CISS) (2002) pp. 807–813.

  2. M. Čagalj, J.-P. Hubaux, and C. Enz. Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues. In Proc. 8th ACM International Conference on Mobile Computing and Networking (MOBICOM), Atlanta, GA, USA (2002) pp. 172–182.

  3. J. Cartigny, D. Simplot, and I. Stojmenovi ć . Localized minimum-energy broadcasting in ad-hoc networks. In Proc. IEEE INFOCOM 2003, volume 3, San Francisco, CA, USA (2003) pp. 2210–2217.

  4. A.K. Das, R.J. Marks, M.El-Sharkawi, P. Arabshahi, and A. Gray. The minimum power broadcast problem in wireless networks: an ant colony system approach. In Proc. IEEE CAS Workshop on Wireless Communications and Networking, Pasadena, CA, USA (2002).

  5. A.K. Das, R.J. Marks, M.El-Sharkawi, P. Arabshahi, and A. Gray. Minimum power broadcast trees for wireless networks: integer programming formulations. In Proc. IEEE INFOCOM 2003, volume 2, San Francisco, CA, USA (2003) pp. 1001–1010.

  6. T. He, C. Huang, B.M. Blum, J.A. Stankovic, and T. Abdelzaher. Range-free localization schemes for large scale sensor networks. In Proc. 9th ACM International Conference on Mobile Computing and Networking (MOBICOM), San Diego, CA, USA (2003) pp. 81–95.

  7. R.J.M. II, A.K. Das, M.El-Sharkawi, P. Arabshahi, and A. Gray. Minimum power broadcast trees for wireless networks: optimizing using the viability lemma. In Proc. IEEE International Symposium on Circuits and Systems, Scottsdale, AZ, USA (2002) pp. 273–276.

  8. F. Li and I. Nikolaidis. On minimum-energy broadcasting in all-wireless networks. In Proc. 26th Annual IEEE Conference on Local Computer Networks, Tampa, FL, USA (2001) pp. 193–202.

  9. N. Li and J.C. Hou. FLSS: a fault-tolerant topology control algorithm for wireless networks. In Proc. 10th ACM International Conference on Mobile Computing and Networking (MOBICOM), Philadelphia, PA, USA (2004) pp. 275–286.

  10. N. Li, J.C. Hou, and L. Sha. Design and analysis of an MST-based topology control algorithm. In Proc. IEEE INFOCOM 2003, volume 3, San Francisco, CA, USA (2003) pp. 1702–1712.

  11. W. Liang. Constructing minimum-energy broadcast trees in wireless ad hoc networks. In Proc. 3rd ACM Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), Lausanne, Switzerland (2002) pp. 194–205.

  12. S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu. The broadcast storm problem in a mobile ad hoc network. In Proc. 5th ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM), Seattle, WA, USA (1999) pp. 151–162.

  13. K. Obraczka, K. Viswanath, and G. Tsudik. Flooding for reliable multicast in multi-hop ad hoc networks. Wireless Networks, 7(6) (2001) pp. 627–634.

    Google Scholar 

  14. A. Qayyum, L. Viennot, and A. Laouiti. Multipoint relaying for flooding broadcast messages in mobile wireless networks. In Proc. 35th Annual Hawaii International Conference on System Sciences, Hawaii, USA (2002) pp. 3898–3907.

  15. T.S. Rappaport. Wireless communications: principles and practice. Prentice Hall, second edition (2002).

  16. C.A. Santiv áñ ez, B. McDonald, I. Stavrakakis, and R. Ramanathan. On the scalability of ad hoc routing protocols. In Proc. IEEE INFOCOM 2002, volume 3, New York, NY, US (2002) pp. 1688–1697.

  17. S. Singh, C.S. Raghavendra, and J. Stepanek. Power-aware broadcasting in mobile ad hoc networks. In Proc. PIMRC ’99, Osaka, Japan (1999) pp. 22–31.

  18. I. Stojmenovi ć, M. Seddigh, and J. Zunic. Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks. IEEE Trans. Parallel Distrib. Syst., 13(1) (2002) pp. 14–25.

    Article  Google Scholar 

  19. 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, volume 2, Anchorage, AK, USA (2001) pp. 1162–1171.

  20. 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, volume 2, Tel Aviv, Israel (2000) pp. 585–594.

  21. J.E. Wieselthier, G.D. Nguyen, and A. Ephremides. The energy efficiency of distributed algorithms for broadcasting in ad hoc networks. In Proc. IEEE 5th International Symposium on Wireless Personal Multimedia Communications (WPMC) (2002) pp. 499–503.

  22. B. Williams and T. Camp. Comparison of broadcasting techniques for mobile ad hoc networks. In Proc. 3rd ACM Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), Lausanne, Switzerland (2002) pp. 194–205.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, USA

    Ning Li

  2. Department of Computer Science, University of Illinois at Urbana-Champaign, 201 N. Goodwin Avenue, Urbana, IL, 61801-2302, USA

    Jennifer C. Hou

Authors
  1. Ning Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jennifer C. Hou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jennifer C. Hou.

Additional information

Ning Li received the B.E. and M.E. degrees from Department of Automation, Tsinghua University, Beijing, PR China, in 1998 and 1999, respectively, and the M.S. degree in Computer Engineering from The Ohio State University, Columbus, OH, in 2001 and the Ph.D. degree in Computer Science from University of Illinois at Urbana-Champaign, Urbana, IL. His research interests include design and analysis of wireless mobile ad hoc networks and sensor networks, large-scale network simulation and emulation, and distributed and mobile computing.

Jennifer C. Hou received her Ph.D. from The University of Michigan, Ann Arbor, MI in 1993. She is currently a professor in the Department of Computer Science at University of Illinois at Urbana-Champaign, Urbana, IL.

Dr. Hou has been supervising several federally and industry funded projects in the areas of network modeling and simualtion, network measurement and diagnostics, enabling communication software for assisted living, and both the theoretical and protocol design aspects of wireless sensor networks. She has published (with her former advisor, students, and colleagues) over 125 papers and book chapters in archived journals and peer-reviewed conferences, and released a truly extensible, reusable, component-based, compositional network simulation and emulation package, J-Sim. She has also served on the TPC of several major networking, real-time, and distributed systems conferences/symposiums, such as IEEE INFOCOM, IEEE ICNP, IEEE ICDCS, IEEE RTSS, IEEE ICC, IEEE Globecome, ACM Mobicom, and ACM Sigmetrics. She is the Technical Program Co-chair of 27th IEEE INFOCOM 2008, First International Wireless Internet Conference 2005, ACM 3rd Information Processing in Sensor Networks (IPSN 2004) and IEEE Real-time Technology and Application Symposium (RTAS 2000). She is severing on the editorial board of IEEE Trans. on Wireless Communications, IEEE Trans. on Parallel and Distributed Systems, IEEE Wireless Communication Magazine, ACM/Kluwer Wireless Networks, Kluwer Computer Networks, and ACM Trans. on Sensor Networks.

Dr. Hou was a recipient of an ACM Recognition of Service Award in 2004, a Lumley Research Award from The Ohio State University in 2001, a NSF CAREER award in 1996–2000 and a Women in Science Intiative Award from The University of Wisconsin—Madison in 1993–1995.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, N., Hou, J.C. A scalable, power-efficient broadcast algorithm for wireless networks. Wireless Netw 12, 495–509 (2006). https://doi.org/10.1007/s11276-006-6548-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-006-6548-8

Keywords

Search

Navigation