Abstract

Disruption Tolerant Networks (DTNs) are characterized by lack of continuous network connectivity because of the limits of radio communication range, sparsity of mobile nodes, shortage of energy resources. There are many researches about data forwarding in DTNs, while limited work on providing efficient data access. In this paper, we propose an efficient cooperative caching scheme, which enables the data query to be satisfied quickly. Our basic idea is to cache data at a set of Proper Nodes (PNs), which can be easily accessed by other nodes in the network. We present a novel algorithm to select the PNs. This algorithm ensures that the PNs are not clustered to damage the data access performance of the whole network. We evaluate our proposed cooperative caching scheme with extensive simulation by using the Sigcomm2009 trace records. The simulation results show that our proposed cooperative caching scheme significantly improves the performance of data access.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.