Data Delivery in Delay Tolerant Networks: A Survey

Delay-Tolerant Networks (Fall (2003)), also called disruption tolerant networks (DTNs), represent a fairly new networking paradigm that allows inter-connection between devices that current networking technology cannot provide. There are a wide variety of networks where an end-to-end connection between a given source and destination may never be present. Consequently, traditional routing protocols cannot be directly applied in these scenarios for delivering data. However, if one were to take the graph formed by the nodes based on their connectivity dictated by their radio range and consider the overlap not only over space but also time then there is a high likelihood that the network will appear as a single connected component. So while at any given instant, the network may not be connected, it may still be possible to route data from a source to a destination. DTNs are sometimes also called Intermittently-Connected Mobile Networks (ICMNs). The primary goal in such networks is to get the information from a source to the destination; these networks can tolerate a relatively higher delay. A wide variety of ”challenged” networks fall under this category ranging from outer-space networks, under-water networks, wireless sensor networks, vehicular networks, sparse mobile ad-hoc networks etc. Students moving about in a college campus (Hsu & Helmy (2006)), or buses moving about in a small metropolitan area (Burgess et al. (2006)), or a wireless sensor network with some mobile nodes (Shah et al. (2003); Juang et al. (2002)) acting as relays to assist in the data-collection phase provide representative examples of DTNs. This chapter strives to provide a survey of some of the most relevant studies that have appeared in the domain of data delivery in delay tolerant networks. First, we introduce some fundamental challenges that are unique to DTNs. Then we present the major parameters of interest that various proposed routing solutions have considered, examples include end-to-end delay, throughput, mobility model of the nodes, energy efficiency, storage etc. Subsequently, we provide a classification of various approaches to routing in DTNs and pigeon-hole the major studies that have appeared in the last few years into the classified categories.

[1]  S. Keshav,et al.  Practical security for disconnected nodes , 2005, 1st IEEE ICNP Workshop on Secure Network Protocols, 2005. (NPSec)..

[2]  Timur Friedman,et al.  Evaluating Mobility Pattern Space Routing for DTNs , 2005, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[3]  E. Jones Routing Strategies for Delay-Tolerant Networks , 2006 .

[4]  Margaret Martonosi,et al.  Erasure-coding based routing for opportunistic networks , 2005, WDTN '05.

[5]  Ellen W. Zegura,et al.  Controlling the mobility of multiple data transport ferries in a delay-tolerant network , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[6]  Doug Terry,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[7]  Kevin C. Almeroth,et al.  Transport Layer Issues in Delay Tolerant Mobile Networks , 2006, Networking.

[8]  Wei-jen Hsu,et al.  On Modeling User Associations in Wireless LAN Traces on University Campuses , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[9]  Roy D. Yates,et al.  The Infostations challenge: balancing cost and ubiquity in delivering wireless data , 2000, IEEE Wirel. Commun..

[10]  Cauligi S. Raghavendra,et al.  Single-copy routing in intermittently connected mobile networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[11]  James A. Davis,et al.  Wearable computers as packet transport mechanisms in highly-partitioned ad-hoc networks , 2001, Proceedings Fifth International Symposium on Wearable Computers.

[12]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[13]  Jörg Widmer,et al.  Network coding for efficient communication in extreme networks , 2005, WDTN '05.

[14]  Alex Pentland,et al.  DakNet: rethinking connectivity in developing nations , 2004, Computer.

[15]  Zygmunt J. Haas,et al.  The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way) , 2003, MobiHoc '03.

[16]  Qian Zhang,et al.  Shortest path routing in partially connected ad hoc networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[17]  Magdalena Balazinska,et al.  Characterizing mobility and network usage in a corporate wireless local-area network , 2003, MobiSys '03.

[18]  Li Li,et al.  Practical Routing in Delay-Tolerant Networks , 2007, IEEE Trans. Mob. Comput..

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

[20]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

[21]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.

[22]  Vinton G. Cerf,et al.  Delay-Tolerant Networking Architecture , 2007, RFC.

[23]  Athanasios V. Vasilakos,et al.  Routing for disruption tolerant networks: taxonomy and design , 2010, Wirel. Networks.

[24]  Zygmunt J. Haas,et al.  Resource and performance tradeoffs in delay-tolerant wireless networks , 2005, WDTN '05.

[25]  Martin Vetterli,et al.  Locating nodes with EASE: last encounter routing in ad hoc networks through mobility diffusion , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[26]  Xin Wang Mobile Ad-Hoc Networks: Protocol Design , 2011 .

[27]  Kevin C. Almeroth,et al.  Delay Tolerant Mobile Networks (DTMNs): Controlled Flooding in Sparse Mobile Networks , 2005, NETWORKING.

[28]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[29]  Srinivasan Keshav,et al.  An Architecture for Tetherless Communication , 2005, Disruption Tolerant Networking.

[30]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[31]  Bhaskar Krishnamachari,et al.  An evaluation of availability latency in carrier-based wehicular ad-hoc networks , 2006, MobiDE '06.

[32]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

[33]  Qun Li,et al.  Sending messages to mobile users in disconnected ad-hoc wireless networks , 2000, MobiCom '00.

[34]  Cecilia Mascolo,et al.  Adaptive routing for intermittently connected mobile ad hoc networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[35]  Chen-Nee Chuah,et al.  Knowledge-based opportunistic forwarding in vehicular wireless ad hoc networks , 2005, 2005 IEEE 61st Vehicular Technology Conference.

[36]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[37]  Timur Friedman,et al.  DTN routing in a mobility pattern space , 2005, WDTN '05.

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

[39]  Ellen W. Zegura,et al.  Message ferry route design for sparse ad hoc networks with mobile nodes , 2006, MobiHoc '06.

[40]  Cauligi S. Raghavendra,et al.  Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[41]  Bhaskar Krishnamachari,et al.  Static Replication Strategies for Content Availability in Vehicular Ad-hoc Networks , 2009, Mob. Networks Appl..

[42]  Robin Kravets,et al.  Encounter-Based Routing in DTNs , 2009, INFOCOM.

[43]  Tristan Henderson,et al.  The changing usage of a mature campus-wide wireless network , 2008, Comput. Networks.

[44]  Stephen Farrell,et al.  Delay- and Disruption-Tolerant Networking , 2006, IEEE Internet Computing.

[45]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[46]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[47]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[48]  Mostafa H. Ammar,et al.  Message ferrying: proactive routing in highly-partitioned wireless ad hoc networks , 2003, The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems, 2003. FTDCS 2003. Proceedings..

[49]  Aniket Kate,et al.  Anonymity and security in delay tolerant networks , 2007, 2007 Third International Conference on Security and Privacy in Communications Networks and the Workshops - SecureComm 2007.