Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Optimum Throughput Constrained Opportunistic Scheduling in Cellular Data 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

3 Author(s)
Ali, S.H. ; Dept. of Electr. & Comput. Eng., British Columbia Univ., Vancouver, BC ; Ki-Dong Lee ; Leung, V.C.M.

This paper considers the problem of scheduling multiple users in the downlink of a time-slotted cellular data network. For such a network, opportunistic scheduling algorithms exploit the time-varying radio channel and improve the system performance. This paper introduces a new optimum scheduling algorithm that maximizes the sum of average user performance subject to certain minimum and maximum performance constraints. The proposed algorithm, which is named as throughput constrained opportunistic scheduling (TCOS), is an extension of the framework proposed by Liu et al. For memory less fading channels, TCOS performs identically to another optimum algorithm. For fading channels with memory, TCOS significantly improves system performance. The TCOS with the minimum and maximum performance constraints offers better service differentiation among different classes of users than opportunistic scheduling algorithm provides with only minimum performance constraints

Published in:

Signal Processing and Information Technology, 2006 IEEE International Symposium on

Date of Conference:

Aug. 2006