Abstract
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.
Similar content being viewed by others
References
Johnson, D. B., Maltz, D. A., & Broch, J. (2001). DSR: The dynamic source routing protocol for multi-hop wireless ad hoc networks. In Ad hoc networking (chap. 5, pp. 139–172).
Royer, E. M., & Toh, C. K. (1999). A review of current routing protocols for ad hoc mobile wireless networks. IEEE Personal Communications, 6(2), 46–55.
Fall, K. (2003, August). A delay-tolerant network architecture for challenged internets. In Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (pp. 27–34). ACM.
Burleigh, S., Hooke, A., Torgerson, L., Fall, K., Cerf, V., Durst, B., et al. (2003). Delay-tolerant networking: An approach to interplanetary internet. IEEE Communications Magazine, 41(6), 128–136.
Jain, S., Fall, K., & Patra, R. (2004). Routing in a Delay Tolerant Network. In Proceedings of the 2004 conference on applications, technologies, architectures, and protocols for computer communications. SIGCOMM 04 (pp. 145–158). New York, NY, USA: ACM.
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2004). Single-copy routing in intermittently connected mobile networks. In Proceedings of IEEE conference sensor and ad hoc communications and networks (SECON) (pp. 235–244). IEEE
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2007). Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility. In Fifth annual IEEE international conference on pervasive computing and communications workshops, 2007. PerCom Workshops’07 (pp. 79–85). IEEE.
Vahdat, A., & Becker, D. (2000). Epidemic Routing for Partially Connected Ad hoc Networks. Technical Report CS-200006, Duke University, Durham.
Balasubramanian, A., Levine, B., & Venkataramani, A. (2007). DTN routing as a resource allocation problem. In ACM SIGCOMM computer communication review (Vol. 37, pp. 373–384). ACM.
Liu, C., & Wu, J. (2012). On multicopy opportunistic forwarding protocols in nondeterministic delay tolerant networks. IEEE Transactions on Parallel and Distributed Systems, 23(6), 1121–1128.
Lo, S. C., Luo, N. W., Gao, J. S., & Tseng, C. C. (2014). Quota-based multicast routing in delay-tolerant networks. Wireless Personal Communications, 74(4), 1329–1344.
Zhang, L., & Zhou, X. (2013). Hop-by-hop dynamic congestion control with contact interruption probability for intermittently connected deep space information networks. Wireless Personal Communications, 71(1), 399–424.
Bindra, H. S., & Sangal, A. L. (2013). Extension of delay tolerant networks routing protocols for preventing excessive utilization of resources. Wireless Personal Communications, 73(3), 535–553.
Lindgren, A., Doria, A., & Schelén, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7(3), 19–20.
Zhu, Y., Xu, B., Shi, X., & Wang, Y. (2013). A survey of social-based routing in delay tolerant networks: Positive and negative social effects. IEEE Communications Surveys and Tutorials., 15(1), 387–401.
Bulut, E., Geyik, S. C., & Szymanski, B. K. (2010). Conditional shortest path routing in delay tolerant networks. In World of Wireless Mobile and Multimedia Networks (WoWMoM), 2010 IEEE international symposium on a. IEEE.
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008). Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Transactions on Networking, 16(1), 77–90.
Musolesi, M., & Mascolo, C. (2009). Car: Context-aware adaptive routing for delay-tolerant mobile networks. IEEE Transactions on Mobile Computing, 8(2), 246–260.
Jathar, R., & Gupta, A. (2010). Probabilistic routing using contact sequencing in delay tolerant networks. In 2010 Second International Conference on Communication systems and networks (COMSNETS) (pp. 1–10). IEEE.
Shah, R. C., Roy, S., Jain, S., & Brunette, W. (2003). Data mules: Modeling and analysis of a three-tier architecture for sparse sensor networks. Ad Hoc Networks, 1(2), 215–233.
Soares, V. N., Rodrigues, J. J., & Farahmand, F. (2014). GeoSpray: A geographic routing protocol for vehicular delay-tolerant networks. Information Fusion, 15, 102–113.
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proceeding of mobile computer and communication review (Vol. 7, pp. 252–259). ACM.
Wang, G., Wang, B., & Gao, Y. (2010, April). Dynamic spray and wait routing algorithm with quality of node in delay tolerant network. In Communications and Mobile Computing (CMC), 2010 international conference on (Vol. 3, pp. 452–456). IEEE.
Zhang, J., & Luo, G. (2012). Adaptive spraying for routing in delay tolerant networks. Wireless Personal Communications, 66(1), 217–233.
Prodhan, A. T., Das, R., Kabir, H., & Shoja, G. C. (2011). TTL based routing in opportunistic networks. Journal of Network and Computer Applications, 34(5), 1660–1670.
Hui, P., Crowcroft, J., & Yoneki, E. (2011). Bubble rap: Social-based forwarding in delay-tolerant networks. IEEE Transactions on Mobile Computing, 10(11), 1576–1589.
Lindgren, A., Doria, A., & Schelén, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7(3), 19–20.
Burgess, J., Gallagher, B., Jensen, D. D., & Levine, B. N. (2006, April). MaxProp: Routing for vehicle-based disruption-tolerant networks. In Infocom.
De Oliveira, E. C., & De Albuquerque, C. V. (2009, March). NECTAR: A DTN routing protocol based on neighborhood contact history. In Proceedings of the 2009 ACM symposium on Applied Computing (pp. 40–46). ACM.
Abdelkader, T., Naik, K., Nayak, A., Goel, N., & Srivastava, V. (2013). SGBR: A routing protocol for delay tolerant networks using social grouping. IEEE Transactions on Parallel and Distributed Systems, 24(12), 2472–2481.
Ayub, Q., Rashid, S., Zahid, M. S. M., & Abdullah, A. H. (2014). Contact quality based forwarding strategy for delay tolerant network. Journal of Network and Computer Applications, 39, 302–309.
Ayub, Q., Zahid, M. S. M., Sulma, R., & Abdullah, A. H. (2013). Threshold based locking routing strategy for delay tolerant network. Wireless Networks, 19(8), 2067–2078.
Scott, J., Gass, R., Crowcroft, J., Hui, P., Diot, C. & Chaintreau, A. (2006). CRAWDAD data set cambridge haggle (v. 2006-01-31). CRAWDAD Wireless Network Data Archive.
Bigwood, G., & Henderson, T. (2011, June). Bootstrapping opportunistic networks using social roles. In World of Wireless, Mobile and Multimedia Networks (WoWMoM), 2011 IEEE International Symposium on a (pp. 1–6). IEEE.
Acknowledgements
This work is supported by Post-doc Research University Grant from Universiti Teknologi Malaysia (Q.J130000.21A2.02E63), Fundamental Research Grant Scheme (FRGS) form Ministry of Higher Education of Malaysia (R.J130000.7828.4F568) and Research Grant BKP from University of Malaya (BK043-2015).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ayub, Q., Ngadi, M.A., Rashid, S. et al. Probabilistic and Replication Based Locking Routing Protocol for Delay Tolerant Network. Wireless Pers Commun 97, 3239–3259 (2017). https://doi.org/10.1007/s11277-017-4673-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-017-4673-6