A simplified adaptive scheduling algorithm for increased throughput guarantees

Offering throughput guarantees for wireless networks is of interest to both the network operators and the customers. In this paper, an optimization problem is formulated which aims at maximizing the throughput that can be guaranteed to the mobile users. Solution to this problem has already been found for users with different channel quality distributions. However, this solution is suboptimal for time-windows containing only a small amount of time-slots. Hassel et al. proposed an adaptive scheduling algorithm that showed good performance for short time-windows but that algorithm can only fulfill the throughput guarantees when the placement of the window is fixed and cannot promise the throughput guarantees within time-windows with a different duration or a different placement than that used by the algorithm. In this work, we propose a very simple adaptive scheduling algorithm that overcomes the problem of fixed window placement and provides similar throughput guarantees. Our simplified adaptive algorithm also performs significantly better than other well-known scheduling algorithms.