In Mobile Ad-Hoc Networks (MANETs) we are often faced with the problem of sharing information among a (potentially large) set of nodes. The replication of data items among different nodes of a MANET is an efficient technique to increase data availability and improve the latency of data access. However, an efficient replication scheme requires a scalable method to disseminate updates. The robustness and scalability of gossip (or epidemic) protocols make them an efficient tool for message dissemination in large scale wired and wireless networks. This chapter describes a novel algorithm to replicate and retrieve data items among nodes in a MANET that is based on a epidemic dissemination scheme. Our approach is tailored to the concrete network environment of MANETs and, while embedding several ideas from existing gossip protocols, takes into account the topology, scarcity of resources, and limited availability of both the devices and the network links in this sort of networks.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 firstname.lastname@example.org
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 email@example.com