Channel-Aware Rotating Priority Queue Scheduling with Delay Deadline over Wireless Links

Conventional Rotating Priority Queues (RPQ) scheduling adopted in Time-Sensitive Networks (TSN) fails to achieve desired performance over time-varying wireless channel. In this paper, we propose a channel-aware RPQ scheduling algorithm to meet explicit delay deadlines in wireless context. Specifically, we first construct an improved channel-aware RPQ framework. Different to the classic RPQ scheduler, we allocate the transmission opportunity to various devices before adopting RPQ scheduling for each device. For the scheduling of device transmission time, we establish a weighted queue for each device by learning their effects to the violation of delay deadlines, and propose a low-complexity scheduling algorithm by stabilizing the virtual outage queue via Lyapunov optimization. As the mapping to the weighted queue is non-smooth, we enhance the soft threshold function by employing momentum to accelerate the convergence rate. Simulation results verify the performance improvements of the proposed scheduling algorithm,

Authors

Institutions

Publication Details

Published
2024-10-24
DOI
https://doi.org/10.1109/wcsp62071.2024.10827057
Citations
1
Primary Topic
Advanced Wireless Network Optimization
Type
article
Field-Weighted Citation Impact
0.21
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Channel-Aware Rotating Priority Queue Scheduling with Delay Deadline over Wireless Links

Yitu Wang, Yan‐Kai Zhang, Wei Wang, Wenkai Zhang et al.
1 citations
Advanced Wireless Network Optimization
0.21
article

Channel-Aware Rotating Priority Queue Scheduling with Delay Deadline over Wireless Links

Yitu Wang, Yan‐Kai Zhang, Wei Wang, Wenkai Zhang, Zhaoyang Zhang, Yang Xinglin
article en
1 citations

Abstract

Conventional Rotating Priority Queues (RPQ) scheduling adopted in Time-Sensitive Networks (TSN) fails to achieve desired performance over time-varying wireless channel. In this paper, we propose a channel-aware RPQ scheduling algorithm to meet explicit delay deadlines in wireless context. Specifically, we first construct an improved channel-aware RPQ framework. Different to the classic RPQ scheduler, we allocate the transmission opportunity to various devices before adopting RPQ scheduling for each device. For the scheduling of device transmission time, we establish a weighted queue for each device by learning their effects to the violation of delay deadlines, and propose a low-complexity scheduling algorithm by stabilizing the virtual outage queue via Lyapunov optimization. As the mapping to the weighted queue is non-smooth, we enhance the soft threshold function by employing momentum to accelerate the convergence rate. Simulation results verify the performance improvements of the proposed scheduling algorithm,

North Minzu University (CN), Zhejiang University (CN)
Openalex Percentile: Top 44%
Advanced Wireless Network Optimization
0.21
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.