Probabilistic and Replication Based Locking Routing Protocol for Delay Tolerant Network

A DTN node under multi copy protocols forwards a message to all connected nodes and improves message delivery at higher consumption of network resources. The probabilistic protocols control resource expenditure by transmitting a message only to nodes having high probability value to encounter its destination. The probability value is increased in terms of number of encounters and reduced by time interval since nodes last saw each other. The probability value computation does not consider impact of speed and number of hops a node has moved away from message destination. Similarly, node with low probability value to deliver a message continue its replication on high probable nodes. This replication produce congestion and messages are dropped before reaching their destinations. In this paper, we have proposed a routing protocol known as Probabilistic and Replication Based Locking Routing protocol for Delay Tolerant Network (RBL). The RBL defines a replication based locking method in which message transmissions and drop have been reduced via novel concept of locking. Moreover, probability value of a node has been computed by dynamic parameters such as the number of hops a node is away from message destination, speed and time elapsed since nodes last saw each other. The RBL has been compared with state-of-art routing protocols under renowned real time mobility traces. The proposed RBL has reduced message transmissions, message drop, hop count, end-to-end delay and increases message delivery.

[1]  Joel J. P. C. Rodrigues,et al.  GeoSpray: A geographic routing protocol for vehicular delay-tolerant networks , 2014, Inf. Fusion.

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

[3]  Pan Hui,et al.  CRAWDAD dataset cambridge/haggle (v.2009-05-29) , 2009 .

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

[5]  Md. Humayun Kabir,et al.  TTL based routing in opportunistic networks , 2011, J. Netw. Comput. Appl..

[6]  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).

[7]  Guangchun Luo,et al.  Adaptive Spraying for Routing in Delay Tolerant Networks , 2012, Wirel. Pers. Commun..

[8]  Abdul Hanan Abdullah,et al.  Threshold based locking routing strategy for delay tolerant network , 2013, Wireless Networks.

[9]  Amrit Lal Sangal,et al.  Extension of Delay Tolerant Network’s Routing Protocols for Preventing Excessive Utilization of Resources , 2013, Wireless Personal Communications.

[10]  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).

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

[12]  David A. Maltz,et al.  DSR: the dynamic source routing protocol for multihop wireless ad hoc networks , 2001 .

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

[14]  Long Zhang,et al.  Hop-by-Hop Dynamic Congestion Control with Contact Interruption Probability for Intermittently Connected Deep Space Information Networks , 2013, Wirel. Pers. Commun..

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

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

[17]  Christophe Diot,et al.  CRAWDAD dataset cambridge/haggle (v.2006-01-31) , 2006 .

[18]  Cecilia Mascolo,et al.  CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks , 2009, IEEE Transactions on Mobile Computing.

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

[20]  Abdul Hanan Abdullah,et al.  Contact quality based forwarding strategy for delay tolerant network , 2014, J. Netw. Comput. Appl..

[21]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[22]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[23]  Shou-Chih Lo,et al.  Quota-Based Multicast Routing in Delay-Tolerant Networks , 2012, The 15th International Symposium on Wireless Personal Multimedia Communications.

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

[25]  Sagar Naik,et al.  SGBR: A Routing Protocol for Delay Tolerant Networks Using Social Grouping , 2013, IEEE Transactions on Parallel and Distributed Systems.

[26]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.

[27]  Jie Wu,et al.  On Multicopy Opportunistic Forwarding Protocols in Nondeterministic Delay Tolerant Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[28]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[29]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[30]  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).

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

[32]  Greg Bigwood,et al.  Bootstrapping opportunistic networks using social roles , 2011, 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

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

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