Paper Info
Title
Multiplexing URLLC Traffic Within eMBB Services in 5G NR: Fair Scheduling
Abstract
5G New Radio (NR) is envisioned to efficiently support both enhanced mobile broadband (eMBB) and ultra-reliable low-latency communication (URLLC). Due to the severe constraint of URLLC traffic, the time resources used by eMBB are further divided into mini-slots. From the media access control (MAC) layer scheduling perspective, the resource allocation occurs on different timescales, and URLLC traffic is pre-emptively overlapped at the mini-slot timescale to obtain the strict requirements of URLLC (achieve 99.999% reliability within 1 ms latency). In this article, we analyze the multiplexing of eMBB and URLLC traffic in 5G downlink transmission, with the dual objectives of maximizing eMBB utility like proportional fairness for eMBB users while satisfying URLLC constraints. We formulate the resource allocation problem in each mini-slot as the integer programming (IP) problem with two solutions: 1) convex relaxation; 2) greedy algorithm. The simulation results show that our algorithms have a higher utility of eMBB users while satisfying the URLLC users' latency and reliability requirements than using basic round robin. The performance comparison between the two algorithms is extensively studied, and the choice of two algorithms in practice can be decided by the trade-off analysis investigated in this article.
Year
DOI
Venue
2021
10.1109/TCOMM.2020.3035582
IEEE Transactions on Communications
Keywords
DocType
Volume
5G NR,URLLC,eMBB,scheduling,resource allocation
Journal
69
Issue
ISSN
Citations 
2
0090-6778
6
PageRank 
References 
Authors
0.46
0
3
Name
Order
Citations
PageRank
Hao Yin172.16
Zhang Lyutianyang261.81
Sumit Roy32245203.71