Multi-base-station multi-user proportional-fairness scheduling method with guarantee of service quality

A proportional fair scheduling and quality of service technology, applied in electrical components, wireless communication, etc., can solve the problems of not considering the business needs between users, not considering the situation of multiple base stations, and the difficulty of allocating resources to meet business needs

Active Publication Date: 2015-12-16
XIDIAN UNIV
View PDF1 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] ZhangYJ, LiewSC. 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 time-varying channel models, there are many The sources of multiple antennas, multiple subcarriers and multiple channels are all from the same base station, and the situation of multiple base stations is not considered
[0006] HuiZhou, PingyiFan, Xiang-GenXia, KhaledBenLetaief.AchievingNetworkWideProportionalFairness:APricingMethod.ProceedingsofIEEEWirelessCommunicationsandNetworkingConference,Sydney,Australia,2010, although this method provides a global proportional fair scheduling method with base station cooperation for the time-varying channel model of multiple base stations, but Does not take into account the different business needs among users
[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.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Multi-base-station multi-user proportional-fairness scheduling method with guarantee of service quality
  • Multi-base-station multi-user proportional-fairness scheduling method with guarantee of service quality
  • Multi-base-station multi-user proportional-fairness scheduling method with guarantee of service quality

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0044] refer to figure 1 , the specific implementation steps of the present invention are as follows:

[0045] Step 1, set the initialization parameters.

[0046] Suppose the number of base stations in the system is N, and the number of users to be served is M, where 1<N≤10, 0<M≤50;

[0047] Set the user's service quality set S=[S 1 ,...,S m ,...,S M ], where S m Indicates the service quality requirement of the mth user;

[0048] Set M users to keep the service quality requirement S unchanged in K time slots;

[0049] In the 1st to i-th time slots, the time-average throughput obtained by the m-th user from the n-th base station is expressed as T n,m (i), where n=1,2,...,N, m=1,2,...,M, i represents the number of time slots, initialized to i=1, and let the average throughput of all links T n,m (1)=1 / N.

[0050] Step 2, calculate the user weight according to the user's time average throughput.

[0051] Let time slot i=i+1, according to the time average throughput T of...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a multi-base-station multi-user proportional-fairness scheduling method with guarantee of the service quality, and mainly solves the problem that resource scheduling is unfair in the prior art due to neglect of the user service quality. The method comprises the steps that 1) parameters are set according to a practical scheduling problem; 2) the user weight is calculated according to the time averaging throughput of each user; 3) a base station determines the user to serve in the present time slot according to the user weight and the time averaging throughput; 4) after the user to serve in the present time slot is determined, the base station updates the local user throughput, and broadcasts local user throughput information to other bases stations in the network; and 5) scheduling in the roll is terminated according to a scheduling termination condition, and a scheduling result which satisfies the proportional fairness is obtained. Satisfied scheduling result can be obtained when the resources are sufficient or insufficient, the computational complexity is low, the base station scheduling efficiency in the time-varying channels is improved, and the method can be applied to large-scale wireless local area network 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 ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04W72/12
CPCH04W72/54
Inventor 郭漪王志敏刘刚葛建华
Owner XIDIAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products