Hypergossiping: A Generalized Broadcast Strategy for Mobile Ad Hoc Networks

  • Abdelmajid Khelil
  • Pedro José Marrón
  • Christian Becker
  • Kurt Rothermel
Conference paper
Part of the Informatik aktuell book series (INFORMAT)


Broadcasting is a commonly used communication primitive needed by many applications and protocols in mobile ad hoc networks (MANETs). Unfortunately, most broadcast solutions are tailored to one class of MANETs with respect to node density and node mobility and are unlikely to operate well in other classes. In this paper, we introduce hypergossiping, a novel adaptive broadcast algorithm that combines two strategies. Hypergossiping uses adaptive gossiping to efficiently distribute messages within single network partitions and implements an efficient heuristic to distribute them across partitions. Simulation results in ns-2 show that hypergossiping operates well for a broad range of MANETs with respect to node densities and mobility levels.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Z. Cheng, and W.B. Heinzelman, “Flooding Strategy for Target Discovery in Wireless Networks”, Proceedings of MSWiM, 2003.Google Scholar
  2. 2.
    S.Y. Ni, Y.C. Tseng, Y.S. Chen, and J.P. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network”, Int. Conf. on Mobile Computing and Networking (MobiCom), 1999.Google Scholar
  3. 3.
    Z.J. Haas, J.Y. Halpern, and L. Li, “Gossip-Based Ad Hoc Routing”, INFOCOM, 2002.Google Scholar
  4. 4.
    K. Obraczka, G. Tsudik, and K. Viswanath, “Pushing the Limits of Multicast in Ad Hoc Networks”, Int. Conf. on Distributed Computing Systems (ICDCS), 2001.Google Scholar
  5. 5.
    K. Viswanath, and K. Obraczka, “An Adaptive Approach to Group Communications in Multi-Hop Ad Hoc Networks”, Int. Conf. on Networking (ICN), 2002.Google Scholar
  6. 6.
    A. Ouksel, O. Wolfson, B. Xu, “Opportunistic Resource Exchange in Inter-vehicle Ad Hoc Networks”, IEEE Int. Conf. on Mobile Data Management (MDM), 2004.Google Scholar
  7. 7.
    B. Williams and T. Camp, “Comparison of Broadcasting Techniques for Mobile Ad Hoc Net-works”, ACM MOBIHOC, 2002.Google Scholar
  8. 8.
    Y. Yi, M. Gerla, and T.J. Kwon, “Efficient Flooding in Ad hoc Networks: a Comparative Performance Study”, IEEE Int. Conf. on Communications (ICC), 2003.Google Scholar
  9. 9.
    Y.C. Tseng, S.Y. Ni, and E.Y. Shih, “Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Networks”, IEEE Transactions on Computers, V52(5): 545–557, 2003.CrossRefGoogle Scholar
  10. 10.
    J. Cartigny, and D. Simplot, “Border Node Retransmission Based Probabilistic Broadcast Protocols in Ad-Hoc Networks”, Hawaii Int. Conf. on System Sciences (HICSS), 2003.Google Scholar
  11. 11.
    C. Ho, K. Obraczka, G. Tsudik and K. Viswanath, “Flooding for Reliable Multicast in Multi-Hop Ad Hoc Networks”, Proceedings of DIALM, 1999.Google Scholar
  12. 12.
    S. McCanne, and S. Floyd, Ns Network Simulator, Scholar
  13. 13.
    A. Khelil, C. Becker, J. Tian, and K. Rothermel, “Epidemic Model for Information Diffusion in MANETs”, Proceedings of MSWiM, 2002.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Abdelmajid Khelil
    • 1
  • Pedro José Marrón
    • 1
  • Christian Becker
    • 1
  • Kurt Rothermel
    • 1
  1. 1.Universität Stuttgart, IPVS/VSStuttgart

Personalised recommendations