Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access

By Enrico Paolini, Gianluigi Liva, Marco Chiani. IEEE Transactions on Information Theory, 2014

343 citations recorded by the source corpus.

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 through a 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.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering, Molecular Biology

View Paper: https://www.semanticscholar.org/paper/7615ea346cbe0c549a7761b05950f88d711ca535