Journal:Informatica
Volume 5, Issues 3-4 (1994), pp. 364–372
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).
Journal:Informatica
Volume 4, Issues 1-2 (1993), pp. 163–171
Abstract
We consider finite population slotted ALOHA where each of n terminals may have its own transmission probability pi. Given the traffic load λ, throughput is maximized via a constrained optimization problem. The results of Abramson (1985) are obtained as special case.