Rate-Latency Optimization for NB-IoT With Adaptive Resource Unit Configuration in Uplink Transmission

Narrowband Internet of Things (NB-IoT) is a cellular IoT communication technology standardized by 3rd Generation Partnership Project (3GPP) for supporting massive machine type communication and its deployment can be realized by a simple firmware upgrade on existing long term evolution (LTE) networks...

Full description

Saved in:
Bibliographic Details
Published inIEEE systems journal Vol. 15; no. 1; pp. 265 - 276
Main Authors Elgarhy, Osama, Reggiani, Luca, Malik, Hassan, Alam, Muhammad Mahtab, Imran, Muhammad Ali
Format Journal Article
LanguageEnglish
Published New York IEEE 01.03.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Narrowband Internet of Things (NB-IoT) is a cellular IoT communication technology standardized by 3rd Generation Partnership Project (3GPP) for supporting massive machine type communication and its deployment can be realized by a simple firmware upgrade on existing long term evolution (LTE) networks. The NB-IoT requirements in terms of energy efficiency, achievable rates, latency, extended coverage, make the resource allocation, in a limited bandwidth, even a more challenging problem w.r.t. to legacy LTE. The allocation, done with subcarrier (SC) granularity in NB-IoT, should maintain adequate performance for the devices while keeping the power consumption as low as possible. Nevertheless, the optimal solution of the resource allocation problem is typically unfeasible since nonconvex, NP-hard and combinatorial because of the use of binary variables. In this article, after the formulation of the optimization problem, we study the resource allocation approach for NB-IoT networks aiming to analyze the tradeoff between rate and latency. The proposed suboptimal algorithm allocates radio resource (i.e., SCs) and transmission power to the NB-IoT devices for the uplink transmission and the performance is compared in terms of latency, rate, and power. By comparing the proposed allocation to a conventional round robin (RR) and to a brute-force approach, we can observe the advantages of the formulated allocation problem and the limited loss of the suboptimal solution. The proposed algorithm outperforms the RR by a factor 2 in terms of spectral efficiency and, moreover, the study includes techniques that reduce the dropped packets from <inline-formula><tex-math notation="LaTeX">\text{29}\%</tex-math></inline-formula> to <inline-formula><tex-math notation="LaTeX">\text{1.6}\%</tex-math></inline-formula>.
ISSN:1932-8184
1937-9234
DOI:10.1109/JSYST.2020.2991073