QoS-Aware Energy-Efficient Time-Slotted Channel Hopping Scheduling Algorithm

Efficiently balancing Quality of Service (QoS) requirements with energy conservation is essential for the sustainability of Internet of Things (IoT) sensor networks in industrial applications. This paper introduces a novel algorithm designed to optimize QoS and energy efficiency in Time-Slotted Channel Hopping (TSCH) networks for heterogeneous IoT sensor systems. The proposed approach meets application-specific QoS requirements, such as delay and packet loss, while reducing energy consumption through a strategic duty cycle optimization technique. Implemented in MATLAB and tested in a co-simulation environment, the algorithm was evaluated across various sensor network topologies and industrial QoS scenarios aligned with the ISA SP100 standard. The results demonstrate that the algorithm supports the delay and packet loss requirements for “open-loop” and “monitoring” services in networks of 16 to 36 nodes. For larger topologies of up to 64 nodes, it meets delay requirements but slightly exceeds packet loss thresholds by an average of 0.5%. Importantly, the duty cycle reduction strategy significantly enhances energy efficiency, lowering duty cycles by approximately 80% for networks of 16 to 36 nodes and by 15% for networks with 64 nodes. This method thus provides a robust solution for ensuring QoS compliance in industrial IoT systems, balancing high performance with optimized energy usage.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/icc52391.2025.11161043
Citations
1
Primary Topic
Advanced Wireless Network Optimization
Type
article
Field-Weighted Citation Impact
0.73
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

QoS-Aware Energy-Efficient Time-Slotted Channel Hopping Scheduling Algorithm

Ramiro Liscano, Aida Vatankhah
1 citations
Advanced Wireless Network Optimization
0.73
article

QoS-Aware Energy-Efficient Time-Slotted Channel Hopping Scheduling Algorithm

Ramiro Liscano, Aida Vatankhah
article en
1 citations

Abstract

Efficiently balancing Quality of Service (QoS) requirements with energy conservation is essential for the sustainability of Internet of Things (IoT) sensor networks in industrial applications. This paper introduces a novel algorithm designed to optimize QoS and energy efficiency in Time-Slotted Channel Hopping (TSCH) networks for heterogeneous IoT sensor systems. The proposed approach meets application-specific QoS requirements, such as delay and packet loss, while reducing energy consumption through a strategic duty cycle optimization technique. Implemented in MATLAB and tested in a co-simulation environment, the algorithm was evaluated across various sensor network topologies and industrial QoS scenarios aligned with the ISA SP100 standard. The results demonstrate that the algorithm supports the delay and packet loss requirements for “open-loop” and “monitoring” services in networks of 16 to 36 nodes. For larger topologies of up to 64 nodes, it meets delay requirements but slightly exceeds packet loss thresholds by an average of 0.5%. Importantly, the duty cycle reduction strategy significantly enhances energy efficiency, lowering duty cycles by approximately 80% for networks of 16 to 36 nodes and by 15% for networks with 64 nodes. This method thus provides a robust solution for ensuring QoS compliance in industrial IoT systems, balancing high performance with optimized energy usage.

Ontario Tech University (CA)
Openalex Percentile: Top 23%
Advanced Wireless Network Optimization
0.73
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.