Table of Contents Author Guidelines Submit a Manuscript
Mobile Information Systems
Volume 3, Issue 1, Pages 19-37

Cooperative Caching in Mobile Ad Hoc Networks Based on Data Utility

Narottam Chand,1 R. C. Joshi,2 and Manoj Misra2

1Department of Computer Science and Engineering, National Institite of Technology Hamirpur, India
2Department of Electronics and Computer Engineering, Indian Institute of Technology Roorkee, India

Received 26 March 2007; Accepted 26 March 2007

Copyright © 2007 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Cooperative caching, which allows sharing and coordination of cached data among clients, is a potential technique to improve the data access performance and availability in mobile ad hoc networks. However, variable data sizes, frequent data updates, limited client resources, insufficient wireless bandwidth and client's mobility make cache management a challenge. In this paper, we propose a utility based cache replacement policy, least utility value (LUV), to improve the data availability and reduce the local cache miss ratio. LUV considers several factors that affect cache performance, namely access probability, distance between the requester and data source/cache, coherency and data size. A cooperative cache management strategy, Zone Cooperative (ZC), is developed that employs LUV as replacement policy. In ZC one-hop neighbors of a client form a cooperation zone since the cost for communication with them is low both in terms of energy consumption and message exchange. Simulation experiments have been conducted to evaluate the performance of LUV based ZC caching strategy. The simulation results show that, LUV replacement policy substantially outperforms the LRU policy.