A 0.485 Throughput Randomized Part-and-Try Algorithm

Among known random multiple access (RMA) algorithms, the part-and-try (splitting) algorithm demonstrates the highest throughput. However, its implementation in cellular random access channels is challenging, since the correct operation of the algorithm requires absolute time synchronization among all users to uniquely identify events in a Poisson arrival process. In this paper, we propose a modified RMA algorithm based on the principles of the part-and-try algorithm, in which the introduction of randomization eliminates the need for temporal event identification. This modification enables the algorithm to be implemented in practical random access systems. The achieved throughput of the algorithm is $0.485$ .