Abstract
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 of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0.442</tex> . The CRA proposed for the feedback that tells whether or not the previous slot was empty achieves a throughput of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0.279</tex> .
Sign-in/Register to access full text options 
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 call
