Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access
arXiv:1401.1626 · doi:10.1109/TIT.2015.2492579
Abstract
In this paper, a random access scheme is introduced which relies on the combination of packet erasure correcting codes and successive interference cancellation (SIC). The scheme is named coded slotted ALOHA. A bipartite graph representation of the SIC process, resembling iterative decoding of generalized low-density parity-check codes over the erasure channel, is exploited to optimize the selection probabilities of the component erasure correcting codes via density evolution analysis. The capacity (in packets per slot) of the scheme is then analyzed in the context of the collision channel without feedback. Moreover, a capacity bound is developed and component code distributions tightly approaching the bound are derived.
The final version to appear in IEEE Trans. Inf. Theory. 18 pages, 10 figures
References in corpus (1)
Cited by in corpus (34)
- SPARCs for Unsourced Random Access
- DNN-Aided Block Sparse Bayesian Learning for User Activity Detection and Channel Estimation in Grant-Free Non-Orthogonal Random Access
- Enhancing Contention Resolution ALOHA using Combining Techniques
- Error Floor Analysis of Coded Slotted ALOHA over Packet Erasure Channels
- From 5G to 6G: Has the Time for Modern Random Access Come?
- Intra-Slot Interference Cancellation for Collision Resolution in Irregular Repetition Slotted ALOHA
- On the Impact of Channel Estimation on the Design and Analysis of IRSA based Systems
- Information-Centric Grant-Free Access for IoT Fog Networks: Edge vs Cloud Detection and Learning
- Finite-Length Analysis of Frameless ALOHA
- Distributed Scheduling in Time Dependent Environments: Algorithms and Analysis
- Fixed-Symbol Aided Random Access Scheme for Machine-to-Machine Communications
- Massive Access in Multi-cell Wireless Networks Using Reed-Muller Codes
- Massive Access for Future Wireless Communication Systems
- Exploiting Pilot Mixtures in Coded Random Access
- Irregular Repetition Slotted Aloha with Multipacket Detection: A Density Evolution Analysis
- Optimal Distribution Design for Irregular Repetition Slotted ALOHA with Multi-Packet Reception
- Two-Step Interference Cancellation for Energy Saving in Irregular Repetition Slotted ALOHA
- Identifying Randomly Activated Users via Sign-Compute-Resolve on Graphs
- Fast reinforcement learning for decentralized MAC optimization
- Iterative Collision Resolution for Slotted ALOHA with NOMA for Heterogeneous Devices
- Finite Length Performance of Random Slotted ALOHA Strategies
- Exploiting Device Heterogeneity in Grant-Free Random Access: A Data-Driven Approach
- Breaking the Unit Throughput Barrier in Distributed Systems
- Asynchronous Massive Access in Multi-cell Wireless Networks Using Reed-Muller Codes
- Polar-Slotted ALOHA over Slot Erasure Channels
- Achieving Zero-Error Capacity 1 for a Collision Channel Without Feedback
- A TDMA-like Access Scheme with Splitting Request and Transmission for Vehicular Networks
- Grant-Free Coexistence of Critical and Non-Critical IoT Services in Two-Hop Satellite and Terrestrial Networks
- Random Access for Massive Machine-Type Communications
- Asynchronous Massive Access and Neighbor Discovery Using OFDMA
- Analysis of Performance Parameters in Wireless Networks by using Game Theory for the non Cooperative Slotted Aloha Enhanced by ZigZag Decoding Mechanism
- Unequal Error Protection in Coded Slotted ALOHA
- Sporadic Ultra-Time-Critical Crowd Messaging in V2X
- Random NOMA With Cross-Slot Successive Interference Cancellation Packet Recovery