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

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

2012-01-09

arxiv.org/abs/1201.1835v1

Computer Science

Information Theory

in Proc. IEEE Globecom 2011, Houston, TX

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Graph-Based Random Access for the Collision Channel without Feedback: Capacity Bound does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graph-Based Random Access for the Collision Channel without Feedback: Capacity Bound, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph-Based Random Access for the Collision Channel without Feedback: Capacity Bound will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-643656