CN105873226B

CN105873226B - The preferential LTE equity dispatching method of handling capacity

Info

Publication number: CN105873226B
Application number: CN201610182088.2A
Authority: CN
Inventors: 肖清华
Original assignee: Huaxin Consulting Co Ltd
Current assignee: Huaxin Consulting Co Ltd
Priority date: 2016-03-28
Filing date: 2016-03-28
Publication date: 2019-01-15
Anticipated expiration: 2036-03-28
Also published as: CN105873226A

Abstract

The invention discloses a kind of LTE equity dispatching method that handling capacity is preferential, include the following steps: that handling capacity is calculated；Priority update；High throughput users scheduling and low throughput users scheduling.The present invention has the rate variation that can automatically track each user in cell, and dynamically setting assessment threshold, filters out the user that channel quality is good, promote its dispatching priority；For the not high user of handling capacity, to prevent it from suffering from hunger by way of equity dispatching, and then combine throughput of system and fairness, promotion business carry out service quality to ensure customer perception the characteristics of.

Description

The preferential LTE equity dispatching method of handling capacity

Technical field

The present invention relates to a kind of dispatching method of LTE system, especially a kind of equity dispatching side LTE that handling capacity is preferential Method.

Background technique

LTE improves and enhances the air interface technologies of 3G using a variety of key technologies such as OFDM, SC-FDMA and MIMO, The time delay that user face and control plane can be significantly reduced improves the handling capacity of cell.It how to be preferably to be promoted with dispatching algorithm Handling capacity key point indicates, many factors such as service quality and dispatch state for different users according to its current channel RB resource allocation is carried out, guarantees that the resource of every sub-distribution makes full use of as far as possible, promotes user's perception.It is limited by frequency spectrum resource Property constraint, the resource scheduling algorithm of LTE seems most important, it determines the sequence and available transmission rate of grouping transmission.

Such as RR (Round Robin, polling dispatching), PF (Proportion Fair, ratio are fair) and SJF (Short Job First, shortest job first) etc. dispatching methods, merely emphasize throughput of system or fairness, do not account for two How equilibrium is realized between person.

Summary of the invention

Goal of the invention of the invention is cannot be considered in terms of to overcome LTE system scheduling of resource low efficiency in the prior art The deficiency of throughput of system and fairness provides a kind of LTE equity dispatching method that handling capacity is preferential.

To achieve the goals above, the invention adopts the following technical scheme:

A kind of LTE equity dispatching method that handling capacity is preferential, including N number of user { u₁, u₂..., u_N, set u_iIt is each User, u_i∈{u₁, u₂..., u_N}；Include the following steps:

(1-1) handling capacity is calculated；

(1-2) priority update；

The scheduling of (1-3) high throughput users；

The scheduling of (1-4) low throughput users.

The preferential LTE fairness dispatching method of handling capacity of the invention is promoted by filtering out the user that channel quality is good Its dispatching priority, and the user not high for handling capacity, then by way of equity dispatching to prevent it from suffering from hunger, so that Dispatching method can combine throughput of system and fairness.

The preferential LTE fairness dispatching method of handling capacity of the invention, can automatically track the speed of each user in cell Rate variation, dynamically threshold is assessed in setting, and then promotes the service quality of business development as much as possible to ensure customer perception.

Preferably, step (1-1) includes the following steps:

(2-1) set the signal-to-noise ratio of each user asThe bit error rate of business isDistribute to each user RB resource block quantity beUtilize formula Calculate the throughput evaluation index of each user

(2-2) sets each occupied bandwidth of RB resource as B_RB, utilize formulaIt calculates each The handling capacity of user

Preferably, step (1-2) includes the following steps:

(3-1) utilizes formulaCalculate handling capacity desired valueAnd benefit Use formulaCalculate the nondimensionalization throughput value of each user

(3-2) utilizes formulaDesired value after calculating nondimensionalizationUtilize formulaCalculate variances sigma_i, utilize formulaCalculate weight coefficient

(3-3)

Utilize formulaCalculate and update the dispatching priority ρ of each user_i。

Preferably, step (1-3) includes the following steps:

(4-1) sets k user and meetsThe priority of k user is { ρ₁, ρ₂..., ρ_k, it calculates minimum excellent First grade ρ_a=min (ρ_j), ρ_j∈{ρ₁, ρ₂..., ρ_k}；

(4-2) is by { ρ₁, ρ₂..., ρ_kDescending arrangement is carried out, scheduler carries out first according to the size of each User Priority After dispatch.

Preferably, step (1-4) includes the following steps:

(5-1) is { ρ respectively for remaining N-k user, priority_k+1, ρ_k+2..., ρ_N, utilize formulaρ_q∈{ρ_k+1, ρ_k+2..., ρ_NCalculate N-k user desired value ρ_b；

(5-2) utilizes formula ρ_N-k=min (ρ_a, ρ_b) calculate ρ_N-k, by the unified setting of the priority of remaining N-k user For ρ_N-k, scheduler is according to ρ_N-kRemaining N-k user is scheduled.

Therefore, the invention has the following beneficial effects: throughput of system and fairness is taken into account, cell can automatically be tracked In each user rate variation, dynamically setting assessment threshold, as much as possible promotion business carry out service quality to ensure visitor Family perception.

Detailed description of the invention

Fig. 1 is a kind of flow chart of the invention；

Fig. 2 is that the present invention and a kind of throughput ratio of RR, SJF are relatively schemed；

Fig. 3 is a kind of present invention figure compared with packet loss of RR, SJF；

Fig. 4 is a kind of present invention figure compared with fairness of RR, SJF.

Specific embodiment

The present invention will be further described with reference to the accompanying drawings and detailed description.

Embodiment as shown in Figure 1 is that embodiment is a kind of LTE equity dispatching method that handling capacity is preferential, including N number of use Family { u₁, u₂..., u_N, set u_iIt is each user, u_i∈{u₁, u₂..., u_N}；

Step 1: handling capacity is calculated；

Step 1-1: set the signal-to-noise ratio of each user asThe bit error rate of business isThe RB resource block quantity for distributing to each user isUtilize formulaThe handling capacity for calculating each user is commented Estimate index

Step 1-2: each occupied bandwidth of RB resource is set as B_RB, utilize formulaIt calculates The handling capacity of each user

Step 2: priority update；

Step 2-1: formula is utilizedCalculate handling capacity desired value And utilize formulaCalculate the nondimensionalization throughput value of each user

Step 2-2: formula is utilizedDesired value after calculating nondimensionalizationUtilize formulaCalculate variances sigma_i, utilize formulaCalculate weight coefficient

Step 2-3:

Utilize formulaCalculate and update the dispatching priority ρ of each user_i；

Step 3: high throughput users scheduling；

Step 3-1: k user of setting meetsThe priority of k user is { ρ₁, ρ₂..., ρ_k, it calculates minimum Priority ρ_a=min (ρ_j), ρ_j∈{ρ₁, ρ₂..., ρ_k}；

Step 3-2: by { ρ₁, ρ₂..., ρ_kDescending arrangement is carried out, scheduler is carried out according to the size of each User Priority Successively scheduling.；

Step 4: low throughput users scheduling；

Step 4-1: for remaining N-k user, priority is { ρ respectively_k+1, ρ_k+2..., ρ_N, utilize formulaρ_q∈{ρ_k+1, ρ_k+2..., ρ_NCalculate N-k user desired value ρ_b；

Step 4-2: formula ρ is utilized_N-k=min (ρ_a, ρ_b) calculate ρ_N-k, the priority of remaining N-k user is uniformly set It is set to ρ_N-k, scheduler is according to ρ_N-kRemaining N-k user is scheduled.

The present invention is specifically described by taking N=5 as an example below, representative basis data are as shown in table 1, table 2:

Serial number	Project	Data
			1	TTI(ms)	1
2	System bandwidth (MHz)	20
			3	RB sum (a)	80
4	Each RB resource occupation bandwidth B_RB(kHz)	180

Table 1

Table 2

The preferential LTE fairness dispatching method of the handling capacity of this example description, includes the following steps: that handling capacity is calculated, excellent First grade updates, high throughput users scheduling, low throughput users scheduling.

Step 1: handling capacity is calculated；

Calculate user { u₁, u₂..., u₅Throughput evaluation index

According to B_RB, calculate the handling capacity of each user

Step 2: priority update；

Step 2-1: handling capacity desired value is calculatedAnd dimensionless is carried out to the handling capacity of each user Change processing

Step 2-2: the desired value after solving nondimensionalization? Variance outAnd solve weight coefficient

Step 2-3: the dispatching priority of each user is updated according to weight coefficient

Step 3: high throughput users scheduling；

Step 3-1: meetNumber of users k=2, i.e. u₁And u₅, priority is { 0.26,0.24 } respectively, is calculated Minimum priority ρ_a=min (ρ_j)=0.24；

Step 3-2: { 0.26,0.24 } is subjected to descending arrangement, scheduler is according to user { u₁, u₅Priority size into Row successively scheduling；

Step 4: low throughput users scheduling；

Step 4-1: for remaining 3 user { u₂, u₃, u₄, priority is { 0.08,0.31,0.10 } respectively, meter Calculate its desired value

Step 4-2: ρ is calculated_N-k=min (0.24,0.17)=0.17, by { u₂, u₃, u₄Priority be uniformly set as 0.17, scheduler is submitted to, scheduler is according to 0.17 to { u₂, u₃, u₄Be scheduled.

Emulation experiment:

By TFFG method of the invention and RR, the methods of PF and SJF carry out simulation comparison, dispatch number of users from 10 gradually Increase to 30, resulting LTE system handling capacity, the packet loss occurred in scheduling process and method fairness are respectively referring to attached Fig. 2 to 4.

As shown in Fig. 2, TFFG of the invention gives the scheduling power of the user that channel quality is good more preferably, therefore generates and compare RR With the higher handling capacity of SJF algorithm, and with the increase for participating in scheduling number of users, throughput of system is consequently increased.

As shown in figure 3, the packet loss of TFFG of the invention, between RR and SJF, reason is SJF always with most short Job priority does not consider user's state in which environment as dispatching criterion, therefore its packet loss is always positioned at a high position, and RR is then only It is simply to have taken into account each user in line with fair principle.

As shown in figure 4, TFFG of the invention has taken into account the public affairs of low throughput users while considering high throughput users Levelling, therefore, fairness are located among RR and SJF, and with the increase of scheduling user, fairness is gradually decreased.

It should be understood that this embodiment is only used to illustrate the invention but not to limit the scope of the invention.In addition, it should also be understood that, After having read the content of the invention lectured, those skilled in the art can make various modifications or changes to the present invention, these etc. Valence form is also fallen within the scope of the appended claims of the present application.

Claims

1. a kind of LTE equity dispatching method that handling capacity is preferential, characterized in that including N number of user { u₁, u₂..., u_N, set u_i It is each user, u_i∈{u₁, u₂..., u_N}；Include the following steps:

(1-1) handling capacity is calculated:

(1-1-1) set the signal-to-noise ratio of each user asThe bit error rate of business isDistribute to each user's RB resource block quantity isUtilize formula Calculate the throughput evaluation index of each user

(1-1-2) sets each occupied bandwidth of RB resource as B_RB, utilize formulaCalculate each use The handling capacity at family

(1-2) priority update:

(1-2-1) utilizes formulaCalculate handling capacity desired valueAnd it utilizes FormulaCalculate the nondimensionalization throughput value of each user

(1-2-2) utilizes formulaDesired value after calculating nondimensionalizationUtilize formulaCalculate variances sigma_i, utilize formulaCalculate weight coefficient

(1-2-3)

Utilize formulaIt calculates and updates each dispatching priority ρ with corpse_i；

The scheduling of (1-3) high throughput users:

(1-3-1) sets k user and meetsThe priority of k user is { ρ₁, ρ₂..., ρ_k, it calculates minimum preferential Grade ρ_a=min (ρ_j), ρ_j∈{ρ₁, ρ₂..., ρ_k}；

(1-3-2) is by { ρ₁, ρ₂..., ρ_kDescending arrangement is carried out, scheduler carries out successive according to the size of each User Priority Scheduling；

The scheduling of (1-4) low throughput users:

(1-4-1) is { ρ respectively for remaining N-k user, priority_k+1, ρ_k+2..., ρ_N, utilize formulaCalculate the desired value ρ of N-k user_b；

(1-4-2) utilizes formula ρ_N-k=min (ρ_a, ρ_b) calculate ρ_N-k, uniformly set the priority of remaining N-k user to ρ_N-k, scheduler is according to ρ_N-kRemaining N-k user is scheduled.