Abstract
In this paper, a modified form of the ARQ selective repeat protocol with timer control is studied. Transmissions on both the forward and the reverse channels are assumed to experience Markovian errors and therefore the feedback is unreliable. Feedback error recovery is made possible through the use of time diversity. Using results from renewal theory, exact results for the throughput of the protocol are evaluated. In order to overcome the complexity of the exact analytical technique, lower and upper bounds are developed. Simulation results, that confirm the analysis and document the tightness of the bounds are also shown, and a number of implementation issues are discussed. An application to mobile radio is also presented. It is shown that the use of an appropriate degree of time diversity makes it possible to approach the ideal protocol performance obtained with perfect feedback.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Lin, D.J. Costello Jr. and M.J. Miller, Automatic-repeat-request error control schemes, IEEE Commun. Mag. 22 (1984) 5–17.
A.S. Tanenbaum,Computer Networks, 2nd Ed. (Prentice Hall, Englewood Cliffs, 1988).
E.N. Gilbert, Capacity of a burst-noise channel, Bell System Tech. J. 39 (1960) 1253–1266.
L.N. Kanal and A.R.K. Sastry, Models for channels with memory and their applications to error control, Proc. IEEE 66 (1978) 724–744.
D. Towsley, A statistical analysis of ARQ protocols operating in a nonindependent error environment, IEEE Trans. Commun. COM 29 (1981) 971–981.
D.L. Lu and J.F. Chang, Performance of ARQ protocols in nonindependent channel errors, IEEE Trans. Commun. COM 41 (1993) 721–730.
S.R. Kim and C.K. Un, Throughput analysis for two ARQ schemes using combined transition matrix, IEEE Trans. Commun. COM 40 (1992) 1679–1683.
Y.J. Cho and C.K. Un, Performance analysis of ARQ error controls under Markovian block error pattern, IEEE Trans. Commun. COM 42 (1994) 2051–2061.
M. Zorzi and R.R. Rao, Throughput analysis of ARQ Go-Back-N protocol in Markov channels with unreliable feedback,Proc. IEEE ICC'95 (1995) pp. 1232–1237.
L.F. Chang, Throughput estimation of ARQ protocols for a Rayleigh fading channel using fade- and interfade-duration statistics, IEEE Trans. Veh. Tech. VT 40 (1991) 223–229.
J.C.-J. Chuang, Comparison of two ARQ protocols in a Rayleigh fading channel, IEEE Trans. Veh. Tech. VT 39 (1990) 367–373.
M.J. Miller and S. Lin, The analysis of some selective-repeat ARQ schemes with finite receiver buffer, IEEE Trans. Commun. COM 29 (1981) 1307–1315.
E.J. Weldon Jr., An improved selective-repeat ARQ strategy, IEEE Trans. Commun. COM 30 (1982) 480–486.
N. Shacham, Queueing analysis of a selective-repeat ARQ schemes with finite receiver buffer,Proc. IEEE INFOCOM'87 (1987) 512–520.
J.F. Chang and T.H. Yang, End-to-end delay of an adaptive selective repeat ARQ protocol, IEEE Trans. Commun. COM 42 (1994) 2926–2928.
S.H. Ross,Stochastic Processes (Wiley, New York, 1983).
R.A. Howard,Dynamic Probabilistic Systems (Wiley, New York, 1971).
M. Zorzi, R.R. Rao and L.B. Milstein, On the accuracy of a first-order Markov model for data block transmission on fading channels,Proc IEEE ICUPC'95 (1995) pp. 211–215.
W.C. Jakes, Jr.,Microwave Mobile Communications (Wiley, New York, 1974).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zorzi, M., Rao, R.R. Throughput of selective-repeat ARQ with time diversity in Markov channels with unreliable feedback. Wireless Netw 2, 63–75 (1996). https://doi.org/10.1007/BF01201462
Issue Date:
DOI: https://doi.org/10.1007/BF01201462