Hypergossiping: A generalized broadcast strategy for mobile ad hoc networks

  • Authors:
  • Abdelmajid Khelil;Pedro José Marrón;Christian Becker;Kurt Rothermel

  • Affiliations:
  • Universität Stuttgart, Institute for Parallel and Distributed Systems (IPVS), Universitätstr. 38, 70569 Stuttgart, Germany;Universität Stuttgart, Institute for Parallel and Distributed Systems (IPVS), Universitätstr. 38, 70569 Stuttgart, Germany;Universität Stuttgart, Institute for Parallel and Distributed Systems (IPVS), Universitätstr. 38, 70569 Stuttgart, Germany;Universität Stuttgart, Institute for Parallel and Distributed Systems (IPVS), Universitätstr. 38, 70569 Stuttgart, Germany

  • Venue:
  • Ad Hoc Networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Broadcasting is a commonly used communication primitive needed by many applications and protocols in mobile ad hoc networks (MANET). 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, mobility levels and network loads.