Prioritized Shortest Path Computation Mechanism (PSPCM) for wireless sensor networks

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 pa...

Full description

Saved in:
Bibliographic Details
Main Authors: Onwuegbuzie, Innocent Uzougbo, Abd. Razak, Shukor, Isnin, Ismail Fauzi, Al-dhaqm, Arafat, Anuar, Nor Badrul
Format: Article
Language:English
Published: Public Library of Science 2022
Subjects:
Online Access:http://eprints.utm.my/103656/1/ShukorAbdRazak2022_PrioritizedShortestPathComputation.pdf
http://eprints.utm.my/103656/
http://dx.doi.org/10.1371/journal.pone.0264683
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.103656
record_format eprints
spelling my.utm.1036562023-11-22T00:22:14Z http://eprints.utm.my/103656/ Prioritized Shortest Path Computation Mechanism (PSPCM) for wireless sensor networks Onwuegbuzie, Innocent Uzougbo Abd. Razak, Shukor Isnin, Ismail Fauzi Al-dhaqm, Arafat Anuar, Nor Badrul QA76 Computer software 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. Public Library of Science 2022-03 Article PeerReviewed application/pdf en http://eprints.utm.my/103656/1/ShukorAbdRazak2022_PrioritizedShortestPathComputation.pdf Onwuegbuzie, Innocent Uzougbo and Abd. Razak, Shukor and Isnin, Ismail Fauzi and Al-dhaqm, Arafat and Anuar, Nor Badrul (2022) Prioritized Shortest Path Computation Mechanism (PSPCM) for wireless sensor networks. PLoS ONE, 17 (3). pp. 1-30. ISSN 1932-6203 http://dx.doi.org/10.1371/journal.pone.0264683 DOI:10.1371/journal.pone.0264683
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
language English
topic QA76 Computer software
spellingShingle QA76 Computer software
Onwuegbuzie, Innocent Uzougbo
Abd. Razak, Shukor
Isnin, Ismail Fauzi
Al-dhaqm, Arafat
Anuar, Nor Badrul
Prioritized Shortest Path Computation Mechanism (PSPCM) for wireless sensor networks
description 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.
format Article
author Onwuegbuzie, Innocent Uzougbo
Abd. Razak, Shukor
Isnin, Ismail Fauzi
Al-dhaqm, Arafat
Anuar, Nor Badrul
author_facet Onwuegbuzie, Innocent Uzougbo
Abd. Razak, Shukor
Isnin, Ismail Fauzi
Al-dhaqm, Arafat
Anuar, Nor Badrul
author_sort Onwuegbuzie, Innocent Uzougbo
title Prioritized Shortest Path Computation Mechanism (PSPCM) for wireless sensor networks
title_short Prioritized Shortest Path Computation Mechanism (PSPCM) for wireless sensor networks
title_full Prioritized Shortest Path Computation Mechanism (PSPCM) for wireless sensor networks
title_fullStr Prioritized Shortest Path Computation Mechanism (PSPCM) for wireless sensor networks
title_full_unstemmed Prioritized Shortest Path Computation Mechanism (PSPCM) for wireless sensor networks
title_sort prioritized shortest path computation mechanism (pspcm) for wireless sensor networks
publisher Public Library of Science
publishDate 2022
url http://eprints.utm.my/103656/1/ShukorAbdRazak2022_PrioritizedShortestPathComputation.pdf
http://eprints.utm.my/103656/
http://dx.doi.org/10.1371/journal.pone.0264683
_version_ 1783876396583485440
score 13.211869