RANDOMIZED SPLITTING ALGORITHM FOR CENTRALIZED RANDOM MULTIPLE ACCESS SYSTEMS
A.A. Burkov, I.A. Pastushok, Andrey M. Turlikov · Problems of Information Transmission · 2025
Modern communication systems widely use random multiple access (RMA) algorithms based on the ideas of the ALOHA algorithm. An alternative to this approach is to use ideas based on the splitting algorithm, which has a throughput of 0.4877 messages per unit of time, the highest throughput among all known RMA algorithms. The main problem in implementing this algorithm in practice is the need for precise time synchronization of all devices. This paper proposes an RMA algorithm based on the splitting algorithm that is free of this drawback, allowing it to be used in practice in centralized systems.