Random multiple access algorithms using a control mini-slot
Demetrios Kazakos, Lazaros F. Merakos, H. Deliç · IEEE Transactions on Computers · 1997
The multiple access problem as characterized by infinite user population and a slotted-time channel is examined, and an algorithm that utilizes a control mini-slot is proposed. The stability region of the proposed algorithm is determined and compared to the random access algorithm with the highest known throughput. A break-even point is also given.