A virtual backbone based approach for cooperative caching in mobile ad hoc networks

Abstract

Abstract-Cache look up is an integral part of cooperative caching in ad hoc networks. In this paper, we discuss a cooperative caching architecture with a distributed cache look up protocol which relies on a virtual backbone for locating and accessing data within a cooperate cache. Our proposal consists of two phases: (i) formation of a virtual backbone and (ii) the cache look up phase. The nodes in a Connected Dominating Set (CDS) form the virtual backbone. The cache look up protocol makes use of the nodes in the virtual backbone for effective data dissemination and discovery. The idea in this scheme is to reduce the number of nodes involved in cache look up process, by constructing a CDS that contains a small number of nodes, still having full coverage of the network. We evaluated the effect of various parameter settings on the performance metrics such as message overhead, cache hit ratio and average query delay. Compared to the previous schemes the proposed scheme not only reduces message overhead, but also improves the cache hit ratio and reduces the average delay.

Minimum Connected Dominating Set Algorithms for Ad Hoc Sensor Networks

“…Eventually, the whole network may change. Therefore, it has become a favorable research method for researchers to construct a virtual backbone network [4,5,6] based on ad hoc sensor network. Connected backbone nodes in networks can perform efficient routing and broadcasting [7].…”