Dovelos, K;
Toni, L;
Frossard, P;
(2017)
Finite Length Performance of Random Slotted ALOHA Strategies.
arXiv
, Article arXiv:1607.02385 [cs.IT].
Preview |
Text
Toni_1607.02385v1.pdf - Accepted Version Download (135kB) | Preview |
Abstract
Multiple connected devices sharing common wireless resources might create interference if they access the channel simultaneously. Medium access control (MAC) protocols gener- ally regulate the access of the devices to the shared channel to limit signal interference. In particular, irregular repetition slotted ALOHA (IRSA) techniques can achieve high-throughput performance when interference cancellation methods are adopted to recover from collisions. In this work, we study the finite length performance for IRSA schemes by building on the analogy between successive interference cancellation and iterative belief- propagation on erasure channels. We use a novel combinatorial derivation based on the matrix-occupancy theory to compute the error probability and we validate our method with simulation results.
| Type: | Article |
|---|---|
| Title: | Finite Length Performance of Random Slotted ALOHA Strategies |
| Open access status: | An open access version is available from UCL Discovery |
| Publisher version: | https://arxiv.org/abs/1607.02385 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| Keywords: | cs.IT, cs.IT, math.IT |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Electronic and Electrical Eng |
| URI: | https://discovery.ucl.ac.uk/id/eprint/1533116 |
Archive Staff Only
 |
View Item |
