Systems and Means of Informatics

2025, Volume 35, Issue 4, pp 20-32

TREE-SPLITTING ALGORITHMS FOR MASSIVE RANDOM ACCESS OF 5G NB-IoT COMMUNICATIONS

  • V. A. Beschastnyi
  • A. M. Turlikov
  • N. V. Stepanov
  • V. S. Shorgin

Abstract

State-of-the-art Internet of Things (IoT) applications are characterized by exclusive requirements on latency which are much higher than those defined for 5G Massive Machine-Type Communications in ITU-R M.2410 (e. g., less than 10 ms). For this reason, 3GPP (3rd Generation Partnership Project) has defined several procedures to reduce access latency in the 5G NB-IoT systems. However, these procedures are purely ALOHA-type and do not use information that may be available on the NB-IoT base station. In this paper, two extensions of the random access procedure based on tree-splitting algorithms have been considered. The results show that the algorithm with blocked access is characterized by a 25%- 35% higher throughput compared to the free-access algorithm. At the same time, the considered algorithms can be effectively employed in the case when the traffic load does not exceed 70%-80% of the available throughput.

[+] References (12)

[+] About this article