Research On Packet Scheduling Algorithms In Distributed Base Station

With the development of mobile communications, besides the traditional speech service, the future mobile communication system can also provide other services, such as low/high rate data, video etc. There are three aims for wireless network design, one is to guarantee QoS requirements for various services, another is to guarantee the fairness between users, and the third is to maximize the utilization of the wireless resource. All of these depend on the Radio Resource Management (RRM). Because the future mobile communication system is based on the data traffic, wireless scheduling is the key of influencing system performance and guaranteeing users' QoS.Distributed base station and the key techniques of HSDPA are studied, and several typical packet scheduling algorithms are discussed and their performances are compared. Algorithm of fairness and system throughput performance properties are studied through theoretical analysis and simulation.Aiming at the problem of difficulty to select the right value in link adaptation system, a regional division algorithm is proposed, and the performance properties are proved through theoretical analysis and simulation. Simulation results show that regional division algorithm changes the priority according to the division of the different rate of the users; the throughput of the system is improved.A regional division based on the joint weighted algorithm is studied for the unfairness of the classical PF algorithm. By adjusting four weighted factors, the ability of the system to adapt to various users is enhanced. Simulation results indicate that the "hunger" phenomenon is avoided efficiently.