Per‐user service model for opportunistic scheduling scheme over fading channels

Abstract

In this paper, we propose a finite-state Markov model for per-user service of an opportunistic scheduling scheme over Rayleigh fading channels, where a single base station serves an arbitrary number of users. By approximating the power gain of Rayleigh fading channels as finite-state Markov processes, we develop an algorithm to obtain dynamic stochastic model of the transmission service, received by an individual user for a saturated scenario, where user data queues are highly loaded. The proposed analytical model is a finite-state Markov process. We provide a comprehensive comparison between the predicted results by the proposed analytical model and the simulation results, which demonstrate a high degree of match between the two sets.

Stability Region of Opportunistic Scheduling in Wireless Networks

“…Second, given the average arrival rate, how to design the weight to each user to stabilize the system and how the designed weight affects the system performance needs to be investigated further. Under some special assumptions, the system can be modeled as a Markov Chain [18], [19], therefore the performance can be numerically studied. While a system under general assumptions may not be easy to be modeled as a simple Markov Chain, the performance study is still challenging.…”