Smart scheduling and feedback allocation over non-stationary wireless channels

This is the latest version of this item.

Official URL: http://dx.doi.org/10.1109/ICC.2012.6364878

It is well known that opportunistic scheduling algorithms are throughput optimal under dynamic channel and network conditions. However, these algorithms achieve a hypothetical rate region which does not take into account the overhead associated with channel probing and feedback required to obtain the full channel state information at every slot. In this work, we design a joint scheduling and channel probing algorithm by considering the overhead of obtaining the channel state information. We adopt a correlated and non-stationary channel model, which is more realistic than those used in the literature. We use concepts from learning and information theory to accurately track channel variations to minimize the number of channels probed at every slot, while scheduling users to maximize the achievable rate region of the network. Simulation results show that with the proposed algorithm, the network can carry higher user traffic.