Efficient Scheduling Algorithms for Multi-Service Multi-Slot OFDMA Networks

We propose two efficient scheduling algorithms for OFDMA networks based on graph theory. The algorithms overcome many drawbacks of previously proposed algorithms such as assuming a single service scenario, limiting the QoS parameters to instantaneous data rate and considering a single OFDM symbol in each scheduling decision. Also, our algorithms enable the system designer to control the tradeoff between system performance, system complexity and the QoS experienced by the users. System simulations show that the proposed algorithms considerably enhance the system performance.