Gossiping on MANETs: the beauty and the beast
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Epidemic-based reliable and adaptive multicast for mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Count on me: lightweight ad-hoc broadcasting in heterogeneous topologies
M-PAC '09 Proceedings of the International Workshop on Middleware for Pervasive Mobile and Embedded Computing
A prioritization-based application-oriented broadcast protocol for delay-tolerant networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Efficient and reliable dissemination in wireless opportunistic networks by location extrapolation
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
ASTRAL: an adaptive, efficient, and reliable flooding mechanism for MANET
Proceedings of the 2010 ACM Symposium on Applied Computing
Stochastic broadcast for VANET
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
@Flood: auto-tunable flooding for wireless ad hoc networks
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
A survey of adaptive services to cope with dynamics in wireless self-organizing networks
ACM Computing Surveys (CSUR)
A survey of context data distribution for mobile ubiquitous systems
ACM Computing Surveys (CSUR)
PAMPA in the wild: a real-life evaluation of a lightweight ad-hoc broadcasting family
Proceedings of the 7th International Workshop on Middleware Tools, Services and Run-Time Support for Sensor Networks
| Hi-index | 0.00 |
In this paper, we propose a novel ReliAble ProbabIlistic Dissemination protocol, RAPID, for mobile wireless ad-hoc networks that tolerates message omissions, node crashes, and selfish behavior. The protocol employs a combination of probabilistic forwarding with deterministic corrective measures. The forwarding probability is set based on the observed number of nodes in each one-hop neighborhood, while the deterministic corrective measures include deterministic gossiping as well as timer based corrections of the probabilistic process. These aspects of the protocol are motivated by a theoretical analysis that is also presented in the paper, which explains why this unique protocol design is inherent to ad-hoc networks environments. Since the protocol only relies on local computations and probability, it is highly resilient to mobility and failures. The paper includes a detailed performance evaluation by simulation. We compare the performance and the overhead of RAPID with the performance of other probabilistic approaches. Our results show that RAPID achieves a significantly higher node coverage with a smaller overhead.