NPRACH-Aware Link Adaptation and Uplink Resource Allocation in NB-IoT Cellular Networks

In narrowband Internet of Things (NB-IoT), a link adaptation technique can be performed, considering multiple resource unit types, repetition numbers, and modulation-coding schemes, to enhance transmission reliability. Then, a base station should allocate downlink and uplink resources for each devic...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on vehicular technology Ročník 70; číslo 5; s. 4894 - 4906
Hlavní autoři: Yu, Ya-Ju, Wang, Jhih-Kai
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.05.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
5G cellular networks
Adaptation
Algorithms
Base stations
Cellular communication
Cellular networks
Downlink
Frame structures
Heuristic algorithms
Internet of Things
link adaptation
Modulation
Narrowband
NB-IoT
NPRACHs
Polynomials
Programming
Radio
Random access
Resource allocation
Resource management
Uplink
uplink resource allocation
ISSN:0018-9545, 1939-9359
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í:In narrowband Internet of Things (NB-IoT), a link adaptation technique can be performed, considering multiple resource unit types, repetition numbers, and modulation-coding schemes, to enhance transmission reliability. Then, a base station should allocate downlink and uplink resources for each device using the link adaptation decision to transmit data in NB-IoT frame structures. However, because narrowband physical random access channels (NPRACHs) will occupy the partial uplink radio resource, the uplink transmission of a device using the assigned uplink radio resource without considering NPRACHs will cause severe interference. To solve the above issue, this article investigates the joint link adaptation and uplink resource allocation problem with the consideration of NPRACHs. The objective is to minimize the consumption of radio resources while the uplink data requirement of each device can be satisfied. We prove our target problem is <inline-formula><tex-math notation="LaTeX">\mathcal {NP}</tex-math></inline-formula>-hard and cannot be approximated with a ratio better than <inline-formula><tex-math notation="LaTeX">3/2</tex-math></inline-formula>. Then, we propose a dynamic-programming algorithm without considering NPRACHs for the link adaptation problem and finally propose an uplink resource allocation algorithm considering NPRACHs based on the dynamic-programming algorithm. We prove that the proposed dynamic-programming algorithm with pseudo-polynomial time can find an optimal solution for the link adaptation problem. Compared with two previous algorithms, the simulation results show the efficacy of the proposed algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2021.3069272