The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—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.</p>
Dimitri Kazakos, Hakan Deliç, Lazaros F. Merakos, "Random Multiple Access Algorithms Using a Control Mini-Slot", IEEE Transactions on Computers, vol. 46, no. , pp. 473-476, April 1997, doi:10.1109/12.588061
93 ms
(Ver 3.3 (11022016))