TDMA in a random-access environment - An overview

The basic forms of random accessing problems encountered in designing computer communications networks are explored in terms of the Bernoulli finite user model. The problems are classified according to the available channel feedback random variable values. Three feedbacks are possible: conflict/no conflict, something/nothing, and success/failure. Algorithms governing each condition are discussed, noting that the feedback can be interpreted in terms of the conflict intensity. The most effective algorithms are shown to be readily adaptable to TDMA in the presence of heavy traffic.