Mobility assisted opportunistic scheduling for downlink transmissions in cellular data networks

TitleMobility assisted opportunistic scheduling for downlink transmissions in cellular data networks
Publication TypeConference Paper
Year of Publication2005
AuthorsAli, S. H., and V. C. M. Leung
Conference NameWireless Communications and Networking Conference, 2005 IEEE
Pagination1213 - 1218 Vol. 2
Date Publishedmar.
Keywordscellular data networks, cellular radio, channel fluctuation information, completion time, data communication, decision rule, decision theory, downlink transmissions, elastic traffic, infinite backlog service demands, max-rate scheduling scheme, opportunistic scheduling, proportional fair algorithm, scheduling, telecommunication traffic, time-slotted shared wireless network, user mobility information

The paper presents an online opportunistic scheduling algorithm for downlink transmission in a time-slotted shared wireless network that combines channel fluctuation and user mobility information in the decision rule. The algorithm is a general scheduling scheme and adapts well with any utility function for elastic traffic. For finite workload service demands, the scheme uses less completion time than the max-rate scheduling scheme. Under moderate load conditions, it gives time savings of up to 10%. For infinite backlog service demands, the proposed algorithm performs better than the proportional fair algorithm. Simulation results illustrate the usefulness of the proposed scheme for elastic traffic and moderate load conditions.


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

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