Abstract
The recent research has established an analogy between successive interference cancellation in slotted ALOHA framework and iterative belief-propagation erasure-decoding, which has opened the possibility to enhance random access protocols by utilizing theory and tools of erasure-correcting codes. In this paper we present a generalization of the and-or tree evaluation, adapted for the asymptotic analysis of the slotted ALOHA-based random-access protocols, for the case when the contending users experience different channel conditions, resulting in packet loss probability that varies across users. We apply the analysis to the example of frameless ALOHA, where users contend on a slot basis. We present results regarding the optimal access probabilities and contention period lengths, such that the throughput and probability of user resolution are maximized.
| Original language | English |
|---|---|
| Title of host publication | 2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings |
| Number of pages | 4 |
| Publisher | IEEE Signal Processing Society |
| Publication date | 1 Dec 2013 |
| Pages | 787-790 |
| Article number | 6737009 |
| ISBN (Print) | 9781479902484 |
| DOIs | |
| Publication status | Published - 1 Dec 2013 |
| Event | 1st IEEE Global Conference on Signal and Information Processing - Austin, TX, United States Duration: 3 Dec 2013 → 5 Dec 2013 http://www.ieeeglobalsip.org/2013/ |
Conference
| Conference | 1st IEEE Global Conference on Signal and Information Processing |
|---|---|
| Country/Territory | United States |
| City | Austin, TX |
| Period | 03/12/2013 → 05/12/2013 |
| Internet address |