Limited sensing random multiple access using binary feedback

The authors consider the random-accessing problem of a single, collision-type, slotted, packet-switched communication channel by a large number of independent, data transmitting bursty users. They propose and analyze an easy-to-implement algorithm under the realistic assumption that each user inspects the channel outcome feedback only whenever he is blocked. Assumed is binary feedback which informs the users only about whether or not there was a collision in the previous slot. It is shown that the algorithm results in finite average delays for transmission at rates less than 0.36 packets per channel slot, and an exact upper bound for the average delay is given.