Fair scheduling in wireless packet networks
IEEE/ACM Transactions on Networking (TON)
Opportunistic media access for multirate ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
A framework for opportunistic scheduling in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Opportunistic scheduling for wireless systems with multiple interfaces and multiple constraints
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
WCFQ: an opportunistic wireless scheduler with statistical fairness bounds
IEEE Transactions on Wireless Communications
Asymptotically optimal water-filling in vector multiple-access channels
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
A fair opportunistic access scheme for multiuser OFDM wireless networks
EURASIP Journal on Wireless Communications and Networking - Special issue on fairness in radio resource management for wireless networks
On the performance of "compensation-based" and "Greedy" scheduling policies in IEEE 802.16 networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Uplink cross-layer scheduling with differential QoS requirements in OFDMA systems
EURASIP Journal on Wireless Communications and Networking - Special issue on adaptive cross-layer strategies for fourth generation wireless communications
Adaptive best-M feedback scheduling in multiuser OFDMA systems
Proceedings of the 2011 ACM Symposium on Research in Applied Computation
| Hi-index | 0.00 |
We consider several scheduling problems for packet based systems with time-varying channel conditions. Designing scheduling mechanisms that take advantage of time-varying channel conditions, which are different for different users, is necessary to improve system performance; however this has to be done in a way that provides some level of fairness among the users. Such scheduling mechanisms are termed opportunistic. We generalize the opportunistic scheduling mechanisms in the literature on three fronts. First, we formulate and solve an opportunistic scheduling problem with multiple general long term QoS constraints and a general system objective function. The solution of this opportunistic scheduling problem is an index policy. Then, we generalize this problem to include multiple interface systems in which several users can be served simultaneously. Apart from the long term QoS constraints specified by each user, multiple interface systems are constrained with other physical limitations imposed by the system. We show that the structure of the optimal opportunistic scheduling policy is carried over to the problem with general constraints and multiple interfaces. We also study the stability of the multiple interface systems and propose a throughput optimal scheduling rule for such systems. We then formulate an opportunistic scheduling problem with short term processor sharing fairness constraints as an optimization problem where fairness is guaranteed over a finite time window. In its most general form, this problem cannot be solved analytically. Hence observing the form of the optimal policies for special cases, we propose a heuristic scheduling policy. We illustrate the effectiveness of the policies via simulation.