Random access on graphs: A survey and new results

This paper overviews the recently proposed coded slotted ALOHA (CSA) random access scheme and illustrates some new results in this area. In CSA, a randomly picked linear block code is employed by each user to encode segments of its bursts prior to transmission, where the choice of the code is performed with no coordination with the other users. On the receiver side iterative interference cancellation combined with decoding of the local codes is performed to recover from collisions. This process may be represented as an iterative decoding algorithm over a sparse bipartite graph.