Upper and Lower Bound for Non-Blocking Random Multiple Access Algorithm with Time Division Mode
Artem A. Burkov, A. A. Saveliev, Andrey M. Turlikov · 2019 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF) · 2019
In this paper, we consider a non-blocked random multiple access algorithm, which, through the use of orthogonal preamble switch to the time division mode. This approach makes possible to increase the delivery probability in comparison with classical random access algorithms and to use time division with an unlimited number of users, which is impossible when working with a conventional time division algorithm. For this algorithm the methods of numerical calculation of the upper and lower bounds for the main characteristics of the system are given. We are obtained the bounds by considering hypothetical systems with one and an infinite number of preambles. The bounds allow us to estimate the characteristics of real systems with a finite number of preambles.