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., Whippany, NJ, USA
fDate :
9/1/1990 12:00:00 AM
Abstract :
A random multiple-access system which employs 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; Capetanakis tree algorithm; Markovian transitions; collision resolution algorithm; discrete memoryless channel; ergodicity; noisy channel; random multiple-access system; stability; throughput; time varying channel; Computer errors; Kelvin; Memoryless systems; Stability analysis; Statistical analysis; Statistics; Sufficient conditions; Throughput; Time varying systems; Time-varying channels;
Journal_Title :
Communications, IEEE Transactions on
