Paper Info
Title
Robust Data Replication Algorithm for MANETs with Obstacles and Node Failures
Abstract
In this paper we present a Robust data Replication Algorithm (RRA) for MANETs. RRA ensures persistent data availability by duplicating data over replica-nodes, while minimizing the consumption of radio resources. RRA is the first algorithm thoroughly designed to operate in environments with node failures and radio obstacles (e.g., buildings, walls). Our challenge is to consider such impairments as "accidental"; i.e., their occurrence neither can be run-time predicted, nor can be a-priori quantified in terms of probability. As instance, this is the case of nodes wandering in an unknown territory. To cope efficiently with the novel challenge, we suggest a practical assumption: during a refresh period, only a single accidental impairment may occur. Following this assumption, we succeed in formalizing (and solving) the resource minimization problem as the finding of a minimum-cost-set-cover. We assess RRA performance through NS2 simulations. Simulation code is released as open-source.
Year
DOI
Venue
2010
10.1109/ICC.2010.5502566
Communications
Keywords
Field
DocType
data replication,indexing terms,robustness,mobile ad hoc networks,availability,data engineering,set cover,ad hoc network,algorithm design and analysis,ad hoc networks,protocols
Mobile ad hoc network,Mobile radio,Persistent data structure,Algorithm design,Computer science,Computer network,Algorithm,Robustness (computer science),Robust statistics,Information engineering,Wireless ad hoc network,Distributed computing
Conference
ISSN
ISBN
Citations 
1550-3607
978-1-4244-6402-9
0
PageRank 
References 
Authors
0.34
6
3
Name
Order
Citations
PageRank
A. Detti154747.83
Lorenzo Bracciale200.34
Francesco Fedi300.34