Skip to main content
SpringerLink
Log in

Revisiting relative neighborhood graph-based broadcasting algorithms for multimedia ad hoc wireless networks

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Multimedia broadcasting is a popular application in an ad hoc wireless network, itself composed of battery-operated nodes. Hence, energy conservation and avoidance of frequent re-construction of broadcast paths are crucial to ensure robust and uninterrupted service of multimedia broadcasting applications. This paper introduces a class of distributed broadcast algorithms based on variations of Relative Neighborhood Graphs (RNG). In contrast to the original RNG-based algorithms, the proposed algorithms consider the remaining battery energy of nodes and the distance between nodes as criteria for determining the relative neighborhood of a node. This approach is intended to boost the resiliency of the broadcast path by avoiding the choice of nodes with low remaining battery capacity as rebroadcast nodes. Extensive simulations are conducted, demonstrating that the proposed algorithms improve over the original RNG in several aspects, including the reduction of broadcast storms, longer path lifetime, and shorter broadcast latency.

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. Ni S, Tseng Y, Chen Y, Sheu J (1999) The broadcast storm problem in a mobile ad hoc network. In: Proc the 5th annual ACM/IEEE international conference on mobile computing and networking, pp 151–162

    Chapter  Google Scholar 

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

    Google Scholar 

  3. Peng W, Lu X (2001) AHBP: an efficient broadcast protocol for mobile ad hoc networks. J Sci Technol 2(2):97–192

    Google Scholar 

  4. 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 

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

    Google Scholar 

  6. Stojmenovic I, Seddigh M, Xunic J (2002) Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. IEEE Trans Parallel Distrib Syst 13(1):14–25

    Article  Google Scholar 

  7. Alzoubi KM, Wan PJ, Frieder O (2002) New distributed algorithm for connected dominating set in wireless ad hoc networks. In: Proc the 35th Hawaii international conference on system sciences, pp 1–7

    Google Scholar 

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

    Google Scholar 

  9. 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 

  10. Wieselthier JE, Nguyen GD, Ephremides A (2000) On the construction of energy-efficient broadcast and multicast trees in wireless networks. In: Proc IEEE INFOCOM, Tel Aviv, Israel, Mar, pp 585–594

    Google Scholar 

  11. Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. The MIT Press, Cambridge, ISBN-10:0-262-03293-3

    MATH  Google Scholar 

  12. Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc 7(1):48–50

    Article  MathSciNet  MATH  Google Scholar 

  13. Edmonds J (1967) Optimum branchings. J Res Natl Bur Stand (71B), 233–240

  14. Humblet P (1983) A distributed algorithm for minimum weighted directed spanning trees. IEEE Trans Commun 31(6):756–762

    Article  MathSciNet  Google Scholar 

  15. Chen LS, Wang HC (2009) BREAC: broadcast routing based on Edmonds algorithm for ad hoc networks with asymmetric cost model. In: Proc the 5th international conference on wireless communications, networking and mobile computing, Beijing, China, 24–26 Sept, pp 1–5

    Google Scholar 

  16. Chen LS, Wang HC, Woungang I, Kuo FC EOBDBR: an efficient optimum branching-based distributed broadcast routing protocol for wireless ad hoc networks. Telecommun Syst J (in press)

  17. Hsiu PC, Kuo TW (2009) A maximum-residual multicast protocol for large-scale mobile ad hoc networks. IEEE Trans Mob Comput 8(11):1141–1153

    Google Scholar 

  18. Jaromczyk JW, Toussaint GT (1992) Relative neighborhood graphs and their relatives. Proc IEEE 80(9):1502–1517

    Article  Google Scholar 

  19. Sedgewick R, Wayne K (2007) Minimum spanning tree. Lecture notes for algorithms & data structures. Princeton University, Princeton

    Google Scholar 

  20. Cartigny J, Simplot D, Stojmenovic I (2003) Localized minimum-energy broadcasting in ad-hoc networks. In: Proc IEEE INFOCOM 2003

    Google Scholar 

  21. Cartigny J, Ruiz PM, Simplot-Ryl D, Stojmenovic I, Yago CM (2009) Localized minimum-energy broadcasting for wireless multihop networks with directional antennas. IEEE Trans Comput 58(1), 120–131

    Article  MathSciNet  Google Scholar 

  22. Feigenbaum J, Karger D, Mirrokni V, Sami R (2005) Subjective-cost policy routing. In: Lecture notes in computer science, vol 3828. Springer, Berlin, pp 174–183

    Google Scholar 

  23. Courcelle B, Twigg A (2007) Compact forbidden-set routing. In: Lecture notes in computer science, vol 4393. Springer, Berlin, pp 37–48

    Google Scholar 

  24. Yen WCK (2008) Restricted independent domination problems on graphs. Int J Comput Syst Sci Eng 23(4):23–29

    Google Scholar 

  25. Yen CH, Wang HC (2009) Minimum cost broadcast routing with forbidden set for ad-hoc networks. In: Proc international conference on communications and mobile computing, vol 2, pp 20–25

    Chapter  Google Scholar 

  26. Bose P, Morin P, Stojimenovic I, Urmutia J (2001) Routing with guaranteed delivery in ad hoc wireless networks. Wirel Netw 7(6):609–616

    Article  MATH  Google Scholar 

  27. Karp B, Kung HT (2000) GPSR: greedy perimeter stateless mouting for wireless networks. In: Proc 6th annual international conference on mobile computing and networking, New York, USA, pp 243–254

    Chapter  Google Scholar 

  28. Kuhn F, Wattenhofer R, Zhang Y, Zollinger A (2003) Geometric ad-hoc routing of theory and practice. In: Proc annual symposium on principles of distributed computing, New York, USA, pp 63–72

    Google Scholar 

  29. Satyanarayana D, Rao SV (2008) A spanner for multimedia applications in ad hoc networks. In: Proc IET international conference on wireless mobile & multimedia networks, pp 231–234

    Chapter  Google Scholar 

  30. Lin JB, Wang HC, Kuo FC, Ting KC (2010) Distributed broadcast algorithm for wireless ad hoc networks based on RNG and forbidden set. In: Proc mobile computing, NTCU, Taichung, Taiwan, 28 May, pp 1–6

    Google Scholar 

  31. Wang HC, Lin JB, Kuo FC, Ting KC (2010) Combination of relative neighborhood graph and forbidden set in the design of distributed broadcast algorithms for wireless ad hoc networks. In: Proc cyberc (intl conference on cyber-enabled distributed computing and knowledge discovery), Huangshan, China, 10–12 Oct, pp 94–100

    Chapter  Google Scholar 

  32. Lin JB, Wang HC, Kuo FC, Tseng CC, Ting KC (2010) Distributed broadcast algorithms based on variants of relative neighborhood graphs for wireless ad hoc networks. In: Proc national symposium on telecom (NST), Chang-Gung University, Taoyuan, Taiwan, 3–4 Dec, pp 1–5

    Google Scholar 

  33. Li XY, Wang Y, Wan PJ, Song WZ, Frieder O (2004) Localized low-weight graph and its applications in wireless ad hoc networks. In: Proc IEEE INFOCOM, 2004

    Google Scholar 

  34. Peng W, Lu X (2000) On the reduction of broadcast redundancy in mobile ad hoc networks. In: Proc ACM international symposium on mobile ad hoc networking & computing, pp 129–130

    Google Scholar 

  35. Heinzelman WB, Chandrakasan AP, Balakrishnan H (2002) An application-specific protocol architecture for wireless microsensor networks. IEEE Trans Wirel Commun 1(4):660–670

    Article  Google Scholar 

  36. Corson S, Macker J (1999) Mobile ad hoc networking (MANET): routing protocol performance issues and evaluations considerations. IETF RFC 2501

Download references

Author information

Authors and Affiliations

  1. Department of Electronic Engineering, National I-Lan University, I-Lan, Taiwan, ROC

    Hwang-Cheng Wang & Fang-Chang Kuo

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

    Isaac Woungang

  3. Institute of Computer Science & Information Engineering, National I-Lan University, I-Lan, Taiwan, ROC

    Jia-Bao Lin

  4. Department of Business Administration and Electronic Engineering, Min-Hsin University of Science and Technology, Hsin-Chu, Taiwan, ROC

    Kuo-Chang Ting

Authors
  1. Hwang-Cheng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Isaac Woungang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jia-Bao Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Fang-Chang Kuo
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Kuo-Chang Ting
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Isaac Woungang.

Additional information

This work is a significant improvement of the RNG-based broadcasting algorithms proposed in (Proc. CyberC (Intl. Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery), pp. 94–100, 2010; Proc. National Symposium on Telecom. (NST), pp. 1–5, 2010).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, HC., Woungang, I., Lin, JB. et al. Revisiting relative neighborhood graph-based broadcasting algorithms for multimedia ad hoc wireless networks. J Supercomput 62, 24–41 (2012). https://doi.org/10.1007/s11227-011-0662-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-011-0662-9

Keywords

Search

Navigation