Resumé
receiver (e.g., base station) is capable to store the collision slots and use them in a transmission recovery process based on successive interference cancellation, the design space for access protocols is radically expanded. We present the paradigm of coded random access, in which the structure of the access protocol can be mapped to
a structure of an erasure-correcting code defined on graph. This opens the possibility to use coding theory and tools for designing efficient random access protocols, offering markedly better performance than ALOHA. Several instances of coded random access protocols are described, as well as a case study on how to upgrade a legacy
ALOHA system using the ideas of coded random access.
| Originalsprog | Engelsk |
|---|---|
| Tidsskrift | I E E E Communications Magazine |
| Vol/bind | 53 |
| Udgave nummer | 6 |
| Sider (fra-til) | 144 - 150 |
| ISSN | 0163-6804 |
| DOI | |
| Status | Udgivet - jun. 2015 |
Fingerprint
Citer dette
}
Coded Random Access : Applying Codes on Graphs to Design Random Access Protocols. / Paolini, Enrico; Stefanovic, Cedomir; Liva, Gianluigi; Popovski, Petar.
I: I E E E Communications Magazine, Bind 53, Nr. 6, 06.2015, s. 144 - 150.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review
TY - JOUR
T1 - Coded Random Access
T2 - Applying Codes on Graphs to Design Random Access Protocols
AU - Paolini, Enrico
AU - Stefanovic, Cedomir
AU - Liva, Gianluigi
AU - Popovski, Petar
PY - 2015/6
Y1 - 2015/6
N2 - The rise of machine-to-machine communications has rekindled the interest in random access protocols as a support for a massive number of uncoordinatedly transmitting devices. The legacy ALOHA approach is developed under a collision model, where slots containing collided packets are considered as waste. However, if the commonreceiver (e.g., base station) is capable to store the collision slots and use them in a transmission recovery process based on successive interference cancellation, the design space for access protocols is radically expanded. We present the paradigm of coded random access, in which the structure of the access protocol can be mapped toa structure of an erasure-correcting code defined on graph. This opens the possibility to use coding theory and tools for designing efficient random access protocols, offering markedly better performance than ALOHA. Several instances of coded random access protocols are described, as well as a case study on how to upgrade a legacyALOHA system using the ideas of coded random access.
AB - The rise of machine-to-machine communications has rekindled the interest in random access protocols as a support for a massive number of uncoordinatedly transmitting devices. The legacy ALOHA approach is developed under a collision model, where slots containing collided packets are considered as waste. However, if the commonreceiver (e.g., base station) is capable to store the collision slots and use them in a transmission recovery process based on successive interference cancellation, the design space for access protocols is radically expanded. We present the paradigm of coded random access, in which the structure of the access protocol can be mapped toa structure of an erasure-correcting code defined on graph. This opens the possibility to use coding theory and tools for designing efficient random access protocols, offering markedly better performance than ALOHA. Several instances of coded random access protocols are described, as well as a case study on how to upgrade a legacyALOHA system using the ideas of coded random access.
KW - random access, coded slotted ALOHA, successive interference cancellation
U2 - 10.1109/MCOM.2015.7120031
DO - 10.1109/MCOM.2015.7120031
M3 - Journal article
VL - 53
SP - 144
EP - 150
JO - I E E E Communications Magazine
JF - I E E E Communications Magazine
SN - 0163-6804
IS - 6
ER -