Version 1
: Received: 1 October 2022 / Approved: 7 October 2022 / Online: 7 October 2022 (08:33:14 CEST)
How to cite:
Hasan, S.; Al-Bayatti, A.H.; Khan, S.; Harrati, Y.; Alaoui, E.A.A.; Algaddafi, A. Performance Analysis of the Impact of Time to Leave on Different Drop Policies for Delay Tolerant Networks. Preprints2022, 2022100076. https://doi.org/10.20944/preprints202210.0076.v1
Hasan, S.; Al-Bayatti, A.H.; Khan, S.; Harrati, Y.; Alaoui, E.A.A.; Algaddafi, A. Performance Analysis of the Impact of Time to Leave on Different Drop Policies for Delay Tolerant Networks. Preprints 2022, 2022100076. https://doi.org/10.20944/preprints202210.0076.v1
Hasan, S.; Al-Bayatti, A.H.; Khan, S.; Harrati, Y.; Alaoui, E.A.A.; Algaddafi, A. Performance Analysis of the Impact of Time to Leave on Different Drop Policies for Delay Tolerant Networks. Preprints2022, 2022100076. https://doi.org/10.20944/preprints202210.0076.v1
APA Style
Hasan, S., Al-Bayatti, A.H., Khan, S., Harrati, Y., Alaoui, E.A.A., & Algaddafi, A. (2022). Performance Analysis of the Impact of Time to Leave on Different Drop Policies for Delay Tolerant Networks. Preprints. https://doi.org/10.20944/preprints202210.0076.v1
Chicago/Turabian Style
Hasan, S., El Arbi Abdellaoui Alaoui and Ali Algaddafi. 2022 "Performance Analysis of the Impact of Time to Leave on Different Drop Policies for Delay Tolerant Networks" Preprints. https://doi.org/10.20944/preprints202210.0076.v1
Abstract
Delay Tolerant Networks (DTNs) are intermittently connected networks, where there is no guaranteed end-to-end connectivity between the source and destination. The link between the pair of nodes in the DTNs environments is frequently disrupted, due to the fast mobility of nodes, dissemination nature, and power outages. Due to the absence of contemporaneous paths between the nodes, the opportunities for message forwarding in DTNs usually are limited. To obtain high data delivery, the DTNs use innovation of the Store-Carry and Forward (SCF) technique which allows data transmission to successfully proceed despite the absence of continuous end-to-end paths. However, the SCF approach arises various issues such as buffer congestion and message drop which are caused due to growing number of carried messages in restricted network resources. Therefore, buffer management techniques are required to manage the buffer capacity of the nodes by deciding how to effectively drop the messages and how to schedule the messages in the node’s buffer in a perfect way. This paper evaluates the performance of six buffer management techniques, namely First-In-FirstOut, Last In First Out, Drop Largest, Drop Youngest, Evict Shortest Lifetime First and Evict Most Forwarded First, with MaxProp and Spray and Wait routing protocols under variable message’s Time-To-Live values (60 to 300 minutes with step-change 60 minutes). In addition, this study uses an Opportunistic Network Environment (ONE) simulator that is utilized for evaluating the performance of the dropping policies techniques, where it is considering five performance metrics (delivery ratio, overhead ratio, average latency, hop count, and message drop). The evaluation results of each buffer management policy are explained by these metrics briefly.
Keywords
Delay-Tolerant Network (DTNs); Vehicular Delay-Tolerant networks (VDTNs); Store Carries and Forward (SCF)
Subject
Computer Science and Mathematics, Computer Science
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
,
