We present some recent results on a random access protocol, named Coded Slotted Aloha, where the theory of codes on graphs is used to obtain a random access scheme that does not require retransmissions. The scheme is based on the use of erasure correcting codes for the recovery of packet segments that are lost in collisions, and on successive interference subtraction for resolving collisions. The proposed protocol achieves reliable communication in the asymptotic setting and attains capacities close to 1 packet/slot. Some remarks and results for practical implementation of the access scheme are presented.
M. Chiani, G. Liva, E. Paolini (2012). The Marriage Between Random Access and Codes on Graphs: Coded Slotted Aloha. PISCATAWAY, NJ : IEEE [10.1109/ESTEL.2012.6400191].
The Marriage Between Random Access and Codes on Graphs: Coded Slotted Aloha
CHIANI, MARCO;PAOLINI, ENRICO
2012
Abstract
We present some recent results on a random access protocol, named Coded Slotted Aloha, where the theory of codes on graphs is used to obtain a random access scheme that does not require retransmissions. The scheme is based on the use of erasure correcting codes for the recovery of packet segments that are lost in collisions, and on successive interference subtraction for resolving collisions. The proposed protocol achieves reliable communication in the asymptotic setting and attains capacities close to 1 packet/slot. Some remarks and results for practical implementation of the access scheme are presented.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
