A DTN Study: Analysis of Implementations and Tools

Delay and Disruption Tolerant Networking offers a new dimension for communications environments which are not conducive to the use of traditional TCP/IP networks. The area of DTN's, though immature in terms of practical usage and deployment, provides great opportunities for research and analysis. There is lot of work being done to develop frameworks, protocols and algorithms in this area. There are many implementations for DTN protocols which oer different alternatives and approaches. Each have their own advantages and disadvantages. There are two major goals of this work. First is to evaluate two implementations for DTN protocols with regards to their performance, namely BUNDLE and SaFT. The idea is to first analyse the protocols individually and then go for a comparative analysis if time permits. Such an analysis also depends upon the inherent characteristics of the available protocols which might not be feasible for a comparison. Second is to analyse two different tools which can be used for simulations in DTN environments. The tool selection is an important factor with regards to any research work. A wrong choice here might cause delays which are fatal in the end. A good choice however can speed up things and avoid unnecessary delays. Two possible candidates have been evaluated in this regard. These are Network Simulator tool (NS) and the Opportunistic Network Environment simulator( ONE). NS is the most popular open source tool for computer networks related simulation work. But since it is a general tool for almost all such simulations, it lacks certain customized features for specific purposes. The ONE simulator, on the other hand, is a tool which has been custom built for Delay Tolerant Networks. An analysis of both will provide a sound basis for their usage in scenarios related to Delay tolerant Networks.

[1]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[2]  Xabiel G. Pañeda,et al.  Limitations of network emulation with single-machine and distributed ns-3 , 2010, SimuTools.

[3]  Robin Kravets,et al.  Event-driven, role-based mobility in disaster recovery networks , 2007, CHANTS '07.

[4]  Bernhard Plattner,et al.  SaFT: Reliable Transport in Mobile Networks , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[5]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[6]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SimuTools.

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

[8]  Pan Hui,et al.  Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  Daniel Mahrenholz,et al.  Real-Time Network Emulation with ns-2 , 2004, Eighth IEEE International Symposium on Distributed Simulation and Real-Time Applications.

[10]  Henrik Eriksson,et al.  Implementation and analysis of the bundling protocol for delay-tolerant network architectures , 2005 .

[11]  Jörg Ott,et al.  Working day movement model , 2008, MobilityModels '08.

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

[13]  Anders Lindgren,et al.  Probabilistic Routing Protocol for Intermittently Connected Networks , 2012, RFC.

[14]  Daniel Mahrenholz,et al.  Adjusting the ns-2 Emulation Mode to a Live Network , 2005, KiVS.

[15]  Jörg Ott,et al.  Time scales and delay-tolerant routing protocols , 2008, CHANTS '08.

[16]  Ahmed Helmy,et al.  A survey of mobility modeling and analysis in wireless adhoc networks , 2004 .

[17]  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).

[18]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[19]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[20]  Thomas Plagemann,et al.  Ns-2 Distributed Clients Emulation: Accuracy and Scalability , 2009, SimuTools.

[21]  Mani B. Srivastava,et al.  Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks , 2005, DCOSS.

[22]  Jörg Ott,et al.  Integrating DTN and MANET routing , 2006, CHANTS '06.

[23]  Tarek F. Abdelzaher,et al.  A Caching-Based Approach to Routing in Delay-Tolerant Networks , 2007, 2007 16th International Conference on Computer Communications and Networks.

[24]  Thrasyvoulos Spyropoulos,et al.  On Leveraging Partial Paths in Partially-Connected Networks , 2009, IEEE INFOCOM 2009.

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

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

[27]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

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

[29]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

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