Hypergossiping: A generalized broadcast strategy for mobile ad hoc networks
✍ Scribed by Abdelmajid Khelil; Pedro José Marrón; Christian Becker; Kurt Rothermel
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 463 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1570-8705
No coin nor oath required. For personal study only.
✦ Synopsis
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.
📜 SIMILAR VOLUMES
## Abstract Nodes in a computer network often require a copy of a message to be delivered to every node in the network. The network layer can provide such a service, referred to as network‐wide broadcast routing or simply ‘broadcasting’. Broadcasting has many applications, including its role as a s
Mobile ad hoc network (MANET) is a new emerging field with its potential applications in extremely unpredictable and dynamic environments. These characteristics require the networks to have much harder security requirements than the contemporary networks. While current routing protocols do seem to a
## Abstract The ability to proactively manage mobile ad hoc networks (MANETs) is critical for supporting complex services such as quality of service, security and access control in these networks. This paper focuses on the problem of managing highly dynamic and resource‐constrained MANET environmen