Maximizing throughput of finite population slotted ALOHA
Volume 4, Issues 1-2 (1993), pp. 163–171
Pub. online: 1 January 1993
Type: Research Article
This paper was written while the second author was a visiting Professor at Aachen University of Technology, granted by the Deutsche Forschungsgemeinschaft.
Published
1 January 1993
1 January 1993
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.