The polarized gossip protocol for path discovery in MANETs
- 31 January 2008
- journal article
- Published by Elsevier BV in Ad Hoc Networks
- Vol. 6 (1), 79-91
- https://doi.org/10.1016/j.adhoc.2006.08.002
Abstract
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.Keywords
Funding Information
- Ministero dell’Istruzione, dell’Università e della Ricerca
This publication has 11 references indexed in Scilit:
- A hint-based probabilistic protocol for unicast communications in MANETsAd Hoc Networks, 2006
- Regional Gossip Routing for Wireless Ad Hoc NetworksMobile Networks and Applications, 2005
- Probabilistic reliable multicast in ad hoc networksAd Hoc Networks, 2003
- SHARPPublished by Association for Computing Machinery (ACM) ,2003
- PATHSPublished by Association for Computing Machinery (ACM) ,2003
- Critical Density Thresholds in Distributed Wireless NetworksPublished by Springer Science and Business Media LLC ,2003
- Comparison of broadcasting techniques for mobile ad hoc networksPublished by Association for Computing Machinery (ACM) ,2002
- The broadcast storm problem in a mobile ad hoc networkPublished by Association for Computing Machinery (ACM) ,1999
- Epidemic algorithms for replicated database maintenancePublished by Association for Computing Machinery (ACM) ,1987
- Percolation processesMathematical Proceedings of the Cambridge Philosophical Society, 1957