Scheduling Algorithms for Increased Throughput Guarantees in Wireless Networks

Abstract

For cellular wireless networks carrying real-time traffic, it is in the interest of both network operators and customers that throughput guarantees can be offered. In this paper, we formulate an optimization problem which aims at maximizing the throughput that can be guaranteed to the mobile users. By building on results obtained by Borst and Whiting and by assuming that the distributions of the users' carrier-to-noise ratios are known, we find the solution to this problem for users with different channel quality distributions, both for the scenario where all the users have the same throughput guarantee, and for the scenario where all the users have different throughput guarantees. Based on these solutions, we propose an adaptive scheduling algorithm that performs significantly better than other well-known scheduling algorithms.