Wireless random scheduling protocol with realistic channel

In this paper, we propose a novel scheduling protocol for wireless communications over time-varying channels with memory. We incorporate a realistic channel model to study the impact of the changes in the physical layer on the performance of a scheduling protocol at the data link layer, and consider imperfect estimation of the channel conditions, based upon which the scheduling decision is made. We present our analysis results as well as comparisons with other wireless scheduling protocols. In addition to the system throughput study, we develop a new notion on the definition of "fairness": fairness across all the user instead of any individual user. Simulations are provided to illustrate the results.