On linear programs with random costs
Mathematical Programming: Series A and B
Stochastic models in queueing theory
Stochastic models in queueing theory
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
A framework for opportunistic scheduling in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Wireless downlink data channels: user performance and cell dimensioning
Proceedings of the 9th annual international conference on Mobile computing and networking
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
Probability in the Engineering and Informational Sciences
Real-Time Mobility Tracking Algorithms for Cellular Networks Based on Kalman Filtering
IEEE Transactions on Mobile Computing
Convergence of proportional-fair sharing algorithms under general conditions
IEEE Transactions on Wireless Communications
Queuing with adaptive modulation and coding over wireless links: cross-Layer analysis and design
IEEE Transactions on Wireless Communications
Capacity and optimal resource allocation for fading broadcast channels .I. Ergodic capacity
IEEE Transactions on Information Theory
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Standardization of mobile phone positioning for 3G systems
IEEE Communications Magazine
Mobility modeling, location tracking, and trajectory prediction in wireless ATM networks
IEEE Journal on Selected Areas in Communications
Opportunistic transmission scheduling with resource-sharing constraints in wireless networks
IEEE Journal on Selected Areas in Communications
Breaking the silos: access and service convergence over the mobile internet
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Access and service convergence over the mobile internet - A survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
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. [5] 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. [17] for linear programs. Simulation results on High Data Rate (HDR) illustrate the usefulness of the proposed schemes for elastic traffic and macrocell structures.