CN1964552A - A method to dynamically regulate distribution of PRACH resource - Google Patents

Abstract

The disclosed dynamic adjusting method for PRACH resource allocation comprises: detecting RACH business quantity for real loading of every ASC to obtain dynamic requirement of ASC, then dynamic adjusting the PRACH resource allocation. Wherein, the adjustment comprises refers to the sustained probability and PRACH division. This invention has better flexibility.

Description

Dynamically adjust the method for PRACH resource allocation

Technical field

The present invention relates to the WCDMA system, more particularly, the present invention relates to the resource allocation methods of a kind of uplink common channel PRACH.

Background technology

In code division multiplexing (CDMA) communication system of using frequency division multiplexing (FDD) mode, 3GPP for example, Physical Random Access Channel (PRACH) is to be used for terminal and network to set up when initially being connected and send signaling to network, perhaps the beep-page message of response to network also can be used to send discontinuous packet.In 3GPP FDD system, a PRACH is divided into 10 milliseconds radio frames, and each frame is made up of 15 time slots.The numeric order of radio frames is distributed, and from 0 to 255 circulation repeats.Two continuous radio frames have been formed a complete access frame, insert frame and are divided into 15 access slots, and each access slot has the length of 2 wireless timeslots.Only on the starting point of access slot, terminal is allowed to initiate to insert at random.Subchannel is to be 0 to 11 value by access slot is numbered in order.Next access slot after subchannel 11 is numbered as 0 again, so repeatedly.Per 8 radio frames of the numbering of access slot (80 milliseconds) will circulate a week.The transmission of random accessing message is carried out successively by two parts, the transmission of leading part transmission and message part.Leading part is made up of 4096 chips, and spreading factor is 256, and the spreading factor of message part is 32,64, and 128 or 256, time span 10ms or 20ms.

In 3GPP FDD/WCDMA, a plurality of PRACH physical channels can be used in each sub-district, and each PRACH and unique one insert transmission channel RACH binding at random, simultaneously and one＜leading scrambler, available preamble signature set, available subchannels set〉unique the binding together of combination.With reference to figure 1, Fig. 1 is the division of PRACH, has provided the concrete instance of this binding.PRACH0 and leading scrambler 0 are bound uniquely, and it has 3 access service classes, ASC0, ASC1 and ASC2.PRACH1 and leading scrambler 1 are bound uniquely, and it has 4 access service classes, ASC0, ASC1, ASC2 and ASC3.In 3GPP FDD system, actual maximum can dispose 8 ASC types, and maximum available subchannels number is 12, and maximum available preamble signature number is 16.

So usually, the mode that has two kinds of RACH/PRACH to divide, first kind is that each PRACH has different leading scramblers, each PRACH, " available signatures set " arranged, and " available subchannels set ", can be the complete or collected works that comprise whole signature/sub-channel to these set, also can be subclass.Second kind is that two or more PRACH use identical leading scrambler, and the resource of (available signatures, available subchannels) combination of each PRACH does not have intersection, that is to say to appear at the situation of using same signature on the same sub-channel.This qualification can guarantee that network distinguishes certain and insert at random and belong to which PRACH/RACH, uses corresponding TFCS and TFS to decode then.Therefore the PRACH under the identical scrambler resource being divided is exactly in fact the division of signature and sub channel resource.Because terminal is in IDLE attitude and connected state, the system message difference that reads can be provided with the division of PRACH with SIB5 to the terminal that is in the IDLE attitude, then is provided with by SIB6 for the terminal that is in connected state.

To each ASC lasting probability of can reallocating.Lasting probability is the important parameter of slotted ALOHA system, has represented the MAC layer in access failure, continues the probability of retry.Certain ASC distribution marker i is with a division on the corresponding PRACH, and distributed relevant " continuing a probable value " Pi.Distribute bigger Pi value for high priority ASC, on the contrary less.ASC0 is used for other situations of urgent call or equal priority, and P0 is the lasting probability of ASC0, and it is always 1 years old.The lasting probability of other each ASC is realized by " dynamic continuance level " of broadcasting in the system message.Distribute the function of dynamic continuance level Ni to obtain to ASCi: PNi=2 ^-(Ni-1), on its basis, can also regulate the value of reality by a zoom factor Si again, the actual value that continues probability is

Pi＝Si×PNi。

In current method, mainly there are two classes to the PRACH resource allocation

Method one: the way of static allocation.In system initialization, each parameter of PRACH Random Access Channel is set, keep each parameter not change at system's run duration.For example configuration such as Fig. 2 of a kind of static allocation that provides among the uniformity test agreement TS34.108, Fig. 2 are that static PRACH distributes the schematic diagram of ().This configuration is except ASC0 has different continuation probability, and other all ASC mix at the branch of PRACH resource and are equal to.

Problem and shortcoming that this kind method exists:

Though mostly the parameter of PRACH is according to statistics and artificial intelligence, the user's of different COS average access frequency for example, service traffics, the QoS of survice demand, and comprehensive decision such as power system capacity.But in system's running, different COS users' number and traffic carrying capacity are constantly to change, and the resource that the user had of the COS of high priority may be not enough; Another possibility is, the resource that the user of current high priority has has surpassed actual demand, and the user of low priority is because the resource that is assigned to very little, and can't guarantee that the performance that inserts at random satisfies professional demand.

Again such as in following the PRACH resource allocation such as Fig. 3, Fig. 3 is that static PRACH distributes the schematic diagram of (two), it illustrates the PRACH division (sets of sub-channels that different ASC obtains, signature set) be different, ASC0 obtains 8 subchannels and 9 signatures, ASC1 obtains 8 subchannels and 7 signatures, and lasting probability separately is also different.The service otherness of different like this ASC can find full expression.

Problem and shortcoming that this kind method exists:

At first the purpose of this method adjustment be allow overall load less than thresholding to guarantee network stabilization, this just lacks considers the coordination of service otherness and current network conditions between the ASC user.On the means of adjusting, this method is only to change the ASC resource allocation by adjusting the Pi value, just the key parameter that only uses according to the random access procedure of MAC layer.The distribution of PRACH sets of sub-channels and signature set is not taken into account, the adjustment effect of acquisition is not necessarily desirable, and lacks flexibility.Access rate to the ASCi of PRACH channel all is to derive out according to the linear relationship equation of corresponding Pi in addition, and this is the hypothesis of too simplifying.

So just need a kind of new method to overcome the many disadvantages that exists in the method for above-mentioned PRACH resource allocation.

Summary of the invention

The purpose of this invention is to provide a kind of assurance ASC quality of services for users, especially according to the otherness of the demand for services of dissimilar ASC, service is provided flexibly, need dynamic adjustments to distribute to the resource of all kinds of ASC users' access wireless channel at random, promptly a kind of distribution method of PRACH/RACH channel resource.

According to the present invention, a kind of dynamic adjustment PRACH is provided the method for resource allocation, according to the actual loading situation of each ASC in the system, dynamically adjust the resource of the PRACH channel of distributing to each ASC, its concrete steps are as follows:

Step 1 by system message, is provided with " measuring business volume " that terminal is carried out RACH;

Step 2 is provided with timer Tp, and regularly length is the cycle of PRACH resource adjustment;

Step 3, waiting timer Tp is overtime;

Step 4 after timer Tp is overtime, is calculated the G value of each ASC, the GO value; Wherein said G value is meant that the buffering capacity of the radio bearer (RB) under certain ASC that records accounts for the ratio of all RB buffering capacities; Described GO value is meant that the buffering capacity of the RB that certain ASC of expectation is affiliated accounts for the ratio of all RB buffering capacities;

Step 5 is utilized G value and the GO value of all ASC, carries out the planning that Pi reshuffles;

Step 6, whether the result that inspection Pi reshuffles planning is success; Step 7 if the result is success, comes into force the planning Pi value of each ASC; If the result is failure, carry out the planning of reshuffling that PRACH divides;

Step 8 checks whether the result who reshuffles planning that PRACH divides is success;

Step 9 if the result who reshuffles planning that PRACH divides is success, comes into force reshuffling of PRACH division; If the result who reshuffles planning that PRACH divides is failure, repeated execution of steps 4 is to the operation of step 9;

Step 10 repeats the operation of above-mentioned steps 4 to step 9.

According to one embodiment of the invention, calculate the G value of each ASC described in the described step 4, the GO value comprises:

Step 4.1 is calculated the G value of each ASC, and its concrete grammar is as follows:

If radio bearer (RB) belongs to the criterion of certain ASC, (NumASC MLP), then can be divided into all RB among the different ASC to make the value of ASC equal min; Wherein said NumASC is the number of ASC, and described MLP is the MAC priority of logical channels of this RB;

Definition RBBuffer _i(k) be the average buffering capacity of k RB among the ASCi, this average buffering capacity is from last PRACH resource re-allocation average to current time, and the periodic measurement report that it is reported by UE is calculated;

Definition $S_i=\underset{k=1}{\overset{R_i}{\mathrm{\Σ}}}\mathrm{RBBuffe}{r}_i\left(k\right),$ R _iIt is the number that belongs to the RB of described ASCi;

Definition $G_i=\frac{S_i}{\underset{j=1}{\overset{\mathrm{NumASC}-1}{\mathrm{\Σ}}}{S}_j},$ I=1,2 ..., NumASC-1, wherein NumASC is the number of ASC, i does not comprise that 0 expression does not comprise ASC0;

Step 4.2 is calculated the GO value of each ASC;

Calculate the RM that all relate to RB _i(k)=F1 (MLP _i(k)) value, wherein MLP _i(k) be the MAC priority of logical channels of this RB; Wherein mapping relations F1 should guarantee that MLP is more little, and corresponding RM value is also more little;

According to the content of step 4.1, calculate the GO value of each ASC;

Definition $O_i=\underset{k=1}{\overset{R_i}{\mathrm{\Σ}}}\left[R{M}_i\left(k\right)\right],$ R wherein _iIt is the number that belongs to the RB of ASCi;

Definition $O_i=\frac{S{O}_i}{\underset{j=1}{\overset{\mathrm{NumASC}-1}{\mathrm{\Σ}}}S{O}_j},$ I=1,2 ..., NumASC-1, wherein said NumASC are the numbers of ASC, described i does not comprise that 0 expression does not comprise ASC0.

According to one embodiment of the invention, described step 5 is utilized G value and the GO value of all ASC, carries out the planning that Pi reshuffles and comprises the steps:

Step 5.1, the maximum Pmax of initialization Pi, the minimum value Pmin of Pi, the threshold value Pthred of adjustment, the step value Pstep of adjustment;

Step 5.2 according to the content of step 5.1, is provided with cyclic variable i=1;

Step 5.3 according to the content of step 5.2 or 5.7, judges that whether i is less than NumASC;

Step 5.4, according to the content of step 5.3, if the result who judges is a "Yes", whether judgment criterion A1 satisfies again; Described criterion A1 is G _i〉=GO _i+ P _Thred

Step 5.5, according to the content of step 5.4, if the result who judges is a "Yes", the lasting probability of adjusting this ASC is Pi=Pi+Pstep;

Step 5.6, according to the content of step 5.5 or 5.9 or 5.12, whether judgment criterion A3 satisfies; Described criterion A3 is P _Max〉=P _i〉=P _Min

Step 5.7 according to the content of step 5.6, if the result who judges is a "Yes", is upgraded variable i=i+1; Carry out the operation of step 5.3;

Step 5.8, according to the content of step 5.4, if the result who judges is a "No", whether judgment criterion A2 satisfies again; Described criterion A2 is G _i≤ GO _i-P _Thred

Step 5.9 is according to the content of step 5.8, if the result who judges is a "Yes", the lasting probability of adjusting this ASC is Pi=Pi-Pstep; Carry out the operation of step 5.6;

Step 5.10, according to the content of step 5.6, if the result who judges is a "No", the value of recovering all Pi is to planning value before, and step 5 finishes;

Step 5.11, according to the content of step 5.3, if the result who judges is a "No", step 5 finishes;

Step 5.12 according to the content of step 5.8, if the result who judges is a "No", is carried out the operation of step 5.6.

According to one embodiment of the invention, the planning that the PRACH division is reshuffled in the described step 7 specifically comprises:

Step 7.1, threshold value Hthred is adjusted in initialization, the initialization subchannel Nsub of unit of adjustment, the signature Nsig of unit of adjustment; As Nsub=3, Nsig=3; The maximum number of the subchannel of each ASC of initialization is SUBmax (k), and the minimal amount of subchannel is SUBmin (k), maximum signature number SIGmax (k), and minimum signature number SIGmin (k), k=1 ..., NumASC-1; The minimum number of subchannels order sum of all ASC equals the total number of available subchannels, and the number of the minimum signature of all ASC equals the total number of available son signature; Determine minimum zone and the maximum magnitude that each ASC divides at PRACH according to described parameter;

Step 7.2 according to the content of step 7.1, is provided with cyclic variable i=1;

Step 7.3 according to the content of step 7.2, judges that whether i is less than NumASC;

Step 7.4, according to the content of step 7.3, if the result who judges is a "Yes", whether judgment criterion B1 satisfies again; Described criterion is B1:G _i〉=GO _i+ H _Thred

Step 7.5 is according to the content of step 7.5, if the result who judges is "Yes" then increases min (SUBmax (i)-SUBcur (i), Nsub) individual subchannel, min (SIGmax (i)-SIGcur (i), Nsig) individual signature for this ASC; The current subchannel number of wherein said SUBcur (i) expression ASCi, the current signature number of described SIGcur (i) expression ASCi;

Step 7.6 according to the content of step 7.5 or 7.8 or 7.11, is upgraded variable i=i+1;

Step 7.7, according to the content of step 7.3, if the result who judges is a "No", whether judgment criterion B2 satisfies again; Described criterion is B2:G _i≤ GO _i-H _Thred

Step 7.8 according to the content of step 7.7, if the result who judges is a "Yes", reduces min (SUBcur (i)-SUBmin (i), Nsub) individual subchannel, min (SIGcur (i)-SIGmin (i), Nsig) individual signature for this ASC; The current subchannel number of wherein said SUBcur (i) expression ASCi, the current signature number of described SIGcur (i) expression ASCi;

Step 7.9, content according to step 7.3, if the result who judges is a "No", the variation that the ASC of comprehensive all planning divides, step to the physical planning of some ASC is if the subchannel of this ASC has increased, so just divide direction expansion delegation, if the subchannel of this ASC has reduced, so just to the minimum division direction of this ASC delegation of shrinking back to the maximum of this ASC; If the signature of this ASC has increased, so just divide direction expansion one row to the maximum of this ASC; If the signature of this ASC has reduced, so just divide the direction row of shrinking back to the minimum of this ASC; Judge whether the variation that PRACH divides;

Step 7.10, according to the content of step 7.9, decision operation result is a "Yes", just with " success " end step 7, otherwise with " failure " end step 7;

Step 7.11 according to the content of step 7.7, if the result who judges is a "No", is then carried out the operation of step 7.6.

According to one embodiment of the invention, if IE " aich-TransmissionTiming " equals at 0 o'clock in the system message, Nsub is 3, otherwise Nsub is 4.

The method that adopts disclosed a kind of dynamic adjustment PRACH resource allocation is carried out at the demand for services of different ASC in the process of regulating and is had enough flexibilities in order to guarantee the ASC quality of services for users, especially according to the otherness of the demand for services of dissimilar ASC, service is provided flexibly, need dynamic adjustments to distribute to the resource of all kinds of ASC users' access wireless channel at random, the i.e. distribution of PRACH/RACH channel resource.

Description of drawings

The above and other feature of the present invention, character and advantage will further describe below in conjunction with the accompanying drawings and embodiments, and identical in the accompanying drawings Reference numeral is represented identical feature all the time, wherein,

Fig. 1 is the schematic diagram of the division of PRACH;

Fig. 2 is the schematic diagram that a kind of static PRACH of the prior art distributes;

Fig. 3 is the schematic diagram that the static PRACH of another kind of the prior art distributes

Fig. 4 is the flow chart of dynamic adjustments PRACH resource according to an embodiment of the invention;

Fig. 5 is the flow chart that continues the planning process that probability P i reshuffles according to an embodiment of the invention;

Fig. 6 is that PRACH divides the flow chart of the planning process reshuffle according to an embodiment of the invention;

Fig. 7 is the explanation schematic diagram of the PRACH of the ASC according to an embodiment of the invention adjusting range of dividing.

Embodiment

Further specify technical scheme of the present invention below in conjunction with accompanying drawing.

The invention provides the method for a kind of dynamic adjustment PRACH resource allocation, actual loading situation according to each ASC in the system, dynamically adjust the resource of the PRACH channel of distributing to each ASC, its concrete steps are as follows, with reference to figure 4, Fig. 4 is the flow chart of dynamic adjustments PRACH resource according to an embodiment of the invention:

Step 1 by system message, is provided with " measuring business volume " that terminal is carried out RACH;

Step 2 is provided with timer Tp, and regularly length is the cycle of PRACH resource adjustment;

Step 3, waiting timer Tp is overtime;

Step 4 after timer Tp is overtime, is calculated the G value of each ASC, the GO value; Wherein the G value is meant that the buffering capacity of the radio bearer (RB) that certain measured ASC is affiliated accounts for the ratio of all RB buffering capacities; Described GO value is meant that the buffering capacity of the RB that certain ASC of expectation is affiliated accounts for the ratio of all RB buffering capacities;

Step 5 is utilized G value and the GO value of all ASC, carries out the planning that Pi reshuffles;

Step 6, whether the result that inspection Pi reshuffles planning is success;

Step 7 if the result is success, comes into force the planning Pi value of each ASC; If the result is failure, carry out the planning of reshuffling that PRACH divides;

Step 8 checks whether the result who reshuffles planning that PRACH divides is success;

Step 9 if the result who reshuffles planning that PRACH divides is success, comes into force reshuffling of PRACH division; If the result who reshuffles planning that PRACH divides is failure, repeated execution of steps 4 is to the operation of step 9;

Step 10 repeats the operation of above-mentioned steps 4 to step 9.

In above-mentioned method, the G value of each ASC of calculating in the step 4, GO value comprise the steps, with reference to figure 5, Fig. 5 is the flow chart that continues the planning process that probability P i reshuffles according to an embodiment of the invention:

Step 4.1 is calculated the G value of each ASC, and its concrete grammar is as follows:

If radio bearer (RB) belongs to the criterion of certain ASC, (NumASC MLP), then can be divided into all RB among the different ASC to make the value of ASC equal min; Wherein said NumASC is the number of ASC, and described MLP is the MAC priority of logical channels of this RB;

Definition RBBuffer _i(k) be the average buffering capacity of k RB among the ASCi, this average buffering capacity is from last PRACH resource re-allocation average to current time, and the periodic measurement report that it is reported by UE is calculated;

Definition $S_i=\underset{k=1}{\overset{R_i}{\mathrm{\Σ}}}\mathrm{RBBuffe}{r}_i\left(k\right),$ R _iIt is the number that belongs to the RB of described ASCi;

Definition $G_i=\frac{S_i}{\underset{j=1}{\overset{\mathrm{NumASC}-1}{\mathrm{\Σ}}}{S}_j},$ I=1,2 ..., NumASC-1, wherein NumASC is the number of ASC, i does not comprise that 0 expression does not comprise ASC0;

Step 4.2 is calculated the GO value of each ASC;

Calculate the RM that all relate to RB _i(k)=F1 (MLP _i(k)) value, wherein MLP _i(k) be the MAC priority of logical channels of this RB; Wherein mapping relations F1 should guarantee that MLP is more little, and corresponding RM value is also more little;

According to the content of step 4.1, calculate the GO value of each ASC;

Definition ${\mathrm{SO}}_i=\underset{k=1}{\overset{R_i}{\mathrm{\Σ}}}\left[R{M}_i\left(k\right)\right],$ R wherein _iIt is the number that belongs to the RB of ASCi;

Definition ${\mathrm{GO}}_i=\frac{{\mathrm{SO}}_i}{\underset{j=1}{\overset{\mathrm{NumASC}-1}{\mathrm{\Σ}}}{\mathrm{SO}}_j}$ , i=1,2 ..., NumASC-1, wherein said NumASC are the numbers of ASC, described i does not comprise that 0 expression does not comprise ASC0.

Step 5 in the said method is utilized G value and the GO value of all ASC, carries out the planning that Pi reshuffles and comprises the steps, with reference to shown in Figure 6, Fig. 6 is that PRACH divides the flow chart of the planning process of reshuffling according to an embodiment of the invention; :

Step 5.1, the maximum Pmax of initialization Pi, the minimum value Pmin of Pi, the threshold value Pthred of adjustment, the step value Pstep of adjustment;

Step 5.2 according to the content of step 5.1, is provided with cyclic variable i=1;

Step 5.3 according to the content of step 5.2 or 5.7, judges that whether i is less than NumASC;

Step 5.4, according to the content of step 5.3, if the result who judges is a "Yes", whether judgment criterion A1 satisfies again; Described criterion A1 is G _i〉=GO _i+ P _Thred

Step 5.5, according to the content of step 5.4, if the result who judges is a "Yes", the lasting probability of adjusting this ASC is Pi=Pi+Pstep;

Step 5.6, according to the content of step 5.5 or 5.9 or 5.12, whether judgment criterion A3 satisfies; Described criterion A3 is P _Max〉=P _i〉=P _Min

Step 5.7 according to the content of step 5.6, if the result who judges is a "Yes", is upgraded variable i=i+1; Carry out the operation of step 5.3;

Step 5.8, according to the content of step 5.4, if the result who judges is a "No", whether judgment criterion A2 satisfies again; Described criterion A2 is G _i≤ GO _i-P _Thred

Step 5.9 is according to the content of step 5.8, if the result who judges is a "Yes", the lasting probability of adjusting this ASC is Pi=Pi-Pstep; Carry out the operation of step 5.6;

Step 5.10 is according to the content of step 5.6, if the result who judges is a "No", the value of recovering all Pi is to planning value before, and step 5 finishes;

Step 5.11 is according to the content of step 5.3, if the result who judges is a "No", step 5 finishes;

Step 5.12 if the result who judges is a "No", is carried out the operation of step 5.6 according to the content of step 5.8.

Described in the said method in the step 7 PRACH divide the planning reshuffle and specifically comprise, as shown in Figure 7, Fig. 7 is the explanation schematic diagram of the PRACH of the ASC according to an embodiment of the invention adjusting range of dividing;

Step 7.1, threshold value Hthred is adjusted in initialization, the initialization subchannel Nsub of unit of adjustment, the signature Nsig of unit of adjustment; As Nsub=3, Nsig=3; The maximum number of the subchannel of each ASC of initialization is SUBmax (k), and the minimal amount of subchannel is SUBmin (k), maximum signature number SIGmax (k), and minimum signature number SIGmin (k), k=1 ..., NumASC-1; The minimum number of subchannels order sum of all ASC equals the total number of available subchannels, and the number of the minimum signature of all ASC equals the total number of available son signature; Determine minimum zone and the maximum magnitude that each ASC divides at PRACH according to described parameter;

Step 7.2 according to the content of step 7.1, is provided with cyclic variable i=1;

Step 7.3 according to the content of step 7.2, judges that whether i is less than NumASC;

Step 7.4, according to the content of step 7.3, if the result who judges is a "Yes", whether judgment criterion B1 satisfies again; Described criterion is B1:G _i〉=GO _i+ H _Thred

Step 7.5 is according to the content of step 7.5, if the result who judges is "Yes" then increases min (SUBmax (i)-SUBcur (i), Nsub) individual subchannel, min (SIGmax (i)-SIGcur (i), Nsig) individual signature for this ASC; The current subchannel number of wherein said SUBcur (i) expression ASCi, the current signature number of described SIGcur (i) expression ASCi;

Step 7.6 according to the content of step 7.5 or 7.8 or 7.11, is upgraded variable i=i+1;

Step 7.7, according to the content of step 7.3, if the result who judges is a "No", whether judgment criterion B2 satisfies again; Described criterion is B2:G _i≤ GO _i-H _Thred

Step 7.8 according to the content of step 7.7, if the result who judges is a "Yes", reduces min (SUBcur (i)-SUBmin (i), Nsub) individual subchannel, min (SIGcur (i)-SIGmin (i), Nsig) individual signature for this ASC; The current subchannel number of wherein said SUBcur (i) expression ASCi, the current signature number of described SIGcur (i) expression ASCi;

Step 7.9, content according to step 7.3, if the result who judges is a "No", the variation that the ASC of comprehensive all planning divides, step to the physical planning of some ASC is if the subchannel of this ASC has increased, so just divide direction expansion delegation, if the subchannel of this ASC has reduced, so just to the minimum division direction of this ASC delegation of shrinking back to the maximum of this ASC; If the signature of this ASC has increased, so just divide direction expansion one row to the maximum of this ASC; If the signature of this ASC has reduced, so just divide the direction row of shrinking back to the minimum of this ASC; Judge whether the variation that PRACH divides;

Step 7.10, according to the content of step 7.9, decision operation result is a "Yes", just with " success " end step 7, otherwise with " failure " end step 7;

Step 7.11 according to the content of step 7.7, if the result who judges is a "No", is then carried out the operation of step 7.6.

In the said method, if IE " aich-TransmissionTiming " equals at 0 o'clock in the system message, Nsub is 3, otherwise Nsub is 4.

The method that adopts disclosed a kind of dynamic adjustment PRACH resource allocation is carried out at the demand for services of different ASC in the process of regulating and is had enough flexibilities in order to guarantee the ASC quality of services for users, especially according to the otherness of the demand for services of dissimilar ASC, service is provided flexibly, need dynamic adjustments to distribute to the resource of all kinds of ASC users' access wireless channel at random, the i.e. distribution of PRACH/RACH channel resource.The present invention acquires the dynamic change of different ASC demands by the RACH measuring business volume, dynamically adjusts the distribution of PRACH resource, has guaranteed the distribution of PRACH reasonable resources, has guaranteed service quality.The mode of regulating comprises two levels, and first level is the adjusting to " continuing probability ", and second level is the adjusting that PRACH is divided.Has stronger flexibility.

Though technical scheme of the present invention is illustrated in conjunction with preferred embodiment; but it should be appreciated by those skilled in the art; various modifications or change for the above embodiments are predictable; this should not be regarded as having exceeded protection scope of the present invention; therefore; protection scope of the present invention is not limited to above-mentioned specifically described embodiment, and should be the most wide in range scope that meets the inventive features that discloses in this place.

Claims (5)

1. a method of dynamically adjusting the PRACH resource allocation is characterized in that, according to the actual loading situation of each ASC in the system, dynamically adjusts the resource of the PRACH channel of distributing to each ASC, and its concrete steps are as follows:

Step 1 by system message, is provided with " measuring business volume " that terminal is carried out RACH;

Step 2 is provided with timer Tp, and regularly length is the cycle of PRACH resource adjustment;

Step 3, waiting timer Tp is overtime;

Step 4 after timer Tp is overtime, is calculated the G value of each ASC, the GO value; Wherein said G value is meant that the buffering capacity of the radio bearer (RB) under certain ASC that records accounts for the ratio of all RB buffering capacities; Described GO value is meant that the buffering capacity of the RB that certain ASC of expectation is affiliated accounts for the ratio of all RB buffering capacities;

Step 5 is utilized G value and the GO value of all ASC, carries out the planning that Pi reshuffles;

Step 6, whether the result that inspection Pi reshuffles planning is success;

Step 7 if the result is success, comes into force the planning Pi value of each ASC; If the result is failure, carry out the planning of reshuffling that PRACH divides;

Step 8 checks whether the result who reshuffles planning that PRACH divides is success;

Step 9 if the result who reshuffles planning that PRACH divides is success, comes into force reshuffling of PRACH division; If the result who reshuffles planning that PRACH divides is failure, repeated execution of steps 4 is to the operation of step 9;

Step 10 repeats the operation of above-mentioned steps 4 to step 9.

2. the method for adjustment PRACH as claimed in claim 1 resource allocation is characterized in that, calculates the G value of each ASC described in the described step 4, and the GO value comprises:

Step 4.1 is calculated the G value of each ASC, and its concrete grammar is as follows:

If radio bearer (RB) belongs to the criterion of certain ASC, (NumASC MLP), then can be divided into all RB among the different ASC to make the value of ASC equal min; Wherein said NumASC is the number of ASC, and described MLP is the MAC priority of logical channels of this RB;

Definition RBBuffer _i(k) be the average buffering capacity of k RB among the ASC i, this average buffering capacity is from last PRACH resource re-allocation average to current time, and the periodic measurement report that it is reported by UE is calculated;

Definition $S_i=\underset{k=1}{\overset{R_i}{\mathrm{\Σ}}}\mathrm{RBBuffe}{r}_i\left(k\right),$ R _iIt is the number that belongs to the RB of described ASC i;

Definition $G_i=\frac{S_i}{\underset{j=1}{\overset{\mathrm{NumASC}-1}{\mathrm{\Σ}{S}_j}}},i=1,2,...,\mathrm{NumASC}-1,$ Wherein NumASC is the number of ASC,

I does not comprise that 0 expression does not comprise ASC 0;

Step 4.2 is calculated the GO value of each ASC;

Calculate the RM that all relate to RB _i(k)=F1 (MLP _i(k)) value, wherein MLP _i(k) be the MAC priority of logical channels of this RB; Wherein mapping relations F1 should guarantee that MLP is more little, and corresponding RM value is also more little;

According to the content of step 4.1, calculate the GO value of each ASC;

Definition $S{O}_i=\underset{k=1}{\overset{R_i}{\mathrm{\Σ}}}\[R{M}_i\left(k\right)\],$ R wherein _iIt is the number that belongs to the RB of ASC i;

Definition $G{O}_i=\frac{S{O}_i}{\underset{j=1}{\overset{\mathrm{NumASC}-1}{\mathrm{\ΣS}{O}_j}}},i=1,,2,\…,\mathrm{NumASC}-1,$ Wherein said NumASC is ASC

Number, described i do not comprise that 0 expression does not comprise ASC 0.

3. the method for adjustment as claimed in claim 1 PRACH resource allocation is characterized in that described step 5 is utilized G value and the GO value of all ASC, carries out the planning that Pi reshuffles and comprises the steps:

Step 5.1, the maximum Pmax of initialization Pi, the minimum value Pmin of Pi, the threshold value Pthred of adjustment, the step value Pstep of adjustment;

Step 5.2 according to the content of step 5.1, is provided with cyclic variable i=1;

Step 5.3 according to the content of step 5.2 or 5.7, judges that whether i is less than NumASC;

Step 5.4, according to the content of step 5.3, if the result who judges is a "Yes", whether judgment criterion A1 satisfies again; Described criterion A1 is G _i〉=GO _i+ P _Thred

Step 5.5, according to the content of step 5.4, if the result who judges is a "Yes", the lasting probability of adjusting this ASC is Pi=Pi+Pstep;

Step 5.6, according to the content of step 5.5 or 5.9 or 5.12, whether judgment criterion A3 satisfies; Described criterion A3 is P _Max〉=P _i〉=P _Min

Step 5.7 according to the content of step 5.6, if the result who judges is a "Yes", is upgraded variable i=i+1; Carry out the operation of step 5.3;

Step 5.8, according to the content of step 5.4, if the result who judges is a "No", whether judgment criterion A2 satisfies again; Described criterion A2 is G _i≤ GO _i-P _Thred

Step 5.9, according to the content of step 5.8, if the result who judges is a "Yes", the lasting probability of adjusting this ASC is Pi=Pi-Pstep; Carry out the operation of step 5.6;

Step 5.10, according to the content of step 5.6, if the result who judges is a "No", the value of recovering all Pi is to planning value before, and step 5 finishes;

Step 5.11, according to the content of step 5.3, if the result who judges is a "No", step 5 finishes;

Step 5.12 according to the content of step 5.8, if the result who judges is a "No", is carried out the operation of step 5.6.

4. the method for adjustment PRACH as claimed in claim 1 resource allocation is characterized in that, the planning that the PRACH division is reshuffled in the described step 7 specifically comprises:

Step 7.1, threshold value Hthred is adjusted in initialization, the initialization subchannel Nsub of unit of adjustment, the signature Nsig of unit of adjustment; As Nsub=3, Nsig=3; The maximum number of the subchannel of each ASC of initialization is SUBmax (k), and the minimal amount of subchannel is SUBmin (k), maximum signature number SIGmax (k), and minimum signature number SIGmin (k), k=1 ..., NumASC-1; The minimum number of subchannels order sum of all ASC equals the total number of available subchannels, and the number of the minimum signature of all ASC equals the total number of available son signature; Determine minimum zone and the maximum magnitude that each ASC divides at PRACH according to described parameter;

Step 7.2 according to the content of step 7.1, is provided with cyclic variable i=1;

Step 7.3 according to the content of step 7.2, judges that whether i is less than NumASC;

Step 7.4, according to the content of step 7.3, if the result who judges is a "Yes", whether judgment criterion B1 satisfies again; Described criterion is B1:G _i〉=GO _i+ H _Thred

Step 7.5 is according to the content of step 7.5, if the result who judges is "Yes" then increases min (SUBmax (i)-SUBcur (i), Nsub) individual subchannel, min (SIGmax (i)-SIGcur (i), Nsig) individual signature for this ASC; The current subchannel number of wherein said SUBcur (i) expression ASC i, the current signature number of described SIGcur (i) expression ASC i;

Step 7.6 according to the content of step 7.5 or 7.8 or 7.11, is upgraded variable i=i+1;

Step 7.7, according to the content of step 7.3, if the result who judges is a "No", whether judgment criterion B2 satisfies again; Described criterion is B2:G _i≤ GO _i-H _Therd

Step 7.8 according to the content of step 7.7, if the result who judges is a "Yes", reduces min (SUBcur (i)-SUBmin (i), Nsub) individual subchannel, min (SIGcur (i)-SIGmin (i), Nsig) individual signature for this ASC; The current subchannel number of wherein said SUBcur (i) expression ASC i, the current signature number of described SIGcur (i) expression ASC i;

Step 7.9, content according to step 7.3, if the result who judges is a "No", the variation that the ASC of comprehensive all planning divides, step to the physical planning of some ASC is if the subchannel of this ASC has increased, so just divide direction expansion delegation, if the subchannel of this ASC has reduced, so just to the minimum division direction of this ASC delegation of shrinking back to the maximum of this ASC; If the signature of this ASC has increased, so just divide direction expansion one row to the maximum of this ASC; If the signature of this ASC has reduced, so just divide the direction row of shrinking back to the minimum of this ASC; Judge whether the variation that PRACH divides;

Step 7.10, according to the content of step 7.9, decision operation result is a "Yes", just with " success " end step 7, otherwise with " failure " end step 7;

Step 7.11 according to the content of step 7.7, if the result who judges is a "No", is then carried out the operation of step 7.6.

5. the method for adjustment PRACH as claimed in claim 4 resource allocation it is characterized in that if IE " aich-TransmissionTiming " equals at 0 o'clock in the system message, Nsub is 3, otherwise Nsub is 4.

Images