Poisson multiple-access contention with binary feedback
Nader Mehravari, Thomas Berger · IEEE Transactions on Information Theory · 1984
Communication over a random multiple-access, collision-type, time-slotted, packet-switched channel with binary feedback is considered for a Poisson infinite-user model. Three different types of binary feedback are introduced and confusion resolution algorithms (CRA) are discussed for each. The CRA proposed for the feedback that tells only whether or not there was a collision in the previous slot achieves a throughput of0.442. The CRA proposed for the feedback that tells whether or not the previous slot was empty achieves a throughput of0.279.