INFORMATICAInformatica0868-49520868-4952VUINF53-40710.3233/INF-1994-53-407Research articleOn channel access probabilities which maximize throughput of slotted ALOHAMatharRudolfŽilinskasAntanasAachen University of Technology, Aachen, Wuellnerstrasse 3, GermanyInstitute of Mathematics and Informatics, 2600 Vilnius, Goštauto St. 12, Lithuania0101199453-4364372

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).