Optimal Power-Delay Tradeoffs in Fading Channels-Small-Delay Asymptotics

When transmitting stochastically arriving data over fading channels, there is an inherent tradeoff between the required average transmission power and the average queueing delay experienced by the data. This tradeoff can be exploited by appropriately scheduling the transmission of data over time. In...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2013-06, Vol.59 (6), p.3939-3952
Main Author: Berry, R. A.
Format: Article
Language:English
Subjects:
Applied sciences
Asymptotic methods
Convergence
Delays
Energy efficiency
Exact sciences and technology
Fading
Information theory
Information, signal and communications theory
queueing
Queuing
Resource management
Scheduling
Signal to noise ratio
Stochastic models
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teletraffic
time-varying channels
Tin
Transmission and modulation (techniques and equipments)
Transmitters
wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:When transmitting stochastically arriving data over fading channels, there is an inherent tradeoff between the required average transmission power and the average queueing delay experienced by the data. This tradeoff can be exploited by appropriately scheduling the transmission of data over time. In this paper, we study the behavior of the optimal power-delay tradeoff for a single user in the regime of asymptotically small delays. In this regime, we first lower bound how much average power is required as a function of the average queueing delay. We show that the rate at which this bound increases as the delay becomes asymptotically small depends on the behavior of the fading distribution near zero, as well as the arrival statistics. We lower bound this rate for two different classes of fading distributions: one class that requires infinite power to minimize the queueing delay and one class that requires only finite power. We then show that for both classes, the bounds can essentially be achieved by a sequence of simple "channel threshold" policies, which only transmit when the channel gain is greater than a given threshold. We also consider several other transmission scheduling policies and characterize their convergence behavior in the small-delay regime.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2013.2253194