On channel access probabilities which maximize throughput of slotted ALOHA

Abstract

We consider finite population slotted ALOHA where each of n terminals has its own transmission probability p_i. Given the overall traffic load λ, the probabilities p_i 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).