On channel access probabilities which maximize throughput of slotted ALOHA
Volume 5, Issues 3-4 (1994), pp. 364–372
Pub. online: 1 January 1994
Type: Research Article
Published
1 January 1994
1 January 1994
Abstract
We consider finite population slotted ALOHA where each of n terminals has its own transmission probability pi. Given the overall traffic load λ, the probabilities pi are determined in such a way as to maximize throughput. This is achieved by solving a constrained optimization problem. The results of Abramson (1970) are obtained as a special case. Our recent results are improved (Mathar and Žilinskas, 1993).