Energy Efficient Scheduling with Individual Packet Delay Constraints

Abstract

Abstract-This paper focuses on energy-efficient packet transmission with individual packet delay constraints. The optimal offline scheduler (vis-à-vis total transmission energy), assuming information of all packet arrivals before scheduling, was developed by Zafer, et al. (2005) and Chen et al. (2006). This paper shows that when packet inter-arrival times are identically and independently distributed (i.i.d.), the resulting optimal transmission durations of packets m and M − m + 1, m ∈ [1, · · · , M ], M ≥ 1, are identically distributed. This symmetry property leads to a simple and exact solution of the average packet delay under the optimal offline schedule. Two heuristic online scheduling algorithms, which assume no future arrival information, are then studied. These online schedulers are compared with the optimal offline scheduler in terms of delay and energy performance via analysis and simulations. While both online schedulers are inherently inferior, one online scheduler is shown to achieve a comparable energy performance to the optimal offline scheduler in a wide range of scenarios.

Online Energy Efficient Packet Scheduling with Delay Constraints in Wireless Networks

“…Example service disciplines include earliest deadline first [23], first-come-first-served [2], [3], [15], and weighted fair queuing [13]. By separating rate assignment and packet scheduling, we make algorithm design simple and enable the use of independent policies at either level.…”

“…Extensive studies were conducted along the line for offline packet scheduling, in which all packet timing information is available offline in order to determine packet transmission rates, or service times similarly. Researchers have studied the problem with different focuses, such as on a special application model (periodic streams) [19], offline generalization [23], distinguished characteristics of different packets [15], properties of offline schedulers [2] [3].…”

“…We assume the channel between the transmitter and the receivers is an Additive White Gaussian Noise (AWGN) channel and the interference to the receiver is negligible, as in [2], [3], [13], [15], [23]. Using adaptive modulation scaling or channel coding can reduce the energy consumption in wireless communication.…”

Online Maximizing Weighted Throughput in a Fading Channel

“…Scheduling packets over fading wireless channels has received much attention (see [9,5,8,10,2] and the references therein). A scheduling algorithm can significantly improve the communication performance by taking advantages of the changing channel states.…”

“…In their problem settings, energy is minimized under the assumption that all arriving packets are successfully delivered. An optimal offline algorithm maximizing throughput and a heuristic online approach of scheduling uniform-value packets with possibly different deadlines were given in [2]. No theoretical analysis has been provided for the heuristic online solution.…”