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 …

We present a scheme, called global cluster cooperation (GCC) for caching in mobile ad hoc
networks where network topology is partitioned into non-overlapping clusters based on the
physical network proximity. In this scheme cluster cache state (CCS), which is the
information regarding the contents of all the mobile nodes (MNs) within a cluster, is
maintained at each node. In case of cluster cache miss, we propose to keep global cache
state (GCS) at a node called cluster state node (CSN). Simulation experiments show that the …