identify the user with the highest channel gain. OSA is a distributed medium access control protocol that uses ternary feedback to identify the user with the best channel with a constant overhead. A time slot is assumed to comprise of a maximum of $K$ minislots which are used for contention resolution. In every minislot, OSA describes a continuous range in $[0,1]$ (the sample space of the Uniform random variable), $(y_{min}, y_{max}] \subset [0,1]$; only the user(s) whose channel gain values fall within the range will transmit contention resolution packets in the minislot. At the end of the minislot, every user receives a feedback from the base station of $0$ or $1$ or $e$, indicating if the minislot was idle (no transmission), contained a successful packet transmission or involved an error due to collision, respectively. If the feedback is $1$, the lone transmitter is declared the winner of the contention and is permitted to transmit data for the remaining duration of the slot. If the feedback is $0$ or $e$, then the range is suitably adjusted and the contention resolution process continues until either a success occurs or the time-slot ends.

The following pseudo-code describes the OSA algorithm for a fixed 