Skip to main content
SpringerLink
Log in

Threshold based locking routing strategy for delay tolerant network

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Delay tolerance network probabilistic routing protocols forward message to a node by observing its predictability value to meet the message destination. However, it is vital to predict the ability of node to carry the transmitted message. For instance, the traffic confluence on the high probable nodes can produce congestion that results in the drop of previously stored messages. These drops diminish the delivery ratio because the dropped message lost its opportunity to be delivered. Since, there exist multiple copies of each message; therefore, the same node invariably receives the dropped messages from other parts of the network and causes the highest number of transmissions. Additionally, the replication from source node continues on the high probable peers even the previous copies were transmitted on the better predictable neighbors than the current. In this paper, we have proposed a novel routing method called as the adaptive threshold based locking method that maintains the contemporary status of the node based on its activity in the network. We have used the adaptive status measuring metrics such as transmit factor, drop factor and hop away count. Moreover, a threshold based locking method has been introduced to control the diffusion of messages. We have performed the comparison of existing and proposed routing methods with real time mobility traces. The proposed strategy has bolstered the delivery ratio and minimizes hop count, end-to-end delay and number of transmission.

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
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19

Similar content being viewed by others

References

  1. Chakeres, I. D., & Belding-Royer, E. M. (2004). AODV routing protocol implementation design. In Proceedings of the 24th international conference on, distributed computing systems workshops, 2004 (pp. 698–703), IEEE.

  2. Fall, K. (2003). 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.

  3. Jain, S. F., & Patra, R. K. (2004). Routing in a delay tolerant network. In (Vol. 34, Vol. 4), ACM.

  4. Shen, J., Moh, S., & Chung, I. (2008). Routing protocols in delay tolerant networks: A comparative survey. In Proceeding of 23rd international technical conference on circuits/systems, computer and communications (ITC-CSCC 2008), (pp. 1577–1580).

  5. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2004). Single-copy routing in intermittently connected mobile networks. In Proceeding of IEEE conference sensor and ad hoc communications and networks (SECON), (pp. 235–244), IEEE.

  6. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In proceeding of mobile computer and communication review 2005 (Vol. 7, pp. 252–259), ACM.

  7. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2007). Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility. In PerCom Workshops’ 07. Fifth annual IEEE international conference on, pervasive computing and communications workshops, 2007. (pp. 79–85), IEEE.

  8. Spyropoulos, T., Turletti, T., & Obraczka, K. (2009). Routing in delay-tolerant networks comprising heterogeneous node populations. IEEE Transactions on Mobile Computing, 8(8), 1132–1147.

    Article  Google Scholar 

  9. Srinivasa, S., & Krishnamurthy, S. (2009). CREST: An opportunistic forwarding protocol based on conditional residual time. In SEC ON, (pp. 1–9), IEEE.

  10. Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University.

  11. Balasubramanian, A., Levine, B., & Venkataramani, A. (2007). DTN routing as a resource allocation problem. ACM SIGCOMM Computer Communication Review, 37(4), 373–384.

    Article  Google Scholar 

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

    Google Scholar 

  13. Nelson, S. C., Bakht, M., & Kravets, R. (2009). Encounter-based routing in DTNs. In INFOCOM 2009, (pp. 846–854), IEEE.

  14. Leguay, J., Friedman, T., & Conan, V. (2005). DTN routing in a mobility pattern space. In Proceedings of the 2005 ACM SIGCOMM workshop on delay-tolerant networking, (pp. 276–283), ACM.

  15. Elwhishi, A., Ho, P.-H., Naik, S., & Shihada, B. (2011). Contention aware routing for intermittently connected mobile networks. In AFIN 2011, the third international conference on advances in future internet, (pp. 8–15).

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

  17. Musolesi, M., & Mascolo, C. (2006). A community based mobility model for ad hoc network research. In Proceedings of the 2nd international workshop on multi-hop ad hoc networks: From theory to reality, (pp. 31–38), ACM.

  18. Ramanathan, R., Hansen, R., Basu, P., Rosales-Hain, R., & Krishnan, R. (2007). Prioritized epidemic routing for opportunistic networks. In Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking, (pp. 62–66), ACM.

  19. Lu, X., & Hui, P. (2010). An energy-efficient n-epidemic routing protocol for delay tolerant networks. In 2010 IEEE fifth international conference on, networking, architecture and storage (NAS), (pp. 341–347), IEEE.

  20. Qaisar, A., & RMSMZ, S. (2011). TMHF: Transmit Max Hop First forwarding strategy to optimize the performance of epidemic routing protocol. International Journal of Computer Applications, 18(5), 40–45.

    Google Scholar 

  21. Ayub, Q., Rashid, S., & Zahid, M. S. M. (2010). Optimization of epidemic router by new forwarding queue mode TSMF. International Journal of Computer Applications, 7(11), 5–8.

    Article  Google Scholar 

  22. Ayub, Q., Rashid, S., & Zahid, M. S. M. (2011). MinHop (MH) transmission strategy to optimized performance of epidemic routing protocol. Global Journal of Computer Science and Technology, 11(9), 35–41.

    Google Scholar 

  23. Wang, G., Wang, B., & Gao, Y. (2010). Dynamic spray and wait routing algorithm with quality of node in delay tolerant network. In 2010 international conference on, communications and mobile computing (CMC), (Vol. 3, pp. 452–456), IEEE.

  24. Erramilli, V., Crovella, M., Chaintreau, A., & Diot, C. (2008). Delegation forwarding. In Proceedings of the 9th ACM international symposium on mobile ad hoc networking and computing, (pp. 251–260), ACM.

  25. Kernen, A., & Ott, J. (2007). Increasing reality for dtn protocol simulations. Helsinki University of Technology, Technical Report, July.

  26. Kernen, A., Ott, J., & Krkkinen, T. (2009). The ONE simulator for DTN protocol evaluation. In Proceedings of the 2nd international conference on simulation tools and techniques, (pp. 55), ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).

  27. Bigwood, G., Rehunathan, D., Bateman, M., Henderson, T., & Bhatti, S. (2011). CRAWDAD data set st andrews/sassy (v. 2011-06-03).

  28. Burgess, J., Gallagher, B., Jensen, D., & Levine, B. N. (2006). Maxprop: Routing for vehicle-based disruption-tolerant networks. In Proceedings of IEEE infocom, 2006, Barcelona, Spain, Vol. 6, pp. 1–11.

  29. Spyropoulos, T., Rais, R. N., Turletti, T., Obraczka, K., & Vasilakos, A. (2010). Routing for disruption tolerant networks: taxonomy and design. Wireless networks, 16(8), 2349–2370.

    Article  Google Scholar 

  30. Zeng, Y., et al. (2013). Directional routing and scheduling for green vehicular delay tolerant networks. Wireless Networks, 19(2), 161–173.

    Article  Google Scholar 

  31. Dvir, A., et al. (2010). Backpressure-based routing protocol for DTNs SIGCOMM, pp. 405–406.

  32. Alresaini, M., et al. (2012) . Backpressure with adaptive redundancy (BWAR). INFOCOM, 2300–2308.

Download references

Author information

Authors and Affiliations

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

    Qaisar Ayub, M. Soperi Mohd Zahid, Sulma Rashid & A. Hanan Abdullah

Authors
  1. Qaisar Ayub
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Soperi Mohd Zahid
    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. A. Hanan Abdullah
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sulma Rashid.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ayub, Q., Zahid, M.S.M., Rashid, S. et al. Threshold based locking routing strategy for delay tolerant network. Wireless Netw 19, 2067–2078 (2013). https://doi.org/10.1007/s11276-013-0589-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-013-0589-6

Keywords

Search

Navigation