Mobility

Delay Constrained Scheduling Over Fading Channels: Optimal Policies for Monomial Energy-Cost Functions

Free registration required

Executive Summary

A point-to-point discrete-time scheduling problem of transmitting B information bits within T hard delay deadline slots is considered assuming that the underlying energy-bit cost function is a convex monomial. The scheduling objective is to minimize the expected energy expenditure while satisfying the deadline constraint based on information about the unserved bits, channel state/statistics, and the remaining time slots to the deadline. At each time slot, the scheduling decision is made without knowledge of future channel state, and thus there is a tension between serving many bits when the current channel is good versus leaving too many bits for the deadline.

  • Format: PDF
  • Size: 152.48 KB