Abstract
In this paper, we firstly propose simple and computationally efficient wireless channel modeling algorithm that explicitly takes into account first- and second-order statistics of frame error observations. For this purpose we use a discrete-time Markov modulated process with at most single event (error) at any time slot. Then, we identify a class of priority queuing systems of G + G/GI/1/K type capable to model the frame transmission process over wireless channels with correlated arrival and loss processes. Using the proposed frame error process, performance evaluation model of the wireless channel at the data-link layer is then reduced to the special case of ∑ i D-BMAP i /D/1/K queuing system with non-preemptive priority discipline. The proposed queuing representation allows to capture forward error correlation (FEC) and automatic repeat request (ARQ) functionality of the data-link layer as well as distributional and autocorrelational properties of the frame arrival and frame loss processes. This model is further analyzed for a number of performance parameters of interest including probability function of the number of frames in the system and probability function of the number of lost frames. It is shown that the channel response in terms of the mean number of frames in the system and the mean number of lost frames varies substantially for different first- and second-order frame error and arrival statistics. The impact of input statistics is also different for normal ( ρ < 1) and overloaded conditions ( ρ ⩾ 1) of ∑ i D-BMAP i /D/1/K queuing system.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.