On tractable wireless channel models

We present techniques to capture the behavior of realistic channels with mathematically tractable models, We examine different state-space aggregation techniques to reduce a large number of states of Markov chain to a fewer number of states, The property of strong and weak lumpability is discussed and the stochastic bounding techniques are examined. These techniques are applied to three different types of previously published channel models for mobile VHF, wireless indoor, and Rayleigh fading channels. Results show that our stochastic bounding technique can produce a simpler yet still accurate upper bound the for original channel model. We find that the bounds perform well when the higher-layer error control protocols such as stop-and-go and TCP are considered.

[1]  H. C. Ferreira,et al.  Markov characterization of digital fading mobile VHF channels , 1994 .

[2]  Bruce D. Fritchman,et al.  A binary channel characterization using partitioned Markov chains , 1967, IEEE Trans. Inf. Theory.

[3]  E. Gilbert Capacity of a burst-noise channel , 1960 .

[4]  Gerardo Rubino,et al.  ON WEAK LUMPABILITY IN MARKOV CHAINS , 1989 .

[5]  Jack Hachigian Collapsed Markov Chains and the Chapman-Kolmogorov Equation , 1963 .

[6]  A.R.K. Sastry,et al.  Models for channels with memory and their applications to error control , 1978, Proceedings of the IEEE.

[7]  Hong Shen Wang,et al.  Finite-state Markov channel-a useful model for radio communication channels , 1995 .

[8]  G. Rubino,et al.  A finite characterization of weak lumpable Markov processes. Part I: The discrete time case , 1991 .

[9]  Douglas R. Miller Almost Sure Comparisons of Renewal Processes and Poisson Processes, with Application to Reliability Theory , 1979, Math. Oper. Res..

[10]  M. Rosenblatt,et al.  A MARKOVIAN FUNCTION OF A MARKOV CHAIN , 1958 .

[11]  L. B. Milstein,et al.  On the accuracy of a first-order Markov model for data transmission on fading channels , 1995, Proceedings of ICUPC '95 - 4th IEEE International Conference on Universal Personal Communications.

[12]  G. Rubino,et al.  Sojourn times in finite Markov processes , 1989, Journal of Applied Probability.

[13]  K. Sam Shanmugan,et al.  An equivalent Markov model for burst errors in digital channels , 1995, IEEE Trans. Commun..