Community aware content retrieval in disruption-tolerant networks

A major challenge in the design of a sparse mobile ad-hoc network (MANET) is the support of efficient content retrieval. Information-centric network (ICN) is an emerging network technology which provides a viable underlying architecture for efficient content distribution. However, current mobile ICN approaches generate excess control overhead that cause scalability issues as network and content sizes grow. In this paper, we propose a community-based content retrieval architecture which is highly scalable in disruption-tolerant mobile information-centric networks. Simulations in the NS-3 environment shows that our system requires less control overhead while maintaining comparable performance for content retrieval applications.

[1]  Ahmed Helmy,et al.  IMPACT: Investigation of Mobile-user Patterns Across University Campuses using WLAN Trace Analysis , 2005, ArXiv.

[2]  Pan Hui,et al.  Haggle: A networking architecture designed around mobile users , 2006 .

[3]  Deborah Estrin,et al.  Named Data Networking (NDN) Project , 2010 .

[4]  Eyal de Lara,et al.  Haggle: Seamless Networking for Mobile Applications , 2007, UbiComp.

[5]  Mads Haahr,et al.  Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs , 2009, IEEE Transactions on Mobile Computing.

[6]  D. Manjunath,et al.  Data Delivery Properties of Human Contact Networks , 2011, IEEE Transactions on Mobile Computing.

[7]  Xiao Li,et al.  Information-centric delay-tolerant mobile ad-hoc networks , 2014, 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[8]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[9]  Bodo Manthey,et al.  k-Means Has Polynomial Smoothed Complexity , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[10]  Scott C. Burleigh,et al.  Bundle Protocol Specification , 2007, RFC.

[11]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[12]  D.M. Mount,et al.  An Efficient k-Means Clustering Algorithm: Analysis and Implementation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Alexander Afanasyev,et al.  Rapid traffic information dissemination using named data , 2012, NoM '12.

[14]  Sang Lyul Min,et al.  LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies , 2001, IEEE Trans. Computers.

[15]  M. Vetterli,et al.  Locating mobile nodes with EASE: learning efficient routes from encounter histories alone , 2006, IEEE/ACM Transactions on Networking.

[16]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[17]  Mario Gerla,et al.  Content Centric Networking in tactical and emergency MANETs , 2010, 2010 IFIP Wireless Days.

[18]  Martin Mauve,et al.  A survey on position-based routing in mobile ad hoc networks , 2001, IEEE Netw..

[19]  Pan Hui,et al.  Pocket Switched Networks: Real-world mobility and its consequences for opportunistic forwarding , 2005 .