Integrating Buffer Management with Epidemic Routing in Delay Tolerant Networks

Problem statement: The Design of Delay Tolerant Network (DTN) routing protocols has focused to operate in an environment where there is no guarantee of end to end path between source and destination at all points of time. The DTN research has focussed primarily on applications that are delay tolerant. But it can also be used to provide real time information like accident alert in VANETs and emergency alert in earth-quake monitoring applications. Such environment stimulates the need to introduce priority to messages and deliver them at the earliest according to the priority. Approach: In this study, an effective buffer management is proposed and integrated to epidemic routing to support delivery of real-time information at the earliest. In the proposed approach, an indexer, scheduler and dropper is used to perform the buffer management. Results and Conclusion: The performance of epidemic routing after integration is evaluated and compared with other policies in terms of metrics such as delivery ratio and delivery latency. The simulation results show that the approach presented performs well with an advantage of delivering real-time information at the earliest.

[1]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[2]  Prithwish Basu,et al.  Networked parking spaces: architecture and applications , 2002, Proceedings IEEE 56th Vehicular Technology Conference.

[3]  Geetha Jayakumar,et al.  Ad Hoc Mobile Wireless Networks Routing Protocols - A Review , 2007 .

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

[5]  Paul A. S. Ward,et al.  Practical Routing in Delay-Tolerant Networks , 2005, IEEE Transactions on Mobile Computing.

[6]  Thrasyvoulos Spyropoulos,et al.  An optimal joint scheduling and drop policy for Delay Tolerant Networks , 2008, 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks.

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

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

[9]  Vinny Cahill,et al.  When TCP Breaks: Delay- and Disruption- Tolerant Networking , 2006, IEEE Internet Computing.

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

[11]  Scott Shenker,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[12]  Nitin H. Vaidya,et al.  Location‐Aided Routing (LAR) in mobile ad hoc networks , 2000, Wirel. Networks.

[13]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.

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

[15]  Ari Keränen Opportunistic Network Environment simulator , 2008 .

[16]  R. S. D. Wahida Banu,et al.  Comparison of DTN Routing Protocols and Their Buffer Utilization using ONE Simulator , 2010, ICWN.

[17]  Mads Haahr,et al.  The challenges of disconnected delay-tolerant MANETs , 2010, Ad Hoc Networks.

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

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

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

[21]  Richard E. Hansen,et al.  Prioritized epidemic routing for opportunistic networks , 2007, MobiOpp '07.

[22]  Thrasyvoulos Spyropoulos,et al.  Optimal Buffer Management Policies for Delay Tolerant Networks , 2008, 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[23]  Zhensheng Zhang,et al.  Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges , 2006, IEEE Communications Surveys & Tutorials.

[24]  Sung-Ju Lee,et al.  Wireless Ad Hoc Multicast Routing with Mobility Prediction , 2001, Mob. Networks Appl..

[25]  Paolo Giaccone,et al.  Optimal routing and scheduling for deterministic delay tolerant networks , 2009, 2009 Sixth International Conference on Wireless On-Demand Network Systems and Services.

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

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

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

[29]  Essam Natsheh,et al.  Density Based Routing Algorithm for Spare/Dense Topologies in Wireless Mobile Ad-Hoc Networks , 2010 .

[30]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

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

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

[33]  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.

[34]  Anders Lindgren,et al.  Evaluation of Queueing Policies and Forwarding Strategies for Routing in Intermittently Connected Networks , 2006, 2006 1st International Conference on Communication Systems Software & Middleware.

[35]  R.S.D. Wahidabanu,et al.  A New Queuing Policy for Delay Tolerant Networks , 2010 .

[36]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.