Research On Packet Scheduling Algorithms In Cdma2000 1x EV-DV System

Packet Scheduler in wireless network is used to queue various kind of data packets, allocate wireless resources, e.g. Walsh codes, time slots and frequency, so as to satisfy kinds of systems'performance demand. This dissertation focuses on the researching of packet scheduling algorithms in cdma2000 1x EV-DV system.The Main contents are as follows:1. We expatiate on fundamental of packet scheduling algorithms using utility-based optimization techniques.We analyse three scheduling models based on utility function, i.e. U scheduling model, S scheduling model and JUS scheduling model, and a conclusion is derived: different packet scheduling algorithms with different performance are the embodiment of different user object function(UOF), different system object function(SOF) and joint(user and system) object fuction (U-SOF) corresponding to U scheduling model, S scheduling model and JUS scheduling model.2. We analyse the three representative packet scheduling algorithms. Max C/I, Round Robin and Proportional Fairness scheduling are the three representative packet scheduling algorithms, we compare their performance of system throughput and user fairness through theory analysis and computer simulation.3. We research on the packet scheduling algorithms enabaling trade-off between system throughput and user fairness.Firstly, we analyse synthetical performance of additive joint optimization scheduling algorithm and multiplicative joint optimization scheduling algorithm through theory analysis and computer simulation, and the changing rule of synthetical performance when their parameter changed is also discussed at the same time. Then, we propose a hybrid scheduling algorithm based on Max C/I scheduling and Round Robin scheduling, we analyse its performance through theory analysis and computer simulation.4. We have a researching on the scheduling algorithms that guarantee users'quality of service. We analyse the performance of guaranteeing users'data rate of the two scheduling algorithms including scheduling based on exponential barrier function and scheduling based on quadratic barrier function through theory analysis and computer simulation, and the influence on performance introduced by their parameter.