An Efficient Routing Protocol Using the History of Delivery Predictability in Opportunistic Networks

In opportunistic networks such as delay tolerant network, a message is delivered to a final destination node using the opportunistic routing protocol since there is no guaranteed routing path from a sending node to a receiving node and most of the connections between nodes are temporary. In opportunistic routing, a message is delivered using a ‘store-carry-forward’ strategy, where a message is stored in the buffer of a node, a node carries the message while moving, and the message is forwarded to another node when a contact occurs. In this paper, we propose an efficient opportunistic routing protocol using the history of delivery predictability of mobile nodes. In the proposed routing protocol, if a node receives a message from another node, the value of the delivery predictability of the receiving node to the destination node for the message is managed, which is defined as the previous delivery predictability. Then, when two nodes contact, a message is forwarded only if the delivery predictability of the other node is higher than both the delivery predictability and previous delivery predictability of the sending node. Performance analysis results show that the proposed protocol performs best, in terms of delivery ratio, overhead ratio, and delivery latency for varying buffer size, message generation interval, and the number of nodes.

[1]  Jipeng Zhou,et al.  HESnW: History Encounters-Based Spray-and-Wait Routing Protocol for Delay Tolerant Networks , 2017, J. Inf. Process. Syst..

[2]  Yun Won Chung,et al.  An Improved Forwarding Strategy in Opportunistic Network , 2016 .

[3]  Hongcheng Huang,et al.  Probability routing algorithm based on historical throughput in DTN network , 2013, 2013 3rd International Conference on Consumer Electronics, Communications and Networks.

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

[5]  Min Jeong Kim.  An Improved Message Delivery Scheme Based on Node Density in Delay Tolerant Network , 2014 .

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

[7]  Meenu Chawla,et al.  Survey of buffer management policies for delay tolerant networks , 2014 .

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

[9]  Shigeng Zhang,et al.  A Buffer Management Scheme Based on Message Transmission Status in Delay Tolerant Networks , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

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

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

[12]  Donald F. Towsley,et al.  Performance Modeling of Epidemic Routing , 2006, Networking.

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

[14]  Chong-kwon Kim,et al.  Social-community based DTN Routing , 2011 .

[15]  M. Bellafkih,et al.  AntProPHET: A new routing protocol for delay tolerant networks , 2014, Proceedings of 2014 Mediterranean Microwave Symposium (MMS2014).

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

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

[18]  Mohamed El-Kamili,et al.  Learning controlled forwarding strategy improving probabilistic routing in DTNs , 2014, 2014 IEEE Wireless Communications and Networking Conference (WCNC).

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

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

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

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

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

[24]  Ke Xu,et al.  A Survey of Social-Aware Routing Protocols in Delay Tolerant Networks: Applications, Taxonomy and Design-Related Issues , 2014, IEEE Communications Surveys & Tutorials.

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

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

[27]  D. J. Pete,et al.  An improved opportunistic routing protocol in ad-hoc network , 2017, 2017 International Conference on Energy, Communication, Data Analytics and Soft Computing (ICECDS).

[28]  Ying Zhu,et al.  A Survey of Social-Based Routing in Delay Tolerant Networks: Positive and Negative Social Effects , 2013, IEEE Communications Surveys & Tutorials.

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

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

[31]  Dong Yeong Seo,et al.  An Improved Opportunistic Routing Protocol Based on Context Information of Mobile Nodes , 2018 .