Integrated Sized-Based Buffer Management Policy for Resource-Constrained Delay Tolerant Network

Delay tolerant network is a type of network where the end-to-end path is not available from source to destination due to the node mobility, dynamic topology and network partitioning or such a path is highly unstable and may split almost immediately after it has been explored. In this background, existing ad hoc routing protocols would be unsuccessful. Therefore, the concept of store-carry-forward mechanism is utilized by introducing a new layer on the top of transport layer called as bundle layer. The bundle layer store message(s) in a finite size buffer for the long duration of time. As a result, node buffer runs out of space and drop messages to overcome congestion. In this paper, we aim to schedule the node buffer by using local knowledge-based buffer management policies called as best message-size selections buffer management policy. We have utilized the local information available in message header such as message-size to control the drop of messages. The evaluation of proposed policy with the existing DOA, DLA, LIFO, MOFO, N-drop and SHLI have been analyzed in ONE simulator in terms of reducing message drop, overhead, latency and raising the delivery ratio.

[1]  Mohamed El-Kamili,et al.  An effective buffer management in delay tolerant networks based on a partially observed Markov decision process framework , 2016, Int. J. Commun. Networks Distributed Syst..

[2]  Hui-mei Lu,et al.  Buffer scheduling policy in DTN routing protocols , 2010, 2010 2nd International Conference on Future Computer and Communication.

[3]  Stephen Farrell,et al.  DTN: an architectural retrospective , 2008, IEEE Journal on Selected Areas in Communications.

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

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

[6]  M. Soperi Mohd Zahid,et al.  E-DROP: An Effective Drop Buffer Management Policy for DTN Routing Protocols , 2011 .

[7]  Kalman Graffi,et al.  Analysis of Buffer Management Policies for Opportunistic Networks , 2016, 2016 25th International Conference on Computer Communication and Networks (ICCCN).

[8]  Hiroshi Esaki,et al.  Message Deletion and Mobility Patterns for Efficient Message Delivery in DTNs , 2010, 2010 8th IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops).

[9]  Zygmunt J. Haas,et al.  A new networking model for biological applications of ad hoc sensor networks , 2006, TNET.

[10]  Donald F. Towsley,et al.  Performance modeling of epidemic routing , 2006, Comput. Networks.

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

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

[13]  Robin Kravets,et al.  Encounter: based routing in DTNs , 2009, MOCO.

[14]  Yun Li,et al.  N-Drop: congestion control strategy under epidemic routing in DTN , 2009, IWCMC.

[15]  Robert G. Sargent,et al.  Verification and validation of simulation models , 2013, Proceedings of Winter Simulation Conference.

[16]  Lieguang Zeng,et al.  Adaptive Optimal Buffer Management Policies for Realistic DTN , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

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

[18]  Honggang Zhang,et al.  Impact of source counter on DTN routing control under resource constraints , 2010, MobiOpp '10.

[19]  Abdul Hanan Abdullah,et al.  Dynamic Prediction based Multi Queue (DPMQ) drop policy for probabilistic routing protocols of delay tolerant network , 2013, J. Netw. Comput. Appl..

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

[21]  Chai Kiat Yeo,et al.  A Queuing Mechanism to Alleviate Flooding Attacks in Probabilistic Delay Tolerant Networks , 2010, 2010 Sixth Advanced International Conference on Telecommunications.

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

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

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

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

[26]  Hiroshi Esaki,et al.  Heuristic Congestion Control for Message Deletion in Delay Tolerant Network , 2010, NEW2AN.

[27]  Abdul Hanan Abdullah,et al.  Message Drop Control Buffer Management Policy for DTN Routing Protocols , 2013, Wireless Personal Communications.

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

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