Random-access communication with multiple reception
- 1 May 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 36 (3) , 614-622
- https://doi.org/10.1109/18.54879
Abstract
Communication over a random multiple-access (RMA) broadcast channel with multiple reception capability is considered. Multiple reception refers to the assumption that a collision is defined as the simultaneous transmission of more than d packets, where d ⩾2. In most previous studies of RMA channels, it was assumed that d=1, that is, whenever more than one source tries to use the same slot, a collision occurs, and all the messages involved must be retransmitted. In practice, however, it might be possible to construct RMA systems where simultaneous transmission of d or fewer packets, where d⩾2, is successful. In this work, the author presents conflict resolution algorithms and determine lower bounds to the capacity of such RMA channels for many different feedback models. It is shown that the packet transmission rates (throughput) reported previously can be achieved under much less restricted feedback modelsKeywords
This publication has 8 references indexed in Scilit:
- Stability properties of slotted Aloha with multipacket reception capabilityIEEE Transactions on Automatic Control, 1988
- On Poisson contention resolution problem with feedback based on conflict intensityIEEE Transactions on Communications, 1988
- Poisson multiple-access contention with binary feedbackIEEE Transactions on Information Theory, 1984
- Random Multiple-Access Communication and Group TestingIEEE Transactions on Communications, 1984
- A Collision Resolution Protocol for Random Access Channels with Energy DetectorsIEEE Transactions on Communications, 1982
- Decentralized dynamic control of a multiaccess broadcast channelIEEE Transactions on Automatic Control, 1982
- Performance Analysis of Random Access Packet-Switched Code Division Multiple Access SystemsIEEE Transactions on Communications, 1981
- Tree algorithms for packet broadcast channelsIEEE Transactions on Information Theory, 1979