Asymptotically Optimal Policies for Hard-Deadline Scheduling Over Fading Channels

A hard-deadline, opportunistic scheduling problem in which
B
bits must be transmitted within
T
time slots over a time-varying channel is studied: at the beginning of each slot the transmitter must decide how many bits to serve, or equivalently how much power to transmit with, based on causal channel knowledge where the channel varies from slot to slot (i.e., the channel in the current slot is known, but the channels in future slots are unknown). The objective of the opportunistic scheduling problem is to minimize expected transmission energy. It is assumed that no other packets are concurrently scheduled and that the transmission rate is equal to the capacity of the underlying additive white Gaussian noise channel within each slot, where the channel quality is fixed within a slot but varies in from slot to slot. Thus, the scheduler should be opportunistic, in the sense of transmitting more bits in slot(s) with good channel quality, while also being aware of the deadline so that not too many bits are left to the final slot. No closed-form solution for the optimal policy is known for this problem, which is naturally formulated as a finite-horizon dynamic program, but three different policies are shown to be optimal in the limiting regimes where
T
is fixed and
B
is large,
T
is fixed and
B
is small, and where
B
and
T
are simultaneously taken to infinity. In addition, the advantage of optimal scheduling is quantified relative to a nonopportunistic (i.e., channel blind) equal-bit policy.