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

TL;DR

This paper introduces a graph-based random access protocol for collision channels without feedback, utilizing erasure codes and interference cancellation to approach channel capacity.

Contribution

It presents a novel protocol combining erasure coding and interference cancellation, deriving a capacity bound and designing code distributions that closely approach this theoretical limit.

Findings

Achieves reliable communication near capacity in asymptotic regimes

Derives a capacity bound as a function of scheme rate

Designs code distributions that approach the 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.