Threshold Based Best Custodian Routing Protocol for Delay Tolerant Network

Delay Tolerant Network (DTN) is a kind of network in which the source may not be able to establish the stable and uninterrupted path to destination due to network partitioning, dynamic topology change and frequent disconnections. In order to dealt disruption and disconnections a store, carry and forward paradigm is used in which node stores the incoming messages in its buffer, carries it while moving and forward when comes within the transmission range of other nodes. Message forwarding contributes and important role in increasing its delivery. For instance, probabilistic routing protocol forwards message to a node having high probability value to meet message destination. These protocols cannot handle a situation in which the node continually transmits messages even the probability difference is very small. In this paper, we have proposed a routing protocol known as Threshold Based best custodian Routing Protocol (TBbcRP) for delay tolerant network. We have proposed a threshold-based method to compute the quality value which is the ability of node to carry message. A self-learning mechanism has been used to remove the delivered messages from the network. Moreover, a buffer aware mechanism has been used that make sure availability of buffer space at receiver before message transmission. We have compared the performance of TBbcRP with Epidemic, PRoPHET and Delegated Forwarding. The proposed TBbcRP outperforms in terms of maximizing the delivery probability, reducing number of transmissions and message drop.

[1]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[2]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..

[3]  Jie Wu,et al.  Multicasting in Delay Tolerant Networks: Delegation Forwarding , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[4]  Abdul Hanan Abdullah,et al.  DF++ : an adaptive buffer-aware probabilistic delegation forwarding protocol for Delay Tolerant Network , 2013, Cluster Computing.

[5]  Boleslaw K. Szymanski,et al.  Conditional shortest path routing in delay tolerant networks , 2010, 2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM).

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

[7]  Liza Abdul Latiff,et al.  Routing protocols in wireless mobile ad hoc network - a review , 2003, 9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732).

[8]  Richard E. Hansen,et al.  Prioritized epidemic routing for opportunistic networks , 2007, MobiOpp '07.

[9]  Vijay Erramilli,et al.  Delegation forwarding , 2008, MobiHoc '08.

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

[11]  Wu Wei,et al.  Feedback Adaptive Routing Algorithm for DTN , 2009, 2009 WRI International Conference on Communications and Mobile Computing.

[12]  Sang Lyul Min,et al.  Performance evaluation of the Bluetooth-based public Internet access point , 2001, Proceedings 15th International Conference on Information Networking.

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

[14]  Sirikiat Lek Ariyavisitakul,et al.  Turbo space-time processing to improve wireless channel capacity , 2000, IEEE Trans. Commun..

[15]  Jie Wu,et al.  Probability Delegation Forwarding in Delay Tolerant Networks , 2009, 2009 Proceedings of 18th International Conference on Computer Communications and Networks.

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

[17]  Abdul Hanan Abdullah,et al.  Connection Frequency Buffer Aware Routing Protocol for Delay Tolerant Network , 2013 .

[18]  Jie Wu,et al.  An optimal probabilistic forwarding protocolin delay tolerant networks , 2009, MobiHoc '09.

[19]  Basem Shihada,et al.  Contention Aware Routing for Intermittently Connected Mobile Networks , 2011 .

[20]  Cauligi S. Raghavendra,et al.  Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[21]  Robin Kravets,et al.  Encounter-Based Routing in DTNs , 2009, INFOCOM.

[22]  Guizhu Wang,et al.  Dynamic Spray and Wait Routing Algorithm with Quality of Node in Delay Tolerant Network , 2010, 2010 International Conference on Communications and Mobile Computing.

[23]  Xuehui Du,et al.  A DTN Routing Protocol Based on Hierarchy Forwarding and Cluster Control , 2009, 2009 International Conference on Computational Intelligence and Security.

[24]  Cauligi S. Raghavendra,et al.  Single-copy routing in intermittently connected mobile networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[25]  Thierry Turletti,et al.  Utility-based Message Replication for Intermittently Connected Heterogeneous Networks , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[26]  Arobinda Gupta,et al.  Probabilistic routing using contact sequencing in delay tolerant networks , 2010, 2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010).

[27]  Sudha Krishnamurthy,et al.  CREST: An Opportunistic Forwarding Protocol Based on Conditional Residual Time , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

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

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