DMCA
Hypergossiping: A generalized broadcast strategy for mobile ad hoc networks (2005)
| Venue: | In Proceedings of The 2005 Conference on Communication in Distributed Systems (KiVS |
| Citations: | 16 - 5 self |
BibTeX
@INPROCEEDINGS{Khelil05hypergossiping:a,
author = {Abdelmajid Khelil and Pedro José Marrón and Christian Becker and Kurt Rothermel},
title = {Hypergossiping: A generalized broadcast strategy for mobile ad hoc networks},
booktitle = {In Proceedings of The 2005 Conference on Communication in Distributed Systems (KiVS},
year = {2005},
pages = {531--546}
}
Share
 |
 |
 |
 |
||
OpenURL
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. Key words: MANET, adaptive broadcast, network partitioning 1
Keyphrases
mobile ad hoc network generalized broadcast strategy network load single network partition node mobility key word simulation result broad range novel adaptive broadcast algorithm mobility level adaptive broadcast many application communication primitive ns-2 show broadcast solution efficient heuristic
