Slinky : An Adaptive Protocol for Content Access in Disruption-Tolerant Ad Hoc Networks

The topology of tactical MANETs may vary from well connected to severely disconnected. Applications using the clientserver paradigm often do not perform well in such environments, because they rely on the underlying MANET routing protocols to provide connectivity between arbitrary endpoints, which is often infeasible in tactical MANETs. We consider content-based networking as an alternative paradigm to operate tactical MANETs. Content based networking causes information to flow based on its content rather than the identities of endpoints. The network assumes responsibility for positioning information so that it is easily accessible. This model, rather than the classical client–server model, is naturally suited to dynamic and disruption-tolerant tactical MANETs. We present Slinky, an adaptive protocol for content access in disruption-tolerant ad hoc networks, in particular tactical MANETs. Slinky relies on the community structure inherent in most networks. It consists of a distributed scheme to detect dynamic communities in the network, and a scheme to replicate content across the communities. Slinky does not use any underlying network-wide routing, global topology or geographical information that is often unavailable in tactical MANETs. Slinky is an adaptive and efficient content access protocol that can adapt to a wide range of mobility scenarios. We demonstrate the performance of Slinky in a few tactically relevant scenarios.

[1]  Bin Tang,et al.  Benefit-based Data Caching in Ad Hoc Networks , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[2]  Antony I. T. Rowstron,et al.  Virtual ring routing: network routing inspired by DHTs , 2006, SIGCOMM.

[3]  Deborah Estrin,et al.  GHT: a geographic hash table for data-centric storage , 2002, WSNA '02.

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

[5]  Trevor Darrell,et al.  Nearest-Neighbor Methods in Learning and Vision: Theory and Practice (Neural Information Processing) , 2006 .

[6]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[7]  Franca Delmastro From Pastry to CrossROAD: CROSS-layer ring overlay for ad hoc networks , 2005, Third IEEE International Conference on Pervasive Computing and Communications Workshops.

[8]  J. J. Garcia-Luna-Aceves,et al.  Using dominating sets to improve the performance of mobile ad hoc networks , 2005 .

[9]  Nadjib Badache,et al.  Data replication protocols for mobile ad-hoc networks: a survey and taxonomy , 2009, IEEE Communications Surveys & Tutorials.

[10]  Roger Wattenhofer,et al.  Constant-time distributed dominating set approximation , 2003, PODC '03.

[11]  Pan Hui,et al.  Distributed community detection in delay tolerant networks , 2007, MobiArch '07.

[12]  Alexandra Coman,et al.  Identifying Connectors and Communities: Understanding Their Impacts on the Performance of a DTN Publish/Subscribe System , 2009, 2009 International Conference on Computational Science and Engineering.

[13]  David R. Karger,et al.  Looking up data in P2P systems , 2003, CACM.

[14]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[15]  Cecilia Mascolo,et al.  Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks , 2008, IEEE Journal on Selected Areas in Communications.

[16]  Marco Fiore,et al.  A Lightweight Distributed Solution to Content Replication in Mobile Networks , 2010, 2010 IEEE Wireless Communication and Networking Conference.

[17]  Ellen W. Zegura,et al.  Message ferries as generalized dominating sets in intermittently connected mobile networks , 2010, MobiOpp '10.

[18]  Vikram Srinivasan,et al.  Energy-efficient caching strategies in ad hoc wireless networks , 2003, MobiHoc '03.

[19]  Wang Yijie,et al.  A dynamic adaptive replica allocation algorithm in mobile ad hoc networks , 2004, IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second.

[20]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[21]  Jochen H. Schiller,et al.  DHT-based unicast for mobile ad hoc networks , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[22]  Himabindu Pucha,et al.  Ekta: an efficient DHT substrate for distributed applications in mobile ad hoc networks , 2004, Sixth IEEE Workshop on Mobile Computing Systems and Applications.

[23]  Jian Shen,et al.  Routing Protocols in Delay Tolerant Networks : A Comparative Survey , 2008 .