TY - GEN
T1 - Supporting cooperative caching in disruption tolerant networks
AU - Gao, Wei
AU - Cao, Guohong
AU - Iyengar, Arun
AU - Srivatsa, Mudhakar
PY - 2011
Y1 - 2011
N2 - Disruption Tolerant Networks (DTNs) are characterized by the 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 effective 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 effective scheme which ensures appropriate NCL selection based on a probabilistic selection metric, and coordinate multiple caching nodes to optimize tradeoff between data accessibility and caching overhead. Extensive trace-driven simulations show that our scheme significantly improves data access performance compared to existing schemes.
AB - Disruption Tolerant Networks (DTNs) are characterized by the 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 effective 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 effective scheme which ensures appropriate NCL selection based on a probabilistic selection metric, and coordinate multiple caching nodes to optimize tradeoff between data accessibility and caching overhead. Extensive trace-driven simulations show that our scheme significantly improves data access performance compared to existing schemes.
UR - http://www.scopus.com/inward/record.url?scp=80051885535&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80051885535&partnerID=8YFLogxK
U2 - 10.1109/ICDCS.2011.76
DO - 10.1109/ICDCS.2011.76
M3 - Conference contribution
AN - SCOPUS:80051885535
SN - 9780769543642
T3 - Proceedings - International Conference on Distributed Computing Systems
SP - 151
EP - 161
BT - Proceedings - 31st International Conference on Distributed Computing Systems, ICDCS 2011
T2 - 31st International Conference on Distributed Computing Systems, ICDCS 2011
Y2 - 20 June 2011 through 24 July 2011
ER -