EUVIMEDEUVIMED entdecken
Crossref

Joint Buffer-Aware Scheduling and Finite-Blocklength Coding for URLLC: A Tandem Queue Approach

Xiaoyu Zhao, Yuanrui Liu, Wei Chen, Ying-Jun Angela Zhang

IEEE Transactions on Wireless Communications · 2026 · 25 · 6207-6224

DOI: 10.1109/twc.2025.3624092 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Wireless Communications, 2026. Verfasst von Xiaoyu Zhao und 3 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 48 Literaturangaben. Gefördert von: National Natural Science Foundation of China, National Natural Science Foundation of China and Research Grants Council Joint Research Scheme, Research Grants Council of Hong Kong General Research Fund.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Finite-blocklength coding (FBC) is a promising technology to achieve ultra-reliable and low-latency communications (URLLC) in emerging applications, e.g., autonomous driving and extended reality. The challenge lies in scheduling random arriving traffic in URLLC due to the blocklength constraint imposed by low latency. This paper designs a cross-layer mechanism, called the joint scheduling and FBC policy, to meet URLLC requirements for bursty traffic under AWGN and block fading channels. First, we model a single-user transmission system as a tandem queue model. In this model, a packet queue buffers randomly arriving packets. After these packets are encoded using FBC, the resulting encoded symbols are buffered in a symbol queue. To analyze the latency and reliability performance, we represent the system as a Markov chain and conduct steady-state and transition analyses. After that, we construct a non-convex problem to minimize delay subject to reliability and power constraints. Using a variable combination method, we convert this problem into a linear-fractional programming (LFP) problem. Notice that extremely high reliable requirement significantly increases the computational complexity of standard LFP method. We approximate the objective function and packet drop ratio constraint, and obtain a lower bound of the minimum average delay effectively with a marginal performance loss.

Förderung

  • National Natural Science Foundation of China
  • National Natural Science Foundation of China and Research Grants Council Joint Research Scheme
  • Research Grants Council of Hong Kong General Research Fund
  • Research Grants Council Area of Excellence Scheme
  • NSFC/RGC Collaborative Research Scheme

Zitieren

APA

Zhao, X., Liu, Y., Chen, W., & Zhang, Y. A. (2026). Joint Buffer-Aware Scheduling and Finite-Blocklength Coding for URLLC: A Tandem Queue Approach. IEEE Transactions on Wireless Communications, 25, 6207-6224. https://doi.org/10.1109/twc.2025.3624092

Vancouver

Zhao X, Liu Y, Chen W, Zhang YA. Joint Buffer-Aware Scheduling and Finite-Blocklength Coding for URLLC: A Tandem Queue Approach. IEEE Transactions on Wireless Communications. 2026;25:6207-6224. doi:10.1109/twc.2025.3624092

BibTeX
@article{Zhao2026,
  author = {Zhao, Xiaoyu and Liu, Yuanrui and Chen, Wei and Zhang, Ying-Jun Angela},
  title = {Joint Buffer-Aware Scheduling and Finite-Blocklength Coding for URLLC: A Tandem Queue Approach},
  journal = {IEEE Transactions on Wireless Communications},
  year = {2026},
  volume = {25},
  pages = {6207--6224},
  doi = {10.1109/twc.2025.3624092}
}
Kostenlos starten →