Information-maximizing caching in Ad Hoc networks with named data networking

Named data networking has emerged as a new architectural paradigm that replaces host-based addressing in today's networks with content-centric addressing. Rather than assigning IP addresses to hosts, it assigns names to data objects and supports hierarchical name spaces. This paper explores the benefits of naming data for the design of information-maximizing caching policies in ad hoc networks. It is shown that the approach allows development of caching policies for ad hoc networks that simultaneously offer (i) better quality of information (in terms of coverage), (ii) higher throughput (in terms of responses per query), and (iii) lower latency.

[1]  Martin Vetterli,et al.  Network correlated data gathering with explicit communication: NP-completeness and algorithms , 2006 .

[2]  Yan Gao,et al.  Optimizing File Retrieval in Delay-Tolerant Content Distribution Community , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[3]  Md. Yusuf Sarwar Uddin,et al.  PhotoNet: A Similarity-Aware Picture Delivery Service for Situation Awareness , 2011, 2011 IEEE 32nd Real-Time Systems Symposium.

[4]  Jian Pei,et al.  An Energy-Efficient Data Collection Framework for Wireless Sensor Networks by Exploiting Spatiotemporal Correlation , 2007, IEEE Transactions on Parallel and Distributed Systems.

[5]  Marco Conti,et al.  Design and performance evaluation of ContentPlace, a social-aware data dissemination system for opportunistic networks , 2010, Comput. Networks.

[6]  Pan Hui,et al.  A socio-aware overlay for publish/subscribe communication in delay tolerant networks , 2007, MSWiM '07.

[7]  Guohong Cao,et al.  Supporting Cooperative Caching in Disruption Tolerant Networks , 2011, 2011 31st International Conference on Distributed Computing Systems.

[8]  Marco Conti,et al.  ContentPlace: social-aware data dissemination in opportunistic networks , 2008, MSWiM '08.

[9]  Guohong Cao,et al.  Supporting Cooperative Caching in Ad Hoc Networks , 2006, IEEE Trans. Mob. Comput..

[10]  Ji Luo,et al.  Delay Tolerant Event Collection in Sensor Networks with Mobile Sink , 2010, 2010 Proceedings IEEE INFOCOM.

[11]  Narottam Chand,et al.  Efficient Cooperative Caching in Ad Hoc Networks , 2006, 2006 1st International Conference on Communication Systems Software & Middleware.

[12]  Baochun Li,et al.  A Distributed Framework for Correlated Data Gathering in Sensor Networks , 2008, IEEE Transactions on Vehicular Technology.

[13]  Vishnu Navda,et al.  Efficient gathering of correlated data in sensor networks , 2008, TOSN.

[14]  Jörg Ott,et al.  Redundancy and distributed caching in mobile DTNs , 2007, MobiArch '07.

[15]  Guohong Cao,et al.  User-centric data dissemination in disruption tolerant networks , 2011, 2011 Proceedings IEEE INFOCOM.

[16]  Donald F. Towsley,et al.  On optimal communication cost for gathering correlated data through wireless sensor networks , 2006, MobiCom '06.

[17]  Augustin Chaintreau,et al.  The age of impatience: optimal replication schemes for opportunistic networks , 2009, CoNEXT '09.

[18]  Gunnar Karlsson,et al.  Wireless Ad Hoc Podcasting , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[19]  Stratis Ioannidis,et al.  Distributed caching over heterogeneous mobile networks , 2010, SIGMETRICS '10.

[20]  Özgür B. Akan,et al.  Spatio-temporal correlation: theory and applications for wireless sensor networks , 2004, Comput. Networks.

[21]  Sandy Irani,et al.  Cost-Aware WWW Proxy Caching Algorithms , 1997, USENIX Symposium on Internet Technologies and Systems.

[22]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[23]  Tarek F. Abdelzaher,et al.  Energy-conserving data cache placement in sensor networks , 2005, TOSN.

[24]  Jie Wu,et al.  MOPS: Providing Content-Based Service in Disruption-Tolerant Networks , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.