Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
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
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
PATHS: analysis of PATH duration statistics and their impact on reactive MANET routing protocols
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
SHARP: a hybrid adaptive routing protocol for mobile ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Regional gossip routing for wireless ad hoc networks
Mobile Networks and Applications
From battlefields to urban grids: New research challenges in ad hoc wireless networks
Pervasive and Mobile Computing
Survey Paper: Routing protocols in ad hoc networks: A survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
In this paper we present a novel probabilistic protocol for path discovery in Mobile Ad Hoc Networks (MANETs). The protocol implements what we call a polarized gossiping algorithm. While in the classical gossip algorithm each node forwards a message with the same probability, our proposal is characterized by a variable gossiping probability, which is high enough only for sustaining the spreading process towards the destination. The gossiping probability of a node is determined by the difference between its proximity to the destination and the proximity to the destination of the node from which the message was received. Differently from other proposals no external location service support, e.g., via GPS, is required. Rather, the proximity is estimated from the ''inside'' of the network using periodic beacons for determining the time elapsed since a node met the destination and the dwell time of a node with the destination. These information are then exploited by nodes to modulate their gossiping probability. The paper reports a mathematical model for the analysis of the algorithm along with an extensive simulation study of its implementation, which shows the suitability of the proposed solution.