Graph-Based Analysis and Optimization of Contention Resolution Diversity Slotted ALOHA

Contention resolution diversity slotted ALOHA (CRDSA) is a simple but effective improvement of slotted ALOHA. CRDSA relies on MAC bursts repetition and on interference cancellation (IC), achieving a peak throughput T ≅ 0.55, whereas for slotted ALOHA T ≅ 0.37. In this paper we show that the IC process of CRDSA can be conveniently described by a bipartite graph, establishing a bridge between the IC process and the iterative erasure decoding of graph-based codes. Exploiting this analogy, we show how a high throughput can be achieved by selecting variable burst repetition rates according to given probability distributions, leading to irregular graphs. A framework for the probability distribution optimization is provided. Based on that, we propose a novel scheme, named irregular repetition slotted ALOHA, that can achieve a throughput T ≅ 0.97 for large frames and near to T ≅ 0.8 in practical implementations, resulting in a gain of ~ 45% w.r.t. CRDSA. An analysis of the normalized efficiency is introduced, allowing performance comparisons under the constraint of equal average transmission power. Simulation results, including an IC mechanism described in the paper, substantiate the validity of the analysis and confirm the high efficiency of the proposed approach down to a signal-to-noise ratio as a low as E
_b
/N
₀
=2 dB.