Starvation Analysis of CDF-Based Scheduling Over Nakagami- $m$ Markov Fading Channels

In this letter, we consider a cumulative distribution function-based scheduling (CS) algorithm in downlink cellular networks. We present exact and approximate formulas for the probability distribution of the starving time of a user of the CS algorithm over Nakagami-m Markov fading channels. The approximate formula provides a tight result for a large number of users with low computational complexity. Through numerical studies based on our analysis, we investigate the impact of the scheduling parameters and the Nakagami fading parameters on the starving time of the CS algorithm.