Asymptotically Optimal Policies for Hard-Deadline Scheduling Over Fading Channels
Source: University of Minho
A hard-deadline, opportunistic scheduling problem in which B bits must be transmitted within T time-slots over a time-varying channel is studied: the transmitter must decide how many bits to serve in each slot based on knowledge of the current channel but without knowledge of the channel in future slots, with the objective of minimizing expected transmission energy. In order to focus on the effects of delay and fading, the authors assume that no other packets are scheduled simultaneously and no outage is considered. They also assume that the scheduler can transmit at capacity where the underlying noise channel is Gaussian such that the energy-bit relation is a Shannon-type exponential function.