Architecture and Evaluation on Cooperative Caching In Wireless P2P

Abstract

All researches shown that cooperative cache can improve the system performance in wireless P2P networks such as ad hoc networks and mesh networks. And all these studies have been done up to some level only.So for that purpose now iam using an protocol technique called Dynamic Source routing (DSR). And previous studies have been done mainly by using an AODV routing technique and these are all at high level and leaving many design and implementation issues unanswered. In this paper, I am mainly presenting my design and implementation of cooperative cache in wireless P2P networks, and propose solutions to find the best place to cache the data. For that one I propose an novel asymmetric cooperative cache approach by using an Dynamic Source Routing Protocol. By using these technique I can say that packet routing to be trivially loop-free, avoids the need for up-to-date routing information in the intermediate nodes through which packets are forwarded, and allows nodes forwarding or overhearing packets to cache the routing information in them for their own future use. All aspects of the protocol operate entirely on-demand, allowing the routing packet overhead of DSR to scale automatically to only that needed to react to changes in the routes currently in use. The data has been accessed easily by the user. And also by using an data pipelines we can reduce the end-to- end delays between the server and client. My results show that the Dynamic Source Routing out performs the AODV in wireless P2P networks.