Optimum Throughput Constrained Opportunistic Scheduling in Cellular Data Networks

TitleOptimum Throughput Constrained Opportunistic Scheduling in Cellular Data Networks
Publication TypeConference Paper
Year of Publication2006
AuthorsAli, S. H., K. - D. Lee, and V. C. M. Leung
Conference NameSignal Processing and Information Technology, 2006 IEEE International Symposium on
Pagination708 -713
Date Publishedaug.
Keywordscellular radio, data communication, fading channels, memory less fading channels, optimum throughput constrained opportunistic scheduling, scheduling, service differentiation, time-slotted cellular data network, time-varying radio channel
Abstract

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

URLhttp://dx.doi.org/10.1109/ISSPIT.2006.270891
DOI10.1109/ISSPIT.2006.270891

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia