SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:kth-286889"
 

Search: onr:"swepub:oai:DiVA.org:kth-286889" > A RAN Resource Slic...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

A RAN Resource Slicing Mechanism for Multiplexing of eMBB and URLLC Services in OFDMA Based 5G Wireless Networks

Korrai, P. (author)
Lagunas, E. (author)
Sharma, S. K. (author)
show more...
Chatzinotas, S. (author)
Bandi, A. (author)
Ottersten, Björn, 1961- (author)
Interdisciplinary Center for Security, Reliability and Trust (SnT), University of Luxembourg, Esch-sur-Alzette, Luxembourg
show less...
 (creator_code:org_t)
Institute of Electrical and Electronics Engineers (IEEE), 2020
2020
English.
In: IEEE Access. - : Institute of Electrical and Electronics Engineers (IEEE). - 2169-3536. ; 8, s. 45674-45688
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • Enhanced mobile broadband (eMBB) and ultra-reliable and low-latency communications (URLLC) are the two main expected services in the next generation of wireless networks. Accommodation of these two services on the same wireless infrastructure leads to a challenging resource allocation problem due to their heterogeneous specifications. To address this problem, slicing has emerged as an architecture that enables a logical network with specific radio access functionality to each of the supported services on the same network infrastructure. The allocation of radio resources to each slice according to their requirements is a fundamental part of the network slicing that is usually executed at the radio access network (RAN). In this work, we formulate the RAN resource allocation problem as a sum-rate maximization problem subject to the orthogonality constraint (i.e., service isolation), latency-related constraint and minimum rate constraint while maintaining the reliability constraint with the incorporation of adaptive modulation and coding (AMC). However, the formulated problem is not mathematically tractable due to the presence of a step-wise function associated with the AMC and a binary assignment variable. Therefore, to solve the proposed optimization problem, first, we relax the mathematical intractability of AMC by using an approximation of the non-linear AMC achievable throughput, and next, the binary constraint is relaxed to a box constraint by using the penalized reformulation of the problem. The result of the above two-step procedure provides a close-to-optimal solution to the original optimization problem. Furthermore, to ease the complexity of the optimization-based scheduling algorithm, a low-complexity heuristic scheduling scheme is proposed for the efficient multiplexing of URLLC and eMBB services. Finally, the effectiveness of the proposed optimization and heuristic schemes is illustrated through extensive numerical simulations.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Signalbehandling (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Signal Processing (hsv//eng)

Keyword

eMBB and URLLC
Network slicing
RAN radio resource allocation
scheduling
sum-rate maximization

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Find more in SwePub

By the author/editor
Korrai, P.
Lagunas, E.
Sharma, S. K.
Chatzinotas, S.
Bandi, A.
Ottersten, Björn ...
About the subject
ENGINEERING AND TECHNOLOGY
ENGINEERING AND ...
and Electrical Engin ...
and Signal Processin ...
Articles in the publication
IEEE Access
By the university
Royal Institute of Technology

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view