# Evaluation, Modeling and Optimization of Coverage Enhancement Methods of NB-IoT

## TL;DR

This paper evaluates and optimizes coverage enhancement techniques for NB-IoT, proposing a hybrid link adaptation strategy that improves latency performance and is computationally efficient.

## Contribution

It introduces a simulation framework for NB-IoT coverage enhancement features and develops an optimized hybrid link adaptation algorithm with improved speed and comparable latency.

## Key findings

- Hybrid link adaptation reduces latency effectively.
- Proposed algorithms outperform exhaustive search in speed.
- Simulation confirms the effectiveness of the optimization approach.

## Abstract

Narrowband Internet of Things (NB-IoT) is a new Low Power Wide Area Network (LPWAN) technology released by 3GPP. The primary goals of NB-IoT are improved coverage, massive capacity, low cost, and long battery life. In order to improve coverage, NB-IoT has promising solutions, such as increasing transmission repetitions, decreasing bandwidth, and adapting the Modulation and Coding Scheme (MCS). In this paper, we present an implementation of coverage enhancement features of NB-IoT in NS-3, an end-to-end network simulator. The resource allocation and link adaptation in NS-3 are modified to comply with the new features of NB-IoT. Using the developed simulation framework, the influence of the new features on network reliability and latency is evaluated. Furthermore, an optimal hybrid link adaptation strategy based on all three features is proposed. To achieve this, we formulate an optimization problem that has an objective function based on latency, and constraint based on the Signal to Noise Ratio (SNR). Then, we propose several algorithms to minimize latency and compare them with respect to accuracy and speed. The best hybrid solution is chosen and implemented in the NS-3 simulator by which the latency formulation is verified. The numerical results show that the proposed optimization algorithm for hybrid link adaptation is eight times faster than the exhaustive search approach and yields similar latency.