Energy-efficient scheduling with individual packet delay constraints over a fading channel

Authors:
Wanshi Chen;Urbashi Mitra;Michael J. Neely
Affiliations:
Qualcomm Inc., San Diego, USA;Department of Electrical Engineering, University of Southern California, Los Angeles, USA;Department of Electrical Engineering, University of Southern California, Los Angeles, USA
Venue:
Wireless Networks
Year:
2009

Citing 13
Cited 1

Mobility increases the capacity of ad hoc wireless networks

IEEE/ACM Transactions on Networking (TON)
Energy-efficient packet transmission over a wireless link

IEEE/ACM Transactions on Networking (TON)
Energy efficient transmission scheduling for delay constrained wireless networks

IEEE Transactions on Wireless Communications
Optimal transmission scheduling over a fading channel with energy and deadline constraints

IEEE Transactions on Wireless Communications
Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities

IEEE Transactions on Information Theory
Multiaccess fading channels. II. Delay-limited capacities

IEEE Transactions on Information Theory
Optimum power control over fading channels

IEEE Transactions on Information Theory
Communication over fading channels with delay constraints

IEEE Transactions on Information Theory
File transmission over wireless fast fading downlink

IEEE Transactions on Information Theory
Delay-constrained capacity with causal feedback

IEEE Transactions on Information Theory
Delay-bounded packet scheduling of bursty traffic over wireless channels

IEEE Transactions on Information Theory
On adaptive transmission for energy efficiency in wireless data networks

IEEE Transactions on Information Theory
Optimal Power and Rate Control for Minimal Average Delay: The Single-User Case

IEEE Transactions on Information Theory

Decomposition principles and online learning in cross-layer optimization for delay-sensitive applications

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article focuses on energy-efficient packet transmission with individual packet delay constraints over a fading channel. The problem of optimal offline scheduling (vis-à-vis total transmission energy), assuming information of all packet arrivals and channel states before scheduling, is formulated as a convex optimization problem with linear constraints. The optimality conditions are analyzed. From the analysis, a recursive algorithm is developed to search for the optimal offline scheduling. The optimal offline scheduler tries to equalize the energy-rate derivative function as much as possible subject to causality and delay constraints, in contrast to the equalization of transmission rates for optimal scheduling in static channels. It is shown that the optimal offline schedulers for fading and static channels have a similar symmetry property. Combining the symmetry property with potential idling periods, upper and lower bounds on the average packet delay are derived. The properties of the optimal offline schedule and the impact of packet sizes, individual delay constraints, and channel variations are demonstrated via simulations. A heuristic online scheduling algorithm, assuming causal traffic and channel information, is proposed and shown via simulations to achieve energy and delay performances comparable to those of the optimal offline scheduler in a wide range of scenarios.