An efficient algorithm for data transmission certainty in IIoT sensing network: A priority-based approach

Kemal Gökhan Nalbant, Sultan Almutairi, Asma Hassan Alshehri, Hayle Kemal, Suliman A Alsuhibany and Bong Jun Choi

PLOS ONE, 2024, vol. 19, issue 7, 1-29

Abstract: This paper proposes a novel cache replacement technique based on the notion of combining periodic popularity prediction with size caching. The popularity, size, and time updates characteristics are used to calculate the value of each cache item. When it comes to content replacement, the information with the least value is first eliminated. Simulation results show that the proposed method outperforms the current algorithms in terms of cache hit rate and delay. The hit rate of the proposed scheme is 15.3% higher than GDS, 17.3% higher than MPC, 20.1% higher than LRU, 22.3% higher than FIFO, and 24.8% higher than LFU when 350 different categories of information are present. In real-world industrial applications such as including supply chain management, smart manufacturing, automation energy optimization, intelligent logistics transportation, and e-healthcare applications, it offers a foundation for the selection of caching algorithms.

Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0305092 (text/html)
https://journals.plos.org/plosone/article/file?id= ... 05092&type=printable (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:plo:pone00:0305092

DOI: 10.1371/journal.pone.0305092

Access Statistics for this article

More articles in PLOS ONE from Public Library of Science
Bibliographic data for series maintained by plosone ().