Graph-Based Random Access for the Collision Channel without Feedback: Capacity Bound

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.

in Proc. IEEE Globecom 2011, Houston, TX

References in corpus (1)

• High Throughput Random Access via Codes on Graphs: Coded Slotted ALOHA

Cited by in corpus (6)

• Coded Random Access: Applying Codes on Graphs to Design Random Access Protocols
• Frameless ALOHA Protocol for Wireless Networks
• Exploiting Capture Effect in Frameless ALOHA for Massive Wireless Random Access
• Poisson Receivers: a Probabilistic Framework for Analyzing Coded Random Access
• On the Stability Regions of Coded Poisson Receivers with Multiple Classes of Users and Receivers
• A Mathematical Theory for Learning Semantic Languages by Abstract Learners