Throughput Constrained Opportunistic Scheduling in Cellular Data Networks

• Published in: IEEE transactions on vehicular technology Vol. 58; no. 3; pp. 1396 - 1406
• Main Authors: Ali, S.H., Ki-Dong Lee, Leung, V.C.M.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.03.2009; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Aggregates; Algorithms; Applied sciences; Cellular; Cellular communication; Cellular networks; Channels; Control systems; Differentiation; Downlink; Equipments and installations; Exact sciences and technology; Fading; Land mobile radio cellular systems; Mobile radiocommunication systems; Organization and planning of networks (techniques and equipments); Performance enhancement; Radio; Radio control; Radiocommunications; Resource management; Scheduling; Studies; System performance; Systems, networks and services of telecommunications; Telecommunications; Telecommunications and information theory; Teleprocessing networks. Isdn; Throughput; time division multi-access; Transmission and modulation (techniques and equipments); Upper bound; Valuation and optimization of characteristics. Simulation; Channel with memory; Performance evaluation; resource management; Wireless telecommunication; Resource allocation; Power system economics; Information rate; Downlink; Cell network; Trade; Data transmission network; Service differentiation; Power markets; Fading channels; Multiple access; Time variable channel; time division multi-access; Scheduling; Algorithm; Information transmission; Upper bound; Memoryless channel; Land mobile radio cellular systems; Telecommunication network; System simulation; Feasibility; Planning
• ISSN: 0018-9545; 1939-9359
• DOI: 10.1109/TVT.2008.925306

This paper considers a scheduling problem for multiuser transmissions over the downlink of a time-slotted cellular data network. For such a network, opportunistic scheduling exploits the time-varying radio channel and improves network performance. This paper presents a new scheduling solution that maximizes the aggregate user performance subject to certain minimum and maximum performance constraints. By constraining the performance experienced by individual users, who share a common radio downlink, to some upper bounds, it is possible to provide the system operator with a better control of radio resource allocations and service differentiation among different classes of users. The proposed solution, which is referred to as throughput constrained opportunistic scheduling (TCOS), offers better service differentiation among different classes of users than the existing opportunistic scheduling algorithms with only minimum performance constraints. For ideal memoryless fading channels, TCOS provides performance comparable with an existing scheme with minimum and maximum performance constraints. For realistic fading channels with memory, TCOS significantly improves system performance due to its ability to trade off feasibility with throughput. Extensive simulation results demonstrate the improved system performance and effective service differentiation of the proposed solution under realistic channel conditions.