Evaluation of multiuser scheduling algorithm in OFDM for different services

Abstract

The goal of this Master Thesis is to study shared radio resources among users with different services requirements. The analyzed properties of the wireless connection are fairness, throughput and delay for users demanding different services and QoS requirements. Four scheduling algorithms are used for allocating system resources. Two of them, Max Rate and Round Robin, are used as references to analyze throughput and fairness respectively. The other two algorithms, Proportional Fair Scheduling and Rate Craving Greedy, exploit the idea of multiuser diversity improving the throughput without comprising fairness. Different fading radio channel models are investigated, but only urban environments and pedestrian users are simulated in this report. OFDM has been the technique used to transmit signals over the wireless channel. The performance of these algorithms is analyzed and compared through MATLAB computer simulations.