Cooperative Caching in Wireless Mesh Networks

Abstract

For reduction of gateway bottleneck effect, data access cost, and response delay, many cooperative caching schemes are available. But in all the existing schemes, whenever any data is newly cached or any data is evicted, the information needs to be broadcast to all the mesh access points (MAPs). As a result, communication cost increases. In this chapter, a cluster and sub-cluster-based cooperative caching scheme is designed to minimize the communication cost. Clusters and sub-clusters are formed by taking advantage of the static position of Mesh routers. Cluster-heads (CHs) are selected using minimum spanning tree and minimum weighted vertex cover algorithm. Then the clusters and sub-clusters are formed. CHs and other Maps keep different cache information tables, and based on those, cache decision is taken. Client mobility is also considered. The performance of the proposed scheme and some other existing schemes have been compared. It has been observed that in the proposed scheme, communication cost in terms of number of messages is reduced.