By Topic

Effective Capacity and QoS for Wireless Scheduling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Shakkottai, S. ; Univ. of Texas, Austin

Multiuser scheduling in a wireless context, where channel state information is exploited at the base station, can result in significant throughput gains to users. However, when QoS constraints are imposed (in the form of overflow probabilities), the benefits of multiuser scheduling are not clear. In this paper, we address this question for independent and identically distributed ON-OFF channel models, and study a ldquomultiuserrdquo formulation of effective capacity with QoS constraints. We consider a channel-aware greedy rule as well as the channel-aware max-queue rule, and showed that these algorithms that yield the same long-term throughput without QoS constraints have very different performance when QoS constraints are imposed. Next, we study the effective capacity for varying channel burstiness. From results on multiuser scheduling, we expect the long-term throughput to grow with increasing channel burstiness. However, we show that the throughput with QoS constraints decreases with increasing channel burstiness. The intuitive justification for this is that with increasing burstiness, even though the the long-term throughput increases, the channel access delay increases as well resulting in poor QoS performance.

Published in:

Automatic Control, IEEE Transactions on  (Volume:53 ,  Issue: 3 )