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

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 impo...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on wireless communications s. 1
Hlavní autoři: Zhao, Xiaoyu, Liu, Yuanrui, Chen, Wei, Zhang, Ying-Jun Angela
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 2025
Témata:
Channel coding
Cross layer design
Cross-layer scheduling
Delays
Error probability
Fading channels
Finite-blocklength coding
Low latency
Reliability
Scheduling
Short-packet transmission
Symbols
Ultra reliable low latency communication
Ultra-reliable and low-latency communications
Wireless communication
ISSN:1536-1276, 1558-2248
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2025.3624092