Title :
Random access systems with a time varying channel
Author :
Ho, Kelvin K Y ; Rao, Ramesh R. ; Wolf, Jack Keil
Author_Institution :
AT&T Bell Lab., Holmdel, NJ, USA
Abstract :
A random multiple-access system which uses a collision resolution algorithm for accessing a common time-varying channel is considered. The channel is assumed to be in one of two states. In each state the channel is characterized by a general discrete memoryless channel, and the transitions between the two states are assumed to be Markovian. A set of sufficient conditions for the ergodicity (stability) of the system is established. As an example, the case when the Capetanakis tree algorithm operates with a time-varying noisy channel is examined. The stability of this system is analyzed and the throughput is evaluated
Keywords :
Markov processes; multi-access systems; stability; telecommunication channels; trees (mathematics); Capetanakis tree algorithm; Markovian; collision resolution algorithm; common time-varying channel; ergodicity; general discrete memoryless channel; multiple-access system; random access systems; stability; time varying channel; time-varying noisy channel; Computer errors; Kelvin; Memoryless systems; Probability; Stability analysis; Statistical analysis; Statistics; Sufficient conditions; Throughput; Time varying systems;
Conference_Titel :
INFOCOM '89. Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies. Technology: Emerging or Converging, IEEE
Conference_Location :
Ottawa, Ont.
Print_ISBN :
0-8186-1920-1
DOI :
10.1109/INFCOM.1989.101568
