The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks
JiST: an efficient approach to simulation using virtual machines: Research Articles
Software—Practice & Experience
Exploring the Energy-Latency Trade-Off for Broadcasts in Energy-Saving Sensor Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Gossiping is a lightweight and simple technique for information dissemination in many application domains, be it in Wireless Sensor Networks (WSNs), Mobile Ad-hoc Networks (MANETs), or Vehicular Ad-hoc Networks (VANETs). Much research has been conducted in the past on probabilistic dissemination methods because of their efficiency compared with simple flooding and their simple application. However most work was focused on static gossiping, i.e., the gossiping probability cannot be adapted according to topology changes. Thus, topology characteristics have to be known in advance. In this work the use of position information for building up a neighborhood relationship is proposed. Based on this information, a forwarding hierarchy is constructed and the protocol is capable to adjust the dissemination probability dynamically in a distributed manner. The protocol is evaluated in a highway scenario, where the network characteristic varies from sparse networks with highly mobile nodes to a traffic jam with very high node density and low node velocities. The applicability of the proposed protocol for such scenarios is shown by simulations.