Cooperative caching is used in mobile ad hoc networks to reduce the latency perceived by the
mobile clients while retrieving data and to reduce the traffic load in the network. Caching also
increases the availability of data due to server disconnections. The implementation of a
cooperative caching technique essentially involves four major design considerations (i) cache
placement and resolution, which decides where to place and how to locate the cached data (ii)
Cache admission control which decides the data to be cached (iii) Cache replacement which
makes the replacement decision when the cache is full and (iv) consistency maintenance, i.e.
maintaining consistency between the data in server and cache. In this paper we propose an
effective cache resolution technique, which reduces the number of messages flooded in to the
network to find the requested data. The experimental results gives a promising result based on
the metrics of studies.
In this paper we investigate the problem of cache resolution in a mobile peer to peer ad hoc network. In our
vision cache resolution should satisfy the following requirements: (i) it should result in low message
overhead and (ii) the information should be retrieved with minimum delay. In this paper, we show that
these goals can be achieved by splitting the one hop neighbours in to two sets based on the transmission
range. The proposed approach reduces the number of messages flooded in to the network to find the
requested data. This scheme is fully distributed and comes at very low cost in terms of cache overhead. The
experimental results gives a promising result based on the metrics of studies.
Description:
International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 5, October 2013