Optimal scheduling for two sources over time varying wireless channels

In this work, we consider a network that consists of two transmitter-receiver pairs which operate over time varying channels. We derive the optimal scheduling policies which maximize the expected weighted sum-rate of the network per time slot. The decision depends on the information about the channels between nodes. We consider the optimal scheduling policies in the following cases: (i) when all the channels are perfectly measured, (ii) when all the channels are measured with some error probability, (iii) when partial information about the channels is known using previous time slots transmissions, or (iv) when the channels are not measured at all. In the case of partial information from previous transmissions, we exploit the channel characteristics to find the solution. Also, we formulate the problem of finding the optimal policy in case of availability of partial information as a partially observable Markovian decision problem (POMDP). We compare the optimal performance levels achieved in each case and thus evaluate the effect of channel state information.