Prioritized-Resource-Sharing Scheduling in 5G-TSN Integrated Networks

The 5G and Time-Sensitive Networking (TSN) integrated networks are promising communication solutions for future smart factories. The mixed time-triggered and event-triggered traffic inside the smart factories presents great challenges to the scheduling in 5G-TSN integrated networks. This paper proposes a prioritized-resource-sharing scheduling (PRSS) mechanism based on semi-persistent scheduling to guarantee the deterministic transmissions of event-triggered time-sensitive flows (ET-TS) while improving the resource utilizations. The proposed PRSS employs the max-min fair share algorithm in the dynamic scheduling for non-time-sensitive traffic to ensure the fairness of the resource allocation. Simulation results show that the proposed PRSS mechanism achieves lower delay and better resource utilizations compared with conventional scheduling mechanisms, especially for the ET-TS flows.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/icc52391.2025.11160753
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Prioritized-Resource-Sharing Scheduling in 5G-TSN Integrated Networks

Shengkai Wang, Xiao Han, Xiaowen Zhang, Yueping Cai
IoT and Edge/Fog Computing
article

Prioritized-Resource-Sharing Scheduling in 5G-TSN Integrated Networks

Shengkai Wang, Xiao Han, Xiaowen Zhang, Yueping Cai
article en

Abstract

The 5G and Time-Sensitive Networking (TSN) integrated networks are promising communication solutions for future smart factories. The mixed time-triggered and event-triggered traffic inside the smart factories presents great challenges to the scheduling in 5G-TSN integrated networks. This paper proposes a prioritized-resource-sharing scheduling (PRSS) mechanism based on semi-persistent scheduling to guarantee the deterministic transmissions of event-triggered time-sensitive flows (ET-TS) while improving the resource utilizations. The proposed PRSS employs the max-min fair share algorithm in the dynamic scheduling for non-time-sensitive traffic to ensure the fairness of the resource allocation. Simulation results show that the proposed PRSS mechanism achieves lower delay and better resource utilizations compared with conventional scheduling mechanisms, especially for the ET-TS flows.

Chongqing University (CN)
Openalex Percentile: Top 69%
IoT and Edge/Fog Computing
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.