DocumentCode
586472
Title
The marriage between random access and codes on graphs: Coded Slotted Aloha
Author
Chiani, Marco ; Liva, Gianluigi ; Paolini, Enrico
Author_Institution
DEI, Univ. of Bologna, Bologna, Italy
fYear
2012
fDate
2-5 Oct. 2012
Firstpage
1
Lastpage
6
Abstract
We present some recent results on a scheme, named Coded Slotted Aloha, where the theory of codes on graphs is used to obtain a random access protocol 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.
Keywords
access protocols; codes; graph theory; interference; asymptotic setting; coded slotted Aloha; erasure correcting code; graph; packet segment recovery; random access protocol; successive interference subtraction; Equations; Interference; Iterative decoding; Throughput; Tin;
fLanguage
English
Publisher
ieee
Conference_Titel
Satellite Telecommunications (ESTEL), 2012 IEEE First AESS European Conference on
Conference_Location
Rome
Print_ISBN
978-1-4673-4687-0
Electronic_ISBN
978-1-4673-4686-3
Type
conf
DOI
10.1109/ESTEL.2012.6400191
Filename
6400191
Link To Document