DocumentCode :
302380
Title :
Bounds on the throughput performance of ARQ selective-repeat protocol in Markov channels
Author :
Zorzi, Michele ; Rao, Ramesh R.
Author_Institution :
Dipartimento di Elettronica, Politecnico di Milano, Italy
Volume :
2
fYear :
1996
fDate :
23-27 Jun 1996
Firstpage :
782
Abstract :
In this paper, we consider the ARQ selective repeat protocol with time-out mechanism, in the presence of Markovian errors on both the forward and the feedback communication channels. Renewal theory is used in order to find performance bounds for the protocol. This technique makes it possible to overcome the computational complexity of an exact analytical approach. Simulation results, that confirm the analysis and document the accuracy of the bounds are also presented. An application to mobile radio is also discussed
Keywords :
Markov processes; automatic repeat request; channel capacity; computational complexity; error correction; land mobile radio; protocols; telecommunication channels; ARQ selective-repeat protocol; Markov channels; Markovian errors; computational complexity; feedback communication channel; forward communication channels; mobile radio; performance bounds; renewal theory; throughput performance; time-out mechanism; Automatic repeat request; Computational complexity; Electronic mail; Fading; Feedback; Land mobile radio; Performance analysis; Protocols; Strontium; Throughput;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 1996. ICC '96, Conference Record, Converging Technologies for Tomorrow's Applications. 1996 IEEE International Conference on
Conference_Location :
Dallas, TX
Print_ISBN :
0-7803-3250-4
Type :
conf
DOI :
10.1109/ICC.1996.541287
Filename :
541287
Link To Document :
بازگشت