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.

E. Paolini, G. Liva, M. Chiani (2011). Graph-Based Random Access for the Collision Channel without Feedback: Capacity Bound. PISCATAWAY, NJ : IEEE [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.
2011
Proceedings of the 2011 IEEE Global Telecommunications Conference
1
5
E. Paolini, G. Liva, M. Chiani (2011). Graph-Based Random Access for the Collision Channel without Feedback: Capacity Bound. PISCATAWAY, NJ : IEEE [10.1109/GLOCOM.2011.6134205].
E. Paolini; G. Liva; M. Chiani
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/112327
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 38
  • ???jsp.display-item.citation.isi??? 1
social impact