Skip to main content
Top
Published in: Peer-to-Peer Networking and Applications 2/2023

10-03-2023

Community trend message locking routing protocol for delay tolerant network

Authors: Qaisar Ayub, Sulma Rashid

Published in: Peer-to-Peer Networking and Applications | Issue 2/2023

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference 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) 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)
3.
go back to reference 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) 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.
go back to reference Balasubramanian A, Levine BN, Venkataramani A (2009) Replication routing in DTNs: A resource allocation approach. IEEE/ACM Trans Networking 18(2):596–609CrossRef Balasubramanian A, Levine BN, Venkataramani A (2009) Replication routing in DTNs: A resource allocation approach. IEEE/ACM Trans Networking 18(2):596–609CrossRef
5.
go back to reference 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 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.
go back to reference 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 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
8.
go back to reference Lindgren A, Doria A, Davies E, Grasic S (2012) Probabilistic routing protocol for intermittently connected networks. RFC Series Lindgren A, Doria A, Davies E, Grasic S (2012) Probabilistic routing protocol for intermittently connected networks. RFC Series
9.
go back to reference Hui P, Crowcroft J, Yoneki E (2010) Bubble rap: Social-based forwarding in delay-tolerant networks. IEEE Trans Mob Comput 10(11):1576–1589CrossRef Hui P, Crowcroft J, Yoneki E (2010) Bubble rap: Social-based forwarding in delay-tolerant networks. IEEE Trans Mob Comput 10(11):1576–1589CrossRef
10.
go back to reference 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 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.
go back to reference 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 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
13.
go back to reference Vahdat A, Becker D (2000) Epidemic routing for partially connected ad hoc networks Vahdat A, Becker D (2000) Epidemic routing for partially connected ad hoc networks
14.
go back to reference 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) 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.
go back to reference 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–146CrossRef 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–146CrossRef
16.
go back to reference Prodhan ATD, Kabir R, Shoja HGC (2011) TTL based routing in opportunistic net works. J Netw Compu Appl 34(5):1660–1670 Prodhan ATD, Kabir R, Shoja HGC (2011) TTL based routing in opportunistic net works. J Netw Compu Appl 34(5):1660–1670
17.
go back to reference Soares VN, Rodrigues JJ, Farahmand F (2014 Jan) GeoSpray: A geographic routing protocol for vehicular delay-tolerant networks. Information Fusion. 1(15):102–13 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.
go back to reference 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 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
20.
go back to reference Wang K, Guo H (2014) An improved routing algorithm based on social link awareness in delay tolerant networks. Wireless Pers Commun 75(1):397–414CrossRef Wang K, Guo H (2014) An improved routing algorithm based on social link awareness in delay tolerant networks. Wireless Pers Commun 75(1):397–414CrossRef
21.
go back to reference Chen H, Lou W (2016) Contact expectation based routing for delay tolerant networks. Ad Hoc Networks 36:244–257CrossRef Chen H, Lou W (2016) Contact expectation based routing for delay tolerant networks. Ad Hoc Networks 36:244–257CrossRef
22.
go back to reference Shah Mehul, Godaliya Nikhil, Barad Avani (2017) An Improved SimBet Routing Algorithm for Human Mobility based DTN. Kalpa Publications in Computing 2:166–176CrossRef Shah Mehul, Godaliya Nikhil, Barad Avani (2017) An Improved SimBet Routing Algorithm for Human Mobility based DTN. Kalpa Publications in Computing 2:166–176CrossRef
23.
go back to reference 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 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.
go back to reference 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) 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.
go back to reference 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 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
27.
go back to reference 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–18CrossRef 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–18CrossRef
28.
go back to reference 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–25CrossRef 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–25CrossRef
29.
go back to reference 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–58CrossRef 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–58CrossRef
30.
go back to reference Scott K, Burleigh S (2007) RFC 5050. Bundle protocol specification Scott K, Burleigh S (2007) RFC 5050. Bundle protocol specification
31.
go back to reference 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) 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.
go back to reference 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 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
Metadata
Title
Community trend message locking routing protocol for delay tolerant network
Authors
Qaisar Ayub
Sulma Rashid
Publication date
10-03-2023
Publisher
Springer US
Published in
Peer-to-Peer Networking and Applications / Issue 2/2023
Print ISSN: 1936-6442
Electronic ISSN: 1936-6450
DOI
https://doi.org/10.1007/s12083-023-01470-4

Other articles of this Issue 2/2023

Peer-to-Peer Networking and Applications 2/2023 Go to the issue

Premium Partner