Cooperative Caching Strategy in Mobile Ad Hoc Networks Based on Clusters

  • Authors:
  • Narottam Chand;R. C. Joshi;Manoj Misra

  • Affiliations:
  • Department of Electronics and Computer Engineering, Indian Institute of Technology, Roorkee, India;Department of Electronics and Computer Engineering, Indian Institute of Technology, Roorkee, India;Department of Electronics and Computer Engineering, Indian Institute of Technology, Roorkee, India

  • Venue:
  • Wireless Personal Communications: An International Journal
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present a scheme, called Cluster Cooperative (CC) for caching in mobile ad hoc networks. In CC scheme, the network topology is partitioned into non-overlapping clusters based on the physical network proximity. For a local cache miss, each client looks for data item in the cluster. If no client inside the cluster has cached the requested item, the request is forwarded to the next client on the routing path towards server. A cache replacement policy, called Least Utility Value with Migration (LUV-Mi) is developed. The LUV-Mi policy is suitable for cooperation in clustered ad hoc environment because it considers the performance of an entire cluster along with the performance of local client. Simulation experiments show that CC caching mechanism achieves significant improvements in cache hit ratio and average query latency in comparison with other caching strategies.