A Stateless Neighbour-Aware Cooperative Caching Protocol for Ad-Hoc Networks

Replication of data items among different nodes of a Mobile Ad-Hoc Network (MANET) is an efficient technique to increase data availability and improve access latency. This paper proposes a novel algorithm to distribute cached data items among nodes in a MANET. The algorithm combines a probabilistic approach with latency constraints such as the distance from both the source and the clients of the data item. In most scenarios, our approach allows any node to retrieve a data item from a nearby neighbour (often, just one hop away). The paper describes the algorithm and provides its performance evaluation for several different network configurations. This work was partially supported by the Middleware for Network Eccentric and Mobile Applications (MiNEMA) programme of the European Science Foundation Also Technical Report Number C-2005-76. Computer Science Department, University of Helsinki

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

[2]  S. Ci,et al.  An link adaptation scheme for improving throughput in the IEEE 802.11 wireless LAN , 2002, 27th Annual IEEE Conference on Local Computer Networks, 2002. Proceedings. LCN 2002..

[3]  Chita R. Das,et al.  A novel caching scheme for improving Internet-based mobile ad hoc networks performance , 2006, Ad Hoc Networks.

[4]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[5]  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).

[6]  Yuh-Jzer Joung,et al.  Probabilistic file indexing and searching in unstructured peer-to-peer networks , 2004, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004..

[7]  Paolo Santi,et al.  The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[8]  Hsin-Chiao Liu,et al.  Analyzing the throughput of IEEE 802.11 DCF scheme with hidden nodes , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

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

[10]  Martin Nilsson,et al.  Investigating the energy consumption of a wireless network interface in an ad hoc networking environment , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[11]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[13]  M. van Steen,et al.  Epidemic-Style Monitoring in Large-Scale Wireless Sensor Networks , 2005 .