Coded Random Access: Applying Codes on Graphs to Design Random Access Protocols
arXiv:1405.4127 · doi:10.1109/MCOM.2015.7120031
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 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.
12 pages, 4 figures, IEEE Communications Magazine, Volume 53, Issue 6, June 2015
Cited by in corpus (28)
- Sparse Signal Processing for Grant-Free Massive Connectivity: A Future Paradigm for Random Access Protocols in the Internet of Things
- A Random Access Protocol for Pilot Allocation in Crowded Massive MIMO Systems
- Code Design for Short Blocks: A Survey
- Six Key Enablers for Machine Type Communication in 6G
- From 5G to 6G: Has the Time for Modern Random Access Come?
- Joint Source-Channel Coding for Semantics-Aware Grant-Free Radio Access in IoT Fog Networks
- Poisson Receivers: a Probabilistic Framework for Analyzing Coded Random Access
- ALOHA Receivers: a Network Calculus Approach for Analyzing Coded Multiple Access with SIC
- Modern Random Access for Beyond-5G Systems: a Multiple-Relay ALOHA Perspective
- Grant-Free Massive NOMA: Outage Probability and Throughput
- Exploiting Pilot Mixtures in Coded Random Access
- Massive Access for Future Wireless Communication Systems
- Network-Coded Multiple Access with High-order Modulations
- Uplink Grant-Free Random Access Solutions for URLLC services in 5G New Radio
- Identifying Randomly Activated Users via Sign-Compute-Resolve on Graphs
- Rate Selection and Power Adaptation using Maximal Ratio Combining for the Random Access Gaussian Channel
- Efficient Error-Correcting Codes in the Short Blocklength Regime
- Polar-Slotted ALOHA over Slot Erasure Channels
- Random Multiple Access for M2M Communications with QoS Guarantees
- Multiuser Rate-Diverse Network-Coded Multiple Access
- On the required radio resources for ultra-reliable communication in highly interfered scenarios
- Maximum Sum Rate of Slotted Aloha with Successive Interference Cancellation
- Probabilistic Handshake in All-to-all Broadcast Coded Slotted ALOHA
- Random Access for Massive Machine-Type Communications
- Practical Power-Balanced Non-Orthogonal Multiple Access
- A Pseudo-Bayesian Approach to Sign-Compute-Resolve Slotted ALOHA
- Finite-Length Analysis of Frameless ALOHA with Multi-User Detection
- Sparse Signatures with Forward Error Correction Coding for Non-Orthogonal Massive Access