.png){kind=icon}
Return
Coded Random Access: Applying Codes on Graphs to Design Random Access Protocols
.png){kind=icon}
OA
AI
DOI：10.1109/MCOM.2015.7120031.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The rise of machine-to-machine communications has rekindled 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 able 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 a 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.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.2
Papers:
6.9K
Citations:
2.2W
Organization
View more organizations
Cited Papers
Three-dimensional printing of models for surgical planning in patients with primary cardiac tumorsOAAI
OAAIShareSave
ShareSaveShareSaveShareSaveThe ‘White-eyed’ Orbital Blowout Fracture: An Easily Overlooked Injury in Maxillofacial Trauma.png)
CureusOAAI
CureusIF0
OAAIShareSaveShareSave View more