Maximizing throughput of finite population slotted ALOHA


R. Mathar, A. Zilinskas,


        We consider finite population slotted ALOHA where each of n terminals may have its own transmission probability p_i. Given the traffic load lambda, throughput is maximized via a constrained optimization problem. The results of Abramson (1985) are obtained as special case.

BibTEX Reference Entry 

	author = {Rudolf Mathar and Antanas Zilinskas},
	title = "Maximizing throughput of finite population slotted {ALOHA}",
	pages = "163-171",
	journal = "Informatica",
	volume = "4",
	number = "1/2",
	year = 1993,
	hsb = RWTH-CONV-223128,


 Download bibtex-file

Sorry, this paper is currently not available for download.