Efficient broadcasting using packet history in mobile ad hoc networks

Efficient broadcasting using packet history in mobile ad hoc networks

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Broadcasting is a key component of several networking mechanisms in mobile ad hoc networks. However, its traditional implementation suffers from resource consumption caused by message redundancy. Several efficient algorithms have been proposed to tackle this problem. Among them, the class of algorithms that construct on-demand a connected dominating set, known as dominant pruning, yields an improved performance. Dominant pruning algorithms capitalise on neighbourhood information and the previous hop of the broadcast message in order to minimise the set of nodes that forward a message. The proposed algorithm makes the observation that all the nodes, visited by a broadcast message, may be exploited in order to minimise the cost of broadcasting. The analysis of the proposed algorithm as well as extensive simulation results confirm the rationale behind the proposed approach and prove the performance gains.


    1. 1)
    2. 2)
    3. 3)
      • Ni, S.Y., Tseng, Y.C., Chen, Y.S., Sheu, J.P.: `The broadcast storm problem in a mobile ad hoc network', MobiCom, August 1999, p. 151–162.
    4. 4)
      • Bani Yassein, M., Ould-Khaoua, M., Mackenzie, L., Papanastasiou, S.: `Improving the performance of probabilistic flooding in MANETs', Proc. Int. Workshop on Wireless Ad hoc Networks, May 2005.
    5. 5)
    6. 6)
      • Tseng, Y., Ni, S., Shih, E.Y.: `Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc networks', Proc. ICDCS’01, 2001, p. 481–488.
    7. 7)
      • al Humoud, S.O., Mackenzie, L.M., Abdulai, J.: `Neighbourhood-aware counter-based broadcast scheme for wireless ad hoc networks', 2008 IEEE GLOBECOM Workshops, December 2008, p. 1–6.
    8. 8)
      • Woon, W., Yeung, K.L.: `Self-pruning broadcasting for mobile ad hoc networks', IEEE Global Telecommunications Conf., 2009, GLOBECOM 2009, December 2009, p. 1–6.
    9. 9)
    10. 10)
      • Pleisch, S., Balakrishnan, M., Birman, K., van Renesse, R.: `Mistral: efficient flooding in mobile ad-hoc networks', Proc. Seventh ACM Int. Symp. on Mobile ad hoc Networking and Computing, May 2006, p. 7–14.
    11. 11)
      • Yi, Y., Gerla, M., Kwon, T.: `Efficient flooding in ad hoc networks using on-demand (passive) cluster formation', Second Annual Mediterranean Ad Hoc Networking Workshop (Med-hoc-Net 2003), 2003.
    12. 12)
      • Adjih, C., Jacquet, P., Viennot, L.: `Computing connected dominated sets with multipoint relays', Technical Report 4597, October 2002.
    13. 13)
    14. 14)
      • Wu, J., Li, H.: `On calculating connected dominating set for efficient routing in ad hoc wireless networks', Proc. Third Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, August 1999, p. 7–14.
    15. 15)
      • J. Wu , W. Lou . Extended multipoint relays to determine connected dominating sets in MANETs.
    16. 16)
    17. 17)
      • Almahorg, K.A.M., Naik, S., Shen, X.: `Efficient localized protocols to compute connected dominating sets for ad hoc networks', 2010 IEEE Global Telecommunications Conf., GLOBECOM 2010, December 2010, p. 1–5.
    18. 18)
    19. 19)
      • Peng, W., Lu, X.-C.: `On the reduction of broadcast redundancy in mobile ad hoc networks', Proc. Mobihoc’00, August 2000.
    20. 20)
    21. 21)
    22. 22)
      • Al Amin, M.T., Barua, S., Vhaduri, S., Rahman, A.: `Load aware broadcast in mobile ad hoc networks', IEEE Int. Conf. on Communications, ICC’09, June 2009, p. 1–5.
    23. 23)
    24. 24)
    25. 25)
    26. 26)
      • Pongthawornkamol, T., Nahrstedt, K., Wang, G.: `Hybridcast: a hybrid probabilistic/deterministic approach for adjustable broadcast reliability in mobile wireless ad hoc networks', 2009 IEEE Int. Conf. on Communications, ICC’09, June 2009, p. 1–6.
    27. 27)
    28. 28)
    29. 29)
      • Williams, B., Camp, T.: `Comparison of broadcasting techniques for mobile ad hoc networks', Proc. MobiHoc’02, 2002, p. 194–205.
    30. 30)
      • T.H. Cormen , C.E. Leiserson , R.L. Rivest , C. Stein . (2009) Introduction to algorithms.
    31. 31)
      • S.S. Skiena . (1998) The algorithm design manual.
    32. 32)
    33. 33)
      • K. Fall , K. Varadhan . (2001) The ns manual.
    34. 34)
      • Le Boudec, J.-Y., Vojnovic, M.: `Perfect simulation and stationarity of a class of mobility models', Proc. 24th Annual Joint Conf. IEEE Computer and Communications Societies, IEEE INFOCOM'05, 2005.
    35. 35)
    36. 36)

Related content

This is a required field
Please enter a valid email address