期刊名称：International Journal of Wireless & Mobile Networks
印刷版ISSN：0975-4679
电子版ISSN：0975-3834
出版年度：2013
卷号：5
期号：5
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：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.
