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
- Yitu Wang (ORCID: https://orcid.org/0000-0003-4453-5966)
- Yan‐Kai Zhang (ORCID: https://orcid.org/0000-0002-7828-3560)
- Wei Wang (ORCID: https://orcid.org/0000-0003-2153-9075)
- Wenkai Zhang (ORCID: https://orcid.org/0000-0002-8903-2708)
- Zhaoyang Zhang (ORCID: https://orcid.org/0000-0002-0684-9975)
- Yang Xinglin (ORCID: https://orcid.org/0009-0007-1228-1013)
Institutions
- North Minzu University (CN)
- Zhejiang University (CN)
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