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
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
Fair and efficient scheduling in data ferrying networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
IEEE Transactions on Communications
QoS-aware cooperative medium access control for MIMO ad-hoc networks
IEEE Communications Letters
Fairness-related challenges in mobile opportunistic networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
We consider a scheduling problem 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 two fronts. First, we formulate and solve an opportunistic scheduling problem with multiple general long term QoS constraints and a general system objective function. We call the solution of this opportunistic scheduling problem a generalized water filling solution. 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. Our main contribution is to 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.