Performance analysis of reservation random access protocols for wireless access networks

A key issue in future wireless access networks is the design of multiaccess protocols that enable dispersed voice and data terminals to efficiently share the terminal-to-base radio channel. A promising class of multiaccess protocols for wireless access is that of reservation random access (RRA) protocols, in which voice talkspurt packets and data packets are statistically multiplexed over TDMA frames. Voice terminals obtain reservations for their talkspurts using a random access protocol. An analysis method for evaluating the performance of a class of RRA protocols is developed. The method is based on a Markovian model, whose stationary solution is obtained via an iterative computational procedure based on matrix decomposition techniques. Subject to a maximum delay constraint, the voice packet dropping rate and distribution of the number of packets dropped from a talkspurt are evaluated for three RRA protocol examples, and comparisons are made with the performance of an ideal hypothetical multiplexer. The transient performance of RRA protocols is evaluated by simulating their response to sudden changes in the number of active voice terminals. Finally, suggestions for the design of integrated voice/data RRA protocols are made. >

[1]  David J. Goodman,et al.  Performance of PRMA: a packet voice protocol for cellular systems , 1991 .

[2]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

[3]  David J. Goodman,et al.  Cellular packet communications , 1990, IEEE Trans. Commun..

[4]  Panayota Papantoni-Kazakos,et al.  A random-access algorithm for data networks carrying high-priority traffic , 1992, IEEE Trans. Commun..

[5]  D. Kazakos,et al.  On Retransmission Control Policies in Multiaccess Channels. , 1982 .

[6]  John Capetanakis,et al.  Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.

[7]  P. Courtois,et al.  Block iterative algorithms for stochastic matrices , 1986 .

[8]  W. Stewart,et al.  ITERATIVE METHODS FOR COMPUTING STATIONARY DISTRIBUTIONS OF NEARLY COMPLETELY DECOMPOSABLE MARKOV CHAINS , 1984 .

[9]  D. Kazakos,et al.  On retransmission control policies in multiple-access communication networks , 1985, IEEE Transactions on Automatic Control.

[10]  P. Papantoni-Kazakos,et al.  Interconnection algorithms in multi-hop packet radio topologies , 1988, Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings.

[11]  Lazaros Merakos,et al.  Performance analysis of reservation random access protocols for cellular packet communications , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[12]  Panayota Papantoni-Kazakos.  Multiple-access algorithms for a system with mixed traffic: high and low priority , 1992, IEEE Trans. Commun..