Multiple access communication: The finite user population problem
Abstract
The multiple access problem is one of organizing a population of users so that they may efficiently share the resources of a single communication channel. This problem is examined under the modeling assumptions of a finite user population and a time slotted channel with limited feedback. Techniques of schemes for coordinating the transmissions of users are called multiaccess protocols. Simple relationships among common steady state measures of protocol performance (including throughput and average delay) are derived. It is shown that the performance measures are equivalent in the sense that (1) each may be expressed as a simple function of any one of the others and (2) a protocol which is optimal with respect to any one measure is optimal with respect to the others. The derived relationships are also used in the performance analysis of perfect scheduling and TDMA. Four related classes of multiaccess protocols are defined, examined, and an optimal protocol is characterized. The optimization problem is formulated as a Team problem for three classes. Using results from Markov decision theory, optimal window protocols are derived for the cases of two and three users.
 Publication:

Ph.D. Thesis
 Pub Date:
 November 1981
 Bibcode:
 1981PhDT........71H
 Keywords:

 Data Transmission;
 Radio Telemetry;
 Telecommunication;
 Time Division Multiple Access;
 Markov Processes;
 Optimization;
 User Requirements;
 Windows (Intervals);
 Communications and Radar