DMCA
RAPID: Reliable Probabilistic Dissemination in wireless ad-hoc networks (2007)
Cached
Download Links
- [www.cs.technion.ac.il]
- [www.cs.technion.ac.il]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (SRDS |
| Citations: | 26 - 6 self |
BibTeX
@INPROCEEDINGS{Drabkin07rapid:reliable,
author = {Vadim Drabkin and Roy Friedman and Gabriel Kliot and Marc Segal},
title = {RAPID: Reliable Probabilistic Dissemination in wireless ad-hoc networks},
booktitle = {In Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (SRDS},
year = {2007}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Reliable broadcast is a basic service for many collaborative applications as it provides reliable dissemination of the same information to many recipients. In this paper we propose a novel ReliAble ProbabIlistic Dissemination protocol, called 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. By adding authentication, it can even be made malicious tolerant. Additionally, 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.
Keyphrases
reliable probabilistic dissemination wireless ad-hoc network deterministic corrective measure unique protocol design ad-hoc network environment many collaborative application novel reliable probabilistic dissemination protocol probabilistic forwarding theoretical analysis node coverage forwarding probability node crash message omission probabilistic approach reliable broadcast mobile wireless ad-hoc network basic service local computation deterministic gossiping many recipient malicious tolerant one-hop neighborhood detailed performance evaluation observed number reliable dissemination selfish behavior probabilistic process
