An Improved PRoPHET Routing Protocol in Delay Tolerant Network

In delay tolerant network (DTN), an end-to-end path is not guaranteed and packets are delivered from a source node to a destination node via store-carry-forward based routing. In DTN, a source node or an intermediate node stores packets in buffer and carries them while it moves around. These packets are forwarded to other nodes based on predefined criteria and finally are delivered to a destination node via multiple hops. In this paper, we improve the dissemination speed of PRoPHET (probability routing protocol using history of encounters and transitivity) protocol by employing epidemic protocol for disseminating message m, if forwarding counter and hop counter values are smaller than or equal to the threshold values. The performance of the proposed protocol was analyzed from the aspect of delivery probability, average delay, and overhead ratio. Numerical results show that the proposed protocol can improve the delivery probability, average delay, and overhead ratio of PRoPHET protocol by appropriately selecting the threshold forwarding counter and threshold hop counter values.

[1]  Kwan-Wu Chin,et al.  A Unified Study of Epidemic Routing Protocols and their Enhancements , 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum.

[2]  Keecheon Kim,et al.  Distance-based PRoPHET routing protocol in Disruption Tolerant Network , 2013, 2013 International Conference on ICT Convergence (ICTC).

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

[4]  Keecheon Kim,et al.  PRoPHET Routing Protocol Based on Neighbor Node Distance Using a Community Mobility Model in Delay Tolerant Networks , 2013, 2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing.

[5]  Joan Triay,et al.  From Delay-Tolerant Networks to Vehicular Delay-Tolerant Networks , 2012, IEEE Communications Surveys & Tutorials.

[6]  Jon Crowcroft,et al.  Evaluating opportunistic networks in disaster scenarios , 2013, J. Netw. Comput. Appl..

[7]  Chadi Assi,et al.  Disruption-Tolerant Networking: A Comprehensive Survey on Recent Developments and Persisting Challenges , 2012, IEEE Communications Surveys & Tutorials.

[8]  Zhili Sun,et al.  Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges , 2013, IEEE Communications Surveys & Tutorials.

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

[10]  Ling-Jyh Chen,et al.  PRoPHET+: An Adaptive PRoPHET-Based Routing Protocol for Opportunistic Network , 2010, 2010 24th IEEE International Conference on Advanced Information Networking and Applications.

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

[12]  Chai Kiat Yeo,et al.  Probabilistic Routing Based on History of Messages in Delay Tolerant Networks , 2011, 2011 IEEE Vehicular Technology Conference (VTC Fall).

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

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

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

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

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

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

[19]  Pan Hui,et al.  An Energy-Efficient n-Epidemic Routing Protocol for Delay Tolerant Networks , 2010, 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage.

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

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