Performance of a wireless access protocol on correlatedRayleigh-fading channels with capture

The throughput performance of a wireless media access protocol taking into account the effect of correlated channel fading, capture, and propagation delay is analyzed. For efficient access on the uplink (mobile-to-base-station link), the protocol makes use of the uplink channel status information which is conveyed to the mobiles through a busy/idle flag broadcast on the downlink (base-station-to-mobile link). A first-order Markov model is used to describe the correlation in the packet success/failure process on a Rayleigh-fading channel. The analytical results obtained through the first-order Markov approximation of the channel are compared to those obtained from an independent and identically distributed (i.i.d.) channel model. The Markovian-fading channel model is shown to provide better performance results than the i.i.d. channel model. Simulations show that a first-order Markov approximation of the Rayleigh-fading process is quite accurate. An enhanced version of the access protocol to take advantage of the memory in the fading channel behavior is proposed and analyzed. The effect of retransmission of erroneous data packets and propagation delay on the throughput is also analyzed. It is shown that the access protocol with an error detect (ED) feature is efficient in slow fading (e.g., pedestrian user speeds), whereas a retransmission protocol is more efficient in fast fading (e.g., vehicular user speeds)     

Performance Analysis of Replication ALOHA for Fading Mobile Communications Channels

This paper describes an ALOHA random access protocol for fading communications channels. A two-state Markov model is used for the channel error process to account for the channel fading memory. The ALOHA protocol is modified to send multiple contiguous copies of a message at each transmission attempt. Both pure and slotted ALOHA channels are considered. The analysis is applicable to fading environments where the channel memory is .short compared to the propagation delay. It is shown that smaller delay may be achieved using replications and, in noisy conditions, can also improve throughput.     

An average error probability evaluation in a fading environment using finite state Markov channel for LEO satellite communication system

Recent research shows that fading channels have a much larger capacity than anticipated with traditional approaches. This modern view on fading channels encouraged us to characterize these channels more precisely for better identification and use of wireless channel capacity.Since the Markov model is a natural way to approximate a channel with memory, many people have considered finite state first-order Markov modeling for describing a wireless communication channel.In this paper, we first introduce the relationship between a physical fading channel and the corresponding finite state Markov Model (FSMC) in case of low earth orbit (LEO) satellite communication system, which can be used for performance evaluation in an M-order quadrature amplitude-modulation (MQAM) transmission scheme by deriving an analytical expression of average bit error rate in Rayleigh fading channel. By establishing the FSMC, we show that the FSMC is accurate enough to evaluate the performance of MQAM modulation scheme to be implemented on board a LEO satellite communication system.     

A Markov model for the mobile propagation channel

A finite-state Markov model is fitted to the mobile propagation channel by the use of contingency tables. Narrow-band Rayleigh and Ricean fading are considered in detail, but the techniques extend to other types of fading. Several criteria may indicate that a first-order finite-state Markov model sufficiently characterizes the channel behavior. The parameters of the model are obtained both from theoretical analysis and simulation. Functional dependence between the transition probabilities and the steady-state probabilities is found in the slow fading case     

Semi-Markov multistate modeling of the land mobile propagation channel for geostationary satellites

This paper describes a new semi-Markov propagation channel model for land mobile satellite systems using geostationary satellites. The multistate model switches between propagation states representing line-of-sight, shadowing, or blockage of the signal. The duration of times spent in each state follow probability distributions recommended by the radiocommunication sector of the International Telecommunication Union (ITU-R). The actual parameters to be used with the ITU-R distributions were modified and fitted to observed data. The open-area state durations follow a power-law distribution, while the state durations for both the shadowed and the blocked states follow a lognormal distribution. Parameters for both two- and three-state models are extracted from an L-band measurement campaign performed by Inmarsat in the United Kingdom. Propagation channel models characterizing the fading within the open, shadowed, or blocked propagation states are described as well. The semi-Markov models represent an improvement over the more commonly used Markov models where the duration in each state follows an exponential distribution. The new model enables more accurate prediction and simulation of system performance and availability.     

噪声功率时变的瑞利慢衰落信道有限状态Markov模型

对衰落信道的准确建模对于自适应无线通信、认知无线电等应用中的信道预测具有重要意义。针对噪声功率存在时变特性的无线通信应用环境,提出了一种新的瑞利衰落信道的有限状态Markov模型。通过将接收信号的衰落电平进行离散化处理,建立了衰落电平区间与Markov模型状态之间的一一对应关系,推导了门限电平与状态转移概率和状态分布概率之间的理论关系式,并在此基础上提出了一种易于实现的基于等概率的信道模型。理论分析与仿真结果表明:在噪声功率时变的条件下,已有的基于信噪比的模型失效,而该模型能准确反映信道的衰落特性,最大相对误差小于7%。      

A context-tree based model for quantized fading

Fading is modeled by applying context tree pruning (CTP) to the sequence of fading states that results from quantizing a sequence of real-valued fading measurements. There results a family of finite state Markov chains of increasing order that represent the channel with increasing fidelity. A fading state may be the union of chain states. A particular model may be chosen from that family according to an application-specific criterion. The resulting models facilitate analysis and simulation of wireless systems that exploit channel memory. An example criterion compares each model's fading state sojourn time statistics with those of the original sequence     

A New Approach of Channel Modeling in HAPS Based Networks and Their System Performance Analysis

This paper concerns channel modeling for High Altitude Platform Systems (HAPS) and the performance evaluation of Hybrid_ARQ in the WiMAX network provided by HAPS. The stratospheric platform or HAPS is currently a new proposal for WiMAX technology. Firstly we study the HAPS channel behavior as a Finite State Markov Channel (FSMC). In this way, the range of magnitude of the fading channel gain is partitioned into a finite number of states; then based on level crossing rates, the state transition probabilities are derived. The validity of the proposed model is evaluated by theoretical and link level simulation results. Next, we use the derived state transition probabilities as channel model parameters in OPNET simulator for HAPS-WiMAX to calculate HARQ system level measures. The paper compares the performance obtained using two different models in fading effects, i.e. AWGN and our HAPS channel model. In addition, the influence of parameters is analyzed through comparison between our model and the Stanford University Interim (SUI) channel models, in terms of the Bit Error Rate (BER).     

Novel Approach for Modeling Wireless Fading Channels Using a Finite State Markov Chain

Empirical modeling of wireless fading channels using common schemes such as autoregression and the finite state Markov chain (FSMC) is investigated. The conceptual background of both channel structures and the establishment of their mutual dependence in a confined manner are presented. The novel contribution lies in the proposal of a new approach for deriving the state transition probabilities borrowed from economic disciplines, which has not been studied so far with respect to the modeling of FSMC wireless fading channels. The proposed approach is based on equal portioning of the received signal‐to‐noise ratio, realized by using an alternative probability construction that was initially highlighted by Tauchen. The associated statistical procedure shows that a first‐order FSMC with a limited number of channel states can satisfactorily approximate fading. The computational overheads of the proposed technique are analyzed and proven to be less demanding compared to the conventional FSMC approach based on the level crossing rate. Simulations confirm the analytical results and promising performance of the new channel model based on the Tauchen approach without extra complexity costs.     

Analysis of availability improvement in LMSS by means of satellitediversity based on three-state propagation channel model

Aiming at future multimedia land mobile-satellite services (LMSS) consisting of a large number of nongeostationary Earth-orbit satellites, we present an LMSS propagation channel model for assessing the effect of a satellite diversity scheme so that high service availability and high signal quality are assured. We classify general fading environments for LMSS into three states. By taking the occurrence probability of each state into account, a new fading channel model is developed. The validity of the model is identified by comparing its predicted values in terms of the cumulative distribution function (CDF) with measured data available so far. Then, based on this model, we calculate the satellite diversity effect assuming that the area is illuminated simultaneously by at least two satellites moving in low Earth orbits (LEO) over urban and suburban environments. In addition, state transition characteristics based on a Markov model are presented     

Finite-state Markov channel-a useful model for radio communicationchannels

The authors first study the behavior of a finite-state channel where a binary symmetric channel is associated with each state and Markov transitions between states are assumed. Such a channel is referred to as a finite-state Markov channel (FSMC). By partitioning the range of the received signal-to-noise ratio into a finite number of intervals, FSMC models can be constructed for Rayleigh fading channels. A theoretical approach is conducted to show the usefulness of FSMCs compared to that of two-state Gilbert-Elliott channels. The crossover probabilities of the binary symmetric channels associated with its states are calculated. The authors use the second-order statistics of the received SNR to approximate the Markov transition probabilities. The validity and accuracy of the model are confirmed by the state equilibrium equations and computer simulation     

Saturation throughput analysis of IEEE 802.11 in the presence of non ideal transmission channel and capture effects

In this paper, we provide a saturation throughput analysis of the IEEE 802.11 protocol at the data link layer by including the impact of both transmission channel and capture effects in Rayleigh fading environment. Impacts of both non-ideal channel and capture effects, specially in an environment of high interference, become important in terms of the actual observed throughput. As far as the 4-way handshaking mechanism is concerned, we extend the multi-dimensional Markovian state transition model characterizing the behavior at the MAC layer by including transmission states that account for packet transmission failures due to errors caused by propagation through the channel. This way, any channel model characterizing the physical transmission medium can be accommodated, including AWGN and fading channels. We also extend the Markov model in order to consider the behavior of the contention window when employing the basic 2-way handshaking mechanism. Under the usual assumptions regarding the traffic generated per node and independence of packet collisions, we solve for the stationary probabilities of the Markov chain and develop expressions for the saturation throughput as a function of the number of terminals, packet sizes, raw channel error rates, capture probability, and other key system parameters. The theoretical derivations are then compared to simulation results confirming the effectiveness of the proposed models.     

Finite-state Markov modeling of correlated Rician-fading channels

Stochastic properties of the binary channel that describe the successes and failures of the transmission of a modulated signal over a time-correlated flat-fading channel are considered for investigation. This analysis is employed to develop Kth-order Markov models for such a burst channel. The order of the Markov model that generates accurate analytical models is estimated for a broad range of fading environments. The parameterization and accuracy of an important class of hidden Markov models, known as the Gilbert-Elliott channel (GEC), are also investigated. Fading rates are identified in which the Kth-order Markov model and the GEC model approximate the fading channel with similar accuracy. The latter model is useful for approximating slowly fading processes, since it provides a more compact parameterization.     

Fading Channel Modeling via Variable-Length Markov Chain Technique

Channel characterization and modeling are essential to the wireless communication system design. A model that optimally represents a fading channel with a variable-length Markov chain (VLMC) is proposed in this paper. A VLMC offers a general class of Markov chains whose structure has a variable order and a parsimonious number of transition probabilities. The proposed model consists of two main components: 1) the optimal fading partition under the constraint of a transmission policy and 2) the derivation of the best VLMC representation with respect to the Kullback-Leibler (K-L) distance of fading samples. The fading partition is used to discretize a continuous fading channel gain. The optimal discretization criterion is developed based on the cost function of fading channel statistics and the transmission policy used in the system. Once a continuous fading channel gain is discretized, a VLMC is then used to model the channel. To obtain the optimal VLMC representation, we use the K-L distance of the discretized fading samples as the optimization criterion. The K-L distance of the discretized fading samples is used to determine the appropriate transition probabilities characterizing the optimal VLMC. Last, we show simulation results that demonstrate the accuracy and the effectiveness of the proposed fading channel representation in modeling the Rayleigh fading as well as the lognormal fading.     

Modeling End-to-End Wireless Lossy Channels: A Finite-State Markov Approach

In this paper, we present a model for wireless losses in packet transmission data networks. The model provides information about the wireless channel status that can be used in congestion control schemes. A Finite State Markov Channel (FSMC) approach is implemented to model the wireless slow fading for different modulation schemes. The arrival process statistics of the packet traces determine the channel state transition probabilities, where the statistics of both error-free and erroneous bursts are captured. Later, we establish SNR partitioning scheme that uses the transition probabilities as a basis for the state margins. The crossover probability associated with each state is calculated accordingly. We also propose an end-to-end approach to loss discrimination based on the channel state estimation at the receiver. Finally, we present a scheme for finding the channel optimal number of states as a function of the SNR. The presented FSMC approach does not restrict the state transitions to the adjacent states, nor does impose constant state duration as compared to some literature studies. We validate our model by experimental packet traces. Our simulation results show the feasibility of building a fading channel model for better wireless-loss awareness.     

Performance evaluation of multi-hop csma/ca networks in fading environments

The performance of multi-hop CSMA/CA networks has in most cases been evaluated via simulations, or analytically using a perfect collision channel model. Using such methods, one can neither have access to the capture nature of the terminals nor evaluate the performance of the network in a fading environment. In this paper a new analytical framework that takes into account these capture and fading effects is presented. The network investigated in this paper has an infinite number of nodes which is assumed to be spatially Poisson distributed. The approach is to develop analytical expressions for the transition probabilities between states of nodes in the network by approximating these states as a Markov chain. A fast algorithm to solve these equations is also given. Numerical results show that the model agrees with simulation results for both omni-directional networks and networks employing beamforming.     

A novel approach to model the land mobile satellite channel through reversible jump markov chain monte carlo technique

A key issue in the design of a mobile satellite communication system is an adequate knowledge of the statistical behavior of the propagation channel. To achieve this goal, the development of very accurate models plays a very important role. In contrast to traditional multi-state Markov chain based models, the novel approach proposed in this paper makes no prior assumptions on the number of states or on the statistical distributions characterizing each state. The sequence of channel states is blindly estimated using a Reversible Jump Monte Carlo Markov Chain algorithm.     

Propagation model for simulating shadowing and multipath fading inland-mobile satellite channel

A land-mobile satellite propagation model which includes multipath fading and shadowing effects using five-state Markov transitions between fade states and nonfade states is proposed. This generates a time-series of the fading, very closely matching statistical characteristics such as fade duration, nonfade duration and fade depth obtained from measured data     

Joint iterative channel estimation and decoding in flat correlatedRayleigh fading

This paper addresses the design and performance evaluation with respect to capacity of M-PSK turbo-coded systems operating in frequency-flat time-selective Rayleigh fading. The receiver jointly performs channel estimation and turbo decoding, allowing the two processes to benefit from each other. To this end, we introduce a suitable Markov model with a finite number of states, designed to approximate both the values and the statistical properties of the correlated flat fading channel phase, which poses a more severe challenge to PSK transmission than amplitude hiding. Then, the forward-backward algorithm determines both the maximum a posteriori probability (MAP) value for each symbol in the data sequence and the MAP channel phase in each iteration. Simulations show good performance in standard correlated Rayleigh fading channels. A sequence of progressively tighter upper bounds to the capacity of a simplified Markov-phase channel is derived, and performance of a turbo code with joint iterative channel estimation and decoding is demonstrated to approach these capacity bounds