Date Added: Feb 2012
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 paper, the authors design a joint scheduling and channel probing algorithm by considering the overhead of obtaining the channel state information. They adopt a correlated and non-stationary channel model, which is more realistic than those used in the literature.