Throughput Analysis of Selective Repeat ARQ in Fading Wireless Channels

Author

Ausavapattanakun, Kamtorn ; Nosratinia, Aria

Author_Institution

Lab. of Multimedia Commun., Texas Univ., Dallas, TX

fYear

2005

fDate

Oct. 28 2005-Nov. 1 2005

Firstpage

41

Lastpage

45

Abstract

This work analyzes the throughput of selective repeat (SR) protocol in fading wireless channels. Hidden Markov models (HMM) provide a good approximation to the fading wireless channel, hut the calculation of SR throughput has been unavailable for channels characterized by HMM. We use a generalization of Mason´s flow graphs with matrix weights for our analysis, leading to the moment generating function of the transmission lime, and thus calculating the throughput. Our methodology is general and can be applied for any finite-state Markov channels. It can also be used to analyze the delay of SR protocol

Keywords

automatic repeat request; fading channels; graph theory; hidden Markov models; matrix algebra; protocols; wireless channels; HMM; fading wireless channels; finite-state Markov channels; flow graphs; hidden Markov models; matrix weights; selective repeat ARQ; selective repeat protocol; throughput analysis; Automatic repeat request; Fading; Feedback; Flow graphs; Hidden Markov models; Markov processes; Multimedia communication; Protocols; Strontium; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Computers, 2005. Conference Record of the Thirty-Ninth Asilomar Conference on

Conference_Location

Pacific Grove, CA

ISSN

1058-6393

Print_ISBN

1-4244-0131-3

Type

conf

DOI

10.1109/ACSSC.2005.1599697

Filename

1599697