An independent but not identically distributed bit error model for heavy-tailed wireless channels

The error patterns of a wireless channel can be represented by a binary sequence of ones (burst) and zeros (run), which is referred to as a trace. Recent surveys have shown that the run length distribution of a wireless channel is an intrinsically heavy-tailed distribution. Analytical models to characterize such features have to deal with the trade-off between complexity and accuracy. In this paper, we use an independent but not identically distributed (inid) stochastic process to characterize such channel behavior and show how to parameterize the inid bit error model on the basis of a trace. The proposed model has merely two parameters both having intuitive meanings and can be easily figured out from a trace. Compared with chaotic maps, the inid bit error model is simple for practical use but can still be deprived from heavy-tailed distribution in theory. Simulation results demonstrate that the inid model can match the trace, but with fewer parameters. We then propose an improvement on the inid model to capture the ‘bursty’ nature of channel errors, described by burst length distribution. Our theoretical analysis is supported by an experimental evaluation.

[1]  Miguel Á. Carreira-Perpiñán,et al.  M&M: multi-level Markov model for wireless link simulations , 2009, SenSys '09.

[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]  Cheng-Xiang Wang,et al.  Three Layered Hidden Markov Models for Binary Digital Wireless Channels , 2009, 2009 IEEE International Conference on Communications.

[5]  Muttukrishnan Rajarajan,et al.  Graph-Theoretic Complexity Reduction for Markovian Wireless Channel Models , 2011, Wirel. Pers. Commun..

[6]  R. Bhattacharjee,et al.  A generative model for burst error characterization in a fading channel , 2008, TENCON 2008 - 2008 IEEE Region 10 Conference.

[7]  Andreas Willig,et al.  Chaotic maps as parsimonious bit error models of wireless channels , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[8]  Cheng-Xiang Wang,et al.  A New Class of Generative Models for Burst-Error Characterization in Digital Wireless Channels , 2007, IEEE Transactions on Communications.

[9]  Cheng-Xiang Wang,et al.  Double embedded processes based hidden Markov models for binary digital wireless channels , 2008, 2008 IEEE International Symposium on Wireless Communication Systems.

[10]  Marcus V.S. Fernandes,et al.  A Novel Structured Markovian Model for Burst-Error Channels , 2010, 2010 6th International Conference on Wireless and Mobile Communications.

[11]  Seungjoon Lee,et al.  All Bits Are Not Equal - A Study of IEEE 802.11 Communication Bit Errors , 2009, IEEE INFOCOM 2009.

[12]  Pedro M. Crespo,et al.  Hidden Markov models for burst error characterization in indoor radio channels , 1997 .