Scheduling and dropping policies for probabilistic routing in Delay Tolerant Networks

The Delay Tolerant Network employs a store-carry-forward paradigm to enable bundle delivery in intermittent connected environments. A router relays a message only when a proper contact opportunity occurs, which results in prominent congestion issues. An appropriate scheduling and dropping policy can alleviate this situation and maximize contact capacity. We investigate the impact of delivery probability and number of message replicas over the efficiency of scheduling and dropping policies in probabilistic routing, and present a new way to utilize contact probability and delivery predictability to direct the design of scheduling policies. We also design a simple and distributed method to approximate the global number of replicas. We integrate these results and present a new scheduling and dropping policy. Simulation based on map based movement has shown that the new policy gains a delivery rate very close to global knowledge based policies, and it outperforms all other existing scheduling and dropping policies.

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

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

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

[4]  Vinton G. Cerf,et al.  Delay-tolerant networking: an approach to interplanetary Internet , 2003, IEEE Commun. Mag..

[5]  Célio Vinicius N. de Albuquerque,et al.  NECTAR: a DTN routing protocol based on neighborhood contact history , 2009, SAC '09.

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

[7]  Joel J. P. C. Rodrigues,et al.  Scheduling and drop policies for traffic differentiation on Vehicular Delay-Tolerant Networks , 2009, SoftCOM 2009 - 17th International Conference on Software, Telecommunications & Computer Networks.

[8]  Joel J. P. C. Rodrigues,et al.  Performance analysis of scheduling and dropping policies in vehicular delay-tolerant networks , 2010 .

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

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

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

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

[13]  Kevin R. Fall,et al.  Alternative custodians for congestion control in delay tolerant networks , 2006, CHANTS '06.

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