An algorithm for dissemination and retrieval of information in wireless ad hoc networks

Replication of data items among different nodes of a wireless infrastructure‐less network may be an efficient technique to increase data availability and improve data access latency. This paper proposes a novel algorithm to distribute data items among nodes in these networks. The goal of the algorithm is to deploy the replicas of the data items in such a way that they are sufficiently distant from each other to prevent excessive redundancy but, simultaneously, they remain close enough to each participant, such that data retrieval can be achieved using a small number of messages. The paper describes the algorithm and provides its performance evaluation for different configurations. Copyright © 2008 John Wiley & Sons, Ltd.

[1]  Takahiro Hara,et al.  Effective replica allocation in ad hoc networks for improving data accessibility , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[2]  Kimmo E. E. Raatikainen,et al.  A Power-Aware Broadcasting Algorithm , 2006, 2006 IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications.

[3]  Dandan Liu,et al.  A Scalable Quorum Based Location Service in Ad Hoc and Sensor Networks , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[4]  Takahiro Hara,et al.  Replica allocation in ad hoc networks with periodic data update , 2002, Proceedings Third International Conference on Mobile Data Management MDM 2002.

[5]  T. Nandagopal,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, MobiCom 1999.

[6]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[7]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[8]  Kimmo E. E. Raatikainen,et al.  SIPCache: A Distributed SIP Location Service for Mobile Ad-Hoc Networks , 2006, 2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services.

[9]  Guohong Cao,et al.  Supporting Cooperative Caching in Ad Hoc Networks , 2006, IEEE Trans. Mob. Comput..

[10]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, IEEE/ACM Transactions on Networking.

[11]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[12]  Kimmo E. E. Raatikainen,et al.  A Stateless Neighbour-Aware Cooperative Caching Protocol for Ad-Hoc Networks , 2005 .

[13]  Kimmo E. E. Raatikainen,et al.  A framework for seamless service interworking in ad-hoc networks , 2006, Comput. Commun..

[14]  Jens Grossklags,et al.  Resilient Data-Centric Storage in Wireless Sensor Networks , 2003, IEEE Distributed Syst. Online.

[15]  Deborah Estrin,et al.  Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table , 2003, Mob. Networks Appl..

[16]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[17]  Pedro José Marrón,et al.  An Efficient Resilience Mechanism for Data Centric Storage in Mobile Ad Hoc Networks , 2006, 7th International Conference on Mobile Data Management (MDM'06).

[18]  Hugo Miranda.  Gossip-Based Data Distribution in Mobile Ad Hoc Networks , 2007 .

[19]  Karl Aberer,et al.  Autonomous Gossiping: A Self-Organizing Epidemic Algorithm for Selective Information Dissemination in Wireless Mobile Ad-Hoc Networks , 2004, ICSNW.

[20]  Takahiro Hara,et al.  Replica allocation for correlated data items in ad hoc sensor networks , 2004, SGMD.