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.
Graph-Based Random Access for the Collision Channel without Feedback: Capacity Bound / E. Paolini; G. Liva; M. Chiani. - ELETTRONICO. - (2011), pp. 1-5. (Intervento presentato al convegno Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE tenutosi a Houston, TX, USA nel 5-9 December 2011) [10.1109/GLOCOM.2011.6134205].
Graph-Based Random Access for the Collision Channel without Feedback: Capacity Bound
PAOLINI, ENRICO;CHIANI, MARCO
2011
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
