Analytic properties of multiple-access trees
Abstract
A potentially infinite population of terminals is considered, of which a random number X seek reserved access to a slotted, broadcast, random-access channel. The reservation protocol is a tree search with collision detection. The time slots are assumed to be organized in nonoverlapping frames of k consecutive slots each, and the channel feedback is assumed to be available only at frame (as opposed to slot) boundaries. Control is exercised by varying the nodal degree at the root of the search tree according to the distribution p of X. Optimal control, and the duration of the reservation set-up time, are studied as functions of k and p.
- Publication:
-
IEEE Transactions on Information Theory
- Pub Date:
- March 1985
- Bibcode:
- 1985ITIT...31..255K
- Keywords:
-
- Channels (Data Transmission);
- Communication Theory;
- Multiple Access;
- Random Access;
- Trees (Mathematics);
- Optimal Control;
- Poisson Density Functions;
- Searching;
- Communications and Radar