Cooperative caching in mobile ad hoc networks based on data utility

Article type: Research Article

Authors: Chand, Narottam | Joshi, R.C. | Misra, Manoj

Affiliations: Department of Computer Science and Engineering, National Institite of Technology Hamirpur, India | Department of Electronics and Computer Engineering, Indian Institute of Technology Roorkee, India. E-mail: {joshifcc,manojfec}@iitr.ernet.in

Note: [] Corresponding author. Tel.: +91 94180 94345; Fax: +91 1972 223834; E-mail: [email protected]

Abstract: 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.

Keywords: Ad hoc networks, cooperative caching, cache replacement, multi-hop, admission control

Journal: Mobile Information Systems, vol. 3, no. 1, pp. 19-37, 2007