Deadline Constrained Traffic Handling under Average Power Constraints

Wireless devices need to adapt their transmission power according to the fluctuating wireless channel in order to meet constraints of delay sensitive applications. In this paper, we consider delay sensitivity in the form of strict deadlines on packet arriving in a transmission queue. Packets missing the deadline while in the queue are dropped, never to be transmitted. We use Lyapunov optimization tools to find an approximate solution by selecting power allocation in order to minimize the packet drop rate under average power constraints. We evaluate the performance of the proposed algorithm for an infinite time horizon and show that the proposed algorithm achieves the same performance with that of the Earliest Deadline First (EDF) when the available power is sufficient enough.