Random Multiple Access in a Channel with Binary “Success – No Success” Feedback

We consider a random multiple access (RMA) algorithm for packets in a binary feedback channel. Through “success – no success” feedback, all stations learn if one of the following situations occurred in the channel: (a) a single packet was transmitted in the current window (success) or (b) no packets were transmitted or more than one packet was transmitted (no success). An RMA algorithm is proposed with rate $1/e=0.367$. Previously known algorithms had rates not exceeding 0.329. The algorithm is generalized to the case of “empty – not empty” binary feedback.