ArticlePloS one2022
Prioritized Shortest Path Computation Mechanism (PSPCM) for wireless sensor networks.
Article in PloS one, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.
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.
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.
Who cites it
1 citing paper in PubMed.
- Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Routing Protocol for Low-power and Lossy Networks (RPL), the de facto standard routing protocol for the Internet of Things (IoT) administers the smooth transportation of data packets across the Wireless Sensor Network (WSN). However, the mechanism fails to address the heterogeneous nature of data packets traversing the network, as these packets may carry different classes of data with different priority statuses, some real-time (time-sensitive) while others non-real-time (delay-tolerant). The standard Objective Functions (OFs), used by RPL to create routing paths, treat all classes of data as the same, this practice is not only inefficient but results in poor network performance. In this article, the Prioritized Shortest Path Computation Mechanism (PSPCM) is proposed to resolve the data prioritization of heterogeneous data and inefficient power management issues. The mechanism prioritizes heterogeneous data streaming through the network into various priority classes, based on the priority conveyed by the data. The PSPCM mechanism routes the data through the shortest and power-efficient path from the source to the destination node. PSPCM generates routing paths that exactly meet the need of the prioritized data. It outperformed related mechanisms with an average of 91.49% PDR, and average power consumption of 1.37mW which translates to better battery saving and prolonged operational lifetime while accommodating data with varying priorities.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.