Asymptotic Throughput Analysis for Channel-Aware Scheduling

In this paper, we provide an asymptotic performance analysis of channel-aware packet scheduling based on extreme value theory. We first address the average throughput of systems with a homogeneous average signal-to-noise ratio (SNR) and obtain its asymptotic expression. Compared with the exact throughput expression, the asymptotic one, which is applicable to a broader range of fading channels, is more concise and easier to get insights. Furthermore, we confirm the accuracy of the asymptotic results by theoretical analysis and numerical simulation. For a system with heterogeneous SNRs, normalized-SNR-based scheduling needs to be used for fairness. We also investigate the asymptotic average throughput of the normalized-SNR-based scheduling, and prove that the average throughput in this case is less than that in the homogeneous case with a power constraint.