Framework for performance analysis of channel-aware wireless schedulers

Abstract

Although many wireless channel-state dependent (CSD) schedulers have been proposed recently, their contributions lie in the design of the scheduling mechanism to meet some performance objectives. However, these objectives are often first-order statistics such as average or worst-case delay, which are insufficient to characterize the scheduler's performance. In this paper, we propose a matrix formulation to derive the delay probability density function for CSD schedulers over a Markovian wireless channel. Our analysis is then used to determine the admissibility of a wireless scheduler in terms of a minimum throughput requirement and a real-time QoS requirement. In addition, we evaluate the buffer size requirement of the wireless receiver and highlight the trade-off between buffer size requirements and channel efficiency.