ETRI-Knowledge Sharing Plaform

KOREAN
논문 검색
Type SCI
Year ~ Keyword

Detail

Journal Article Asymptotically Optimal Policies for Hard-Deadline Scheduling Over Fading Channels
Cited 21 time in scopus Download 8 time Share share facebook twitter linkedin kakaostory
Authors
Juyul Lee, Nihar Jindal
Issue Date
2013-04
Citation
IEEE Transactions on Information Theory, v.59, no.4, pp.2482-2500
ISSN
0018-9448
Publisher
IEEE
Language
English
Type
Journal Article
DOI
https://dx.doi.org/10.1109/TIT.2012.2236917
Project Code
13PI1800, Research on wireless transmission techniques for enhancing QoE performance of smart mobile services, Lee Seung-Hwan
Abstract
A hard-deadline, opportunistic scheduling problem in which bits must be transmitted within time slots over a time-varying channel is studied: at the beginning of each slot the transmitter must decide how many bits to serve, or equivalently how much power to transmit with, based on causal channel knowledge where the channel varies from slot to slot (i.e., the channel in the current slot is known, but the channels in future slots are unknown). The objective of the opportunistic scheduling problem is to minimize expected transmission energy. It is assumed that no other packets are concurrently scheduled and that the transmission rate is equal to the capacity of the underlying additive white Gaussian noise channel within each slot, where the channel quality is fixed within a slot but varies in from slot to slot. Thus, the scheduler should be opportunistic, in the sense of transmitting more bits in slot(s) with good channel quality, while also being aware of the deadline so that not too many bits are left to the final slot. No closed-form solution for the optimal policy is known for this problem, which is naturally formulated as a finite-horizon dynamic program, but three different policies are shown to be optimal in the limiting regimes where is fixed and is large, is fixed and is small, and where and are simultaneously taken to infinity. In addition, the advantage of optimal scheduling is quantified relative to a nonopportunistic (i.e., channel blind) equal-bit policy.© 2012 IEEE.
KSP Keywords
Additive white Gaussian noise(AWGN), Asymptotically optimal, Deadline scheduling, Dynamic program, Expected transmission energy, Optimal Scheduling, Optimal policy, Time-varying channels, Transmission Rate, additive white Gaussian noise channel, channel quality