Optimal and Approximate Mobility-Assisted Opportunistic Scheduling in Cellular Networks

TitleOptimal and Approximate Mobility-Assisted Opportunistic Scheduling in Cellular Networks
Publication TypeJournal Article
Year of Publication2007
AuthorsAli, S. H., V. Krishnamurthy, and V. C. M. Leung
JournalMobile Computing, IEEE Transactions on
Volume6
Pagination633 -648
Date Publishedjun.
ISSN1536-1233
Keywordsapproximate mobility-assisted opportunistic scheduling, cellular radio, channel capacity, channel fluctuation, data communication, dynamic constraints, elastic traffic, fairness constraints, fundamental inequality, high data rate, linear programming, linear programs, macrocell structures, mobility management (mobile radio), optimal opportunistic scheduling, radio channel, telecommunication traffic, time-slotted cellular data network, user mobility information, wireless channels
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 improve system performance by exploiting time variations of the radio channel. We present novel optimal and approximate opportunistic scheduling algorithms that combine channel fluctuation and user mobility information in their decision rules. The algorithms modify the opportunistic scheduling framework of Liu et al., (1993) with dynamic constraints for fairness. These fairness constraints adapt according to the user mobility. The adaptation of constraints in the proposed algorithms implicitly results in giving priority to the users that are in the most favorable locations. The optimal algorithm is an offline algorithm that precomputes constraint values according to a known mobility model. The approximate algorithm is an online algorithm that relies on the future prediction of the user mobility locations in time. We show that the use of mobility information in opportunistic scheduling increases channel capacity. We also provide analytical bounds on the performance of the approximate algorithm using the fundamental inequality of Dyer et al., (1986) for linear programs. Simulation results on high data rate (HDR) illustrate the usefulness of the proposed schemes for elastic traffic and macrocell structures

URLhttp://dx.doi.org/10.1109/TMC.2007.1051
DOI10.1109/TMC.2007.1051

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