Towards universal power efficient scheduling in wireless channels

In this paper, we propose power efficient schedulers for transmitting bursty traffic sources over Gaussian wireless channels that provide guarantees on absolute delays experienced by the source packets. The proposed schedulers find the transmission rate and power using temporal water-filling techniques without any knowledge of the arrival traffic statistics. We also introduce an iterative process to compute a lower bound on the transmit power of any scheduler that provides absolute delay guarantees. The proposed schedulers and iterative method of computing the lower bound are also shown to provide statistical guarantees on packet delays.