Energy-Efficient Data Transmission with Non-FIFO Packets

TL;DR

This paper addresses energy-efficient data transmission scheduling for non-FIFO packets with arbitrary arrival times and deadlines over an AWGN channel, proposing an optimal algorithm that outperforms FIFO-based methods.

Contribution

It introduces necessary and sufficient conditions for optimal scheduling of non-FIFO packets and presents a novel algorithm that guarantees optimal energy efficiency.

Findings

The proposed algorithm is proven to be optimal.

It effectively handles arbitrary packet arrival and deadline constraints.

The method improves energy efficiency over traditional FIFO-based scheduling.

Abstract

This paper investigates the problem of energy-efficient packet transmission with arbitrary arrival instants and deadline constraints over a point-to-point Additive White Gaussian Noise (AWGN) channel. This is different from previous work where it is assumed that the packets follow a First-In-First-Out (FIFO) order in that the packets that arrive earlier will have a deadline that is also earlier. We first investigate the necessary and sufficient conditions of the optimal transmission scheduler. We then propose an algorithm which finds the transmission schedule of each packet in the order of the packets with the largest transmission rate to the packets with the smallest transmission rate. Finally, we show that our algorithm satisfies the sufficient conditions of the optimal transmission scheduler and thus, is optimal.