Open Access iconOpen Access

ARTICLE

NPBMT: A Novel and Proficient Buffer Management Technique for Internet of Vehicle-Based DTNs

by Sikandar Khan1, Khalid Saeed1, Muhammad Faran Majeed2,*, Salman A. AlQahtani3, Khursheed Aurangzeb3, Muhammad Shahid Anwar4,*

1 Department of Computer Science, Shaheed Benazir Bhutto University Sheringal, Dir (U), Khyber Pakhtunkhwa, 18200, Pakistan
2 Department of Computer Science, Kohsar University Murree, Punjab, 47150, Pakistan
3 Department of Computer Engineering, College of Computer and Information Sciences, King Saud University, P.O. Box 51178, Riyadh, 11543, Saudi Arabia
4 Department of AI and Software, Gachon University, Seongnam-si, 13120, South Korea

* Corresponding Authors: Muhammad Faran Majeed. Email: email; Muhammad Shahid Anwar. Email: email

(This article belongs to the Special Issue: Software-defined Internet-of-Vehicles (SD-IoV) leveraging AI, 5G and NFV)

Computers, Materials & Continua 2023, 77(1), 1303-1323. https://doi.org/10.32604/cmc.2023.039697

Abstract

Delay Tolerant Networks (DTNs) have the major problem of message delay in the network due to a lack of end-to-end connectivity between the nodes, especially when the nodes are mobile. The nodes in DTNs have limited buffer storage for storing delayed messages. This instantaneous sharing of data creates a low buffer/shortage problem. Consequently, buffer congestion would occur and there would be no more space available in the buffer for the upcoming messages. To address this problem a buffer management policy is proposed named “A Novel and Proficient Buffer Management Technique (NPBMT) for the Internet of Vehicle-Based DTNs”. NPBMT combines appropriate-size messages with the lowest Time-to-Live (TTL) and then drops a combination of the appropriate messages to accommodate the newly arrived messages. To evaluate the performance of the proposed technique comparison is done with Drop Oldest (DOL), Size Aware Drop (SAD), and Drop Larges (DLA). The proposed technique is implemented in the Opportunistic Network Environment (ONE) simulator. The shortest path map-based movement model has been used as the movement path model for the nodes with the epidemic routing protocol. From the simulation results, a significant change has been observed in the delivery probability as the proposed policy delivered 380 messages, DOL delivered 186 messages, SAD delivered 190 messages, and DLA delivered only 95 messages. A significant decrease has been observed in the overhead ratio, as the SAD overhead ratio is 324.37, DLA overhead ratio is 266.74, and DOL and NPBMT overhead ratios are 141.89 and 52.85, respectively, which reveals a significant reduction of overhead ratio in NPBMT as compared to existing policies. The network latency average of DOL is 7785.5, DLA is 5898.42, and SAD is 5789.43 whereas the NPBMT latency average is 3909.4. This reveals that the proposed policy keeps the messages for a short time in the network, which reduces the overhead ratio.

Keywords


Cite This Article

APA Style
Khan, S., Saeed, K., Majeed, M.F., AlQahtani, S.A., Aurangzeb, K. et al. (2023). NPBMT: A novel and proficient buffer management technique for internet of vehicle-based dtns. Computers, Materials & Continua, 77(1), 1303-1323. https://doi.org/10.32604/cmc.2023.039697
Vancouver Style
Khan S, Saeed K, Majeed MF, AlQahtani SA, Aurangzeb K, Shahid Anwar M. NPBMT: A novel and proficient buffer management technique for internet of vehicle-based dtns. Comput Mater Contin. 2023;77(1):1303-1323 https://doi.org/10.32604/cmc.2023.039697
IEEE Style
S. Khan, K. Saeed, M. F. Majeed, S. A. AlQahtani, K. Aurangzeb, and M. Shahid Anwar, “NPBMT: A Novel and Proficient Buffer Management Technique for Internet of Vehicle-Based DTNs,” Comput. Mater. Contin., vol. 77, no. 1, pp. 1303-1323, 2023. https://doi.org/10.32604/cmc.2023.039697



cc Copyright © 2023 The Author(s). Published by Tech Science Press.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 463

    View

  • 266

    Download

  • 0

    Like

Share Link