Performance analysis of ARQ schemes for wireless networks

We present a unified method to compute the exact performance of ARQ schemes for wireless networks. A wireless channel is modeled as a stochastic sequential machine. Accordingly, we propose a channel state ordered representation of the performance provided by an underlying block code. Based on proper...

Full description

Saved in:
Bibliographic Details
Published in1997 IEEE International Conference on Communications Vol. 1; pp. 401 - 405 vol.1
Main Author Zepernick, H.-J.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1997
Subjects
Asynchronous transfer mode
Automatic repeat request
Block codes
Decoding
Delay
Memoryless systems
Performance analysis
Stochastic processes
Throughput
Wireless networks
Online AccessGet full text
ISBN9780780339255
0780339258
DOI10.1109/ICC.1997.605311

Cover

More Information
Summary:We present a unified method to compute the exact performance of ARQ schemes for wireless networks. A wireless channel is modeled as a stochastic sequential machine. Accordingly, we propose a channel state ordered representation of the performance provided by an underlying block code. Based on proper events introduced to assess reliability, throughput, and delay performance of an ARQ scheme, we employ a discrete system model to obtain a matrix description for ARQ schemes used on wireless channels. Then, closed formulae are developed for all examined performance characteristics. Numerical results are given for a wireless ATM system.
ISBN:9780780339255
0780339258
DOI:10.1109/ICC.1997.605311