Scheduling Opportunities in WCDMA Network

Abstract

Third Generation network system (UMTS – WCDMA) is developing successfully throughout the world based on popularity of GSM (Global System of Mobile telecommunication). UMTS - WCDMA allows the subscriber experience multimedia services from terminals with higher data rate and lower latency rather than voice call and text message only in GSM. WCDMA is becoming more and more popular and was implemented in many countries but the great problem for any telecommunication system is the limit of time and frequency resource. Therefore, like other network system, saving radio resources in WCDMA is the key of success. Effective performance of the scheduler in NodeB certainly plays an important role in the overall performance of the system. There are many scheduling algorithms was implemented. However, all in all, such scheduling algorithms are based on some basic scheduling algorithms. In my bachelor thesis, I will take an overview on the system model of 3G network, including system architecture, resource allocation and technologies used in data transmission. Then, I will focus on an important factor in shared radio resource allocation in the WCDMA downlink: scheduling algorithms. The content of this thesis will take concentration on the operation of Round Robin and Maximum C/I scheduling algorithms: describes, evaluates and compares to each other in order to represent the adverse features of the two scheduling algorithms due to the performance of WCDMA system.