Multi-base station multi-user proportional fair scheduling method with guaranteed quality of service

Abstract

The invention discloses a multi-base station multi-user proportional fair scheduling method that guarantees service quality, and mainly solves the problem of unfair resource scheduling caused by ignoring user service quality in the prior art. The implementation steps are: 1. Set parameters according to the actual scheduling problem; 2. Calculate user weights according to the user's time average throughput; 3. The base station selects the user to be served in the current time slot according to the user weight and the user's historical average throughput; 4. The base station updates the local user throughput after determining the user served in the current time slot, and broadcasts the local user throughput information to other base stations in the network; 5. Terminates this round of scheduling according to the scheduling termination condition, so as to obtain a scheduling result that satisfies proportional fairness . The present invention can obtain satisfactory scheduling results in both sufficient and insufficient resources, and has low computational complexity, improves the scheduling efficiency of base stations in the case of time-varying channels, and can be used in large-scale wireless local area networks with multiple adjacent wireless routers .

Description

technical field [0001] The invention belongs to the technical field of wireless communication, and relates to a multi-base station multi-user proportional fair scheduling method that guarantees service quality QoS, and can be applied to a large-scale wireless local area network with a plurality of adjacent wireless routers. technical background [0002] With the continuous development of mobile communication technology, the number of users is increasing year by year, and the requirements of mobile services are also increasingly diverse. In the fourth-generation mobile communication system, in addition to the traditional voice service, multi-rate multimedia service is added. Therefore, how the base station can schedule data flow resources for users with different business needs fairly and effectively has become a hot issue in current research. [0003] Most resource allocation algorithms mainly focus on the efficient use of wireless resources and seldom care about the user's ...

AI Technical Summary

Problems solved by technology

[0005] Zhang Y J, Liew S C. Proportional fairness in multi-channel multi-rate wireless networks-part II: the case of time-varying channels with application to OFDM systems. IEEE Transactions on Wireless Communications, 2008; 7(9):3457-3467, Although this method designs a proportional fair scheduling algorithm for the time-varying channel model, the sources of multiple antennas, multiple subcarriers, and multiple channels in the model are all from the same base station, and the situation of multiple base stations is not considered.

[0006] Hui Zhou, Pingyi Fan, Xiang-Gen Xia, Khaled Ben Letaief.Achieving Network Wide Proportional Fairness:A Pricing Method.Proceedings of IEEE Wireless Communications and Networking Conference,Sydney,Australia,2010, although this method is aimed at the time-varying channel model of multiple base stations A global proportional fair scheduling method with base station cooperation is given, but different service requirements among users are not considered

[0007] The above resource scheduling method can meet the user's needs when all users have basically the same quality of service requirements, but when the users have different quality of service requirements, the base station will allocate relatively more resources to users with lower quality of service requirements It is unfair to allocate relatively less resources to users with higher quality of service requirements than their needs, and it is difficult to meet their business needs.

Images