Skip to main content
SpringerLink
Log in

Community trend message locking routing protocol for delay tolerant network

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

Delay Tolerant Network (DTN) establishes the communication framework in environments where source and destination cannot establish the end-to-end path due to the limited transmission range, frequent disconnections, and network partitioning. The messages are delivered to their destinations by adopting a store, carry and forward paradigm in which the node stores the arriving message in its buffer, carries it while moving, and forwards on connecting to other nodes. The DTN multi-copy protocols diffuse the several message copies on all connected nodes and deplete the network resources such as buffer space, bandwidth, and energy. This resource consumption is controlled by incorporating a social community message forwarding technique. The node employs the global rank forwarding metric while moving outside the community and shifts to the local rank forwarding metric while moving within the community. This method produces congestion in scenarios where the node continues message replications on higher global and local rank peers. As a result, more messages are dropped, and message delivery is reduced. This paper presented the Message Locking Routing Protocol for Delay Tolerant Network (CTML). The CTML controls the message forwarding process by employing the Local Rank Lock (LRL) and Global Rank Lock (GRL). The Local Rank Lock (LRL) controls the message transmission during node mobility within the community whereas Global Rank Lock (GRL) refrains the message forwarding during node mobility outside the community. Thus, the small number of transmissions reduces congestion. Similarly, CTML control message drop by using Message Drop Lock (MDL) where a node cannot drop a message with higher global rank or local rank values. Finally, the delivery ratio has been increased by using Deliver to Destine Lock (DDL) lock where a node with higher threshold values to meet the destination is enforced to forward the message directly to its destination. The simulation results prove that the proposed CTML has performed better in terms of reducing message transmissions , message drop, hop-count average, overhead, and raising delivery ratio.

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

Similar content being viewed by others

References

  1. 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 2003 Aug 25 (pp. 27-34)

  2. Madni MAA, Iranmanesh S, Raad R (2020) DTN and Non-DTN routing protocols for inter-cubesat communications: A comprehensive survey. Electronics 9(3):482. https://doi.org/10.3390/electronics9030482

  3. Balasubramanian A, Levine B, Venkataramani A (2007 August) DTN routing as a resource allocation problem. In Proceedings of the 2007 Conference On Applications, Technologies, Architectures, and Protocols for Computer Communications (pp. 373-384)

  4. Balasubramanian A, Levine BN, Venkataramani A (2009) Replication routing in DTNs: A resource allocation approach. IEEE/ACM Trans Networking 18(2):596–609

    Article  Google Scholar 

  5. Massri K, Vitaletti A (2013 September) DTN routing protocols on resource-constrained devices: Design, implementation, and first experiments. In 2013 21st International Conference on Software, Telecommunications and Computer Networks-(SoftCOM 2013) (pp. 1–5). IEEE

  6. Jiaxin H, Chunxiu X, Yuewei W (2016 October) Resource-efficient routing protocol based on historical encounter time interval in DTN. In the 2016 2nd IEEE International Conference on Computer and Communications (ICCC) (pp. 2026-2031). IEEE

  7. Manasrah AM, Aldomi A, Gupta BB (2019) An optimized service broker routing policy based on differential evolution algorithm in fog/cloud environment. Cluster Comput 22:1639–1653. https://doi.org/10.1007/s10586-017-1559-z

    Article  Google Scholar 

  8. Lindgren A, Doria A, Davies E, Grasic S (2012) Probabilistic routing protocol for intermittently connected networks. RFC Series

  9. Hui P, Crowcroft J, Yoneki E (2010) Bubble rap: Social-based forwarding in delay-tolerant networks. IEEE Trans Mob Comput 10(11):1576–1589

    Article  Google Scholar 

  10. Chen X, Shen J, Groves T, Wu J (2009 August) Probability delegation forwarding in delay tolerant networks. In 2009 Proceedings of 18th International Conference on Computer Communications and Networks (pp. 1–6). IEEE

  11. Ayub Q, Zahid MSM, Rashid S, Abdullah AH (2014) DF++: an adaptive buffer-aware probabilistic delegation forwarding protocol for Delay Tolerant Network. Cluster Computing (2014), Volume 17, Issue 4, pp 1465-1472

  12. Bigwood G, Henderson T, Rehunathan D, Bateman M, Bhatti S (2011) CRAWDAD dataset st_andrews/sassy (v. 2011 06 03), downloaded from https://crawdad.org/st_adrews/sassy/2011060

  13. Vahdat A, Becker D (2000) Epidemic routing for partially connected ad hoc networks

  14. Spyropoulos T, Psounis K, Raghavendra CS (2005 August) Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking (pp. 252–259)

  15. Sobin CC, Raychoudhury V, Marfia G, Singla A (2016) A survey of routing and data dissemination in delay tolerant networks. J Netw Comput Appl 67:128–146

    Article  Google Scholar 

  16. Prodhan ATD, Kabir R, Shoja HGC (2011) TTL based routing in opportunistic net works. J Netw Compu Appl 34(5):1660–1670

  17. Soares VN, Rodrigues JJ, Farahmand F (2014 Jan) GeoSpray: A geographic routing protocol for vehicular delay-tolerant networks. Information Fusion. 1(15):102–13

  18. Qirtas MM, Faheem Y, Rehmani MH (2020) A cooperative mobile throwbox-based routing protocol for social-aware delay tolerant networks. Wireless Networks, pp.1–13

  19. Hui P, Crowcroft J (2007) How Small Labels Create Big Improvements. Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW’07), 2007, pp. 65-70, https://doi.org/10.1109/PERCOMW.2007.55.

  20. Wang K, Guo H (2014) An improved routing algorithm based on social link awareness in delay tolerant networks. Wireless Pers Commun 75(1):397–414

    Article  Google Scholar 

  21. Chen H, Lou W (2016) Contact expectation based routing for delay tolerant networks. Ad Hoc Networks 36:244–257

    Article  Google Scholar 

  22. Shah Mehul, Godaliya Nikhil, Barad Avani (2017) An Improved SimBet Routing Algorithm for Human Mobility based DTN. Kalpa Publications in Computing 2:166–176

    Article  Google Scholar 

  23. Bulut, E, Szymanski BK (2010 December) Friendship based routing in delay tolerant mobile social networks. In 2010 IEEE Global Telecommunications Conference GLOBECOM 2010 (pp. 1–5). IEEE

  24. Jahanbakhsh K, Shoja GC, King V (2010 February) Social-greedy: a socially-based greedy routing algorithm for delay tolerant networks. In Proceedings of the Second International Workshop on Mobile Opportunistic Networking (pp. 159-162)

  25. Fatemidokht H, Rafsanjani MK, Gupta BB, Hsu C-H (July 2021) Efficient and Secure Routing Protocol Based on Artificial Intelligence Algorithms With UAV-Assisted for Vehicular Ad Hoc Networks in Intelligent Transportation Systems. IEEE Transactions on Intelligent Transportation Systems 22(7):4757–4769. https://doi.org/10.1109/TITS.2020.3041746

  26. Cao N et al (2018) Evaluation Models for the Nearest Closer Routing Protocol in Wireless Sensor Networks. IEEE Access 6:77043–77054. https://doi.org/10.1109/ACCESS.2018.2825441

    Article  Google Scholar 

  27. Khekare G, Verma P, Dhanre U, Raut S, Sheikh S (2020) The optimal path finding algorithm based on reinforcement learning. International Journal of Software Science and Computational Intelligence (IJSSCI) 12(4):1–18

    Article  Google Scholar 

  28. Sejdiu B, Ismaili F, Ahmedi L (2020) Integration of semantics into sensor data for the IoT: a systematic literature review. International Journal on Semantic Web and Information Systems (IJSWIS) 16(4):1–25

    Article  Google Scholar 

  29. Iqbal S, Hussain I, Sharif Z, Qureshi KH, Jabeen J (2021) Reliable and energy-efficient routing scheme for underwater wireless sensor networks (UWSNs). International Journal of Cloud Applications and Computing (IJCAC) 11(4):42–58

    Article  Google Scholar 

  30. Scott K, Burleigh S (2007) RFC 5050. Bundle protocol specification

  31. Keränen A, Ott J, Kärkkäinen T (2009 March) The ONE simulator for DTN protocol evaluation. In Proceedings of the 2nd international conference on simulation tools and techniques (pp. 1-10)

  32. Burgess J, Gallagher B, Jensen D, Levine BN (2006) MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks. In Proceedings of INFOCOM 2006.25th IEEE International Conference on Computer Communications. IEEE, 1-11

Download references

Author information

Authors and Affiliations

  1. COMSATS Islamabad University, Wah Campus, Wah Cantt, Pakistan

    Qaisar Ayub & Sulma Rashid

Authors
  1. Qaisar Ayub
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sulma Rashid
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qaisar Ayub.

Ethics declarations

Conflict of interest

All authors declared that there is no conflict of interest.

Competing interest

The authors also declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ayub, Q., Rashid , S. Community trend message locking routing protocol for delay tolerant network. Peer-to-Peer Netw. Appl. 16, 1155–1173 (2023). https://doi.org/10.1007/s12083-023-01470-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-023-01470-4

Keywords

Search

Navigation