Skip to main content
SpringerLink
Log in

Probabilistic and Replication Based Locking Routing Protocol for Delay Tolerant Network

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. 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).

  2. 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.

    Article  Google Scholar 

  3. 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.

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

  5. 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.

  6. 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

  7. 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.

  8. Vahdat, A., & Becker, D. (2000). Epidemic Routing for Partially Connected Ad hoc Networks. Technical Report CS-200006, Duke University, Durham.

  9. 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.

  10. 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.

  11. 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.

    Article  Google Scholar 

  12. 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.

    Article  Google Scholar 

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

    Article  Google Scholar 

  14. 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.

  15. 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.

    Article  Google Scholar 

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

  17. 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.

    Article  Google Scholar 

  18. Musolesi, M., & Mascolo, C. (2009). Car: Context-aware adaptive routing for delay-tolerant mobile networks. IEEE Transactions on Mobile Computing, 8(2), 246–260.

    Article  Google Scholar 

  19. 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.

  20. 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.

    Article  Google Scholar 

  21. Soares, V. N., Rodrigues, J. J., & Farahmand, F. (2014). GeoSpray: A geographic routing protocol for vehicular delay-tolerant networks. Information Fusion, 15, 102–113.

  22. 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.

  23. 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.

  24. Zhang, J., & Luo, G. (2012). Adaptive spraying for routing in delay tolerant networks. Wireless Personal Communications, 66(1), 217–233.

    Article  MathSciNet  Google Scholar 

  25. 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.

    Article  Google Scholar 

  26. 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.

  27. 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.

  28. Burgess, J., Gallagher, B., Jensen, D. D., & Levine, B. N. (2006, April). MaxProp: Routing for vehicle-based disruption-tolerant networks. In Infocom.

  29. 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.

  30. 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.

  31. 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.

  32. 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.

    Article  Google Scholar 

  33. 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.

  34. 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.

Download references

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

  1. Department of Computer Science, University of Engineering & Technology, Taxila, Pakistan

    Qaisar Ayub

  2. Department of Computer System and Communication, Faculty of Computing, Universiti Teknologi Malaysia (UTM), 81310, Skudai, Johor, Malaysia

    Md. Asri Ngadi, Johan Mohamad Sharif & Mohd Soperi Mohd Zahid

  3. Department of Computer Science, COMSATS Institute of Information Technology, Wah Cantt, Pakistan

    Sulma Rashid

  4. Department of Computer System Technology, Faculty of Computer Science and Information Technology, University of Malaya, 50603, Kuala Lumpur, Malaysia

    Ismail Ahmedy

Authors
  1. Qaisar Ayub
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Md. Asri Ngadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sulma Rashid
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ismail Ahmedy
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Johan Mohamad Sharif
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Mohd Soperi Mohd Zahid
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qaisar Ayub.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-017-4673-6

Keywords

Search

Navigation