Throughput Analysis of the System of Random Multiple Access with Separation by Signal Power

The article is devoted to a random multiple access algorithm using orthogonal preambles and separation of users by signal power. In the case of superimposing user signals with random access, the algorithm uses preamble information to temporarily switch to signal power splitting mode. This allows you to resolve the “conflict” between users without re-using random access in the next temporary resource. For the given algorithm the numerical analysis of throughput is resulted. We compared this algorithm with the optimal algorithm ALOHA. We show that this algorithm allows to increase the throughput with respect to the algorithm optimal ALOHA. With the use of 8 orthogonal preambles, the algorithm considered achieves a gain of 39% compared to the optimal algorithm of ALOHA. We showed the effect of the number of orthogonal preambles and the probability of sending a message to the channel to improve the efficiency of the algorithm.