By Topic

WLC25-6: Greedy-Coordinated Scheduling with Resource-Sharing Constraints in Wireless Networks

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

2 Author(s)
Hangyu Cho ; Dept. of Electr. & Comput. Eng., Univ. of Texas at Austin, Austin, TX ; Andrews, J.G.

In wireless networks where all users have different channel characteristics and service classes, it is challenging to design an adaptive scheduler to support quality of service (QoS). Some fraction of multiuser diversity gain, which offers significant capacity increase, should be sacrificed to meet certain QoS targets. We present an opportunistic scheduling scheme under resource-sharing constraints. The scheduler solves the weighted fairness by diverting a fraction of resources from surplus users to underserved users. Given the average received signal-to-noise ratios (SNR) of users and resource-sharing constraints, the capacity of the proposed scheduler is analyzed over Rayleigh fading channels. Degree of weighted fairness for various scheduling schemes is also provided. Numerical results illustrate that while sacrificing a fraction of the achievable total capacity the proposed scheduler provides perfect weighted fairness.

Published in:

Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE

Date of Conference:

Nov. 27 2006-Dec. 1 2006