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.
Get full access to this article
View all access options for this article.