Academy & Industry Research Collaboration Center
In this paper, the authors investigate the problem of cache resolution in a mobile peer to peer ad hoc network. In their vision cache resolution should satisfy the following requirements: it should result in low message overhead and the information should be retrieved with minimum delay. In this paper, they show that these goals can be achieved by splitting the one hop neighbors 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.