Throughput analysis of the ideal window stabilized ALOHA
Jesús Alcober, V. Casares · 2002
We consider the problem of random access communications over a time slotted channel with feedback of infinitely multiplicity, i.e., users know via feedback the number of users involved in that collision. For the above problem we propose and analyze a simple full feedback sensing window random access algorithm, the ideal window stabilized ALOHA (IWSA). The throughput of the algorithm is 0.5052 packets/slot. The IWSA algorithm achieves a lower maximum stable throughput.