DocumentCode
3081040
Title
Graph-Based Random Access for the Collision Channel without Feedback: Capacity Bound
Author
Paolini, Enrico ; Liva, Gianluigi ; Chiani, Marco
Author_Institution
DEIS/WiLAB, Univ. of Bologna, Cesena, Italy
fYear
2011
fDate
5-9 Dec. 2011
Firstpage
1
Lastpage
5
Abstract
A random access scheme for the collision channel without feedback is proposed. The scheme is based on erasure correcting codes for the recovery of packet segments that are lost in collisions, and on successive interference cancellation for resolving collisions. The proposed protocol achieves reliable communication in the asymptotic setting and attains capacities close to 1 [packets/slot]. A capacity bound as a function of the overall rate of the scheme is derived, and code distributions tightly approaching the bound developed.
Keywords
channel capacity; channel coding; error correction codes; graph theory; interference suppression; asymptotic setting; capacity bound; code distributions; collision channel; erasure correcting codes; graph-based random access; packet segments; successive interference cancellation; Block codes; Decoding; Parity check codes; Peer to peer computing; Protocols; Silicon carbide; Tin;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE
Conference_Location
Houston, TX, USA
ISSN
1930-529X
Print_ISBN
978-1-4244-9266-4
Electronic_ISBN
1930-529X
Type
conf
DOI
10.1109/GLOCOM.2011.6134205
Filename
6134205
Link To Document