Coded Random Access: Applying Codes on Graphs to Design Random Access Protocols

Enrico Paolini, Cedomir Stefanovic, Gianluigi Liva, Petar Popovski

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

89 Citationer (Scopus)

Resumé

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 common
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.
OriginalsprogEngelsk
TidsskriftI E E E Communications Magazine
Vol/bind53
Udgave nummer6
Sider (fra-til)144 - 150
ISSN0163-6804
DOI
StatusUdgivet - jun. 2015

Fingerprint

Base stations
Recovery
Machine-to-machine communication

Citer dette

@article{a7d3cab49a514d98b44b85c26c2769d6,
title = "Coded Random Access: Applying Codes on Graphs to Design Random Access Protocols",
abstract = "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.",
keywords = "random access, coded slotted ALOHA, successive interference cancellation",
author = "Enrico Paolini and Cedomir Stefanovic and Gianluigi Liva and Petar Popovski",
year = "2015",
month = "6",
doi = "10.1109/MCOM.2015.7120031",
language = "English",
volume = "53",
pages = "144 -- 150",
journal = "I E E E Communications Magazine",
issn = "0163-6804",
publisher = "IEEE",
number = "6",

}

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 tidsskriftTidsskriftartikelForskningpeer 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 -