Erasure, capture, and random power level selection in multiple-access systems

Multiple-access algorithms that handle erasures as well as captures are introduced. The algorithms are evaluated according to the maximal throughput that they can support for a Poisson arrival process. An example is given which shows that, in practice, the positive effect of captures compensates the negative effect of erasures. An approach that effectively utilizes the capture phenomena is introduced. This approach incorporates a random power-level-selection scheme that allows each node to choose randomly to transmit in one of several allowable levels of power. Design issues such as number of levels, selection schemes, etc. are discussed.<>