Analyzing and stabilizing multichannel ALOHA with the use of the preamble-based exploration phase

Introduction: Internet of Things devices are actively used within the framework of Massive Machine-Type Communication scenarios. The interaction of devices is carried out by random multiple-access algorithms with limited throughput. To improve throughput one can use orthogonal preambles in the ALOHA-type class of algorithms. Purpose: To analyze ALOHA-based algorithms using the exploration phase and to calculate the characteristics for the algorithm with and without losses with a finite number of channels. Results: We have described a system model that employs random access for data transmission over a common communication channel with the use of orthogonal preambles and exploration phase. We have obtained a formula for numerical calculation of the throughput of an algorithm channel with losses with an infinite number of preambles and a given finite number of channels. The calculation results for several values of the number of independent channels are presented. A modification of the algorithm using the exploration phase and repeated transmissions is proposed and described. The system in question can work without losses. For this system, we have given the analysis of the maximum input throughput up to which the system operates stably. Also, the average delay values for the algorithm that were obtained by simulation modeling are shown. By reducing the number of available preambles, the results obtained can be used as an upper bound on the system throughput. Practical relevance: The results obtained allow to assess the potential for improving the throughput of random multiple-access systems in 6G networks through the application of the exploration phase.