Faster Algorithms for Minimum-Energy Scheduling of Wireless Data Transmissions

This paper considers the problem of minimizing the energy used in transmitting a given sequence of packets with specied completion deadlines from a node in a wireless packet network. The packets have to to be transmitted in rst-in-rst-out order. Packets can be destined to dierent receivers. The channel conditions to each receiver (and so the energy per bit needed) can be dierent and assumed to be known. An offline algorithm for the case where all the packets have a common completion deadline was presented in [3, 4], and was used as the basis for an online scheduling algorithm. In this paper, we present a faster offline algorithm for the more general case of dierent packet completion deadlines. The presented algorithm has a running time of O(M2), where M is the length of the given packet sequence, provided the inverse of the derivative of the energy function is invertible in closed form. Otherwise, the running time depends on the number of receivers as well.