Evidence map›Paper›PMID 39018273›Full record

ArticlePloS one2024

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, Bong Jun Choi

Abstract read
In one paragraph

Article in PloS one, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors.

Kemal Gökhan NalbantDepartment of Software Engineering, Faculty of Engineering Architecture, Istanbul Beykent University, Istanbul, Turkey.
Sultan AlmutairiDepartment of Natural and Applied Sciences, Community College, Majmaah University, Al-Majmaah, Saudi Arabia.
Asma Hassan AlshehriDepartment of Computer Sciences, College of Computer Engineering and Sciences, Prince Sattam bin Abdulaziz University, Al Kharj, Saudi Arabia.
Hayle KemalFaculty of Natural and Computational Science, Debre Berhan University, Debre Berhan, Ethiopia.ORCID 0009-0007-1996-8475
Suliman A AlsuhibanyDepartment of Computer Science, College of Computer, Qassim University, Buraydah, Saudi Arabia.
Bong Jun ChoiSchool of Computer Science and Engineering, Soongsil University, Seoul, South Korea.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

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.

Indexed as

AlgorithmsComputer Communication NetworksComputer Simulation

Identifiers

PMID39018273
PMCPMC11253953

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.