The Community for Technology Leaders
RSS Icon
Issue No.03 - March (2014 vol.13)
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.
Peer-to-peer computing, Delay, Ad hoc networks, Mobile nodes,cache replacement, Cooperative caching, disruption tolerant networks, data access, network central locations
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
[1] A. Balasubramanian, B. Levine, and A. Venkataramani, "DTN Routing as a Resource Allocation Problem," Proc. ACM SIGCOMM Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm., pp. 373-384, 2007.
[2] C. Boldrini, M. Conti, and A. Passarella, "ContentPlace: Social-Aware Data Dissemination in Opportunistic Networks," Proc. 11th Int'l Symp. Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM), pp. 203-210, 2008.
[3] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, "Web Caching and Zipf-Like Distributions: Evidence and Implications." Proc. IEEE INFOCOM, vol. 1, 1999.
[4] J. Burgess, B. Gallagher, D. Jensen, and B. Levine, "MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks," Proc. IEEE INFOCOM, 2006.
[5] H. Cai and D.Y. Eun, "Crossing over the Bounded Domain: From Exponential to Power-Law Inter-Meeting Time in MANET," Proc. ACM MobiCom, pp. 159-170, 2007.
[6] P. Cao and S. Irani, "Cost-Aware WWW Proxy Caching Algorithms," Proc. USENIX Symp. Internet Technologies and Systems, 1997.
[7] A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, "Impact of Human Mobility on Opportunistic Forwarding Algorithms," IEEE Trans. Mobile Computing, vol. 6, no. 6, pp. 606-620, June 2007.
[8] P. Costa, C. Mascolo, M. Musolesi, and G. Picco, "Socially Aware Routing for Publish-Subscribe in Delay-Tolerant Mobile Ad Hoc Networks," IEEE J. Selected Areas in Comm., vol. 26, no. 5, pp. 748-760, June 2008.
[9] E. Daly and M. Haahr, "Social Network Analysis for Routing in Disconnected Delay-Tolerant MANETs," Proc. ACM MobiHoc, 2007.
[10] H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli, "Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages," Proc. ACM MobiHoc, pp. 257-266, 2003.
[11] J. Eriksson, L. Girod, B. Hull, R. Newton, S. Madden, and H. Balakrishnan, "The Pothole Patrol: Using a Mobile Sensor Network for Road Surface Monitoring," Proc. ACM Sixth Ann. Int'l Conf. Mobile Systems, Applications and Services (MobiSys), 2008.
[12] V. Erramilli, A. Chaintreau, M. Crovella, and C. Diot, "Diversity of Forwarding Paths in Pocket Switched Networks," Proc. Seventh ACM SIGCOMM Conf. Internet Measurement (IMC), pp. 161-174, 2007.
[13] V. Erramilli, A. Chaintreau, M. Crovella, and C. Diot, "Delegation Forwarding," Proc. ACM MobiHoc, 2008.
[14] K. Fall, "A Delay-Tolerant Network Architecture for Challenged Internets," Proc. ACM SIGCOMM Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm., pp. 27-34, 2003.
[15] L. Fan, P. Cao, J. Almeida, and A. Broder, "Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol," IEEE/ACM Trans. Networking, vol. 8, no. 3, pp. 281-293, June 2000.
[16] M. Fiore, F. Mininni, C. Casetti, and C.F. Chiasserini, "To Cache or Not to Cache?" Proc. IEEE INFOCOM, pp. 235-243, 2009.
[17] W. Gao and G. Cao, "On Exploiting Transient Contact Patterns for Data Forwarding in Delay Tolerant Networks," Proc. IEEE Int'l Conf. Network Protocols (ICNP), pp. 193-202, 2010.
[18] W. Gao and G. Cao, "User-Centric Data Dissemination in Disruption Tolerant Networks," Proc. IEEE INFOCOM, 2011.
[19] W. Gao, G. Cao, A. Iyengar, and M. Srivatsa, "Supporting Cooperative Caching in Disruption Tolerant Networks," Proc. Int'l Conf. Distributed Computing Systems (ICDCS), 2011.
[20] W. Gao, Q. Li, B. Zhao, and G. Cao, "Multicasting in Delay Tolerant Networks: A Social Network Perspective," Proc. ACM MobiHoc, pp. 299-308, 2009.
[21] Y. Huang, Y. Gao, K. Nahrstedt, and W. He, "Optimizing File Retrieval in Delay-Tolerant Content Distribution Community," Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS), pp. 308-316, 2009.
[22] P. Hui, J. Crowcroft, and E. Yoneki, "Bubble Rap: Social-Based Forwarding in Delay Tolerant Networks," Proc. ACM MobiHoc, 2008.
[23] S. Ioannidis, L. Massoulie, and A. Chaintreau, "Distributed Caching over Heterogeneous Mobile Networks," Proc. ACM SIGMETRICS Int'l Conf. Measurement and Modeling of Computer Systems, pp. 311-322, 2010.
[24] V. Lenders, G. Karlsson, and M. May, "Wireless Ad Hoc Podcasting," Proc. IEEE Fourth Ann. Comm. Soc. Conf. Sensor, Mesh and Ad Hoc Comm. and Networks (SECON), pp. 273-283, 2007.
[25] F. Li and J. Wu, "MOPS: Providing Content-Based Service in Disruption-Tolerant Networks," Proc. Int'l Conf. Distributed Computing Systems (ICDCS), pp. 526-533, 2009.
[26] S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, 1990.
[27] M.J. Pitkanen and J. Ott, "Redundancy and Distributed Caching in Mobile DTNs," Proc. ACM/IEEE Second Workshop Mobility in the Evolving Internet Architecture (MobiArch), 2007.
[28] I. Psaras, L. Wood, and R. Tafazolli, "Delay-/Disruption-Tolerant Networking: State of the Art and Future Challenges," technical report, Univ. of Surrey, 2010.
[29] J. Reich and A. Chaintreau, "The Age of Impatience: Optimal Replication Schemes for Opportunistic Networks," Proc. ACM Fifth Int'l Conf. Emerging Networking Experiments and Technologies (CoNEXT), pp. 85-96, 2009.
[30] S.M. Ross, Introduction to Probability Models. Academic, 2006.
[31] T. Spyropoulos, K. Psounis, and C. Raghavendra, "Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks," Proc. ACM SIGCOMM Workshop Delay-Tolerant Networking, pp. 252-259, 2005.
[32] T. Spyropoulos, K. Psounis, and C. Raghavendra, "Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case," IEEE/ACM Trans. Networking, vol. 16, no. 1, pp. 63-76, Feb. 2008.
[33] B. Tang, H. Gupta, and S.R. Das, "Benefit-Based Data Caching in Ad Hoc Networks," IEEE Trans. Mobile Computing, vol. 7, no. 3, pp. 289-304, Mar. 2008.
[34] A. Vahdat and D. Becker, "Epidemic Routing for Partially Connected Ad Hoc Networks,"  Technical Report CS-200006, Duke Univ., 2000.
[35] L. Yin and G. Cao, "Supporting Cooperative Caching in Ad Hoc Networks," IEEE Trans. Mobile Computing, vol. 5, no. 1, pp. 77-89, Jan. 2006.
[36] E. Yoneki, P. Hui, S. Chan, and J. Crowcroft, "A Socio-Aware Overlay for Publish/Subscribe Communication in Delay Tolerant Networks," Proc. 10th ACM Symp. Modeling, Analysis, and Simulation of Wireless and Mobile Systems (MSWiM), pp. 225-234, 2007.
[37] Q. Yuan, I. Cardei, and J. Wu, "Predict and Relay: An Efficient Routing in Disruption-Tolerant Networks," Proc. ACM MobiHoc, pp. 95-104, 2009.
[38] J. Zhao, P. Zhang, G. Cao, and C. Das, "Cooperative Caching in Wireless P2P Networks: Design, Implementation, and Evaluation," IEEE Trans. Parallel & Distributed Systems, vol. 21, no. 2, pp. 229-241, Feb. 2010.
[39] H. Zhu, L. Fu, G. Xue, Y. Zhu, M. Li, and L.M. Ni, "Recognizing Exponential Inter-Contact Time in VANETs," Proc. IEEE INFOCOM, 2010.
41 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool