TY - GEN
T1 - Resource Allocation for Downlink URLLC in a Smart Factory
AU - Li, Jing
AU - Wu, Hao
AU - Niu, Yong
AU - Ai, Bo
AU - Wang, Ning
AU - Quek, Tony Q.S.
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - Emerging as an important enabling technology for smart factories, ultra-reliable low latency communications (URLLC) have attracted extensive attention from academia and industry. In this paper, we aim to improve the performance of downlink URLLC in a smart factory. We first construct the system model based on the 5G New Radio (NR) standard, which specifies the modulation scheme, resource block structure and achievable data rates under finite blocklength codes (FBC). Next, since it is challenging to fulfill all transmission requests with limited radio and power resources, we formulate the problem to maximize the network throughput while considering delay and reliability constraints. This is a mixed integer non-convex nonlinear problem that is difficult to solve directly. To be tractable, we decompose it into two sub-problems, and apply the alternating optimization to obtain a sub-optimal solution. Specifically, the flow scheduling sub-problem is transformed into a matching game (MG) and solved by a delayed acceptance-based algorithm. Also a local water-filling algorithm is utilized to solve the power allocation sub-problem. Simulation results reveal that our proposed scheme outperforms other benchmark schemes.
AB - Emerging as an important enabling technology for smart factories, ultra-reliable low latency communications (URLLC) have attracted extensive attention from academia and industry. In this paper, we aim to improve the performance of downlink URLLC in a smart factory. We first construct the system model based on the 5G New Radio (NR) standard, which specifies the modulation scheme, resource block structure and achievable data rates under finite blocklength codes (FBC). Next, since it is challenging to fulfill all transmission requests with limited radio and power resources, we formulate the problem to maximize the network throughput while considering delay and reliability constraints. This is a mixed integer non-convex nonlinear problem that is difficult to solve directly. To be tractable, we decompose it into two sub-problems, and apply the alternating optimization to obtain a sub-optimal solution. Specifically, the flow scheduling sub-problem is transformed into a matching game (MG) and solved by a delayed acceptance-based algorithm. Also a local water-filling algorithm is utilized to solve the power allocation sub-problem. Simulation results reveal that our proposed scheme outperforms other benchmark schemes.
UR - https://www.scopus.com/pages/publications/85202838675
UR - https://www.scopus.com/pages/publications/85202838675#tab=citedBy
U2 - 10.1109/ICC51166.2024.10623043
DO - 10.1109/ICC51166.2024.10623043
M3 - Conference contribution
AN - SCOPUS:85202838675
T3 - IEEE International Conference on Communications
SP - 605
EP - 610
BT - ICC 2024 - IEEE International Conference on Communications
A2 - Valenti, Matthew
A2 - Reed, David
A2 - Torres, Melissa
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 59th Annual IEEE International Conference on Communications, ICC 2024
Y2 - 9 June 2024 through 13 June 2024
ER -