Error Floor Analysis of Coded Slotted ALOHA over Packet Erasure Channels
arXiv:1412.2888 · doi:10.1109/LCOMM.2014.2385073
Abstract
We present a framework for the analysis of the error floor of coded slotted ALOHA (CSA) for finite frame lengths over the packet erasure channel. The error floor is caused by stopping sets in the corresponding bipartite graph, whose enumeration is, in general, not a trivial problem. We therefore identify the most dominant stopping sets for the distributions of practical interest. The derived analytical expressions allow us to accurately predict the error floor at low to moderate channel loads and characterize the unequal error protection inherent in CSA.
References in corpus (2)
Cited by in corpus (9)
- Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access
- Enhancing Contention Resolution ALOHA using Combining Techniques
- Irregular Repetition Slotted Aloha with Multipacket Detection: A Density Evolution Analysis
- All-to-all Broadcast for Vehicular Networks Based on Coded Slotted ALOHA
- Modern Random Access for Satellite Communications
- Two-Step Interference Cancellation for Energy Saving in Irregular Repetition Slotted ALOHA
- Iterative Collision Resolution for Slotted ALOHA with NOMA for Heterogeneous Devices
- Polar-Slotted ALOHA over Slot Erasure Channels
- Random Access for Massive Machine-Type Communications