CN1984457A - Method for up-link scheduling controlled by base-station - Google Patents

Abstract

The method comprises: a) estimating the cell available resources used for scheduling the speed; b) deciding the scheduling priority of each UE in cell; c) according to the priority of each UE, allocating resources for each UE. It also comprises: receiving the buffer area occupation status reported from UE; according to the buffer occupation status, allocating the scheduling resources for each UE. In the invention, after scheduling priority of UE is determined, the buffer occupation status is considered, and the UE with fuller buffer will be scheduled firstly.

Description

A kind of uplink dispatch method of base stations control

Technical field

The present invention relates to high speed uplink packet and insert (HSUPA, High Speed Uplink PacketAccess) technology, particularly relate to a kind of uplink dispatch method of base stations control.

Background technology

Wideband Code Division Multiple Access (WCDMA) (WCDMA) is as one of 3G standard of current main flow, among himself system is in and constantly improves.In Release 5 versions, WCDMA has introduced high speed downlink packet access (HSDPA, High Speed Downlink Packet Access) technology, and is called a key character of Release 5 versions.The HSDPA technology makes the descending handling capacity of WCDMA reach two to three times of version before the Release 5, can carry various Packet Services effectively.

Corresponding with it, during the HSUPA technology is in and discusses warmly, and probably be introduced in Release 6 versions of WCDMA.The core objective of HSUPA technology is by using some up technique for enhancing to improve the throughput of ascending packet data.The simulation result of 3GPP TR25.896 shows, the throughput that the HSUPA technology can make the WCDMA up channel improves 30% to 50% on the basis of version before.At present, as up-to-date hot technology, among the WCDMA system protocol is being formulated about the standard of HSUPA, the HSUPA technology mainly comprise base station (NodeB) control scheduling, mix automatic repeat requests (HARQ, Hybrid Automatic Repeat Request) etc.

Wherein, scheduling based on NodeB mainly passes through to measure uplink interference, subscriber equipment (UE, UserEquipment) report the relevant state information of NodeB, the transport format combination set (TFCS, Transport Format Combination Set) of restriction UE is to reach the purpose of scheduling.NodeB indicates by corresponding resource on down link and notifies UE the ascending resource of its maximum that can utilize.Uplink scheduling based on NodeB is divided into two classes: absolute scheduling and relative scheduling.Absolute scheduling is NodeB provides its available ascending resource at every turn to UE a maximum; Relatively scheduling is that NodeB increases the last employed ascending resource of UE or reduces by a magnitude, as the value of the employed ascending resource of this UE.

Introduce the idiographic flow of the uplink scheduling of existing NodeB control below.

The first step, calculate the cell available resources that is used for rate scheduling in the current dispatching cycle:

If only consider to exist Dedicated Physical Control Channel (DPCCH, Dedicated Physical ControlChannel) and strengthen dedicated channel (E-DCH, Enhanced Dedicated Data Channel) Dedicated Physical Data Channel (E-DPDCH, Enhanced Dedicated Physical Data Channel), then n UE represents with the form of signal to noise ratio that to the contribution of the load of sub-district j (this sub-district) its computing formula is as follows:

${(\mathrm{Ec}/N0)}_{n,j}\left(R\right)={\left(\frac{\mathrm{SIR}}{256}\right)}_{n,j}[1+{\left(\frac{{\mathrm{\β}}_{e,R}}{{\mathrm{\β}}_c}\right)}^2]---\left(1\right)$

Wherein SIR is the signal interference ratio on the DPCCH channel, β _cAnd β _{E, R}Be respectively the gain factor of DPCCH channel and E-DPDCH interchannel, n and j are positive integer.

Following calculating is used for the sub-district current available resource Cav (j) of rate scheduling:

Cav(j)＝maxLoad-Cav(j) ₁-Cav(j) ₂-Cav(j) ₃ (2)

${\mathrm{Cav}\left(j\right)}_1=\underset{n\∈\mathrm{NonPriSec}\left(j\right)}{\mathrm{\Σ}}\frac{{(\mathrm{Ec}/N0)}_{n,j}\left(R(n,k-1)\right)}{1+{(\mathrm{Ec}/N0)}_{n,j}\left(R(n,k-1)\right)}---\left(3\right)$

Wherein NonPriSec (j) is as active set cell but be not the set of all UE of optimum subdistrict with sub-district j, maxload is the maximum load that be can bear by the sub-district that the network planning is determined according to capacity and covering, (n k-1) is the transmission rate of n UE k dispatching cycle to R.Generally be to be unit with the frame dispatching cycle, and k is a positive integer.

${\mathrm{Cav}\left(j\right)}_2=\underset{n\∈\mathrm{ReTxPriSec}(j,k)}{\mathrm{\Σ}}\frac{{(\mathrm{Ec}/N0)}_{n,j}\left(R(n,k-1)\right)}{1+{(\mathrm{Ec}/N0)}_{n,j}\left(R(n,k-1)\right)}---\left(4\right)$

Wherein (j k) is the set of all UE that need retransmit as optimum subdistrict but k dispatching cycle with sub-district j to ReTxPriSec.

${\mathrm{Cav}\left(j\right)}_3=\underset{n\∈\mathrm{NewTxPriSec}(j,k)}{\mathrm{\Σ}}\frac{{(\mathrm{Ec}/N0)}_{n,j}\left(R_{\mathrm{red}}(n,k-1)\right)}{1+{(\mathrm{Ec}/N0)}_{n,j}\left(R_{\mathrm{red}}(n,k-1)\right)}---\left(5\right)$

Wherein, NewTxPriSec (j, k) be with sub-district j as optimum subdistrict k dispatching cycle New Development the set of all UE, R _Red(n, k-1)=max (R _Auto, R (n, k-1)-1), R _AutoBe automatic transmission rate, if do not allow automatic emission, then R _AutoBe 0.

Second step, calculate belong to NewTxPriSec (j, the priority of all UE k):

The dispatching priority of determining UE is the important step that realizes scheduling, and determining of UE dispatching priority is relevant with request rate and the Mean Speed of UE:

$S_n\left(k\right)=\frac{{\·\left[R_{\mathrm{req}}(n,k)\right]}^{\mathrm{\β}}}{{\left[R_{\mathrm{avg}}(n,k)\right]}^{\mathrm{\η}}}---\left(6\right)$

R wherein _Req(n is n UE at the request rate of k dispatching cycle k), is that NodeB regularly reports according to UE and the buffer size upgraded is calculated; β and η are fairness factor, R _Avg(n is n UE in the Mean Speed of k dispatching cycle k), is to calculate in transmission rate and the Mean Speed of (k-1) individual dispatching cycle according to this UE, and computing formula is as follows:

R _avg(n，k)＝(1-χ)R _avg(n，k-1)+χR(n，k-1) (7)

Wherein (n is n UE in the transmission rate of k dispatching cycle k) to R, and χ is a smoothing factor, is generally 0.1, Initial R _Avg(n ,-1)=16.0kbps or other size.

(j, k) in the set, the priority of UE is according to S at NewTxPriSec _n(k) Zhi big minispread generates priority list, S _n(k) priority of the UE of value maximum is the highest, S _n(k) priority of the UE of value minimum is minimum, the positive integer m of expression UE position in priority list is set, and the initial value of m is set to 0.

In the 3rd step, the transmission rate of the UE of m position is in priority list:

$R_{\mathrm{grant}}(m,k)=\arg \underset{R_{\mathrm{red}}(m,k-1)\≤R\≤R_{\mathrm{req}}(m,k)}{\max }\mathrm{Cav}\left(j\right)-\frac{{(\mathrm{Ec}/N0)}_{m,j}\left(R\right)}{1+{(\mathrm{Ec}/N0)}_{m,j}\left(R\right)}+\frac{{(\mathrm{Ec}/N0)}_{m,j}\left(R_{\mathrm{red}}(m,k-1)\right)}{1+{(\mathrm{Ec}/N0)}_{m,j}\left(R_{\mathrm{red}}(m,k-1)\right)}\≥0---\left(8\right)$

From formula (8) as can be seen, the size of the transmission rate of UE that is to say that by the available resource decision of current area different transmission rates will produce different load sizes.

If formula (8) is not separated, then R _Grant(m, k)=R _Red(m, k-1).Like this, send to the assignment messages of UE, promptly be assigned to the permission speed G of UE _m(k) as follows:

From formula (9) as can be seen, if calculate the transmission rate of gained current dispatching cycle greater than the transmission rate of last dispatching cycle, then the assignment messages sent of NodeB is UP; If the transmission rate of calculating the gained current dispatching cycle equals the transmission rate of last dispatching cycle, then the assignment messages sent of NodeB is KEEP; If calculate the transmission rate of gained current dispatching cycle less than the transmission rate of last dispatching cycle, then the assignment messages sent of NodeB is DOWN.

After UE receives assignment messages UP, its transmission rate is improved one-level; After UE receives assignment messages KEEP, keep its existing transmission rate constant; After UE receives assignment messages DOWN, its transmission rate is reduced one-level.

What more than adopt is the mode of dispatching relatively, when adopting the mode of absolute scheduling, comprises the value of the concrete transmission rate that calculates in the assignment messages that NodeB issues.

The 4th step if formula (8) is separated, illustrated that current dispatching cycle can supply scheduled resources in addition, then utilized formula (10) to upgrade the sub-district current available resource that is used for rate scheduling; Do not separate if formula (8) has, illustrate and do not dispatched the resource of other UE k dispatching cycle, finish the scheduling of this dispatching cycle.

$\mathrm{Cav}\left(j\right)=\mathrm{Cav}\left(j\right)+\frac{{(\mathrm{Ec}/N0)}_{m,j}\left(R_{\mathrm{red}}(m,k-1)\right)}{1+{(\mathrm{Ec}/N0)}_{m,j}\left(R_{\mathrm{red}}(m,k-1)\right)}-\frac{{(\mathrm{Ec}/N0)}_{m,j}\left(R_{\mathrm{grant}}(m,k)\right)}{1+{(\mathrm{Ec}/N0)}_{m,j}\left(R_{\mathrm{grant}}(m,k)\right)}\≥0---\left(10\right)$

The 5th step if formula (10) is separated, illustrated that current dispatching cycle can supply scheduled resources in addition, then returned for the 3rd step, was that (m+1) individual UE distributes transmission rate; If formula (10) does not have and not separate, illustrating has not currently had to supply scheduled resources, finishes the scheduling of this dispatching cycle.

From above technical scheme as can be seen, do not consider the situation that takies of UE buffering area in the scheme of existing UE dispatching priority, and do not consider that in the allocative decision of scheduling resource the UE buffering area takies situation yet, therefore can't give user resource allocation in fairness ground, thereby can't obtain bigger throughput gain.In addition, can support stream (Streaming), mutual (Interactive) and three kinds of business of background (Background) by the scheduling of NodeB control, different business has different quality requirements, but in the scheme of existing dispatching priority, do not consider professional quality requirement, thereby can't keep its desired service quality different business.

Summary of the invention

In view of this, main purpose of the present invention is to provide a kind of method of base stations control uplink scheduling, by consider that the buffering area of each UE takies situation when dispatching, is the UE Resources allocation fairness.

The objective of the invention is to be achieved through the following technical solutions:

A kind of uplink dispatch method of base stations control comprises:

A, calculating are used for the cell available resources of rate scheduling;

B, determine the dispatching priority of each subscriber equipment in the sub-district;

C, according to the sequencing of determined dispatching user facility priority, be each user equipment allocation scheduling resource in the sub-district;

Key is that this method further comprises: the buffering area that receives each user equipment to report takies situation, and takies situation with reference to the current buffering area of each subscriber equipment and be each user equipment allocation scheduling resource.

Described current buffering area with reference to each subscriber equipment takies situation and comprises for each user equipment allocation scheduling resource: when the dispatching priority of described definite each subscriber equipment of step b, the current buffering area of each subscriber equipment is taken situation as a parameter determining dispatching priority, and the dispatching priority of the subscriber equipment that buffering area is fuller is higher.

Described current buffering area with reference to each subscriber equipment takies situation and comprises for each user equipment allocation scheduling resource: described at step c in the sub-district during each user equipment allocation scheduling resource, and take situation with reference to the current buffering area of each subscriber equipment and be each subscriber equipment appointment transmission rate.

The buffering area of described subscriber equipment takies the buffer performance that situation is a subscriber equipment;

In step b, determine the dispatching priority of each subscriber equipment according to following formula:

$S_n\left(k\right)\frac{{\·\left[R_{\mathrm{req}}(n,k)\right]}^{\mathrm{\β}}}{{\left[R_{\mathrm{avg}}(n,k)\right]}^{\mathrm{\η}}}\×{\left[\frac{\mathrm{Bo}(n,k)}{\underset{n}{\max }\mathrm{Bo}(n,k)}\right]}^{\mathrm{\ρ}}$

Wherein, S _n(k) be nth user's equipment at the dispatching priority of k dispatching cycle, Bo (n is nth user's equipment at the buffer performance of k dispatching cycle k), Be the maximum of buffer performance in all subscriber equipmenies, R _Req(n is nth user's equipment at the request rate of k dispatching cycle k), R _Avg(n is nth user's equipment in the Mean Speed of k dispatching cycle k), and β, η, ρ are fairness factor, and n and k are positive integer.

This method further comprises: according to type of service is the handled business setting priority of subscriber equipment;

When the described dispatching priority of determining each subscriber equipment of step b, with each subscriber equipment when the priority of the business of pre-treatment as a parameter determining dispatching priority, it is higher that processing has the dispatching priority of subscriber equipment of business of higher service priority.

The buffering area of described subscriber equipment takies the buffer performance that situation is a subscriber equipment;

In step b, determine the dispatching priority of each subscriber equipment according to following formula:

$S_n\left(k\right)={{\mathrm{\α}}_n}^{\mathrm{\λ}}\·\frac{\·{\left[R_{\mathrm{req}}(n,k)\right]}^{\mathrm{\β}}}{{\left[R_{\mathrm{avg}}(n,k)\right]}^{\mathrm{\η}}}\×{\left[\frac{\mathrm{Bo}(n,k)}{\underset{n}{\max }\mathrm{Bo}(n,k)}\right]}^{\mathrm{\ρ}}$

Wherein, S _n(k) be nth user's equipment at the dispatching priority of k dispatching cycle, α _nBe the priority of the handled business of nth user's equipment, Bo (n is nth user's equipment at the buffer performance of k dispatching cycle k), Be the maximum of buffer performance in all subscriber equipmenies, R _Req(n is nth user's equipment at the request rate of k dispatching cycle k), R _Avg(n is nth user's equipment in the Mean Speed of k dispatching cycle k), and β, η, ρ are fairness factor, and n and k are positive integer.

In step c, describedly for each user equipment allocation scheduling resource in the sub-district be: take situation according to the current buffering area of each subscriber equipment and assign each subscriber equipment employed transmission rate in this dispatching cycle.

The buffering area of described subscriber equipment takies the buffer performance that situation is a subscriber equipment;

The employed transmission rate of each subscriber equipment of the described appointment of step c is:

C1, according to dispatching priority order from high to low, select subscriber equipment and calculate this subscriber equipment in this dispatching cycle of employed transmission rate estimation value according to the current cell available resources that is used for rate scheduling;

This subscriber equipment that c2, basis calculate assigns this subscriber equipment in this dispatching cycle of employed transmission rate at the current buffer performance of this dispatching cycle employed transmission rate estimation value and this subscriber equipment;

C3, renewal are used for the cell available resources of rate scheduling, return step c1 then, calculate next subscriber equipment in this dispatching cycle of employed transmission rate estimation value, assign until the cell available resources that is used for rate scheduling.

The employed transmission rate of the described appointment subscriber equipment of step c2 is:

If described subscriber equipment in the transmission rate estimation value of this dispatching cycle greater than the transmission rate of subscriber equipment in last dispatching cycle, and the current buffer performance of subscriber equipment then sends the rate assignment message that comprises the transmission rate estimation value that calculates to subscriber equipment greater than the buffer performance mean value of all subscriber equipmenies;

If described subscriber equipment in the transmission rate estimation value of this dispatching cycle less than the transmission rate of subscriber equipment in last dispatching cycle, and the current buffer performance of subscriber equipment then sends the rate assignment message that comprises the transmission rate estimation value that calculates to subscriber equipment less than the buffer performance mean value of all subscriber equipmenies;

If described subscriber equipment in the transmission rate of this dispatching cycle greater than the transmission rate of subscriber equipment in last dispatching cycle, and the current buffer performance of subscriber equipment then sends the rate assignment message that its transmission rate is increased one-level to subscriber equipment less than the buffer performance mean value of all subscriber equipmenies;

If described subscriber equipment equals subscriber equipment in the transmission rate of last dispatching cycle in the transmission rate of this dispatching cycle, then send the rate assignment message that keeps its transmission rate to subscriber equipment;

If described subscriber equipment in the transmission rate of this dispatching cycle less than the transmission rate of subscriber equipment in last dispatching cycle, and the current buffer performance of subscriber equipment then sends the rate assignment message that its transmission rate is reduced one-level to subscriber equipment greater than the buffer performance mean value of all subscriber equipmenies.

In step a,, consider the influence of neighbor cell to this cell load calculating when being used for the cell available resources of rate scheduling this dispatching cycle.

Influence comprises described consideration neighbor cell to this cell load: determine the parameter f of neighbor cell to the influence of this cell load;

The cell available resources that the described estimation of step a is used for rate scheduling this dispatching cycle is:

Cav(j)＝max?Load-Cav(j) ₁-Cav(j) ₂-Cav(j) ₃

Wherein, sub-district j is this sub-district, and Cav (j) is the available resources of the sub-district j that is used for rate scheduling this dispatching cycle, and maxload is the maximum load of this sub-district, Cav (j) ₁Be with sub-district j as active set cell but be not the estimated values of all subscriber equipmenies of optimum subdistrict to the load of sub-district j, Cav (j) ₂Be all subscriber equipmenies that need retransmit as optimum subdistrict but in this dispatching cycle with sub-district j estimated values to the load of sub-district j, Cav (j) ₃Be with sub-district j as optimum subdistrict this dispatching cycle New Development all subscriber equipmenies to the estimated value of the load of sub-district j; Wherein:

$\mathrm{Cav}{\left(j\right)}_1=\underset{n\∈\mathrm{NonPriSec}\left(j\right)}{\mathrm{\Σ}}f\×\frac{{(\mathrm{Ec}/N0)}_{n,j}\left(R(n,k-1)\right)}{1+{(\mathrm{Ec}/N0)}_{n,j}\left(R(n,k-1)\right)}$

Wherein, NonPriSec (j) be with sub-district j as active set cell but be not the set of all subscriber equipmenies of optimum subdistrict, $\frac{{(\mathrm{Ec}/N0)}_{n,j}\left(R(n,k-1)\right)}{1+{(\mathrm{Ec}/N0)}_{n,j}\left(R(n,k-1)\right)}$ For nth user's equipment in (k-1) individual dispatching cycle the estimated value to the load of sub-district j, n and k are positive integer.

Described definite neighbor cell to the parameter f of the influence of this cell load is: determine parameter f by emulation or actual network design scene.

From above scheme as can be seen, according to an aspect of the present invention, when determining the dispatching priority of UE, take situation with reference to the UE buffering area, the UE that the priority scheduling buffering area is fuller, thus realized the more scheduling of fairness.

According to a further aspect in the invention, when being UE allocation schedule resource, take situation, can determine to use still scheduling relatively of absolute scheduling, improved scheduling fairness, increased data throughout according to the situation of UE buffering area with reference to the UE buffering area.

According to a further aspect in the invention, when determining the dispatching priority of UE, handle professional service priority with reference to UE, like this, the UE that the priority of priority scheduling current business is high, thus realize different business is kept different service quality.

According to a further aspect in the invention, when determining the available resources that the sub-district is used to dispatch,, thereby realize better " sigma compactness " of load-threshold controlled with reference to the influence of neighbor cell to the load of this sub-district.

Description of drawings

Fig. 1 is the uplink dispatch method flow chart according to the base stations control of the embodiment of the invention one.

Fig. 2 is the uplink dispatch method flow chart according to the base stations control of the embodiment of the invention two.

Fig. 3 is the uplink dispatch method flow chart according to the base stations control of the embodiment of the invention three.

Fig. 4 is the uplink dispatch method flow chart according to the base stations control of the embodiment of the invention four.

Embodiment

In order to make purpose of the present invention, technical scheme and advantage clearer,, the present invention is further elaborated below in conjunction with drawings and Examples.Should be appreciated that specific embodiment described herein only in order to explanation the present invention, and be not used in qualification the present invention.

Core concept of the present invention is: when determining the dispatching priority of UE, with reference to the situation that takies of UE buffering area.Perhaps, when distributing transmission rate, take situation, determine this UE is used still scheduling relatively of absolute scheduling according to the buffering area of UE for UE.

Embodiment one:

Fig. 1 is the method flow diagram according to the uplink scheduling of the embodiment of the invention one.In the present embodiment, determine the priority and the allocation schedule speed of uplink scheduling with reference to the situation that takies of UE buffering area.As can be seen from Figure 1, present embodiment specifically comprises following steps:

Step 101:NodeB receives the buffer state that UE reports, and upgrades the size of buffering area, and more new formula is as follows:

Q(k)＝Q(k-1)-Data _tx (11)

Wherein Q (k) be k dispatching cycle buffering area estimated value, Q (k-1) is the estimated value of buffering area (k-1) individual dispatching cycle, Data _TxBe the data of last dispatching cycle emission, k is a positive integer.

Step 102: calculate the request rate that UE wishes according to the buffer size after upgrading:

$R_{\mathrm{req}}(n,k)=\min (R_{\max }\left(\mathrm{power}\right),\underset{R\≤1024\mathrm{kbps}}{\arg \max }\{R|Q\left(k\right)\≥R\·\mathrm{TTI}\})---\left(12\right)$

R wherein _Max(power) be the maximum rate that the transmitting power of UE can be supported; 1024kbps is the supported maximum rate of ascending reinforced special channel, and the supported maximum rate of this ascending reinforced special channel also can be worth for other; $\underset{R\≤1024\mathrm{kbps}}{\arg \max }\left\{R\right|Q\left(k\right)\≥R\·\mathrm{TTI}\}$ Be meant the peak transfer rate that data volume corresponding in the transmit buffer can provide.

Step 103: the base station averages the buffer state that UE in the sub-district reports, and obtains the mean value of buffer size, and formula is as follows:

$\stackrel{\‾}{B}o\left(k\right)=\frac{\mathrm{Bo}(1,k)+\mathrm{Bo}(2,k)+\·\·\·+\mathrm{Bo}(N,k)}{N}---\left(13\right)$

Wherein N is schedulable UE number, Bo (1, k) to Bo (N k) is respectively the 1st buffering area that reports to N UE and takies situation, Take the mean value of situation for all UE buffering areas.The state of buffering area can be expressed as buffering area and take situation, for example the occupancy of buffering area.

Step 104: calculate the cell available resources that is used for rate scheduling:

Suppose only to consider to have channel DPCCH and E-DPDCH, then n UE is as follows to the contribution of sub-district j load:

${(\mathrm{Ec}/N0)}_{n,j}\left(R\right)={\left(\frac{\mathrm{SIR}}{256}\right)}_{n,j}[1+{\left(\frac{{\mathrm{\β}}_{e,R}}{{\mathrm{\β}}_c}\right)}^2]---\left(1\right)$

Wherein SIR is the signal interference ratio on the DPCCH channel, β _cAnd β _{E, R}Be respectively the gain factor between DPCCH and the E-DPDCH, n and j are positive integer.

Following calculating is used for the sub-district current available resource Cav (j) of rate scheduling:

Cay(j)＝maxLoad-Cav(j) ₁-Cav(j) ₂-Cay(j) ₃ (2)

${\mathrm{Cav}\left(j\right)}_1=\underset{n\∈\mathrm{NonPriSec}\left(j\right)}{\mathrm{\Σ}}\frac{{(\mathrm{Ec}/N0)}_{n,j}\left(R(n,k-1)\right)}{1+{(\mathrm{Ec}/N0)}_{n,j}\left(R(n,k-1)\right)}---\left(3\right)$

Wherein NonPriSec (j) be with sub-district j as active set cell but be not the set of all UE of optimum subdistrict, maxLoad is a maximum load, (n k-1) is the transmission rate of n UE k dispatching cycle to R.

${\mathrm{Cav}\left(j\right)}_2=\underset{n\∈\mathrm{ReTxPriSec}(j,k)}{\mathrm{\Σ}}\frac{{(\mathrm{Ec}/N0)}_{n,j}\left(R(n,k-1)\right)}{1+{(\mathrm{Ec}/N0)}_{n,j}\left(R(n,k-1)\right)}---\left(4\right)$

Wherein (j k) is the set of all UE that need retransmit dispatching cycle as optimum subdistrict but in next time with sub-district j to ReTxPriSec.

${\mathrm{Cav}\left(j\right)}_3=\underset{n\∈\mathrm{NewTxPriSec}(j,k)}{\mathrm{\Σ}}\frac{{(\mathrm{Ec}/N0)}_{n,j}\left(R_{\mathrm{red}}(n,k-1)\right)}{1+{(\mathrm{Ec}/N0)}_{n,j}\left(R_{\mathrm{red}}(n,k-1)\right)}---\left(5\right)$

Wherein, (j is as the set of all UEs of optimum subdistrict in New Development dispatching cycle next time, R with sub-district j k) to NewTxPriSec _Red(n, k-1)=max (R _Auto, R (n, k-1)-1), R _AutoBe automatic transmission rate, if do not allow automatic emission, then R _AutoBe 0.

Step 105: calculate belong to NewTxPriSec (j, the priority of all UE k) is arranged UE according to priority, for example generates a priority list, the UE that priority is the highest comes first of tabulation, successively toward low.

For the buffering area that embodies different UEs takies situation, thereby may be those full UE preferential emission of buffering area, to be unlikely to because trigger the transmission control protocol (TCP, Transmission ControlProtocol) of UE thus congestion mechanism reduces transmission rate.In the present embodiment, n UE is as follows in the priority definition of k dispatching cycle:

$S_n\left(k\right)=\frac{\·{\left[R_{\mathrm{req}}(n,k)\right]}^{\mathrm{\β}}}{[R_{\mathrm{avg}}(n,k){]}^{\mathrm{\η}}}\×{\left[\frac{\mathrm{Bo}(n,k)}{\underset{n}{\max }\mathrm{Bo}(n,k)}\right]}^{\mathrm{\ρ}}---\left(14\right)$

Wherein β, η, ρ are fairness factor, Bo (n k) is the take situation of n UE at the buffering area of k dispatching cycle,

Be the maximum that takies of buffering area among all UE, R _Avg(n is n UE in the Mean Speed of k dispatching cycle k), but does not comprise k, following calculating:

R _avg(n，k)=(1-χ)R _avg(n，k-1)+χR(n,k-1) (7)

Wherein (n is n UE in the transmission rate of k dispatching cycle k) to R, and χ is a smoothing factor, is generally 0.1, Initial R _Avg(n ,-1)=16.0kbps or other size.

(j, k) in the set, the priority of UE is according to S at NewTxPriSec _n(k) Zhi big minispread generates priority list, S _n(k) priority of the UE of value maximum is the highest, S _n(k) priority of the UE of value minimum is minimum, the positive integer m of expression UE position in priority list is set, and the initial value of m is set to 0.

Step 106:m=m+1, calculating speed of the UE of m position in priority list is:

$R_{\mathrm{grant}}(m,k)=\arg \underset{R_{\mathrm{red}}(m,k-1)\≤R\≤R_{\mathrm{req}}(m,k)}{\max }\mathrm{Cav}\left(j\right)-\frac{{(\mathrm{Ec}/N0)}_{m,j}\left(R\right)}{1+{(\mathrm{Ec}/N0)}_{m,j}\left(R\right)}+\frac{{(\mathrm{Ec}/N0)}_{m,j}\left(R_{\mathrm{red}}(m,k-1)\right)}{1+{(\mathrm{Ec}/N0)}_{m,j}\left(R_{\mathrm{red}}(m,k-1)\right)}\≥0---\left(8\right)$

R wherein _Req(m is to take m peak transfer rate that UE supported in priority list that situation is determined according to power and buffering area k).If formula (8) is not separated, then R _Grant(m, k)=R _Red(m, k-1).Like this, send to the assignment messages of UE, promptly be assigned to the permission speed G of UE _m(k) as follows:

What more than adopt is the mode of dispatching relatively, when adopting the mode of absolute scheduling, comprises the value of the concrete transmission rate that calculates in the assignment messages that NodeB issues.

Step 107: determine in current dispatching cycle, whether there is the possibility of dispatching other UE,, then forward step 108 to if there is the possibility of other UE of scheduling; Otherwise, finish the scheduling of current dispatching cycle.

Can whether have to separate to determine in current dispatching cycle, whether there is the possibility of dispatching other UE by formula (8),, the possibility that has other UE of scheduling in the current dispatching cycle is described if formula (8) is separated; Do not separate if formula (8) has, illustrate not have the possibility of dispatching other UE in the current dispatching cycle.

Step 108: upgrade the sub-district current available resource that is used for rate scheduling:

$\mathrm{Cav}\left(j\right)=\mathrm{Cav}\left(j\right)+\frac{{(\mathrm{Ec}/N0)}_{m,j}\left(R_{\mathrm{red}}(m,k-1)\right)}{1+{(\mathrm{Ec}/N0)}_{m,j}\left(R_{\mathrm{red}}(m,k-1)\right)}-\frac{{(\mathrm{Ec}/N0)}_{m,j}\left(R_{\mathrm{red}}(m,k)\right)}{1+{(\mathrm{Ec}/N0)}_{m,j}\left(R_{\mathrm{grant}}(m,k)\right)}\≥0---\left(10\right)$

Step 109: determining whether there is the resource of dispatching other UE in current dispatching cycle, if there is the resource of other UE of scheduling, then forward step 106 to, is that (m+1) individual UE distributes transmission rate; Otherwise, finish the scheduling of current dispatching cycle.

In the present embodiment, considered the situation that takies of UE buffering area when determining the dispatching priority of UE, for the fuller UE priority scheduling of buffering area.Like this, can be comparatively liberally for UE be dispatched, and be unlikely to owing to the TCP congestion mechanism that triggers UE reduces transmission rate.

Embodiment two:

Fig. 2 is the method flow diagram according to the uplink scheduling of the embodiment of the invention two.In the present embodiment, the situation that takies with reference to the UE buffering area is that UE distributes transmission rate.As can be seen from Figure 2, present embodiment specifically comprises following steps:

Step 201 is identical to step 104 with step 101 respectively to step 204.

Step 205: calculate belong to NewTxPriSec (j, the priority of all UE k) is arranged UE according to priority, for example generates a priority list, the UE that priority is the highest comes first of tabulation, successively toward low.

In the present embodiment, n UE is as follows in the priority definition of k dispatching cycle:

$S_n\left(k\right)=\frac{{\·\left[R_{\mathrm{req}}(n,k)\right]}^{\mathrm{\β}}}{{\left[R_{\mathrm{avg}}(n,k)\right]}^{\mathrm{\η}}}---\left(6\right)$

Wherein β, η are fairness factor, R _Avg(n is n UE in the Mean Speed of k dispatching cycle k), but does not comprise k.

(j, k) in the set, the priority of UE is according to S at NewTxPriSec _n(k) Zhi big minispread generates priority list, S _n(k) priority of the UE of value maximum is the highest, S _n(k) priority of the UE of value minimum is minimum, the positive integer m of expression UE position in priority list is set, and the initial value of m is set to 0.

Step 206: calculating speed of the UE of m position in priority list is:

$R_{\mathrm{grant}}(m,k)=\arg \underset{R_{\mathrm{red}}(m,k-1)\≤R\≤R_{\mathrm{req}}(m,k)}{\max }\mathrm{Cav}\left(j\right)-\frac{{(\mathrm{Ec}/N0)}_{m,j}\left(R\right)}{1+{(\mathrm{Ec}/N0)}_{m,j}\left(R\right)}+\frac{{(\mathrm{Ec}/N0)}_{m,j}\left(R_{\mathrm{red}}(m,k-1)\right)}{1+{(\mathrm{Ec}/N0)}_{m,j}\left(R_{\mathrm{red}}(m,k-1)\right)}\≥0---\left(8\right)$

R wherein _Req(n is to take the maximum rate that situation is determined according to power and buffering area k).If formula (8) is not separated, then R _Grant(m, k)=R _Red(m, k-1).Like this, send to the assignment messages of UE, promptly be assigned to the permission speed G of UE _m(k) as follows:

From following formula (15) as can be seen, present embodiment takies situation with reference to the buffering area of UE, and takies situation according to the buffering area that UE reports when distributing transmission rate for UE, determines to use absolute scheduling still to dispatch relatively to this UE.Be specially: be higher than mean value if the transmission rate of calculating the gained current dispatching cycle takies greater than the transmission rate of last dispatching cycle and buffering area, then adopt absolute scheduling, the assignment messages that send the base station is the transmission rate of the current dispatching cycle of calculating gained; If the transmission rate of the current dispatching cycle of calculating gained takies subaverage greater than transmission rate and the buffering area of last dispatching cycle, then adopt scheduling relatively, the assignment messages that send the base station is UP; If the transmission rate of calculating the gained current dispatching cycle equals the transmission rate of last dispatching cycle, then the assignment messages sent of base station is KEEP; Be higher than mean value if the transmission rate of calculating the gained current dispatching cycle takies less than the transmission rate of last dispatching cycle and buffering area, then adopt scheduling relatively, the assignment messages that send the base station is DOWN; If the transmission rate of the current dispatching cycle of calculating gained takies subaverage less than transmission rate and the buffering area of last dispatching cycle, then adopt absolute scheduling, the assignment messages that send the base station is the transmission rate of the current dispatching cycle of calculating gained.And formula (9) does not consider that buffering area takies situation, and UE has been adopted relative scheduling without distinction.

Step 207 to step 209 respectively with step 107 to 109 basic identical, do not repeat them here.

In the present embodiment, present embodiment is when determining the transmission rate of UE, to dispatch relatively and absolute scheduling combines, and UE that buffering area fuller, the transmission rate less and buffering area empty UE that calculate big for the transmission rate that calculates adopt definitely scheduling; For the transmission rate that calculates is big but buffering area transmission rate empty, that calculate is less but buffering area is full, the transmission rate and the original identical UE that calculate, adopt relatively and dispatch.Like this, can be the UE Resources allocation more liberally.

Should be appreciated that, in the step 205 of present embodiment, also can consider the situation that takies of UE buffering area when determining the dispatching priority of UE, shown as the formula (14) of step 105, for the fuller UE priority scheduling of buffering area.

Embodiment three:

Fig. 3 is the method flow diagram according to the uplink scheduling of the embodiment of the invention three.The difference of present embodiment and embodiment one only is, when definite uplink scheduling priority, not only with reference to the situation that takies of UE buffering area, also with reference to service priority.As can be seen from Figure 3, present embodiment comprises following steps:

Step 301: for different types of service different service priority is set in advance.

Step 302 is identical to step 104 with step 101 respectively to step 305.

Step 306 is basic identical with step 105, and difference only is: the dispatching priority that calculates UE according to formula (16):

$S_n\left(k\right)={{\mathrm{\α}}_n}^{\mathrm{\λ}}\·\frac{\·{\left[R_{\mathrm{req}}(n,k)\right]}^{\mathrm{\β}}}{{\left[R_{\mathrm{avg}}(n,k)\right]}^{\mathrm{\η}}}\×{\left[\frac{\mathrm{Bo}(n,k)}{\underset{n}{\max }\mathrm{Bo}(n,k)}\right]}^{\mathrm{\ρ}}---\left(16\right)$

α wherein _nEmbody the priority of n UE current business, β, η, ρ, λ are fairness factor, Bo (n k) is the take situation of n UE at the buffering area of k dispatching cycle,

Be the maximum that buffering area takies among all UE, R _Avg(n k) is the Mean Speed of n UE k dispatching cycle.

Step 307 is basic identical to step 109 with step 106 respectively to step 310, does not repeat them here.

Should be appreciated that the step 307 of present embodiment also can adopt the absolute scheduling and the relative mode that combines of dispatching in the step 206.

In the present embodiment, when determining the dispatching priority of UE, also with reference to professional priority, like this, but the high UE of the priority of priority scheduling current business, thus realize different business is kept different service quality.

Embodiment four:

Fig. 4 is the method flow diagram according to the uplink scheduling of the embodiment of the invention four.The difference of present embodiment and embodiment one only is, in the estimation procedure that can utilize capacity, with reference to influencing each other of neighbor cell.As can be seen from Figure 4, present embodiment comprises following steps:

Step 401 is identical to step 103 with step 101 respectively to step 403.

Step 404 and step 104 are basic identical, and institute's difference only is, are the active sets of UE for sub-district j but are not optimum descending sub-districts, calculate according to formula (17):

${\mathrm{Cav}\left(j\right)}_1=\underset{n\∈\mathrm{NonPriSec}\left(j\right)}{\mathrm{\Σ}}f\×\frac{{(\mathrm{Ec}/N0)}_{n,j}\left(R(n,k-1)\right)}{1+{(\mathrm{Ec}/N0)}_{n,j}\left(R(n,k-1)\right)}---\left(17\right)$

Wherein NonPriSec (j) is as active set cell but be not the set of all UE of optimum subdistrict with sub-district j.(n k-1) is the transmission rate of n UE k dispatching cycle to R.Compare with formula (3), formula (17) is introduced the interactional parameter f that neighbor cell is described from the statistical significance, parameter f is a configurable parameter, introducing it controls load-threshold " sigma compactness " in order to finish better, reduce because the actual loading that caused of control and the difference between the desired load thresholding, thereby estimate the available resource in sub-district more accurately.

Generally, determine the value of parameter f by emulation or actual network design scene.

Step 405 is basic identical to step 109 with step 105 respectively to step 409, does not repeat them here.

Should be appreciated that the step 406 of present embodiment also can adopt the absolute scheduling and the relative mode that combines of dispatching in the step 206.And the step 405 of present embodiment also can adopt the mode of the consideration service priority in the step 306.

In the present embodiment, in the estimation procedure that can utilize capacity,, thereby realize better " sigma compactness " of load-threshold controlled with reference to influencing each other between the neighbor cell load.

More than be four specific embodiments of the present invention, the present invention is not limited to above-mentioned four specific embodiments, also comprises other consider the UE buffering area in scheduling the situation that takies.

The above only is preferred embodiment of the present invention, not in order to restriction the present invention, all any modifications of being done within the spirit and principles in the present invention, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.

Claims (12)

1, a kind of uplink dispatch method of base stations control comprises:

A, calculating are used for the cell available resources of rate scheduling;

B, determine the dispatching priority of each subscriber equipment in the sub-district;

C, according to the sequencing of determined dispatching user facility priority, be each user equipment allocation scheduling resource in the sub-district;

It is characterized in that, further comprise: the buffering area that receives each user equipment to report takies situation, and takies situation with reference to the current buffering area of each subscriber equipment and be each user equipment allocation scheduling resource.

2, method according to claim 1, it is characterized in that, described current buffering area with reference to each subscriber equipment takies situation and comprises for each user equipment allocation scheduling resource: when the dispatching priority of described definite each subscriber equipment of step b, the current buffering area of each subscriber equipment is taken situation as a parameter determining dispatching priority, and the dispatching priority of the subscriber equipment that buffering area is fuller is higher.

3, method according to claim 1, it is characterized in that, described current buffering area with reference to each subscriber equipment takies situation and comprises for each user equipment allocation scheduling resource: described at step c in the sub-district during each user equipment allocation scheduling resource, and take situation with reference to the current buffering area of each subscriber equipment and be each subscriber equipment appointment transmission rate.

According to claim 1,2 or 3 described methods, it is characterized in that 4, the buffering area of described subscriber equipment takies the buffer performance that situation is a subscriber equipment;

In step b, determine the dispatching priority of each subscriber equipment according to following formula:

$S_n\left(k\right)=\frac{\·{\left[R_{\mathrm{req}}(n,k)\right]}^{\mathrm{\β}}}{{\left[R_{\mathrm{avg}}(n,k)\right]}^{\mathrm{\η}}}\×{\left[\frac{\mathrm{Bo}(n,k)}{\underset{n}{\max }\mathrm{Bo}(n,k)}\right]}^{\mathrm{\ρ}}$

Wherein, S _n(k) be nth user's equipment at the dispatching priority of k dispatching cycle, (n is nth user's equipment at the buffer performance of k dispatching cycle k) to Bo, and (n k) is the maximum of buffer performance in all subscriber equipmenies, R to maxBo _Req(n is nth user's equipment at the request rate of k dispatching cycle k), R _Avg(n is nth user's equipment in the Mean Speed of k dispatching cycle k), and β, η, ρ are fairness factor, and n and k are positive integer.

5, according to claim 1,2 or 3 described methods, it is characterized in that, further comprise: according to type of service is the handled business setting priority of subscriber equipment;

When the described dispatching priority of determining each subscriber equipment of step b, with each subscriber equipment when the priority of the business of pre-treatment as a parameter determining dispatching priority, it is higher that processing has the dispatching priority of subscriber equipment of business of higher service priority.

6, method according to claim 5 is characterized in that, the buffering area of described subscriber equipment takies the buffer performance that situation is a subscriber equipment;

In step b, determine the dispatching priority of each subscriber equipment according to following formula:

$S_n\left(k\right)={{\mathrm{\α}}_n}^{\mathrm{\λ}}\·\frac{\·{\left[R_{\mathrm{req}}(n,k)\right]}^{\mathrm{\β}}}{{\left[R_{\mathrm{avg}}(n,k)\right]}^{\mathrm{\η}}}\×{\left[\frac{\mathrm{Bo}(n,k)}{\underset{n}{\max }\mathrm{Bo}(n,k)}\right]}^{\mathrm{\ρ}}$

Wherein, S _n(k) be nth user's equipment at the dispatching priority of k dispatching cycle, α _nBe the priority of the handled business of nth user's equipment, (n is nth user's equipment at the buffer performance of k dispatching cycle k) to Bo, and (n k) is the maximum of buffer performance in all subscriber equipmenies, R to maxBo _Req(n is nth user's equipment at the request rate of k dispatching cycle k), R _Avg(n is nth user's equipment in the Mean Speed of k dispatching cycle k), and β, η, ρ are fairness factor, and n and k are positive integer.

7, method according to claim 2, it is characterized in that, in step c, describedly for each user equipment allocation scheduling resource in the sub-district be: take situation according to the current buffering area of each subscriber equipment and assign each subscriber equipment employed transmission rate in this dispatching cycle.

8, according to claim 2 or 3 described methods, it is characterized in that,

The buffering area of described subscriber equipment takies the buffer performance that situation is a subscriber equipment;

The employed transmission rate of each subscriber equipment of the described appointment of step c is:

C1, according to dispatching priority order from high to low, select subscriber equipment and calculate this subscriber equipment in this dispatching cycle of employed transmission rate estimation value according to the current cell available resources that is used for rate scheduling;

This subscriber equipment that c2, basis calculate assigns this subscriber equipment in this dispatching cycle of employed transmission rate at the current buffer performance of this dispatching cycle employed transmission rate estimation value and this subscriber equipment;

C3, renewal are used for the cell available resources of rate scheduling, return step c1 then, calculate next subscriber equipment in this dispatching cycle of employed biography elm speed estimated value, assign until the cell available resources that is used for rate scheduling.

9, method according to claim 8 is characterized in that, the employed transmission rate of the described appointment subscriber equipment of step c2 is:

If described subscriber equipment in the transmission rate estimation value of this dispatching cycle greater than the transmission rate of subscriber equipment in last dispatching cycle, and the current buffer performance of subscriber equipment then sends the rate assignment message that comprises the transmission rate estimation value that calculates to subscriber equipment greater than the buffer performance mean value of all subscriber equipmenies;

If described subscriber equipment in the transmission rate estimation value of this dispatching cycle less than the transmission rate of subscriber equipment in last dispatching cycle, and the current buffer performance of subscriber equipment then sends the rate assignment message that comprises the transmission rate estimation value that calculates to subscriber equipment less than the buffer performance mean value of all subscriber equipmenies;

If described subscriber equipment in the transmission rate of this dispatching cycle greater than the transmission rate of subscriber equipment in last dispatching cycle, and the current buffer performance of subscriber equipment then sends the rate assignment message that its transmission rate is increased one-level to subscriber equipment less than the buffer performance mean value of all subscriber equipmenies;

If described subscriber equipment equals subscriber equipment in the transmission rate of last dispatching cycle in the transmission rate of this dispatching cycle, then send the rate assignment message that keeps its transmission rate to subscriber equipment;

If described subscriber equipment in the transmission rate of this dispatching cycle less than the transmission rate of subscriber equipment in last dispatching cycle, and the current buffer performance of subscriber equipment then sends the rate assignment message that its transmission rate is reduced one-level to subscriber equipment greater than the buffer performance mean value of all subscriber equipmenies.

10, according to claim 1,2 or 3 described methods, it is characterized in that, in step a,, consider the influence of neighbor cell this cell load calculating when being used for the cell available resources of rate scheduling this dispatching cycle.

11, method according to claim 10 is characterized in that, influence comprises described consideration neighbor cell to this cell load: determine the parameter f of neighbor cell to the influence of this cell load;

The cell available resources that the described estimation of step a is used for rate scheduling this dispatching cycle is:

Cav(j)＝max?Load-Cav(j) ₁-Cav(j) ₂-Cav(j) ₃

Wherein, sub-district j is this sub-district, and Cav (j) is the available resources of the sub-district j that is used for rate scheduling this dispatching cycle, and maxload is the maximum load of this sub-district, Cav (j) ₁Be with sub-district j as active set cell but be not the estimated values of all subscriber equipmenies of optimum subdistrict to the load of sub-district j, Cav (j) ₂Be all subscriber equipmenies that need retransmit as optimum subdistrict but in this dispatching cycle with sub-district j estimated values to the load of sub-district j, Cav (j) ₃Be with sub-district j as optimum subdistrict this dispatching cycle New Development all subscriber equipmenies to the estimated value of the load of sub-district j; Wherein:

$\mathrm{Cav}{\left(j\right)}_1=\underset{n\∈\mathrm{NonPriSec}\left(j\right)}{\mathrm{\Σ}}f\×\frac{{(\mathrm{Ec}/N0)}_{n,j}\left(R(n,k-1)\right)}{1+{(\mathrm{Ec}/N0)}_{n,j}\left(R(n,k-1)\right)}$

Wherein, Non PriSec (j) be with sub-district j as active set cell but be not the set of all subscriber equipmenies of optimum subdistrict, $\frac{{(\mathrm{Ec}/\mathrm{NO})}_{n,j}\left(R(n,k-1)\right)}{{1+(\mathrm{Ec}/\mathrm{NO})}_{n,j}\left(R(n,k-1)\right)}$ For nth user's equipment in (k-1) individual dispatching cycle the estimated value to the load of sub-district j, n and k are positive integer.

12, method according to claim 11 is characterized in that, described definite neighbor cell to the parameter f of the influence of this cell load is: determine parameter f by emulation or actual network design scene.

Images