Scheduling and Dropping Policies in Delay Tolerant Network

Sometimes end to end connectivity may not exist between the nodes, sometimes it is too expensive to connect all the networks and sometimes due to some catastrophic effect, exchanging of messaging are difficult, so it can cause delays from hours to days, hence networking of this type of situation is called as Delay Tolerant Network. As no end to end connectivity between the nodes so it require buffer at each node to store incoming messages. The network uses a store-carry-forward mechanism, while sending a message from one node to another node. Messages which are stored at each node carry along with him until it reaches to the next node and then forward. Here two scheduling policies are named as PRIORITY+ algorithm and FACTOR algorithm. PRIORITY+ algorithm considers a priority of message with different routing algorithm. FACTOR algorithm considers the TTL value with priority of that particular message. Algorithms can achieve better delivery ratios with less overhead and latency ratio.

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

[2]  Eric Brewer,et al.  Implementing Delay Tolerant Networking , 2004 .

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

[4]  Padma Mundur,et al.  Delay tolerant network routing: Beyond epidemic routing , 2008, 2008 3rd International Symposium on Wireless Pervasive Computing.

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

[6]  Maria Udén,et al.  Providing connectivity to the Saami nomadic community , 2002 .

[7]  Andrea Vitaletti,et al.  Routing protocols for delay tolerant networks: a quantitative evaluation , 2012, PM2HW2N '12.

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

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

[10]  Joel J. P. C. Rodrigues,et al.  Improvement of Messages Delivery Time on Vehicular Delay-Tolerant Networks , 2009, 2009 International Conference on Parallel Processing Workshops.

[11]  Shou-Chih Lo,et al.  Routing and Buffering Strategies in Delay-Tolerant Networks: Survey and Evaluation , 2011, 2011 40th International Conference on Parallel Processing Workshops.

[12]  Thrasyvoulos Spyropoulos,et al.  Message Drop and Scheduling in DTNs: Theory and Practice , 2012, IEEE Transactions on Mobile Computing.

[13]  Joel J. P. C. Rodrigues,et al.  Impact of Scheduling and Dropping Policies on the Performance of Vehicular Delay-Tolerant Networks , 2011, 2011 IEEE International Conference on Communications (ICC).

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