This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks
March 2014 (vol. 13 no. 3)
pp. 611-625
Wei Gao, University of Tennessee, Knoxville
Guohong Cao, Pennsylvania State University, University Park
Arun Iyengar, IBM T.J. Watson Research Center, Hawthorne
Mudhakar Srivatsa, IBM T.J. Watson Research Center, Hawthorne
Disruption tolerant networks (DTNs) are characterized by low node density, unpredictable node mobility, and lack of global network information. Most of current research efforts in DTNs focus on data forwarding, but only limited work has been done on providing efficient data access to mobile users. In this paper, we propose a novel approach to support cooperative caching in DTNs, which enables the sharing and coordination of cached data among multiple nodes and reduces data access delay. Our basic idea is to intentionally cache data at a set of network central locations (NCLs), which can be easily accessed by other nodes in the network. We propose an efficient scheme that ensures appropriate NCL selection based on a probabilistic selection metric and coordinates multiple caching nodes to optimize the tradeoff between data accessibility and caching overhead. Extensive trace-driven simulations show that our approach significantly improves data access performance compared to existing schemes.
Index Terms:
Peer-to-peer computing,Delay,Ad hoc networks,Mobile nodes,cache replacement,Cooperative caching,disruption tolerant networks,data access,network central locations
Citation:
Wei Gao, Guohong Cao, Arun Iyengar, Mudhakar Srivatsa, "Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks," IEEE Transactions on Mobile Computing, vol. 13, no. 3, pp. 611-625, March 2014, doi:10.1109/TMC.2013.33
Usage of this product signifies your acceptance of the Terms of Use.