A Self-Adaptive, Utility-based Scheduling for Wireless Cellular Networks

Design of efficient scheduling algorithms has an important impact on performance of wireless mobile networks. The previously proposed scheduling algorithms like Best CQI and Proportional Fair have good performance, but only for certain load and services types. Within this work, we propose a novel Utility based Scheduling algorithm, which is fully adaptive to service and load conditions and includes some well known scheduling algorithms as special cases. We show by using dynamic system level simulations that the algorithm provides same or substantially better performance than these scheduling algorithms, with low signalization and computation overhead.