Optimal linear-time QoS-based scheduling for WiMAX

We address a recent application of realtime scheduling in wireless communication industry; namely, the uplink scheduling problem for WiMAX systems. More specially, we have worked on the problem of maximizing the number of data packets to be sent through an uplink subframe such that the expectations from the system are guaranteed. We argue that this problem is NP-hard. Thus far, only a number of heuristic algorithms have been developed for special cases of the problem and the problem has not been modeled formally. In this work, we present two formal models for the system. Then, we derive an algorithm for uplink scheduling which has two highly favourable features: it finds the optimal solution in linear time.