Abstract
The random access erasure collision channel captures, in an abstracted manner, several important features of a wireless environment shared by uncoordinated radios. The radios employ random access and, when contending, transmit over independent heterogeneous erasure channels with the common access point. The access point is capable of only receiving a single message at a time, and so any colliding messages are lost. The combined effects of the channel heterogeneity and the collision rule give rise to a natural question: how does the expected sum throughput vary with the subset of radios that are active? The subset of radios achieving the optimal throughput is found by a simple greedy packing procedure — add the radios, sorted by nonerasure probability, until a target offered load is exceeded.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
