Multichannel wireless scheduling under limited terminal capability

Emerging systems like OFDMA and MIMO systems require multichannel scheduling over a wireless link. In this paper, we focus on the case that the number of channels to be assigned to a mobile terminal is limited, which we call limited matching. This case often occurs over a MIMO downlink when the number of receive antennas at a mobile user is smaller than that of transmit antennas at the base station. When the system exploits channel-aware opportunistic scheduling based on the channel feedback, finding the sum of channel gains by the limited matching is an NP-complete problem. To solve it easily, we can use the Hungarian algorithm, but its complexity is still too high and not amenable to performance analysis. Hence, we develop a heuristic algorithm, and analyze its cell throughput. Also, we investigate its performance when the channel feedback information is partially available. For analytic simplicity, we consider proportionally fair (PF) scheduling that is widely accepted as an opportunistic scheduler. Numerical results demonstrate that our heuristic limited-matching scheduling algorithm works well with partial channel feedback.