A framework for opportunistic scheduling in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
WCFQ: an opportunistic wireless scheduler with statistical fairness bounds
IEEE Transactions on Wireless Communications
Convergence of proportional-fair sharing algorithms under general conditions
IEEE Transactions on Wireless Communications
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Providing quality of service over a shared wireless link
IEEE Communications Magazine
Joint power control and intracell scheduling of DS-CDMA nonreal time data
IEEE Journal on Selected Areas in Communications
Fair channel-adaptive rate scheduling in wireless networks with multirate multimedia services
IEEE Journal on Selected Areas in Communications
A Game-Theoretic Approach to Energy-Efficient Modulation in CDMA Networks with Delay QoS Constraints
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In this paper, we address the problem of efficient recourse allocation in CDMA wireless networks supporting multimedia services with various and often diverse QoS prerequisites, placing special emphasis on real-time services' essential requirements satisfaction. We first provide an analytical framework for studying real-time users' short-term delay and throughput properties under fundamental opportunistic scheduling policies. The corresponding results demonstrate that probabilistic delay constraints are insufficient indicators of real-time services' QoS prerequisites, while probabilistic short-term throughput requirements are more appropriate in asserting their performance expectations. Based on these observations and results, we propose and develop a scheduling policy for efficiently supporting heterogeneous services that include delay-tolerant non-real-time and delay-sensitive real-time services, over a wireless CDMA system under a common utility based framework. A user's utility characterizes his degree of satisfaction for the received service as well as QoS expectations fulfillment, in a normalized way. Aiming at the maximization of users' utilities, both non-real-time services' long-term and real-time services' short-term throughput QoS requirements are met, under the proposed opportunistic scheduler. Finally, via modeling and simulation it is demonstrated that significant performance improvements concerning both types of services' QoS requirements satisfaction are achieved through the proposed scheduling approach.