Cache data access system in ad hoc networks

Since nodes in mobile wireless ad hoc networks may not always be able to access original data that they want, methods for distributing caches of data have been developed. We propose not only a cache allocation method but also a comprehensive system for accessing cached data, which includes such three steps; distributing caches beforehand, discovering the caches, and accessing the discovered cache. This paper is especially focused on cache discovery problem and proposes a "self-resolver paradigm, in which a client user itself queries and measures which node it should access. In addition to the self-resolver cache discovery framework, we consider stability of a multihop route as probability, which can be obtained by two definitions: neighbor-independent link model or neighbor-dependent link model. The route stability models are utilized not only for cache data access system but also for any applications in ad hoc networks. In this paper, evaluations of the self-resolver method are carried out with the route stability models. Experimental results show that, in comparison with query range limitation with hop count, query range limitation with the route stability models can reduce the number of query packets and discover more cache-keeping nodes.