Skip to main content
Springer Nature Link
Log in

EOBDBR: an Efficient Optimum Branching-Based Distributed Broadcast Routing protocol for wireless ad hoc networks

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Wireless ad hoc networks are in general characterized by dynamic topologies that do not have a fixed infrastructure. In addition, connectivity is maintained in a decentralized fashion through a form of multi-hop radio network. To this effect, wireless ad hoc networks with asymmetric link costs have been advocated as more realistic ones from a network modeling perspective. In this paper, we propose an Efficient Optimum Branching-based Distributed Broadcast Routing (EOBDBR) protocol for wireless ad hoc networks with asymmetric link costs, which makes use of local information exchange only. The proposed protocol contrasts with centralized routing protocols, in which link state and other relevant information are kept in the routing table of each node. It involves setting up link states, finding minimum in-edge, detecting cycles, re-weighting and breaking cycles. Through extensive simulations, our protocol is compared against four distributed broadcast routing protocols chosen as benchmarks. The performance metrics used are message overhead, total energy consumption, number of rebroadcasting nodes, network lifetime, and broadcast time. The superiority of EOBDBR against the studied benchmark protocols is established with respect to the above-mentioned metrics.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Heylighen, F., & Gershenson, C. (2003). The meaning of self-organization in computing. IEEE Intelligent Systems, 72–75.

  2. Giordano, S., & Lu, W. W. (2001). Challenges in mobile ad hoc networking. IEEE Communications Magazine, 39(6), 129–181.

    Article  Google Scholar 

  3. Ni, S., Tseng, Y., Chen, Y., & Sheu, J. (1999). The broadcast storm problem in a mobile ad hoc network. In Proc. of the 5th annual ACM/IEEE international conference on mobile computing and networking (pp. 151–162).

    Chapter  Google Scholar 

  4. Lim, H., & Kim, C. (2000). Multicast tree construction and flooding in wireless ad hoc networks. In Proc. of the 3rd ACM international workshop on modeling, analysis and simulation of wireless and mobile systems (ACM MSWiM 2000), Boston, Massachusetts, USA.

    Google Scholar 

  5. Peng, W., & Lu, X. (2001). AHBP: an efficient broadcast protocol for mobile ad hoc networks. Journal of Science and Technology, 2(2), 97–192.

    Google Scholar 

  6. Das, B., & Bhargavan, V. (1997). Routing in ad-hoc networks using minimum connected dominating sets. In Proc. of IEEE international conference on communications (pp. 376–380).

    Google Scholar 

  7. Wu, J., & Li, H. (1999). On calculating connected dominating set for efficient routing in ad hoc wireless networks. In Proc. of the 3rd international workshop on discrete algorithms and methods for mobile computing and communications (pp. 7–14).

    Google Scholar 

  8. Stojmenovic, I., Seddigh, M., & Xunic, J. (2002). Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 13(1), 14–25.

    Article  Google Scholar 

  9. Alzoubi, K. M., Wan, P. J., & Frieder, O. (2002). New distributed algorithm for connected dominating set in wireless ad hoc networks. In Proc. of the 35th Hawaii international conference on system sciences (pp. 1–7).

    Google Scholar 

  10. Dai, F., & Wu, J. (2003). Distributed dominant pruning in ad hoc wireless networks. In Proc. of the IEEE international conference on communications (ICC) (pp. 353–357).

    Google Scholar 

  11. Kirousis, L., Kranakis, E., Krizanc, D., & Pelc, A. (1997). Power consumption in packet radio networks. In Proc. of the 14th symposium on theoretical computer science (STACS’97) (pp. 363–374).

    Google Scholar 

  12. Wieselthier, J. E., Nguyen, G. D., & Ephremides, A. (2000). On the construction of energy-efficient broadcast and multicast trees in wireless networks. In Proc. of IEEE INFOCOM (pp. 585–594). Tel Aviv, Israel, March 2000.

    Google Scholar 

  13. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Introduction to algorithms. Cambridge: MIT Press. ISBN-10:0-262-03293-3.

    Google Scholar 

  14. Kruskal, J. B. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7(1), 48–50.

    Article  Google Scholar 

  15. Edmonds, J. (1967). Optimum branchings. Journal of Research of the National Bureau of Standards. B, Mathematics and Mathematical Physics, 71B, 233–240.

    Google Scholar 

  16. Humblet, P. (1983). A distributed algorithm for minimum weighted directed spanning trees. IEEE Transactions on Communications, 31(6), 756–762.

    Article  Google Scholar 

  17. Chen, L. S., & Wang, H. C. (2009). BREAC: Broadcast routing based on Edmonds algorithm for ad hoc networks with asymmetric cost model. In Proc. of the 5th international conference on wireless communications, networking and mobile computing (WiCOM 2009), Beijing, China, Sept. 24–26, 2009.

    Google Scholar 

  18. Gold, S. (1997). A PSPICE macro model for lithium-ion batteries. In Proc. of the 12th annual battery conference on applications and advances (pp. 215–222).

    Google Scholar 

  19. Wang, H. C., & Chen, W. H. (2007). Maximum path lifetime routing for ad-hoc wireless networks. In Proc. of IFIP/IEEE mobile wireless communication networks (MWCN 2007) (pp. 166–170), Cork, Ireland, Sept. 19–21.

    Chapter  Google Scholar 

  20. Schergers, C., Aberthorne, O., & Srivastava, M. (2001). Modulation scaling for energy aware communication systems. In Proc. of the ACM international symposium on low power electronics and design (pp. 96–99), Huntington Beach, California, USA.

    Google Scholar 

  21. Srivastava, M. Power-aware design—Part II: reduction and management. Lecture Notes EE202A, Fall 2002, University of California at Los Angeles. Available online at: http://www.ee.ucla.edu/~mbs (Last visited Dec. 3, 2009).

  22. Doshi, S., Bhandare, S., & Brown, T. X. (2002). An on-demand minimum energy routing protocol for a wireless ad hoc network. In ACM SIGMOBILE on mobile computing and communications review (pp. 50–66).

    Google Scholar 

  23. Wang, H. C., & Wang, Y. H. (2007). Energy-efficient routing algorithms for wireless ad-hoc networks. In Proc. of the 18th IEEE international symposium on personal, indoor, and mobile radio communications (PIMRC), Athens, Greece, Sept. 2–6, 2007.

    Google Scholar 

  24. Peng, W., & Lu, X. (2000). On the reduction of broadcast redundancy in mobile ad hoc networks. In Proc. of the ACM international symposium on mobile ad hoc networking and computing (MobiHoc), Boston, USA, Aug. 2000.

    Google Scholar 

  25. Williams, B., & Camp, T. (2002). Comparison of broadcasting techniques for mobile ad hoc networks. In Proc. of the 3rd ACM international symposium on mobile ad hoc networking & computing (MobiHoc) (pp. 194–205).

    Chapter  Google Scholar 

  26. Qayyum, A., Viennot, L., & Laouiti, A. (2002). Multipoint relaying for flooding broadcast messages in mobile wireless networks. In Proc. of the Hawaii International Conference on System Sciences (HICSS), Big Island, Hawaii, Jan. 2002.

    Google Scholar 

  27. Cartigny, J., Ingelrest, F., & Simplot, D. (2003). RNG relay subset flooding protocols in mobile ad hoc networks. International Journal of Foundations of Computer Science, 14(2), 253–265.

    Article  Google Scholar 

  28. Cartigny, J., Simplot, D., & Stojmenovic, I. (2003). Localized minimum energy broadcasting in ad hoc networks. In Proc. of IEEE INFOCOM, San Francisco, USA, Apr. 2003.

    Google Scholar 

  29. Cartigny, J., Ingelrest, F., Simplot-Ryl, D., & Stojmenovic, I. (2004). Localized LMST and RNG based minimum-energy broadcast Protocols in ad hoc networks. Ad Hoc Networks, 3(1), 1–16.

    Article  Google Scholar 

  30. Marks, R., Das, A., El-Sharkawi, M., Arabshahi, P., & Gray, A. (2002). Minimum power broadcast trees for wireless networks: optimizing using the viability lemma. In Proc. of the international symposium on circuits and systems (ISCAS 2002), Scottsdale, USA, May 2002.

    Google Scholar 

  31. Iguchi-Cartigny, J., Ruiz, P. M., Simplot-Ryl, D., Stojmenovic, I., & Yago, C. M. (2009). Localized minimum-energy broadcasting for wireless multi-hop networks with directional antennas. IEEE Transactions on Computers, 58(1), 120–131.

    Article  Google Scholar 

  32. Li, N., Hou, J., & Sha, L. (2003). Design and analysis of an MST-based topology control algorithm. In Proc. of IEEE INFOCOM, San Francisco, USA, Apr. 2003.

    Google Scholar 

  33. Wieselthier, J. E., Nguyen, G., & Ephremides, A. (2002). The energy efficiency of distributed algorithms for broadcasting in ad hoc networks. In Proc. of the international symposium on wireless personal multimedia communications (WPMC), Honolulu, Hawaii, Oct. 2002.

    Google Scholar 

  34. Wieselthier, J. E., Nguyen, G. D., & Ephremides, A. (2002). Distributed algorithms for energy-efficient broadcasting in ad hoc networks. In Proc. of military communications conference (MILCOM 2002) (Vol. 2, pp. 820–825).

    Google Scholar 

  35. Ingelrest, F., & Simplot-Ryl, D. (2008). Localized broadcast incremental power protocol for wireless ad hoc networks. Wireless Networks, 14(3), 309–319.

    Article  Google Scholar 

  36. Yen, C. H., & Wang, H. C. (2008). Broadcast routing based on new link cost model for ad-hoc networks. In Proc. of the international workshop on modeling analysis and simulation of wireless and mobile systems (pp. 27–32), Vancouver, B.C., Canada. Held in conjunction with the 5th ACM symposium on performance evaluation of wireless ad hoc, sensor, and ubiquitous networks.

    Google Scholar 

  37. Stojmenovic, I., & Seddigh, M. (2000). Broadcasting algorithms in wireless networks. In Proc. of the international conference on advances in infrastructure for electronic business, science and education on the Internet (SSGRR), L’Aquila, Italy, July 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronic Engineering, National I-Lan University, I-Lan, Taiwan, R.O.C.

    Li-Sheng Chen, Hwang-Cheng Wang & Fang-Chang Kuo

  2. Department of Computer Science, Ryerson University, Toronto, ON, Canada

    Isaac Woungang

Authors
  1. Li-Sheng Chen
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Hwang-Cheng Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Isaac Woungang
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Fang-Chang Kuo
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Isaac Woungang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, LS., Wang, HC., Woungang, I. et al. EOBDBR: an Efficient Optimum Branching-Based Distributed Broadcast Routing protocol for wireless ad hoc networks. Telecommun Syst 52, 497–512 (2013). https://doi.org/10.1007/s11235-011-9452-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-011-9452-1

Keywords