CN101304594A - Management method and scheduling machine for wireless resource - Google Patents
Management method and scheduling machine for wireless resource Download PDFInfo
- Publication number
- CN101304594A CN101304594A CNA2007100991146A CN200710099114A CN101304594A CN 101304594 A CN101304594 A CN 101304594A CN A2007100991146 A CNA2007100991146 A CN A2007100991146A CN 200710099114 A CN200710099114 A CN 200710099114A CN 101304594 A CN101304594 A CN 101304594A
- Authority
- CN
- China
- Prior art keywords
- resource
- chance
- probability
- sub
- radio resource
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000007726 management method Methods 0.000 title claims abstract description 11
- 238000000034 method Methods 0.000 claims abstract description 27
- 238000012937 correction Methods 0.000 claims description 13
- 230000008569 process Effects 0.000 claims description 4
- 230000007812 deficiency Effects 0.000 claims description 2
- 238000004321 preservation Methods 0.000 claims description 2
- 238000013461 design Methods 0.000 description 8
- 238000013507 mapping Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 3
- 238000010295 mobile communication Methods 0.000 description 3
- 238000012546 transfer Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000007774 longterm Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- 108010003272 Hyaluronate lyase Proteins 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 235000019788 craving Nutrition 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000012467 final product Substances 0.000 description 1
- 239000010410 layer Substances 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 239000002356 single layer Substances 0.000 description 1
- 230000007480 spreading Effects 0.000 description 1
- 238000005211 surface analysis Methods 0.000 description 1
Images
Abstract
The invention discloses a radio resource management method, which is designed against a plurality of adjacent cells in a flat network, comprising the following steps: each cell divides a part of opportunity radio resources in the radio resources which are managed by the cell, part or all of the opportunity radio resources divided by the various cells are the same as each other; and the cells occupy the opportunity radio resources according to the pre-set probabilities thereof. The interferences of the adjacent cells can be avoided as far as possible by setting the reasonable probability factor and setting the different resources in the priority selected opportunity resource sets of the various cells, and the various cells share the resources in the opportunity resource sets, thus greatly improving the utilization rate of the resources. The invention further provides a scheduler which is corresponding to the method.
Description
Technical field
The present invention relates to the radio resource management techniques field, relate in particular to a kind of management method and scheduler of Radio Resource of flat network.
Background technology
At existing 3G (3rd Generation, 3G (Third Generation) Moblie) in the system, adopted three-dimensional network configuration, be provided with central controlled node device in Access Network one side---radio network controller (RadioNetwork Controller, RNC), be used for being responsible for the RRM and the distribution of the sub-district in its compass of competency.Three-dimensional network can be introduced extra transfer of data and transfer time delay owing to there is too much node.In order to address this problem, the mobile communication system of studying at present, for example, the Long Term Evolution of mobile communication (Long Term Evolution, LTE) and 4G (4rd Generation, the 4th third-generation mobile communication) system, all plan RNC is saved, the single layer structure that employing is made of base station (Node B), Node B directly links to each other with core net, also is flat network configuration.Because the minimizing of interstitial content, will help to simplify network and reduce and postpone, simultaneously, this structure means that also a lot of functions that originally realize will transfer among the Node B on RNC, this wherein just comprises RRM.As seen, Node B has obtained further expanding on function in the flat network, therefore be also referred to as evolved base station (Evolued NodeB, eNB).
Owing to there is not centralized Control Node, in flat network, the scheduler among the Node B of each sub-district is managed its other resources ground independently.In LTE and the 4G system, physical layer all can adopt OFDM (Orthogonal Frequency Division Multiplexing, OFDM) technology, under the environment of a plurality of sub-districts identical networking, there is more serious phase mutual interference between the sub-district, adopts the soft multiplex technique of resource to solve this problem at present usually.
Referring to Fig. 1, be the soft multiplexing scheme schematic diagram of resource, the resource here comprises frequency, time, code word, space and the combination of these reasonable resources.Among the figure, sub-district 1,2 and 3 all comprises 3 resource: A, B and C; MS12, MS22 and MS32 represent the subscriber equipment that is positioned at sub-district 1, sub-district 2 and 3 centers, sub-district respectively, and (User Equipment, UE), MS11, MS21 and MS31 representative are positioned at the UE of sub-district 1, sub-district 2 and sub-district 3 marginal positions.For the UE that is in the central area (MS12, MS22 and MS32), can be any it and distribute different resources, by the transmitting power of suitable these UE of reduction, utilize signal attenuation to reduce its interference to adjacent area UE; And for the UE (MS11, MS21 and MS31) of cell edge, each sub-district is reserved different resources respectively, as shown in the figure, sub-district 1 is edge UE preserved sub-carrier A, sub-district 2 preserved sub-carrier B, sub-district 3 preserved sub-carrier C, thus, at three cell boarder places, owing to, effectively reduce the interference between each sub-district for UE distributes different resources.
But the resource utilization of the soft multiplex mode of above-mentioned this resource is but very low.For example among Fig. 1, each sub-district is that the multiplexing factor of edge UE reserved resource (A, B or C) is 3, and utilance only is 1/3, even certain sub-district does not have edge UE, can not be used by adjacent sub-district for edge UE reserved radio resource in advance.
Summary of the invention
In view of this, the invention provides a kind of management method and scheduler of Radio Resource, in effectively avoiding flat network, on the basis of adjacent presence of intercell interference, improve wireless resource utility efficiency.
For this reason, the embodiment of the invention adopts following technical scheme:
A kind of management method of Radio Resource, a plurality of neighbor cells in the flat network comprise: each sub-district marks off a part of chance Radio Resource in the Radio Resource of self-management, and the chance Radio Resource that each sub-district is divided is partly or entirely identical; Each sub-district takies described chance Radio Resource according to the probability that presets separately.
Described probability is to set successively according to the resource quantity that need take in the chance Radio Resource; Each sub-district takies described chance Radio Resource according to taking the pairing probability of resource quantity.
Perhaps, described probability is to set successively according to the number of times that need take the chance Radio Resource; Each sub-district takies described chance Radio Resource according to the pairing probability of number of times that takies the chance Radio Resource.
Perhaps, described probability is to set successively according to the quantity and the number of times that need take the chance Radio Resource; Each sub-district takies described chance Radio Resource according to the probability that takies the quantity and the number of times correspondence of chance Radio Resource.
The quantity of described chance Radio Resource is that the number of the least resource unit that comprises according to the chance Radio Resource is determined.
Preferably, described chance Radio Resource further comprises a plurality of least resource unit; Described probability is to set according to the number of times that takies a least resource unit: P1, P2...Pn represents first time, for the second time ... take the probability of a least resource unit the n time; When needs take k least resource unit, take 1 to k least resource unit successively: take first least resource unit with P1, if success, then utilize P2 to take second least resource unit, until taking k least resource unit, if middle failure is then withdrawed from.
Perhaps, described chance Radio Resource further comprises a plurality of least resource unit; Described probability is meant the probability factor that takies a least resource unit that presets; When needs take the chance Radio Resource of n least resource unit, take described chance Radio Resource with the n power of described probability factor.
The quantity or the number of times that take the chance Radio Resource are many more, and corresponding probability is more little.
Each sub-district preferentially takies the exclusive Radio Resource outside the chance Radio Resource, and the exclusive Radio Resource of each sub-district is different; Under the condition of described exclusive Radio Resource deficiency, take the chance Radio Resource with described probability.
Described method also comprises: described chance Radio Resource further is divided into identical sub regions with number of cells, and a sub regions is corresponding with a sub-district; Each sub-district preferentially takies the Radio Resource of its corresponding subregion when taking described chance Radio Resource.
Described method also comprises: take the historical information of described chance Radio Resource according to each sub-district, dynamically revise the probability that each sub-district takies the chance Radio Resource.
The process of described dynamic adjustment probability is: reduce the probability that history takies chance Radio Resource quantity or sub-district correspondence often; Increase the historical probability that takies the few sub-district correspondence of chance Radio Resource quantity or number of times.
A kind of scheduler is applied to flat network, and the Radio Resource of this sub-district is managed, and comprising: the chance resource collection: preserve the set of a part of Radio Resource, the chance resource collection of scheduler is partly or entirely identical in described set and the adjacent sub-district; Probability preset unit: preset the probability that takies the Radio Resource in the described chance resource collection; Scheduling execution units: the probability so that described probability preset unit presets takies the Radio Resource in the chance resource collection.
Described probability preset unit is quantity, number of times or quantity and the number of times that need take Radio Resource in the described chance resource collection according to this sub-district, the probability that sets gradually.
Described scheduler also comprises: dedicated resources set: preserve the resource except that described chance resource collection, and the resource of its preservation to belong to sub-district, described scheduler place peculiar; Described scheduling execution units, the resource in the set of the described dedicated resources of priority scheduling is gathered when inadequate in described dedicated resources, dispatches the resource in the described chance resource collection again.
Described chance resource collection is a neighbor cell number subclass with the resource division of preserving, and each set is corresponding with an adjacent sub-district; Described scheduling execution units takies Radio Resource in the subclass corresponding with this sub-district with described preference for probability.
Described scheduler also comprises: the historical information collector unit: be responsible for collecting the historical information that this sub-district takies Radio Resource in the wireless set of described chance; Revise indicating member: analyze the information that described historical information collector unit is collected, indicate described probability preset unit that the probability that presets is revised; Described probability preset unit according to the indication of described correction indicating member, is revised probability.
Preferably, when history took in the described chance resource collection resource quantity or number of times greater than preset value, described correction indicating member indicated described probability preset unit to reduce described probability; When history took in the described chance resource collection resource quantity or number of times less than preset value, described correction indicating member indicated described probability preset unit to increase described probability.
Technique effect for technique scheme is analyzed as follows:
Each sub-district at first obtains from the dedicated resources set that has nothing in common with each other when Resources allocation, has avoided adjacent area interference; Under the situation of the inadequate resource of dedicated resources set, share the chance resource collection with the probability of appropriate design in advance.By rational probability factor is set, can avoid adjacent area interference as far as possible, simultaneously,, improved resource utilization greatly because the chance resource collection of each sub-district is partly or entirely identical.Preferably, each sub-district is set preferentially takies subregions different in the chance resource collection, effectively avoid taking resource identical in the chance resource collection.Further, can dynamically revise the probability factor that is provided with, avoid adjacent area interference more effectively by taking the historical information of chance resource collection.
Description of drawings
Fig. 1 is the soft multiplexing schematic diagram of prior art resource;
Fig. 2 is the embodiment of the invention one schematic diagram;
Fig. 3 is the embodiment of the invention one flow chart;
Fig. 4 is the embodiment of the invention four flow charts;
Fig. 5 is a scheduler architecture schematic diagram of the present invention.
Embodiment
The invention provides a kind of method of RRM, in reducing flat network, in the adjacent area interference, improve utilization ratio of wireless resources.Its key is, marks off a part of Radio Resource, is shared with certain probability by all neighbor cell UE (particularly edge UE).So, because this part Radio Resource is shared, improved wireless utilance; On the other hand, each sub-district can not these resources of unconditional seizure, can only take with certain probability, and this has effectively been avoided the interference of adjacent sub-district again.Below in conjunction with accompanying drawing, the embodiment of the invention is described in detail.
At first, introduce the embodiment of the invention one:
In essence, interference can be thought to suppose all to use between each neighbor cell completely orthogonal system resource because the sub-district has used too much Radio Resource to cause, area interference also disappears immediately so, but the problem of bringing thus is that usage factor of system resource seriously descends.
Among the present invention, the Radio Resource of each sub-district is divided into two set: dedicated resources set and chance resource collection.Resource in the dedicated resources set is that the sub-district is exclusive, arranged by the cell scheduling device, and the dedicated resources set of different districts is a mutually orthogonal, can not produce the phase mutual interference, and perhaps incomplete quadrature can produce less interference but do not influence the receptivity of data.And the resource in the chance resource collection of each sub-district is partly or entirely identical, perhaps can be understood as the chance resource collection to be shared by each sub-district, and each sub-district is only in the use down that meets some requirements.The concrete manifestation form of the Radio Resource here can be frequency, time, code word, space or the combination of these reasonable resources.
Referring to Fig. 2, be the schematic diagram of embodiment one.Three sub-districts mark off dedicated resources set A, B and the C that has nothing in common with each other separately, and identical chance resource collection X.Thus, be respectively 3 sub-districts reservation different resources with prior art and compare, utilize identical chance resource collection X, improved resource utilization; Allow each sub-district to take probability among the chance resource collection X for fear of taking same asset among the set X simultaneously, just must rationally being provided with.
In each dispatching cycle, each sub-district judges at first whether the resource in the dedicated resources set satisfies the resource requirement of current scheduling UE, if can satisfy, then preferentially takies the resource in the dedicated resources set; Otherwise, from the chance resource collection, obtain resource with certain probability.Wherein, key is how to design described probability, and whether this utilance and adjacent sub-district that can influence resource produces interference.Say that in some sense utilance and adjacent area interference are a pair of contradiction, the present invention is intended to find optimal balance point between the two.
Take the probability of chance resource collection about each sub-district, mainly to crave for degree relevant with the traffic load of sub-district or resource: traffic load is heavy more, must use the probability of resource in the chance resource collection high more, but can increase the risk of area interference like this, so, for fear of producing bigger presence of intercell interference, if certain sub-district take resource in the chance resource collection to crave for degree big more, it is low more that its probability that obtains of permission so just can be set.Need to prove, might not only be to provide a kind of implementation according to the set-up mode of above-mentioned " crave for degree high more-probability is low more " when specifically implementing herein.
Mention " craving for degree " of from the chance resource collection, obtaining resource above, can weigh with three kinds of modes: need obtain resource quantity, obtain the number of times of resource, and the quantity and the number of times that obtain resource; So, correspondingly, just can come the estimate by design factor according to above-mentioned three kinds of modes.
Referring to Fig. 3, be the embodiment of the invention one flow chart.
Embodiment one comprises:
Step 301: each sub-district is divided into dedicated resources set and chance resource collection with own resource, the mutually orthogonal or nearly orthogonal of dedicated resources set of each sub-district, and the chance resource collection of each sub-district is identical or basic identical;
Step 302: each sub-district according to the quantity that takies resource in the chance resource collection, take number of times or quantity and number of times, probability factor is set;
Step 303: in dispatching cycle, judge whether enough current scheduling UE use for resource in the dedicated resources set, if, execution in step 304; Otherwise, execution in step 305;
Step 304: scheduling resource from the dedicated resources set;
Step 305: take resource quantity as required, take number of times, perhaps resource quantity and number of times obtain resource with its corresponding probability from the chance resource.
Be not difficult to find out from above, probability factor and resource quantity, take number of times or the two combines, have corresponding relation.In practical operation, each sub-district can be designed a mapping table separately and safeguard this corresponding relation, referring to table 1, is the corresponding relation that takies resource quantity and each probability factor in the chance resource collection of certain sub-district design:
Table 1
| |
1 | 2 | 3 | ... | n |
| Probability factor | P10 | P20 | P30 | ... | Pn0 |
So, when certain dispatching cycle, this sub-district need obtain resource quantity from the chance resource collection when being 3 resource, and its probability that obtains is P30.As last surface analysis, from the chance resource collection, obtain resource to crave for degree big more, for its probability factor that designs is low more, therefore, can will go up the value that P10 in the table, P20, P30...Pn0 are designed to successively decrease.Resource quantity can adopt the number of the least resource unit that resource comprises to weigh in the last table, just resource quantity is that 1 expression comprises 1 least resource unit, the least resource unit is the implication difference in each system, for example, in the TD-SCDMA system, the least resource unit is that spreading factor is 16 spreading code; In the LTE system, the least resource unit is the basic resources transmission unit that comprises 12 subcarriers.
Similar for corresponding relation that obtains resource number of times and probability factor and table 1, also be about to " resource quantity " hurdle and replace with " taking number of times ", as table 2:
Table 2
| Take number of |
1 | 2 | 3 | ... | n |
| Probability factor | P11 | P21 | P31 | ... | Pn1 |
For example, when this sub-district obtains resource the 3rd time from the chance resource collection, can take with the probability factor P31 of the 3rd correspondence.Above-mentioned P11, P21, P31...Pn1 also successively decrease.
Explanation once more, in the practical operation, P10, P20, P30...Pn0 and P11, P21, P31...Pn1 might not successively decrease in table 1 and the table 2, and this kind mode only is an example.
For according to taking resource quantity and number of times, the probability factor of comprehensive Design is actually above-mentioned table 1 and table 2 is organically combined.For example, when this sub-district obtains 3 resources the 2nd time from the chance resource, can take the resource in the chance resource collection with the probability of " P30 * P21 ".Adopt this mode, stricter control takies the resource in the chance resource collection.
For each neighbor cell, self all safeguard the mapping table of self probability factor.Probability factor for certain the identical entry correspondence in the mapping table of each cell maintenance, then there is not specific requirement, for example, neighbor cell a and sub-district b safeguard the mapping table with " resource quantity and probability factor " corresponding relation, for certain identical entry, for example the resource quantity probability factor P4_a and the P4_b that are 4, two sub-district correspondences there is no specific (special) requirements, so long as get final product smaller or equal to 1 numerical value more than or equal to 0.
In the such scheme, each sub-district at first obtains from the dedicated resources set that has nothing in common with each other when Resources allocation, has avoided adjacent area interference to a certain extent, under the situation of the inadequate resource of dedicated resources set, share the resource of chance resource collection with the probability of appropriate design in advance.By rational probability factor is set, can avoid adjacent area interference as far as possible, simultaneously,, improved resource utilization greatly because the chance resource collection of each sub-district is identical.
Below, introduce the embodiment of the invention two:
That introduces among the embodiment one takies the mode of resource in the chance resource collection with certain probability, it all is the mode that adopts " disposable " to take, for example, when needs take the resource of 3 resource quantity, take with the P30 probability, this mode is that a kind of " definitely " takies: or disposablely take three resources of success, or a resource accounts for also and do not use.In the present embodiment, the mode that adopts " one by one " to take, for example, when needs take the resource of 3 resource quantity, at first take a resource, if success with certain probability, continuation takies second resource with certain probability, after the success, takies the 3rd resource with certain probability again, at this wherein, when taking failure, then directly withdraw from, this mode is that a kind of " relatively " takies, be a kind of compromise: might account for and not use three resources, but probably take one or two resource.
Mention above, weigh resource quantity with the number that comprises the least resource unit.Referring to table 3, be the form of expression of the concrete mapping table of embodiment two:
Table 3
| Which |
1 | 2 | 3 | ... | n |
| Probability factor | P1 | P2 | P3 | ... | Pn |
P1, P2...Pn represent for the first time, for the second time ... take the probability of a least resource unit the n time; When needs take k least resource unit, take 1 to k least resource unit successively: take first least resource unit with P1, if success, then utilize P2 to take second least resource unit, until taking k least resource unit, if wherein failure is then withdrawed from.As seen, take fully k resource probability of successful be " P1 * P2 * ... * Pk ", its probability is lower than P1, P2... or Pk naturally, so, needn't limit the magnitude relationship of P1 in the table 3, P2, P3...Pn.
The benefit of this mode is that reduction definitely can not take the risk of resource in the chance resource collection, takies a part of resource that need take with big probability, satisfies a part of demand.
Except the mode of mapping table (table 1,2 or 3) is set, for simplicity, a probability factor (can think the simplification of mapping table) can only be set also, this comprises dual mode again:
1. a probability factor P only is set, and when needs took a plurality of least resource unit, the each selection all took according to P, up to failure or all successes.This is appreciated that it is a special case of above-mentioned table 3, and just P1, P2, P3...Pn all equate, all equal P.
2. a probability factor P only is set, and when needs took m least resource unit, disposable probability with " the m power of P " took.This can be understood as the special case of table 1 among the embodiment one: P10 and equals the quadratic power that P, P20 equal P ... Pn0 equals the n power of P.
Introduce the embodiment of the invention three below:
Present embodiment is further optimized the management method of Radio Resource on the basis of embodiment one or embodiment two, further avoids adjacent area interference.
In embodiment one or embodiment two, the probability that takies the chance resource collection by reasonable setting is avoided adjacent area interference as far as possible, although the resource of lesser amt in the chance resource collection has all been used in a plurality of sub-districts, but these resources still may overlap in the performance of resources such as time, frequency, code word or space in form, therefore, still might produce between small amounts of ortho and disturb.Therefore, in order to address this problem, resource in the chance resource collection can be numbered according to certain rule, share the sub-district of these resources and select resource according to different number order, for example, cell i d is that low resource is preferentially selected to number in the sub-district of odd number, and cell i d is that high resource is preferentially selected to number in the sub-district of even number.More perfect ground, supposing to exist M sub-district, can be the M sub regions with the resource division in the chance resource collection so, just the corresponding sub regions in each sub-district, when each sub-district takies in the chance resource collection resource, preferentially take the resource in the subregion of himself correspondence.Need to replenish a bit, when the subregion resource of this sub-district chance resource collection correspondence is not enough, allow to continue to select resource at the subregion of other sub-district correspondence.
Like this, the subregion difference that each sub-district preferentially takies is effectively avoided taking identical resource, reduces adjacent area interference.
Introduce the embodiment of the invention four below:
On the basis of embodiment one, embodiment two or embodiment three, can utilize each sub-district to take the account of the history of chance resource collection, the probability of setting is dynamically revised.
Particularly, be the historical information that takies the chance resource collection according to each sub-district, dynamically revise probability factor, just probability factor is arranged to " memory characteristic ".For example, can be according to the resource quantity of whether successfully having used resource in the chance resource collection and use a last dispatching cycle, adjust the probability factor of this dispatching cycle, for example: resource or number of times many more (greater than a certain preset values) that last one-period uses, then the probability of this dispatching cycle is low more; Otherwise, can heighten the probability factor of this dispatching cycle.
By above-mentioned correction, can avoid history to take many sub-districts and take the chance resource with high probability always, increase history simultaneously and take few probability, with the take degree of each sub-district of balance the chance resource collection.
On the basis of embodiment three, increase the dynamic flow process of revising probability referring to Fig. 4, comprising:
Step 401: each sub-district is divided into dedicated resources set and chance resource collection with own resource, the mutually orthogonal or nearly orthogonal of dedicated resources set of each sub-district, and the chance resource collection of each sub-district is identical or basic identical;
Step 402: the chance resource collection further is divided into the identical sub regions of neighbor cell sum, and each subregion is corresponding with a sub-district;
Step 403: each sub-district according to the quantity that takies resource in the chance resource collection, take number of times or quantity and number of times, probability factor is set;
Step 404: utilize the historical information that takies the chance resource collection, revise the probability factor that step 403 is provided with;
Step 405: in dispatching cycle, judge whether enough current scheduling UE use for resource in the dedicated resources set, if, execution in step 406; Otherwise, execution in step 407;
Step 406: scheduling resource from the set of self dedicated resources;
Step 407: each sub-district takies resource quantity as required, takies number of times, and perhaps resource quantity and number of times obtain resource with its corresponding probability from oneself subregion corresponding in the chance resource collection.
Need to prove that above-mentioned steps is to be described in the mode (table 1,2) that embodiment one is provided with probability factor, the mode of introducing for embodiment two that probability factor is set (table 3,1., 2.) is suitable for too, does not repeat them here.
For on embodiment one or embodiment two bases, increasing the mode of dynamically adjusting probability, with Fig. 4 describe similar, do not repeat them here.
Corresponding with said method, the present invention also provides a kind of scheduler, and this scheduler is present among the eNB in the flat network, manages by the Radio Resource to this sub-district, effectively avoids producing with adjacent sub-district and disturbs.
Referring to Fig. 5, described scheduler comprises chance resource collection 501, probability preset unit 502 and scheduling execution units 503.
Describe in detail with regard to the function of each unit and the relation between them below:
Chance resource collection 501: preserve a part of Radio Resource, described set is identical with the chance resource collection of scheduler in the adjacent sub-district;
Probability preset unit 502: preset the probability that takies the Radio Resource in the chance resource collection 501; Be quantity, number of times or quantity and the number of times that need take Radio Resource in the described set according to this sub-district, set gradually;
Scheduling execution units 503:, take the Radio Resource in the chance resource collection 501 with the probability that probability preset unit 502 presets.
As shown in Figure 5, scheduler also can comprise dedicated resources set 504, be used to preserve the resource except that chance resource collection 501, and it is peculiar to belong to sub-district, described scheduler place; Scheduling execution units 503, the resource in the priority scheduling dedicated resources set 503 gathers 503 when inadequate in dedicated resources, again the resource of dispatcher in can resource collection 501.
Take the probability of mobilize resources by reasonable setting, can under the prerequisite that improves resource utilization, effectively avoid the phase mutual interference of adjacent sub-district.
Preferably, chance resource collection 501 is divided into a neighbor cell number subclass with described set, and each set is corresponding with an adjacent sub-district; Scheduling execution units 503 takies Radio Resource in the subclass corresponding with this sub-district with described preference for probability.
Like this, the subregion difference that each sub-district preferentially takies effectively avoids taking resource identical in the chance resource collection 501, avoids adjacent area interference more effectively.
Preferably, scheduler is on the basis that comprises chance resource collection 501, probability preset unit 502 and scheduling execution units 503, perhaps, on the basis that comprises chance resource collection 501, probability preset unit 502, scheduling execution units 503 and dedicated resources set 504, further also can comprise historical information collector unit 505 and revise indicating member 506.
Historical information collector unit 505: be responsible for collecting the historical information that this sub-district takies Radio Resource in the chance resource collection 501; Revise indicating member 506: the information that analysis of history information collection unit 505 is collected, 502 pairs of probability that preset of indication probability preset unit are revised.
For example, concrete correcting mode can be: when history takies in the chance resource collection 501 Radio Resource quantity or number of times greater than preset value, revise indicating member 506 indication probability preset units 502 and reduce described probability; When history takies in the chance resource collection 501 Radio Resource quantity or number of times less than preset value, revise indicating member 506 indication probability preset units 502 and increase described probability.
By dynamic correction probability factor, make the probability factor of design more reasonable, further avoid taking place interference among adjacent cells.
About a few thing details of scheduler, can not repeat them here referring to preceding method embodiment.
The above only is a preferred implementation of the present invention; should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the principle of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (22)
1, a kind of management method of Radio Resource, a plurality of neighbor cells in the flat network is characterized in that, comprising:
Each sub-district marks off a part of chance Radio Resource in the Radio Resource of self-management, the chance Radio Resource that each sub-district is divided is partly or entirely identical;
Each sub-district takies described chance Radio Resource according to the probability that presets separately.
2, according to the described method of claim 1, it is characterized in that,
Described probability is to set successively according to the resource quantity that need take in the chance Radio Resource;
Each sub-district takies described chance Radio Resource according to taking the pairing probability of resource quantity.
3, according to the described method of claim 1, it is characterized in that,
Described probability is to set successively according to the number of times that need take the chance Radio Resource;
Each sub-district takies described chance Radio Resource according to the pairing probability of number of times that takies the chance Radio Resource.
4, according to the described method of claim 1, it is characterized in that,
Described probability is to set successively according to the quantity and the number of times that need take the chance Radio Resource;
Each sub-district takies described chance Radio Resource according to the probability that takies the quantity and the number of times correspondence of chance Radio Resource.
According to claim 2 or 4 described methods, it is characterized in that 5, the quantity of described chance Radio Resource is that the number of the least resource unit that comprises according to the chance Radio Resource is determined.
6, according to the described method of claim 1, it is characterized in that,
Described chance Radio Resource further comprises a plurality of least resource unit;
Described probability is to set according to the number of times that takies a least resource unit: P1, P2...Pn represents first time, for the second time ... take the probability of a least resource unit the n time;
When needs take k least resource unit, take 1 to k least resource unit successively:
Take first least resource unit with P1, if success then utilizes P2 to take second least resource unit, until taking k least resource unit, if middle failure is then withdrawed from.
7, according to the described method of claim 1, it is characterized in that,
Described chance Radio Resource further comprises a plurality of least resource unit;
Described probability is meant the probability factor that takies a least resource unit that presets;
When needs take the chance Radio Resource of n least resource unit, take described chance Radio Resource with the n power of described probability factor.
8, according to each described method in the claim 1 to 4,6 to 7, it is characterized in that,
The quantity or the number of times that take the chance Radio Resource are many more, and corresponding probability is more little.
9, according to each described method in the claim 1 to 4,6 to 7, it is characterized in that,
Each sub-district preferentially takies the exclusive Radio Resource outside the chance Radio Resource, and the exclusive Radio Resource of each sub-district is different;
Under the condition of described exclusive Radio Resource deficiency, take the chance Radio Resource with described probability.
10, according to claim 1 to 4,6 to 7 each described methods, it is characterized in that, also comprise:
Take the historical information of described chance Radio Resource according to each sub-district, dynamically revise the probability that each sub-district takies the chance Radio Resource.
According to the described method of claim 10, it is characterized in that 11, the process of described dynamic correction probability is:
Reduce the probability that history takies chance Radio Resource quantity or sub-district correspondence often;
Increase the historical probability that takies the few sub-district correspondence of chance Radio Resource quantity or number of times.
12, according to each described method in the claim 1 to 4,6 to 7, it is characterized in that, also comprise:
Described chance Radio Resource further is divided into identical sub regions with number of cells, and a sub regions is corresponding with a sub-district;
Each sub-district preferentially takies the Radio Resource of its corresponding subregion when taking described chance Radio Resource.
13, according to the described method of claim 12, it is characterized in that, also comprise:
Take the historical information of described chance Radio Resource according to each sub-district, dynamically revise the probability that each sub-district takies the chance Radio Resource.
According to the described method of claim 13, it is characterized in that 14, the process of described dynamic correction probability is:
Reduce the probability that history takies chance Radio Resource quantity or sub-district correspondence often;
Increase the historical probability that takies the few sub-district correspondence of chance Radio Resource quantity or number of times.
15, a kind of scheduler is applied to flat network, and the Radio Resource of this sub-district is managed, and it is characterized in that, comprising:
The chance resource collection: preserve the set of a part of Radio Resource, the chance resource collection of scheduler is partly or entirely identical in described set and the adjacent sub-district;
Probability preset unit: preset the probability that takies the Radio Resource in the described chance resource collection;
Scheduling execution units: the probability so that described probability preset unit presets takies the Radio Resource in the chance resource collection.
16, according to the described scheduler of claim 15, it is characterized in that,
Described probability preset unit is quantity, number of times or quantity and the number of times that need take Radio Resource in the described chance resource collection according to this sub-district, the probability that sets gradually.
17, according to the described scheduler of claim 15, it is characterized in that, also comprise:
Dedicated resources set: preserve the resource except that described chance resource collection, and the resource of its preservation to belong to sub-district, described scheduler place peculiar;
Described scheduling execution units, the resource in the set of the described dedicated resources of priority scheduling is gathered when inadequate in described dedicated resources, dispatches the resource in the described chance resource collection again.
18, according to claim 15,16 or 17 described schedulers, it is characterized in that, also comprise:
Historical information collector unit: be responsible for collecting the historical information that this sub-district takies Radio Resource in the wireless set of described chance;
Revise indicating member: analyze the information that described historical information collector unit is collected, indicate described probability preset unit that the probability that presets is revised;
Described probability preset unit according to the indication of described correction indicating member, is revised probability.
19, scheduler according to claim 18 is characterized in that,
When history took in the described chance resource collection resource quantity or number of times greater than preset value, described correction indicating member indicated described probability preset unit to reduce described probability;
When history took in the described chance resource collection resource quantity or number of times less than preset value, described correction indicating member indicated described probability preset unit to increase described probability.
20, according to claim 15,16 or 17 described schedulers, it is characterized in that,
Described chance resource collection is a neighbor cell number subclass with the resource division of preserving, and each set is corresponding with an adjacent sub-district;
Described scheduling execution units takies Radio Resource in the subclass corresponding with this sub-district with described preference for probability.
21, scheduler according to claim 20 is characterized in that, also comprises:
Historical information collector unit: be responsible for collecting the historical information that this sub-district takies Radio Resource in the wireless set of described chance;
Revise indicating member: analyze the information that described historical information collector unit is collected, indicate described probability preset unit that the probability that presets is revised;
Described probability preset unit according to the indication of described correction indicating member, is revised probability.
22, scheduler according to claim 21 is characterized in that,
When history took in the described chance resource collection resource quantity or number of times greater than preset value, described correction indicating member indicated described probability preset unit to reduce described probability;
When history took in the described chance resource collection resource quantity or number of times less than preset value, described correction indicating member indicated described probability preset unit to increase described probability.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100991146A CN101304594B (en) | 2007-05-11 | 2007-05-11 | Management method and scheduling machine for wireless resource |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100991146A CN101304594B (en) | 2007-05-11 | 2007-05-11 | Management method and scheduling machine for wireless resource |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101304594A true CN101304594A (en) | 2008-11-12 |
| CN101304594B CN101304594B (en) | 2011-11-30 |
Family
ID=40114256
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007100991146A Active CN101304594B (en) | 2007-05-11 | 2007-05-11 | Management method and scheduling machine for wireless resource |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101304594B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2011032317A1 (en) * | 2009-09-18 | 2011-03-24 | 上海贝尔股份有限公司 | Resources scheduling method for spectrum sharing system and base station |
| CN101588632B (en) * | 2009-06-17 | 2011-04-20 | 华为技术有限公司 | Allocation method, device and base station for physical downlink control channel time domain symbolic number |
| WO2011079759A1 (en) * | 2009-12-31 | 2011-07-07 | 华为技术有限公司 | Method, device and base station for utilizing cell edge frequency band resources |
| CN101784103B (en) * | 2009-01-19 | 2013-04-17 | 电信科学技术研究院 | Method for scheduling users in a plurality of communities and wireless access network equipment thereof |
| CN101778479B (en) * | 2009-01-14 | 2015-06-17 | 电信科学技术研究院 | Resource scheduling method and resource scheduling device |
| US9107233B2 (en) | 2009-02-24 | 2015-08-11 | Alcatel Lucent | Resource scheduling method, scheduler and base station |
| WO2017125037A1 (en) * | 2016-01-22 | 2017-07-27 | Jrd Communication Inc. | Communication resource allocation for telecommunications networks |
| WO2019028924A1 (en) * | 2017-08-11 | 2019-02-14 | 华为技术有限公司 | Communication method and related device |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1134921C (en) * | 2001-03-14 | 2004-01-14 | 华为技术有限公司 | Service channel frequency distributing method for CDMA mobile communication system |
| US8023951B2 (en) * | 2003-04-24 | 2011-09-20 | Nokia Siemens Networks Oy | Dynamic coverage and capacity solution for cellular radio network |
| EP1519607A1 (en) * | 2003-09-23 | 2005-03-30 | Siemens Aktiengesellschaft | A method and system for performing radio resource management in a mobile radio network |
-
2007
- 2007-05-11 CN CN2007100991146A patent/CN101304594B/en active Active
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101778479B (en) * | 2009-01-14 | 2015-06-17 | 电信科学技术研究院 | Resource scheduling method and resource scheduling device |
| CN101784103B (en) * | 2009-01-19 | 2013-04-17 | 电信科学技术研究院 | Method for scheduling users in a plurality of communities and wireless access network equipment thereof |
| US9107233B2 (en) | 2009-02-24 | 2015-08-11 | Alcatel Lucent | Resource scheduling method, scheduler and base station |
| CN101588632B (en) * | 2009-06-17 | 2011-04-20 | 华为技术有限公司 | Allocation method, device and base station for physical downlink control channel time domain symbolic number |
| WO2011032317A1 (en) * | 2009-09-18 | 2011-03-24 | 上海贝尔股份有限公司 | Resources scheduling method for spectrum sharing system and base station |
| WO2011079759A1 (en) * | 2009-12-31 | 2011-07-07 | 华为技术有限公司 | Method, device and base station for utilizing cell edge frequency band resources |
| US8909238B2 (en) | 2009-12-31 | 2014-12-09 | Huawei Technologies Co., Ltd. | Method and device for utilizing cell edge frequency band resource and base station |
| WO2017125037A1 (en) * | 2016-01-22 | 2017-07-27 | Jrd Communication Inc. | Communication resource allocation for telecommunications networks |
| CN108370569A (en) * | 2016-01-22 | 2018-08-03 | 捷开通讯(深圳)有限公司 | The communication resource distribution of telecommunication network |
| GB2546548B (en) * | 2016-01-22 | 2021-08-11 | Tcl Communication Ltd | Communication resource allocation for telecommunications networks |
| WO2019028924A1 (en) * | 2017-08-11 | 2019-02-14 | 华为技术有限公司 | Communication method and related device |
| CN110999455A (en) * | 2017-08-11 | 2020-04-10 | 华为技术有限公司 | Communication method and related equipment |
| CN110999455B (en) * | 2017-08-11 | 2022-04-29 | 华为技术有限公司 | Communication method and related equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101304594B (en) | 2011-11-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101304594B (en) | Management method and scheduling machine for wireless resource | |
| CN102026390B (en) | Base station and resource allocation method for realizing interference coordination among cells | |
| CN102202400B (en) | Instruction and processing method and device for resource occupancy mode | |
| CN102186247B (en) | Method and system for coordinating interference between cells | |
| CN103079262B (en) | Mode selection and resource allocation method of device-to-device (D2D) users in cellular system | |
| CN101127556B (en) | A dynamic scheduling method for carrier resource | |
| CN103036663B (en) | The method of SRS resource, device and base station is distributed in a kind of LTE system | |
| CN101472339B (en) | Method for coordinating district interference | |
| CN102843695A (en) | Method and device for allocating CRS (Cell Reference Signal) | |
| CN101925185B (en) | Interference suppression method of relay cellular network, base station and network system | |
| CN102017682A (en) | Downlink inter-cell interference coordination method and base station | |
| CN101404800A (en) | Semi-static interference coordination method based on void cell in OFDMA cellular system | |
| CN102413510A (en) | Cell access control method and device | |
| CN106357579A (en) | Application method of orthogonal frequency division multiplexing (OFDM) system spectrum resources and base station corresponding to OFDM system | |
| CN102264123B (en) | Method and device for distributing PDSCH (physical downlink shared channel) power | |
| CN102821470B (en) | A kind of physical downlink control channel resource distribution method and device | |
| CN103313251A (en) | Multi-cell cooperative resource allocation method based on potential game theory | |
| CN102412950A (en) | Coordination system of power of downlink control channel and method thereof | |
| CN102316522B (en) | Notification method for control signaling transmission resource position and terminal | |
| CN101888637B (en) | Multi-slot cooperative communication method for multiple base stations | |
| CN105165049B (en) | Communication control unit, communication control method and information processing equipment | |
| CN102387497B (en) | Base station and allocation method of radio network temporary identities | |
| CN103548286A (en) | Method and base station for power allocation in wireless system | |
| CN102387554B (en) | Method for allocating inter-cell interference coordination (ICIC) resource | |
| CN102457972A (en) | Same-frequency networking method and device for different time slot allocations |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: INST OF TELECOMMUNICATION SCIENCE AND TECHNOLGOY Free format text: FORMER OWNER: DATANG MOBILE COMMUNICATION EQUIPMENT CO., LTD. Effective date: 20110509 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 100083 NO. 29, XUEYUAN ROAD, HAIDIAN DISTRICT, BEIJING TO: 100083 NO. 40, XUEYUAN ROAD, HAIDIAN DISTRICT, BEIJING |
|
| TA01 | Transfer of patent application right |
Effective date of registration: 20110509 Address after: 100083 No. 40, Haidian District, Beijing, Xueyuan Road Applicant after: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY Address before: 100083 Haidian District, Xueyuan Road, No. 29, Applicant before: DATANG MOBILE COMMUNICATIONS EQUIPMENT Co.,Ltd. |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 100083 No. 40, Haidian District, Beijing, Xueyuan Road Patentee after: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY Address before: 100083 No. 40, Haidian District, Beijing, Xueyuan Road Patentee before: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20210602 Address after: 100085 1st floor, building 1, yard 5, Shangdi East Road, Haidian District, Beijing Patentee after: DATANG MOBILE COMMUNICATIONS EQUIPMENT Co.,Ltd. Address before: 100083 No. 40, Haidian District, Beijing, Xueyuan Road Patentee before: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY |
|
| TR01 | Transfer of patent right |