Channel quality dependent scheduling for flexible wireless resource management

In this paper, we propose a scheduling paradigm that gives cellular network operators greater flexibility in adjusting the way resources are allocated among interactive best-effort data users. This work is motivated by the unique characteristic of cellular networks, where users with different radio link qualities may deliver different amounts of data using the same amount of radio resource. In the context of link adaptation, we demonstrate how this characteristic complicates the fairness issue in cellular environments and has a profound impact on the overall system performance. We also show that, as a result, it becomes extremely appealing to adopt scheduling algorithms that are capable of allocating radio resource dynamically, not only based on channel conditions, but also to achieve different performance trade-offs among users with different link qualities. We present an efficiency-based scheduling algorithm which achieves this goal effectively. Simulation results from the efficiency-based scheduling algorithm provide some important guidelines for efficient resource allocation in cellular networks. In particular, we find that systems should be very cautious when trying to improve the performance of users with bad channel qualities, as it is more likely to degrade the performance of good channel users in a disproportionate manner. And in many cases, it is preferable to favor users with good channel qualities.

[1]  Paul Barford,et al.  Generating representative Web workloads for network and server performance evaluation , 1998, SIGMETRICS '98/PERFORMANCE '98.

[2]  Parameswaran Ramanathan,et al.  Adapting packet fair queueing algorithms to wireless networks , 1998, MobiCom '98.

[3]  Songwu Lu,et al.  Fair queuing in wireless networks: issues and approaches , 1999, IEEE Wirel. Commun..

[4]  Anders Furuskar,et al.  EDGE: enhanced data rates for GSM and TDMA/136 evolution , 1999, IEEE Wirel. Commun..

[5]  N. K. Shankaranarayanan,et al.  Providing multiple service classes for bursty data traffic in cellular networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[6]  Songwu Lu,et al.  A Unified Architecture for the Design and Evaluation of Wireless Fair Queueing Algorithms , 2002, Wirel. Networks.

[7]  Satish K. Tripathi,et al.  Enhancing throughput over wireless LANs using channel state dependent packet scheduling , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[8]  Justin C. Chuang,et al.  Link adaptation in wireless data networks for throughput maximization under retransmissions , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[9]  Ion Stoica,et al.  Packet fair queueing algorithms for wireless networks with location-dependent errors , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[10]  Giuseppe Bianchi,et al.  On utility-fair adaptive services in wireless networks , 1998, 1998 Sixth International Workshop on Quality of Service (IWQoS'98) (Cat. No.98EX136).