4.7 Article

Coexistence Mechanism Between eMBB and uRLLC in 5G Wireless Networks

Journal

IEEE TRANSACTIONS ON COMMUNICATIONS
Volume 69, Issue 3, Pages 1736-1749

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCOMM.2020.3040307

Keywords

Upper bound; Heuristic algorithms; Transportation; Ultra reliable low latency communication; Minimization; Scheduling; Reliability; Ultra-reliable low latency communications (uRLLC); enhanced mobile broadband (eMBB); coexistence; penalty successive upper bound minimization (PSUM); transportation model (TM); resource scheduling

Funding

  1. National Research Foundation of Korea (NRF) - Korea government (MSIT) [2020R1A4A1018607]
  2. MSIT(Ministry of Science and ICT), Korea, under the Grand Information Technology Research Center support program [IITP-2020-2015-0-00742]
  3. National Research Foundation of Korea [2020R1A4A1018607] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)

Ask authors/readers for more resources

This paper studies the co-scheduling problem of eMBB and uRLLC traffic using the puncturing technique, decomposed into two sub-problems and solved with different optimization algorithms. Through numerical analysis, the proposed approach is established to be superior in terms of rate and fairness compared to other baseline methods.
Ultra-reliable low-latency communication (uRLLC) and enhanced mobile broadband (eMBB) are two influential services of the emerging 5G cellular network. Latency and reliability are major concerns for uRLLC applications, whereas eMBB services claim for the maximum data rates. Owing to the trade-off among latency, reliability and spectral efficiency, sharing of radio resources between eMBB and uRLLC services, heads to a challenging scheduling dilemma. In this paper, we study the co-scheduling problem of eMBB and uRLLC traffic based upon the puncturing technique. Precisely, we formulate an optimization problem aiming to maximize the minimum expected achieved rate (MEAR) of eMBB user equipment (UE) while fulfilling the provisions of the uRLLC traffic. We decompose the original problem into two sub-problems, namely scheduling problem of eMBB UEs and uRLLC UEs while prevailing objective unchanged. Radio resources are scheduled among the eMBB UEs on a time slot basis, whereas it is handled for uRLLC UEs on a mini-slot basis. Moreover, for resolving the scheduling issue of eMBB UEs, we use penalty successive upper bound minimization (PSUM) based algorithm, whereas the optimal transportation model (TM) is adopted for solving the same problem of uRLLC UEs. Furthermore, a heuristic algorithm is also provided to solve the first sub-problem with lower complexity. Finally, the significance of the proposed approach over other baseline approaches is established through numerical analysis in terms of the MEAR and fairness scores of the eMBB UEs.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available