CN101521942B - Method for dispatching high-speed uplink package access system - Google Patents

Abstract

The invention discloses a method for dispatching a high-speed uplink package access system (HSUPA), comprising the following steps of: firstly, estimating the resource requested by UE to be dispatchedand the interference generated after the UE is dispatched; subsequently, according to the estimated resource requested by the UE and the interference generated when the UE is dispatched, determining the UE that can be dispatched in corresponding threshold from high to low according to the determined sending sequence priority; and finally, according to the estimated resource requested by the UE, authorizing corresponding resource to the UE that can be dispatched. The method can reasonably distribute the time-slot code-channel physical resource and effectively control the interference in the cell and the interference to the adjacent cells during the dispatching process.

Description

A kind of method for dispatching high-speed uplink package access system

Technical field

The present invention relates to high speed uplink packet and insert (HSUPA) technology, particularly a kind of HSUPA dispatching method.

Background technology

For adapting to the growth requirement of mobile network's high speed data service, TD SDMA inserts in (TD-SCDMA) system and has introduced the HSUPA technology, and ascending reinforced special channel (E-DCH) is the newly-increased up channel of HSUPA technology.The key technology of E-DCH comprises: Adaptive Modulation and Coding (AMC), the up fast dispatch of mixing automatic repeat requests (HARQ) and base station (Node B) control.

HSUPA scheduler among the Node B is used to control up fast dispatch, up fast dispatch comprises: rate scheduling (speed also can be corresponding power according to certain relation equivalence) and physical resource scheduling, wherein, the former can be based on the emission rate of interference level quick control user terminal (UE), the latter can based on the burst characteristic of business and the time channel circumstance quick control time-slot code channel physical resource that becomes effective distribution.The noise rise (RoT) that the HSUPA scheduler should be controlled in the sub-district is in the interior higher range of thresholding, controlling UE again is within the control range the interference of adjacent area, therefore, in the process of dispatching, how to control effectively in the sub-district and to disturb and, and the rate request of reasonably distributing the time-slot code channel physical resource and taking into account UE is successfully to realize the key of TD-SCDMA HSUPA the interference of adjacent area.

HSUPA dispatching method under existing Frequency Division Duplexing (FDD) (FDD) pattern mainly is the emission rate of the interference level downward modulation adjacent area, adjacent area that is subjected to of the Serving cell according to the UE that is scheduled for, and controls the adjacent area interference level of whole system.Yet, TD-SCDMA is the system of a kind of time division duplex (TDD) pattern, tdd mode and fdd mode in the technical existence of HSUPA than big-difference, the emission rate of the interference level downward modulation adjacent area, adjacent area that the HSUPA scheduler of tdd mode can not be subjected to according to the Serving cell of the UE that is scheduled for, and the UE that can only be scheduled for by control be to may the disturbing of adjacent area, thereby the adjacent area interference level that reaches whole system is controlled.As seen, existing FDD HSUPA dispatching method can not be used directly in and realize the HSUPA scheduling in the TD-SCDMA system.

And, because up link and the down link difference on handling makes existing high speed downlink packet insert (HSDPA) dispatching method and can not be directly used in realization HSUPA scheduling.In addition, in present disclosed patent and document, do not find the relevant dispatching method of HSUPA under the tdd mode as yet.

Therefore, press for the HSUPA dispatching method that proposes to be applicable to tdd mode.

Summary of the invention

In view of this, main purpose of the present invention is to provide a kind of HSUPA dispatching method, with in the process of dispatching, reasonably distributes the time-slot code channel physical resource, and controls effectively in the sub-district and to disturb and to the interference of adjacent area.

For achieving the above object, technical scheme of the present invention specifically is achieved in that

A kind of method for dispatching high-speed uplink package access system, this method comprises:

A, estimate each request rate for the treatment of the dispatched users terminal UE, the time-slot code channel physical resource that needs, and described UE when being scheduled for interference increment in the sub-district that produces with to the interference increment of adjacent area;

B, the sending order priority of determining to wait to dispatch UE;

C, according to each of described estimation wait to dispatch the time-slot code channel physical resource of UE needs, when being scheduled for interference increment in the sub-district that produces with to the interference increment of adjacent area, in default sub-district total load thresholding, adjacent area interference threshold and resource pool thresholding, according to described sending order priority order from high to low, determine the UE that can be scheduled;

D, wait to dispatch the request rate of UE and the time-slot code channel physical resource that needs, the UE that can be scheduled is authorized corresponding power and time-slot code channel physical resource according to each of described estimation.

Before described steps A, may further include: receive and preserve the schedule information that UE to be dispatched reports;

The described estimation of steps A can comprise: estimate according to the schedule information of preserving.

Described steps A can be carried out in each waits to dispatch first scheduling time interval T TI of dispatching cycle of UE by base station node B;

Described step B, step C and step D can be carried out in each TTI by Node B.

The described estimation of steps A UE can comprise interference increment in the sub-district that produces when being scheduled for: adopt the mode of incremental loading equivalence estimation to estimate.

Described step C can comprise:

C1, UE that described sending order priority medium priority is the highest are as UE current to be dispatched;

C2, interference increment in the current sub-district of waiting to dispatch UE is added to the current total load of sub-district, the current interference increment to the adjacent area of waiting to dispatch UE is added to current total interference to the adjacent area, the current time-slot code channel physical resource of waiting to dispatch UE and needing is added to the current total points dosage of time-slot code channel physical resource, if the current total load of sub-district does not surpass sub-district total load thresholding, current total interference to the adjacent area does not surpass the adjacent area interference threshold, and the current total points dosage of time-slot code channel physical resource does not surpass the resource pool thresholding, then UE current to be dispatched is defined as the UE that can be scheduled, wait to dispatch the next UE of UE as UE current to be dispatched with current in the sending order priority, return step C2, otherwise, continue execution in step D.

Described step C can comprise:

C3, UE that described sending order priority medium priority is the highest are as UE current to be dispatched;

C4, interference increment in the current sub-district of waiting to dispatch UE is added to the current total load of sub-district, wait to dispatch UE the interference increment of adjacent area is added to current total interference to the adjacent area current, the current time-slot code channel physical resource of waiting to dispatch UE and needing is added to the current total points dosage of time-slot code channel physical resource, if the current total load of sub-district does not surpass sub-district total load thresholding, current total interference to the adjacent area does not surpass the adjacent area interference threshold, and the current total points dosage of time-slot code channel physical resource does not surpass the resource pool thresholding, then UE current to be dispatched is defined as the UE that can be scheduled, continue execution in step D, otherwise, the method ends flow process;

After described step D, may further include: the current next UE that waits to dispatch UE in the sending order priority is returned step C3 as UE current to be dispatched.

Described step B can comprise: the sending order priority that adopts poll RR dispatching algorithm to determine to wait to dispatch UE.

Described steps A may further include: the uplink signal-channel quality of estimation current TTI;

Described step B comprises: according to the uplink signal-channel quality of the current TTI of described estimation, and the sending order priority that adopts max carrier to interference MAX C/I dispatching algorithm to determine to wait to dispatch UE.

Described steps A may further include: estimate uplink signal-channel quality and up average channel quality that each waits to dispatch the average transmission rate of UE, current TTI, or estimate uplink signal-channel quality and up average channel quality that each waits to dispatch the average throughput of UE, current TTI;

Described step B comprises: the uplink signal-channel quality and the up average channel quality of waiting to dispatch the request rate of UE, average transmission rate, current TTI according to each of described estimation, or wait to dispatch request rate, the average throughput of UE, the uplink signal-channel quality and the up average channel quality of current TTI, the sending order priority that adopts equitable proportion PF dispatching algorithm to determine to wait to dispatch UE according to each of described estimation.

As seen from the above technical solution, HSUPA dispatching method provided by the invention is estimated by the interference for the treatment of scheduling UE requested resource and will produce when being scheduled for, the interference that will produce then according to the UE requested resource of described estimation and when being scheduled for, in the thresholding of correspondence, determine the UE that can be scheduled from high to low according to the sending order priority of determining, according to the UE requested resource of described estimation, the UE that can be scheduled is authorized corresponding resource at last.Because the present invention is before carrying out resource authorization, the interference for the treatment of scheduling UE requested resource in advance and will producing when being scheduled for is estimated, thereby can in the threshold range of correspondence, dispatch, make the inventive method can more reasonably distribute the time-slot code channel physical resource, and control effectively in the sub-district and to disturb and the interference of adjacent area is in higher range in the corresponding thresholding.

Description of drawings

Fig. 1 is the schematic flow sheet of HSUPA dispatching method of the present invention;

Fig. 2 is the scheduling preprocessing process schematic diagram in the HSUPA dispatching method of the present invention;

Fig. 3 is the scheduling processing procedure schematic diagram in the HSUPA dispatching method of the present invention;

Fig. 4 is the scheduling last handling process schematic diagram in the HSUPA dispatching method of the present invention.

Embodiment

For making purpose of the present invention, technical scheme and advantage clearer, below with reference to the accompanying drawing embodiment that develops simultaneously, the present invention is described in further detail.

Main thought of the present invention is to estimate by the interference for the treatment of scheduling UE requested resource and will produce when being scheduled for, the interference that will produce then according to the UE requested resource of described estimation and when being scheduled for, in the thresholding of correspondence, determine the UE that can be scheduled from high to low according to the sending order priority of determining, according to the UE requested resource of described estimation, the UE that can be scheduled is authorized corresponding resource at last.Because the present invention is before carrying out resource authorization, the interference for the treatment of scheduling UE requested resource in advance and will producing when being scheduled for is estimated, thereby can in the thresholding of correspondence, dispatch, make the inventive method can more reasonably distribute the time-slot code channel physical resource, and control effectively in the sub-district and to disturb and the interference of adjacent area is in higher range in the corresponding thresholding.

Fig. 1 is the schematic flow sheet of HSUPA dispatching method of the present invention.Referring to Fig. 1, this method comprises:

Step 101: estimate the time-slot code channel physical resource that each is waited to dispatch the request rate of UE, needs, and described UE when being scheduled for interference increment in the sub-district that produces with to the interference increment of adjacent area;

Step 102: the sending order priority of determining to wait to dispatch UE;

Step 103: according to each of described estimation wait to dispatch the time-slot code channel physical resource of UE needs, when being scheduled for interference increment in the sub-district that produces with to the interference increment of adjacent area, in default sub-district total load thresholding, adjacent area interference threshold and resource pool thresholding, according to described sending order priority order from high to low, determine the UE that can be scheduled;

Step 104: wait to dispatch the request rate of UE and the time-slot code channel physical resource that needs according to each of described estimation, the UE that can be scheduled is authorized corresponding power and time-slot code channel physical resource.

So far, finish HSUPA dispatching method of the present invention.

Method shown in Figure 1 can be carried out by Node B, and particularly: step 101 can wait to dispatch first scheduling time execution in (TTI) at interval of the dispatching cycle of UE at each by Node B; Step 102～step 104 can be carried out in each TTI by Node B.

Before carrying out step 101 shown in Figure 1, Node B can receive and preserve the schedule information that UE to be dispatched reports; At this moment, the described estimation of step 101 comprises: estimate according to the schedule information that Node B preserves.

In actual applications, can adopt multiple mode determining step 102 described sending order priority of waiting to dispatch UE, for example:

1) can adopt comparatively simple poll (RR) algorithm, UE to be dispatched will be scheduled one by one in the RR algorithm, and each waits that the time of dispatching UE acquisition scheduling equates;

2) also can adopt max carrier to interference (MAX C/I) dispatching algorithm, adopt MAX C/I dispatching algorithm need estimate the uplink signal-channel quality (can in step 101, estimate) of current TTI in advance, uplink signal-channel quality according to the current TTI of described estimation carries out MAX C/I scheduling then, thus the sending order priority of determining to wait to dispatch UE;

3) can also adopt equitable proportion (PF) dispatching algorithm of taking into account user fairness and cell throughout, adopt the PF dispatching algorithm need estimate uplink signal-channel quality and the up average channel quality (can in step 101, estimate) that each waits to dispatch the average transmission rate of UE, current TTI in advance, the uplink signal-channel quality and the up average channel quality of waiting to dispatch the request rate of UE, average transmission rate, current TTI according to each of estimation carried out the PF scheduling then, thus the sending order priority of determining to wait to dispatch UE.In the above-mentioned PF dispatching algorithm, the average transmission rate of UE also can substitute with the average throughput of UE.

During the UE that in realizing step 103 shown in Figure 1, determines to be scheduled, can take following mode:

At first, sending order priority medium priority is the highest UE is as UE current to be dispatched;

Then, interference increment in the current sub-district of waiting to dispatch UE is added to the current total load of sub-district, wait to dispatch UE the interference increment of adjacent area is added to current total interference to the adjacent area current, the current time-slot code channel physical resource of waiting to dispatch UE and needing is added to the current total points dosage of time-slot code channel physical resource, and make the following judgment: if the current total load of sub-district does not surpass sub-district total load thresholding, current total interference to the adjacent area does not surpass the adjacent area interference threshold, and the current total points dosage of time-slot code channel physical resource does not surpass the resource pool thresholding, then UE current to be dispatched is defined as the UE that can be scheduled; Otherwise, finish this operation.

When above-mentioned each thresholding all is not exceeded, carry out one time aforesaid operations, can determine a UE that can be scheduled, next need this UE that can be scheduled is authorized corresponding power and time-slot code channel physical resource, and continue to judge whether UE is waited to dispatch in follow-up in the sending order priority is the UE that can be scheduled.In actual applications, can determine a UE that can be scheduled, just this UE is authorized accordingly, then with the current next UE that waits to dispatch UE in the sending order priority as UE current to be dispatched, continue to carry out the operation of above-mentioned " determine can be scheduled UE "; Also can earlier all UE that can be scheduled be decided, then all UE that can be scheduled be authorized accordingly.

Below in conjunction with accompanying drawing, the embodiment of each step of the present invention is made a more detailed description.

Because the operation of the schedule information that reception and preservation UE to be dispatched report before step 101 and the step 101 is actually the preliminary treatment before the scheduling, therefore, in subsequent descriptions of the present invention, abbreviates aforesaid operations as the scheduling preprocessing process; Because step 102 and step 103 all are about determining the operation with which UE of which kind of sequential scheduling, therefore, in subsequent descriptions of the present invention, step 102 and step 103 being collectively referred to as the scheduling processing procedure; Step 104 is the UE that can be scheduled to be carried out the operation of corresponding mandate, in subsequent descriptions of the present invention, step 104 is called the scheduling last handling process.

Fig. 2 is the scheduling preprocessing process schematic diagram in the HSUPA dispatching method of the present invention.Referring to Fig. 2, this scheduling preprocessing process comprises:

Step 201: the schedule information of upgrading UE.

Normally triggering reports schedule information based on timer, if the HSUPA scheduler among the Node B is received the schedule information request (SI) that UE reports, then upgrades the schedule information of this temporary UE of Node B side.Relate to the present invention, the schedule information of described UE can comprise: total buffer status (TEBS), UE power headroom (UPH), Serving cell adjacent area path loss (SNPL) etc.

Step 202: the request rate of estimation UE.

The request rate of the UE that this step is estimated can be used for equivalence and is corresponding power, in the scheduling last handling process UE is carried out corresponding power mandate by Node B.In addition, when needs adopted the PF dispatching algorithm to determine to wait to dispatch the sending order priority of UE, the request rate of the UE that this step is estimated can be used for the PF dispatching algorithm.

Below the request rate of UE in n TTI is designated as R _Req(n), R _Req(n) TEBS and the UPH that can report based on UE obtains according to the estimation of (1) formula:

R _req(n)＝min(R _max(UPH(n))，argmax{R|TEBS(n)≥R·Tsp}) (1)

(1) in the formula, R _Max(UPH (n)) is for allowing emission rate based on the maximum of the anti-UE that pushes away to obtain of power headroom UPH (n) of UE in n TTI in n TTI;

Argmax{R|TEBS (n) 〉=RTsp} is that the result of calculation of argmax{R|TEBS (n) 〉=RTsp} is based on the UE largest request speed R of UE in the total buffer memory situation TEBS (n) of n TTI and Tsp estimation dispatching cycle: the R that makes the maximum that the inequality in this bracket sets up.

Step 203: average transmission rate and the average throughput of estimation UE.

When needs adopted the PF dispatching algorithm to determine to wait to dispatch the sending order priority of UE, average transmission rate and the average throughput of the UE that this step is estimated can be used for the PF dispatching algorithm.

For each TTI, the HSUPA scheduler among the Node B can calculate average transmission rate and the average throughput of each UE based on formula (2) and formula (3) respectively:

$\stackrel{\‾}{R_i^t\left(n\right)}=(1-\frac{1}{T_1})\stackrel{\‾}{R_i^t(n-1)}+\frac{1}{T_1}{R}_i^t\left(n\right)---\left(2\right)$

$\stackrel{\‾}{R_i\left(n\right)}=(1-\frac{1}{T_2})\stackrel{\‾}{R_i(n-1)}+\frac{1}{T_2}{R}_i\left(n\right)---\left(3\right)$

Wherein, i represents the numbering of UE;

With

Average transmission rate of UE and the average throughput of representing n TTI respectively;

R ⁱ _t(n) and R ⁱ(n) represent transmission rate and the throughput of n TTI respectively, R _i ^t(n) can obtain R based on the big or small ratio of the transmission block that n TTI receives with TTI _i(n) can obtain based on the big or small ratio of the transmission block that n TTI successfully receives with TTI;

T ₁And T ₂Be respectively default filtering factor.

Step 204: the up average channel quality (UCQI) of estimation UE.

When needs adopted MAX C/I dispatching algorithm to determine to wait to dispatch the sending order priority of UE, the UCQI of the UE that this step is estimated can be used for MAX C/I dispatching algorithm.Particularly, the SNPL that UE can be reported is as the up instantaneous channel quality UCQI of UE, for each TTI, and the up average channel quality of UE Can obtain based on formula (4):

$\stackrel{\‾}{\mathrm{UCQ}{I}_i}=(1-\frac{1}{T_3})\stackrel{\‾}{\mathrm{UCQ}{I}_i(n-1)}+\frac{1}{T_3}\mathrm{UCQ}{I}_i\left(n\right)---\left(4\right)$

(4) in the formula, UCQI _i(n) be the SNPL among the SI that receives recently that preserves among the Node B;

T ₃Be default filtering factor.

Step 205: estimation UE when being scheduled for interference increment in the sub-district that produces.

In this step, under the situation that hypothesis UE is scheduled for, estimate that this UE is with interference increment in the sub-district that produces.Particularly, can adopt the mode of incremental loading equivalence estimation that UE is estimated interference increment in the sub-district that produces.

Suppose that i UE obtains scheduling, its incremental loading Cell_load _i ^HypCan calculate according to (5) formula:

$\mathrm{Cell}\_{\mathrm{load}}_i^{\mathrm{hyp}}=(1-\mathrm{JD})*L_i=(1-\mathrm{JD})*\frac{{\mathrm{<figure-callout\; id="1"\; label="CIR\; i"\; filenames="S2008101009328E00011.png"\; state="\{\{state\}\}">CIR</figure-callout>}}_i}{1+(1-\mathrm{JD})*{\mathrm{CIR}}_i}---\left(5\right)$

Wherein, JD is the up joint inspection factor;

CIR _iBe the reception carrier/interface ratio of i UE, and ${\mathrm{CIR}}_i={\mathrm{CIR}}_{\mathrm{base}}*{10}^{\frac{{\mathrm{AG}}_i}{10}}*\frac{16}{{\mathrm{SF}}_i},$ Wherein:

ClR _BaseBe UE side closed power component P _E-baseCorresponding CIR;

SF _iIt is the spreading factor (SF) of i user's the power mandate channel code correspondence of being distributed;

AG _iBe i user's power mandate, can be based on UE request rate R _Req(n) and the supposition code rate λ _eCalculate power gain factors β _0eObtain.

Step 206: estimate UE presence of intercell interference increment with generation when being scheduled for.

In this step, under the situation that hypothesis UE is scheduled for, estimate that this UE is with the presence of intercell interference increment that produces.

Suppose that i UE obtains scheduling, it is to the interference increment I of non-service adjacent area _Inter ⁱCan estimate according to (6) formula:

${I_{\mathrm{inter}}}^i=\frac{1}{{\mathrm{SNPL}}_i}*{10}^{{P_{e-\mathrm{base}}}^{\&prime;}\frac{{\mathrm{AG}}_i}{10}}*\frac{16}{{\mathrm{SF}}_i}---\left(6\right)$

Wherein, SNPL _iThe up-to-date SNPL that reports for i UE;

P _E-base' estimate the closed power component of the UE side obtain for Node B;

SF _iAnd AG _iConsistent with the description in the step 205.

Step 207: the time-slot code channel physical resource that estimation UE needs.

In this step, at first can determine supposition mandate corresponding codes speed λ based on the AMC principle _eAnd modulation strategy; Particularly, the size of the SNPL index value that can report based on UE is determined suitable λ _e, the big more desirable bigger λ of SNPL _eAnd 16QAM, the more little desirable less λ of SNPL _eAnd QPSK;

Then, determine the maximum E-TFC of permission of the corresponding UE of supposition mandate, thereby according to ${\mathrm{\&lambda;}}_e=\frac{S_e}{R_e}$ Determine R _e, S wherein _eBe the transmission block size of selected E-TFC, R _eBe the physical channel bit number of exporting from the physical channel mapping block in the multiplexing flow process of E-DCH chnnel coding.According to R _eAt each time slot the principle of an E-DCH physical uplink channel (E-PUCH) can only be arranged with the modulation strategy of determining and each UE, determine the time-slot code channel physical resource that supposition is authorized to be needed.

So far, the scheduling preprocessing process in the end HSUPA dispatching method of the present invention.

Fig. 3 is the scheduling processing procedure schematic diagram in the HSUPA dispatching method of the present invention.Referring to Fig. 3, this scheduling processing procedure comprises:

Step 301: the sending order priority of determining to wait to dispatch UE.

As previously mentioned, can adopt existing RR dispatching algorithm, MAC C/I dispatching algorithm, PF dispatching algorithm etc. to determine to wait to dispatch the sending order priority of UE.Particularly:

1) for the RR dispatching algorithm, UE will be scheduled one by one, and each waits that the time of dispatching UE acquisition scheduling equates;

2), can calculate the priority P of UE in n TTI that is numbered i according to (7) formula for MAC C/I dispatching algorithm _i ^MAXC/I(n):

$P_i^{\mathrm{MAX\; C}/I}\left(n\right)=\mathrm{UCQ}{I}_i\left(n\right),i=1,\&CenterDot;\&CenterDot;\&CenterDot;,K---\left(7\right)$

Wherein, P _i ^MAXC/I(n) big more, corresponding priorities is high more;

3), can calculate the priority P of UE in n TTI that is numbered i according to (8) formula for the PF dispatching algorithm _i ^MPF(n):

$P_i^{\mathrm{MPF}}\left(n\right)={\left(\frac{R_{\mathrm{req}}\left(n\right)}{\stackrel{\&OverBar;}{R_i^t\left(n\right)}}\right)}^{\mathrm{\&alpha;}}\&CenterDot;{\left(\frac{{\mathrm{UCQI}}_i\left(n\right)}{\stackrel{\&OverBar;}{\mathrm{UCQ}{I}_i\left(n\right)}}\right)}^{\mathrm{\&beta;}}---\left(8\right)$

R _Req(n) the UE request rate for calculating according to (1) formula;

Be the average transmission rate of UE that calculates according to (2) formula, here, also can be with in (8) formula

Replace with the UE average throughput that calculates by (3) formula

UCQI _i(n) and

Be respectively uplink signal-channel quality and the up average channel quality of n TTI in (4) formula;

α, β are respectively predetermined weights and adjust the factor.

Step 302: the UE that sending order priority medium priority is the highest is as UE current to be dispatched.

Step 303: interference increment in the current sub-district of waiting to dispatch UE is added to the current total load of sub-district, and judges whether the current total load of sub-district surpasses sub-district total load thresholding, if do not surpass, then continues execution in step 304, otherwise, finish this handling process.

The uplink interference thresholding of supposing this sub-district is I _Total ^Target, can derive noise rise (RoT) the thresholding RoT of this sub-district by (9) formula _j ^Target, and then conversion obtains the total load thresholding Cell_load of sub-district _j ^Target:

$\mathrm{Cell}\_\mathrm{loa}{d}_j^{t\arg \mathrm{et}}=1-\frac{1}{\mathrm{Ro}{T}_j^{t\arg \mathrm{et}}}=1-\frac{P_N}{{I_{\mathrm{total}}}^{t\arg \mathrm{et}}}---\left(9\right)$

Wherein, subscript j represents cell number;

P _NFor making an uproar at the bottom of the up reception, can make by oneself by radio network controller (RNC) configuration or Node B.

Similarly, as if uplink interference thresholding I with sub-district in (9) formula _Total ^TargetReplace with the current uplink interference I of sub-district _Total ^Current, just can obtain the current total load Cell_load of sub-district based on (9) formula estimation _j ^CurrentWherein, I _Total ^Current=(1-Jd) * RTWP+JD*ISCP, JD is the up joint inspection factor, RTWP and ISCP are respectively up reception broadband gross power and the Interference Signal Code Power that Node B measures.

Suppose the current i that is numbered that waits to dispatch UE, in this step, the incremental loading Cell_load of i the UE that step 205 estimation can be obtained _i ^HypBe added to the current total load Cell_load of sub-district _j ^Current, and judge Cell_load _j ^CurrentThe total load thresholding Cell_load that whether surpasses the sub-district _j ^TargetIf, do not surpass, then continue execution in step 304, otherwise, finish this handling process.

Step 304: the current interference increment to the adjacent area of waiting to dispatch UE is added to current total interference to the adjacent area, and judge that whether the current total interference to the adjacent area surpasses the adjacent area interference threshold, if do not surpass, then continues execution in step 305, otherwise, finish this handling process.

Suppose the current i that is numbered that waits to dispatch UE, the described current interference increment to the adjacent area of waiting to dispatch UE of this step is exactly the presence of intercell interference increment I of i UE obtaining of step 206 estimation _Inter ⁱ

Step 305: the current total points dosage that the current time-slot code channel physical resource of waiting to dispatch UE and needing is added to the time-slot code channel physical resource, and whether the current total points dosage of judging the time-slot code channel physical resource surpasses the resource pool thresholding, if do not surpass, then continue execution in step 306, otherwise, finish this handling process.

The described current time-slot code channel physical resource of waiting to dispatch UE and needing of this step is exactly the time-slot code channel physical resource that step 207 estimation obtains.

Step 306: UE current to be dispatched is defined as the UE that can be scheduled, and the current next UE that waits to dispatch UE in the sending order priority is returned step 303 as UE current to be dispatched.

So far, the scheduling that finishes in the HSUPA dispatching method of the present invention is handled.

The order of step 303 shown in Figure 3,304 and 305 these three decision operation can arbitraryly be changed, as long as any one thresholding is exceeded, then illustrates in this TTI and can't dispatch more UE again, at this moment, needs to finish this handling process.

According to handling process shown in Figure 3, this is determined all UE that can be scheduled in this TTI after, again the UE that can be scheduled is authorized accordingly, as previously mentioned, in actual applications, also can whenever determine a UE that can be scheduled, once authorize.

After determining the UE that can be scheduled, can dispatch reprocessing according to the scheduling last handling process schematic diagram in the HSUPA dispatching method of the present invention shown in Figure 4.Referring to Fig. 4, this scheduling preprocessing process comprises:

Step 401: for the UE that can be scheduled distributes the power mandate.

In this step, can be corresponding power, then, UE be distributed corresponding power mandate the UE request rate equivalence of step 202 estimation.

Step 402: for the UE that can be scheduled distributes the mandate of time-slot code channel physical resource.

In this step, can be according to the time-slot code channel physical resource of the UE needs of step 207 estimation, for the UE that can be scheduled distributes the mandate of corresponding time-slot code channel physical resource.

Step 403: the mandate that will distribute for the UE that can be scheduled sends to UE.

In this step, can send to UE by the mandate that E-DCH absolute grant channel (E-AGCH) will be distributed for the UE that can be scheduled.

So far, the scheduling last handling process in the end HSUPA dispatching method of the present invention.

As seen from the above-described embodiment, HSUPA dispatching method provided by the invention is estimated by the interference for the treatment of scheduling UE requested resource and will produce when being scheduled for, the interference that will produce then according to the UE requested resource of described estimation and when being scheduled for, in the thresholding of correspondence, determine the UE that can be scheduled from high to low according to the sending order priority of determining, according to the UE requested resource of described estimation, the UE that can be scheduled is authorized corresponding resource at last.Because the present invention is before carrying out resource authorization, the interference for the treatment of scheduling UE requested resource in advance and will producing when being scheduled for is estimated, thereby can in the threshold range of correspondence, dispatch, make the inventive method can more reasonably distribute the time-slot code channel physical resource, and control effectively in the sub-district and to disturb and the interference of adjacent area is in higher range in the corresponding thresholding.

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

Claims (9)

1. a method for dispatching high-speed uplink package access system is applicable to tdd mode, it is characterized in that, this method comprises:

A, estimate each request rate for the treatment of the dispatched users terminal UE, the time-slot code channel physical resource that needs, and described UE when being scheduled for interference increment in the sub-district that produces with to the interference increment of adjacent area;

B, the sending order priority of determining to wait to dispatch UE;

C, according to each of described estimation wait to dispatch the time-slot code channel physical resource of UE needs, when being scheduled for interference increment in the sub-district that produces with to the interference increment of adjacent area, in default sub-district total load thresholding, adjacent area interference threshold and resource pool thresholding, according to described sending order priority order from high to low, determine the UE that can be scheduled;

D, wait to dispatch the request rate of UE and the time-slot code channel physical resource that needs, the UE that can be scheduled is authorized corresponding power and time-slot code channel physical resource according to each of described estimation.

2. method according to claim 1 is characterized in that, further comprises before the described steps A: receive and preserve the schedule information that UE to be dispatched reports;

The described estimation of steps A comprises: estimate according to the schedule information of preserving.

3. method according to claim 2 is characterized in that, described steps A is carried out in each waits to dispatch first scheduling time interval T TI of dispatching cycle of UE by base station node B;

Described step B, step C and step D are carried out in each TTI by Node B.

4. method according to claim 3 is characterized in that, the described estimation of steps A UE comprises interference increment in the sub-district that produces when being scheduled for:

Adopt the mode of incremental loading equivalence estimation to estimate.

5. method according to claim 4 is characterized in that, described step C comprises:

C1, UE that described sending order priority medium priority is the highest are as UE current to be dispatched;

C2, interference increment in the current sub-district of waiting to dispatch UE is added to the current total load of sub-district, wait to dispatch UE the interference increment of adjacent area is added to current total interference to the adjacent area current, the current time-slot code channel physical resource of waiting to dispatch UE and needing is added to the current total points dosage of time-slot code channel physical resource, if the current total load of sub-district does not surpass sub-district total load thresholding, current total interference to the adjacent area does not surpass the adjacent area interference threshold, and the current total points dosage of time-slot code channel physical resource does not surpass the resource pool thresholding, then UE current to be dispatched is defined as the UE that can be scheduled, wait to dispatch the next UE of UE as UE current to be dispatched with current in the sending order priority, return step C2, otherwise, continue execution in step D.

6. method according to claim 4 is characterized in that, described step C comprises:

C3, UE that described sending order priority medium priority is the highest are as UE current to be dispatched;

C4, interference increment in the current sub-district of waiting to dispatch UE is added to the current total load of sub-district, wait to dispatch UE the interference increment of adjacent area is added to current total interference to the adjacent area current, the current time-slot code channel physical resource of waiting to dispatch UE and needing is added to the current total points dosage of time-slot code channel physical resource, if the current total load of sub-district does not surpass sub-district total load thresholding, current total interference to the adjacent area does not surpass the adjacent area interference threshold, and the current total points dosage of time-slot code channel physical resource does not surpass the resource pool thresholding, then UE current to be dispatched is defined as the UE that can be scheduled, continue execution in step D, otherwise, the method ends flow process;

After described step D, further comprise: the current next UE that waits to dispatch UE in the sending order priority is returned step C3 as UE current to be dispatched.

7. according to each described method of claim 1 to 6, it is characterized in that described step B comprises: the sending order priority that adopts poll RR dispatching algorithm to determine to wait to dispatch UE.

8. according to each described method of claim 1 to 6, it is characterized in that described steps A further comprises: the uplink signal-channel quality of estimation current TTI;

Described step B comprises: according to the uplink signal-channel quality of the current TTI of described estimation, and the sending order priority that adopts max carrier to interference MAX C/I dispatching algorithm to determine to wait to dispatch UE.

9. according to each described method of claim 1 to 6, it is characterized in that, described steps A further comprises: estimate uplink signal-channel quality and up average channel quality that each waits to dispatch the average transmission rate of UE, current TTI, or estimate uplink signal-channel quality and up average channel quality that each waits to dispatch the average throughput of UE, current TTI;

Described step B comprises: the uplink signal-channel quality and the up average channel quality of waiting to dispatch the request rate of UE, average transmission rate, current TTI according to each of described estimation, or wait to dispatch request rate, the average throughput of UE, the uplink signal-channel quality and the up average channel quality of current TTI, the sending order priority that adopts equitable proportion PF dispatching algorithm to determine to wait to dispatch UE according to each of described estimation.

Images