CN105992358A

CN105992358A - Resource distribution method, base station and correlation network element

Info

Publication number: CN105992358A
Application number: CN201510072624.9A
Authority: CN
Inventors: 何金薇; 邵泽才; 俞滨晖
Original assignee: China Mobile Communications Group Co Ltd
Current assignee: China Mobile Communications Group Co Ltd
Priority date: 2015-02-11
Filing date: 2015-02-11
Publication date: 2016-10-05
Anticipated expiration: 2035-02-11
Also published as: CN105992358B

Abstract

An embodiment of the invention provides a resource distribution method, a base station and a correlation network element. The method comprises the following steps of using a taboo search algorithm by a base station to carry out iteration on a MCS value set formed by MCSs distributed for each user located in the base station till that a preset iteration ending condition is satisfied; aiming at each MCS value set used during each iteration, according to the MCS value set and a lowest transmission rate demand of each user, determining a subchannel distributed for each user and a data transmission total rate of the base station; determining the MCS value set, based on the determined MCS value set, distributing the subchannel for each user correspondingly, and determining the highest data transmission total rate of the base station; according to the MCS value set determined for the base station and the corresponding subchannel distributed for each user located in the base station, distributing resources for each user located in the base station. In the prior art, an AMC mechanism is used to carry out resource distribution. Compared to the prior art, the method in the invention is more reasonable. The invention relates to the mobile communication technology field.

Description

A kind of resource allocation methods, base station and related network elements

Technical field

The present invention relates to mobile communication technology field, particularly relate to a kind of resource allocation methods, base station and be correlated with Network element.

Background technology

Along with mobile Internet business amount is skyrocketed through, OFDM (OFDM, Aorthogonal Frequency division multiple access) capacity of system and service quality (QoS, Quality of Service) problem becomes increasingly conspicuous.In order to solve the problem become increasingly conspicuous, on the one hand, need to design more flexible Resource allocation mechanism to mate business demand dynamic characteristic, on the other hand, need to improve further OFDMA The spectrum efficiency of system is to strengthen network capacity.Under this background, draw in a new generation's Communication System Design Enter Adaptive Modulation and Coding (AMC, Adaptive Modulation and Coding) mechanism to promote again and again Spectrum efficiency, Dynamic Resource Allocation for Multimedia transmission technology based on AMC mechanism then obtains the concern of the increasingly degree of depth.

So-called Dynamic Resource Allocation for Multimedia, mainly base station are according to channel information, in multi-user diversity effect and frequency Under the influence of diversity effect, dynamically distribute subchannel, bit and power for the multiple users in system, thus Promote spectrum efficiency.At real system (the most such as: Long Term Evolution (LTE, Long Term Evolution) System) in the resource allocation mechanism that uses be according to corresponding physical resource dispatching algorithm (such as: maximum carry Dry than allocation algorithm, equitable proportion allocation algorithm and poll distribution mechanism) combining with adaptive modulation encoding mode Distribute the bit number of transmission for user, power distribution generally uses impartial distribution.

But, for AMC mechanism, first, give each Resource Block of user in systems in practice On power be equal.When same user uses identical modulation coding mode on different sub-channels Time, owing to user's gain on a different channel and decline are different, meet identical modulation coding mode institute The signal-noise ratio threshold needed is accomplished by different power, uses equal power distribution to exist for the wave of power resource Take.And for channel preferable for channel condition, the performance number using equal power to get can More than the performance number of the maximum modulation coded system meeting its use, thus power dissipation can be caused；For letter For the channel that road condition is bad, use the underpower that equal power distribution obtains to meet its modulating-coding Mode, thus affect the use of frequency resource.

Secondly, in AMC mechanism, first dispatched resource, then selected preferably according to channel situation Modulation coding mode, each channel of this mode often selects best modulation coding mode, and user may not Need the highest modulation coding mode, so AMC mechanism is not efficient coding mode distribution mechanism.

Summary, uses AMC mechanism to carry out resource unreasonable distribution in prior art.

Summary of the invention

Embodiments provide a kind of resource allocation methods, base station and related network elements, existing in order to solve Technology uses the problem that AMC mechanism carries out resource unreasonable distribution.

Based on the problems referred to above, embodiments provide one of a kind of resource allocation methods, including:

Base station uses tabu search algorithm, the modulation distributing each user for resident described base station and coding plan The MCS numerical value set that slightly (MCS, Modulation and Coding Scheme) is constituted is iterated, Iteration termination condition is preset until meeting；And

For in each iteration use each MCS numerical value set, according to this MCS numerical value set and described respectively The minimum transmission rate requirements of user, determines for described each user distribute corresponding with this MCS numerical value set Subchannel, and true based on corresponding with this MCS numerical value set subchannel for described each user distribution The data of fixed described base station transmit total speed；

Determine MCS numerical value set, wherein, based on a determination that MCS numerical value set corresponding for described each use The subchannel of family distribution, it is the highest that the data of the described base station determined transmit total speed；

The each user for this base station resident characterized according to the MCS numerical value set determined for described base station distributes MCS, and the son that corresponding with the MCS numerical value set the determined each user for this base station resident distributes Channel is each user resource allocation of resident described base station.

Embodiments provide the two of a kind of resource allocation methods, including:

For each base station, receive the minimum transmission rate requirements of each user of this base station resident of this base station statistics Sum；

Determine the highest with the biggest base station priorities of the minimum transmission rate requirements of each user；

According to each base station priorities order from high to low, for the distribution of described each base station carry out resource distribution time Between point so that the base station that priority is the highest carries out the time point of resource distribution more early；

The time point information that this base station of instruction carries out the time point of resource distribution is sent respectively to described each base station.

Embodiments provide a kind of base station, including:

Iteration module, is used for using tabu search algorithm, distributes each user for resident described base station The MCS numerical value set that MCS is constituted is iterated, and presets iteration termination condition until meeting；And for The each MCS numerical value set every time used in iteration, according to this MCS numerical value set and described each user Low transmission rate demand, determines the subchannel for described each user distribution corresponding with this MCS numerical value set, And determine described base station based on the subchannel for described each user distribution corresponding with this MCS numerical value set Data transmit total speed；

MCS determines module, is used for determining MCS numerical value set, wherein, based on a determination that MCS numerical value The subchannel for described each user distribution that set is corresponding, the data of the described base station determined transmit total speed The highest；

Resource distribution module, for characterize according to the MCS numerical value set that determines for described base station for resident The MCS of each user distribution of this base station, and corresponding with the MCS numerical value set determined for this base resident Each user resource allocation that subchannel is resident described base station of each user distribution stood.

Embodiments provide a kind of network element, including:

Receiver module, for for each base station, receives each user of this base station resident of this base station statistics The sum of low transmission rate demand；

Determine module, for that determine the minimum transmission rate requirements of each user and the biggest base station priorities more High；

Distribution module, for according to each base station priorities order from high to low, being allocated into for described each base station The time point of row resource distribution so that the base station that priority is the highest carries out the time point of resource distribution more early；

Sending module, for sending the time point indicating this base station to carry out resource distribution respectively to described each base station Time point information.

The beneficial effect of the embodiment of the present invention includes:

A kind of resource allocation methods, base station and the related network elements that the embodiment of the present invention provides, including: base station is adopted With tabu search algorithm, the MCS numerical value set that the MCS distributing each user for this base station resident is constituted Being iterated, presetting iteration termination condition until meeting；And for each MCS number used in each iteration Value set, according to this MCS numerical value set and the minimum transmission rate requirements of each user, determines and this MCS The subchannel distributed for each user that numerical value set is corresponding, and based on corresponding with this MCS numerical value set The subchannel distributed for each user determines that the data of this base station transmit total speed；Determine MCS numerical value set, Wherein, based on a determination that the subchannel distributed for each user corresponding to MCS numerical value set, that determines should It is the highest that the data of base station transmit total speed；According to the MCS numerical value set that determines for this base station characterize for staying Stay the MCS that each user of this base station distributes, and for resident be somebody's turn to do corresponding with the MCS numerical value set determined Each user resource allocation that subchannel is this base station resident of each user distribution of base station.The embodiment of the present invention carries The resource allocation methods of confession, uses tabu search algorithm, the MCS distributing each user for resident base station The MCS numerical value set constituted is iterated, and obtains transmitting, so that the data of base station, the MCS that total speed is the highest Numerical value set, i.e. obtains being suitable for the MCS method of salary distribution of each user, will not need higher than user for user's distribution The MCS wanted, and determine the subchannel method of salary distribution corresponding with this MCS method of salary distribution, also ensure that Subchannel distribution power according to distribution, without the power identical for each resource block assignments, is not only able to Meet user rate demand and can promote again the utilization rate of sub channel resource and power resource, adopt in prior art Carry out resource distribution by AMC mechanism to compare, more rationally.

Accompanying drawing explanation

A kind of resource allocation methods that Fig. 1 provides for the embodiment of the present invention, is applied to the flow chart of base station side；

A kind of resource allocation methods that Fig. 2 provides for the embodiment of the present invention, is applied to preset the flow process of network element side network element Figure；

A kind of resource allocation methods that Fig. 3 provides for the embodiment of the present invention 1, is applied to the flow chart of base station side；

The method using tabu search algorithm to determine MCS numerical value set that Fig. 4 provides for the embodiment of the present invention Flow chart；

The Hungary Algorithm that uses that Fig. 5 provides for the embodiment of the present invention is defined as user's correspondence distribution subchannel Method flow diagram；

The default network element that Fig. 6 provides for the embodiment of the present invention and the system architecture schematic diagram of each base station；

The structural representation of a kind of base station that Fig. 7 provides for the embodiment of the present invention；

The structural representation of a kind of network element that Fig. 8 provides for the embodiment of the present invention.

Detailed description of the invention

Embodiments provide a kind of resource allocation methods, base station and related network elements, below in conjunction with explanation The preferred embodiments of the present invention are illustrated by book accompanying drawing, it will be appreciated that preferred embodiment described herein It is merely to illustrate and explains the present invention, being not intended to limit the present invention.And in the case of not conflicting, this Embodiment in application and the feature in embodiment can be mutually combined.

The embodiment of the present invention provides a kind of resource allocation methods, is applied to base station side, as it is shown in figure 1, include:

S101, base station use tabu search algorithm, the MCS structure distributing each user for this base station resident The MCS numerical value set become is iterated, and presets iteration termination condition until meeting.

S102, for each MCS numerical value set used in each iteration, according to this MCS numerical value set and The minimum transmission rate requirements of each user, determines and corresponding with this MCS numerical value set distributes for each user Subchannel, and determine this base based on corresponding with this MCS numerical value set subchannel distributed for each user The data stood transmit total speed.

S103, determine MCS numerical value set, wherein, based on a determination that MCS numerical value set corresponding be each The subchannel of user's distribution, it is the highest that the data of this base station determined transmit total speed.

S104, each user for this base station resident characterized according to the MCS numerical value set determined for this base station The MCS of distribution, and each user distribution for resident this base station corresponding with the MCS numerical value set determined Each user resource allocation that subchannel is this base station resident.

Further, a kind of resource allocation methods that the embodiment of the present invention provides, is the angle a base station Write, all can apply in multiple base stations when being embodied as.

The embodiment of the present invention provides a kind of resource allocation methods, is applied to preset network element side network element, as in figure 2 it is shown, Including:

S201, for each base station, each user minimum transmission speed of this base station resident receiving this base station statistics The sum of rate demand.

S202, determine the minimum transmission rate requirements of each user and the biggest base station priorities the highest.

S203, according to each base station priorities order from high to low, carry out resource distribution for the distribution of each base station Time point so that the base station that priority is the highest carries out the time point of resource distribution more early.

S204, to each base station respectively send indicate this base station carry out resource distribution time point time point letter Breath.

Below in conjunction with the accompanying drawings, the method and the relevant device that provide the present invention with specific embodiment are retouched in detail State.

Embodiment 1:

In the embodiment of the present invention 1, it is provided that a kind of resource allocation methods, it is applied to base station side, as it is shown on figure 3, Specifically include following steps:

S301, base station determine what the MCS that each user for resident base station as initial sets distributes was constituted MCS numerical value set.

Further, in this step, determine the MCS numerical value set as initial sets, this MCS numerical value Gather the ident value corresponding for MCS distributed by each user for this base station resident to constitute.This is as initial set The MCS numerical value set closed can determine that mode determines, such as by presetting: determines at random or by each The MCS numerical value set of the ident value composition corresponding for MCS that user is currently used is defined as initial sets etc..

Use tabu search algorithm, be iterated according to the mode described in S302～S317:

S302, determine rule according to initial sets and default neighborhood, determine as neighborhood for this base resident The MCS numerical value set that the MCS of each user distribution stood is constituted.

Tabu search algorithm has used for reference the intelligence thinking characteristic of the mankind, uses taboo strategy to avoid roundabout searching as far as possible Rope constitutes tabu search algorithm.In tabu search algorithm, carry out the solution of problem of representation by the form of mathematics, And construct object function and neighborhood, object function is used for weighing the excellent situation often organizing solution in each iteration, Neighborhood is by currently solving and moving, by the neighborhood of definition, all set being deconstructed into that can reach.Algorithm must Must can accept inferior solution, the solution that iteration obtains the most each time is the most necessarily better than original solution, once connects Being subject to inferior solution, iteration is it is possible to be absorbed in circulation, in order to prevent search from circulation occurring, it is also possible to structure taboo list, Using the value of the movement of neighborhood or object function as taboo object, more newly received movement can be placed on In taboo list, iteration afterwards is forbidden.I.e. only the better solutions in taboo list (may ratio Current guards escorting prisoners) initial solution as next iteration could be accepted.Along with the carrying out of iteration, taboo list is continuous Update, after certain iterations, enter the movement of taboo list the earliest and just lift a ban from taboo list and step back. The selection strategy used in tabu search algorithm, it is ensured that tabu search algorithm has jumps out locally optimal solution Ability, current solve the optimal solution that each step is always moved in neighborhood not avoided.In tabu search algorithm Can also arrange special pardon criterion, the solution meeting special pardon criterion can not be limited by taboo list.

Fig. 4 is the flow chart of tabu search algorithm.As shown in Figure 4, mainly perform during TABU search Following steps:

S401, determining algorithm initial solution, arranging initial solution is current optimum solution, arranges taboo list for sky.

S402, judging that whether iteration meets and preset iteration termination condition, if meeting, then terminating search, output Optimal solution；Otherwise, step S403 is entered.

S403, based on current optimum solution generate neighborhood solution, and from generate neighborhood solution determine candidate solution.

S404, judge whether meet preset special pardon criterion, if meet, then enter step S405；Otherwise, Enter step S406.

S405, being defined as currently solving by meeting the solution presetting special pardon criterion, object corresponding to this solution is replaced the earliest The object of write taboo list, updates optimal solution.Enter step S402.

S406, candidate solution taboo attribute is judged, using optimum solution corresponding for non-taboo object as currently Good solution, uses this object to replace the object writing taboo list the earliest.Enter step S402.

The embodiment of the present invention uses tabu search algorithm, can be by the MCS's of K user of resident base station The MCS numerical value set S that ident value is constituted is as the solution of tabu search algorithm problem.First by K user's The MCS numerical value set S that the ident value of MCS is constituted is as K dimension, such as: S=[1,2,3,13,5...] represents Ident value for the MCS of user 1 distribution is 1, and the ident value for the MCS of user 4 distribution is 13.Mesh Scalar functions could be arranged to: f (S), is when each user selects different MCS numerical value set and understands correspondence not With desired value, object function be calculated as each user MCS configure determine in the case of, preset son The data of the base station under channel and the power method of salary distribution transmit total speed.Wherein, preset subchannel and power divides Formula formula can be meet user's each subchannel lowest data transmission rate on the premise of, power consumption is minimum Subchannel and the power method of salary distribution.

Further, initial sets i.e. initial solution S of tabu search algorithm₀, can be that each user chooses maximum Exponent number MCS configures, and neighborhood moves the displacement that can be defined as currently solving and moves, such as: assume that K=3 works as Front solution is S=[1,1,1], then, the current neighborhood solved can be that other two user's configuration modes are constant, only Become the modulation system of a user, then the neighborhood obtained may include that

[2,1,1], [3,1,1], [4,1,1] ..., [1,2,1], [1,3,1] ..., [1,1,2], [1,1,3] ... etc., the number of neighborhood can also be carried out Limit, such as: represented the number of neighborhood by F=(M-1) × K, wherein, M represents embodiment of the present invention institute The MCS mode sum that the system of application includes, after neighborhood is all obtained, it is also possible to reduce further Neighborhood quantity, such as: randomly selectIndividual neighborhood solution is as candidate solution, to candidate solution It is iterated.Tabu Length can be set to L=0.6L_n, iteration maximum times iter_max=i, wherein, i is permissible It is configured according to actual needs.

S303, for MCS numerical value set respectively as initial sets and neighborhood in this iteration, pin To each user in described each user, according to the sub-carrier number of every sub-channels, symbolic number, the persistent period, The efficiency of the MCS corresponding with this user in this MCS numerical value set, determines that this user is at every sub-channels Message transmission rate.

Further, in this step, for each iteration, in this iteration respectively as initial sets MCS numerical value set, and the MCS numerical value set as neighborhood, determine each MCS set of values respectively The each user closed is in the message transmission rate of every sub-channels.

Further, for same user, the subchannel being assigned to needs to use same MCS Mode, selects different MCS modes can affect the data rate of user, then, any user k is in office Under one MCS modulation system m, transfer rate R in arbitrary subchannel n_k,n,mCan be determined by formula (1):

R_{k, n, m} = \frac{{SC}_{ofdm} \cdot {SY}_{ofdm}}{T_{slot}} \cdot {eff}_{m}

Formula (1)

In formula (1), SC_ofdmAnd SY_ofdmRepresent sub-carrier number and symbolic number, the T of subchannel n respectively_slotTable Show the persistent period of subchannel n, eff_m(bits/symbol) efficiency of selection MCS modulation system m is represented, K ∈ [1, K], m ∈ [1, M], n ∈ [1, N]；Maximum in the value of statistical indicant of the M all MCS modes of sign；N table Levy maximum subchannel number in all subchannel number；

Every kind of ident value corresponding for MCS and modulation system (Modulation), code check (Code Rate), Signal to Interference plus Noise Ratio thresholding (SINR threshold, Signal and Interference to Noise Ratio threshold [dB]) and the corresponding relation of efficiency (Efficiency) as shown in table 1:

Table 1

S304, according to this user determined in S303 the message transmission rate of every sub-channels and this user Minimum transmission rate requirements, determine the subchannel number that this user needs.

Further, there is minimum transmission rate requirements in each user, and in this step, base station distribution is owned Sub channel resource to downlink user, first pass through minimum power to meet the minimum speed limit demand of user, The minimum speed limit demand assuming any user k is R_min(k), and user MCS is R_k,m, then, Ke Yiyou Formula (2) determines subchannel number n (k) that user needs:

n (k) = \frac{R_{\min} (k)}{R_{k, m}}

Formula (2)

In formula (2), R_k,mFormula (1) can be passed through be determined.

S305, according to the minimum SINR needed for the MCS that this user in this MCS numerical value set is corresponding, should User's experienced interference on each of the sub-channels and this base station, to the channel gain of this user, determine this user Minimum transmitting power on each of the sub-channels.

Further, as shown in Table 1, every kind of MCS mode has corresponding SINR thresholding, then, User k SINR γ in subchannel n_k,nCan be determined by formula (3):

γ_{k, n} = \frac{P_{k, n}^{b} G_{b, k}}{I_{k, n} + σ^{2}} = \frac{P_{k, n} G_{b, k}}{Σ_{b^{'} = 1, b^{'} &NotEqual; b}^{B} P_{k^{'}, n}^{b^{'}} G_{b^{'}, k} + σ^{2}}

Formula (3)

In formula (4),Represent the power that base station b launches in subchannel n to user k；G_b,kRepresent base Stand the b channel gain to user k；I_k,nRepresent that user k receives self base station outside resident base station exist Interference on channel n；σ²Represent noise power.

For different users, distribute different modulation systems, different subchannels, need the power of distribution Also it is different, so affect power is user's modulation system and subchannel.So, user k uses son letter The lowest power of road n and the satisfied SINR threshold requirement corresponding for MCS distributed can be entered by formula (3) The formula (4) that row is derived by determines:

P_{k, n, m}^{b} = γ_{m} \cdot \frac{I_{k, n} + σ^{2}}{G_{b, k}}

Formula (4)

In formula (4), γ_mExpression user k is in the case of distribution MCS mode m, and required is minimum SINR value；It is calculated by user feedback channel condition information and disturbed condition.

Further, step S305 does not has strict sequencing with the execution of step S303～step S304.

S306, according to the subchannel number of the respectively corresponding needs of each user and respectively in each subchannel Minimum transmitting power, constructs cost matrix,

Wherein, the row of cost matrix represents user, and more than one for subchannel number required in each user User, the line number of this user that cost matrix comprises is identical with the subchannel number needed for this user；Cost Matrix column represents subchannel, and the element of cost matrix represents this element and is expert at corresponding user in this element institute Minimum transmitting power in the corresponding subchannel of row.

Further, for any one MCS numerical value set, say, that divide for each user for any one Join the mode of MCS, on the premise of the mode of the MCS distributed for each user determines, and meet user On the premise of minimum transfer rate, user's sub-channel number has different demands, then can just base The subchannel stood distributes to the problem that the general power of user and consumption is minimum, the problem being converted to task assignment, Make everyone complete the cost of each required by task different, and finally distributing of task to make total cost Minimum, and the number of sub-channels that each user needs is different, meets demand and the son of final distribution of user It is minimum that channel makes base station consume general power.

It is possible to further use Hungary Algorithm that the standard assignments problem being converted into is solved.Son letter Road can be equivalent to the task in assignment problem, and user selects subchannel can be equivalent to user and completes a certain Business, and have corresponding cost i.e. power.

Assume that in the cost matrix of structure, each user accounts for a line, and every sub-channels accounts for string, the sequence often gone Number and the ordinal number one_to_one corresponding of user, every a line represents that user k uses the minimum power of all subchannels respectively Cost, cost matrix has K × N number of element.The cost matrix so obtained is:

{[\begin{matrix} p (1,1), p (1,2), . . ., p (1, N) \\ p (2,1), p (2,2), . . ., p (2, N) \\ . . . . . . \\ p (K, 1), p (K, 2), . . ., p (K < N) \end{matrix}]}_{K \times N}

Wherein, (k n) characterizes the user k minimum transmitting power in subchannel n to p.But, due to subchannel Number, often more than user's number, will be converted to standard assignments problem resource allocation problem, " use for i.e. one Family " only select one " subchannel ", need to convert cost matrix, can be by virtual for each user For multiple Virtual User, the subchannel number that Virtual User number is required equal to this user self, each user is empty The user drawn up has identical Power penalty in each subchannel certainly with this user, the cost after conversion Matrix is:

{[\begin{matrix} p (1,1), p (1,2), . . ., p (1, N) \\ p (2,1), p (2,2), . . ., p (2, N) \\ p (2,1), p (2,2), . . ., p (2, N) \\ . . . . . . \\ p (K, 1), p (K, 2), . . ., p (K, N) \end{matrix}]}_{Q \times N}

Where it is assumed that user 2 needs two sub-channels, and Q ∈ [K, N].

S307, judge in S306 that the line number of cost matrix of structure whether less than columns, the most then enters Step S308；Otherwise, step S309 is entered.

S308, increase in cost matrix full 0 exercise the line number of cost matrix equal to columns.

Further, when users all in step S306 have virtualized, if Virtual User number is less than son The number of channel, then increase extra Virtual User and make Virtual User number equal to number of subchannels, these extra users The cost using all subchannels could be arranged to zero, because they can get user uses remaining channel. Cost matrix after changing is the square formation of a N × N, and the N × N square formation obtained can be:

{[\begin{matrix} p (1,1), p (1,2), . . ., p (1, N) \\ p (2,1), p (2,2), . . ., p (2, N) \\ p (2,1), p (2,2), . . ., p (2, N) \\ . . . . . . \\ p (K, 1), p (K, 2), . . ., p (K, N) \\ 0,0, . . ., 0 \\ . . . . . . \\ 0,0, . . ., 0 \end{matrix}]}_{N \times N}

Now problem is converted to standard assignments problem, it is possible to use Hungary Algorithm solves.

S309, the son using Hungary Algorithm to be defined as described each user distribution based on the cost matrix obtained are believed Road.

Further, owing to generally not havinging the line number situation more than columns of cost matrix, therefore, originally Step is the branch performed when the line number of cost matrix is equal to columns.

Further, Fig. 5 is the method flow using Hungary Algorithm to be defined as user's correspondence distribution subchannel Figure.As it is shown in figure 5, use Hungary Algorithm to be defined as described each use based on the N × N cost matrix obtained The process of the subchannel of family distribution, can be achieved by the steps of:

S3091: conversion cost matrix so that each row in the cost matrix after conversion respectively arranges all occurs 0 yuan Element.

In this step, for every row element of cost matrix, this row element is made all to deduct this row element intermediate value Little element, the more every column element for the new cost matrix obtained, make this column element deduct this column element The element that intermediate value is minimum, if certain row or existing 0 element of certain row, it is not necessary to subtract (negative element can not occur) again.

S3092: carry out examination and assign, to seek optimal solution.

In this step, the cost matrix after converting through step 1 determines Independent 0 Elements as much as possible. After the 1st step conversion, in cost matrix there is 0 element in each row and column the most；But N number of independence need to be found out 0 element.If can find out, just with the element in these Independent 0 Elements homographic solution matrixes for 1, remaining is 0, obtain optimal solution.Determine that the step of Independent 0 Elements can be such that

(1) from the beginning of the row (column) of only one of which 0 element, add circle to this 0 element.This represents this row Representative user, only one task can be assigned to this user.Then scratch in the row (OK) drawn a circle its His 0 element, represents that this task representated by row has been assigned, it is not necessary to consider further that other users.

(2) 0 element giving only 0 element row (OK) adds circle, then scratches and adds the element of circle and be expert at 0 element of (arranging).

(3) (1), (2) two steps are repeated, until all neutral elements are all circled or cross out.

(4) if still suffering from 0 element do not drawn a circle, and with the neutral element at least two of row (column), available Different schemes goes to sound out.From the beginning of remaining the row (column) having 0 element minimum, compare this row 0 element column In the number of 0 element, 0 element that in alternative column, 0 element is minimum adds circle, then crosses out colleague's same column its His 0 element.It is repeated, until all 0 elements are all irised out or cross out.

S3093: the number of 0 element that judges to draw a circle, equal to the dimension of matrix, has the most obtained appointment and asked The optimal solution of topic；If drawing a circle, the number of 0 element is less than the dimension of matrix, then enter S3094.

S3094: make minimum straight line and cover all 0 elements, can find in this cost matrix at most to determine Independent null element prime number.

This step sequentially includes the following steps:

(1) row do not drawn a circle is played check mark；

(2) row crossing out neutral element are had to play check mark to having beaten in the row of check mark；

(3) check mark is played to being equipped with in the row of check mark containing the row of element of drawing a circle again；

(4) (2), (3) are repeated, until not reaching the new row, column playing check mark；

(5) to not beating the row picture horizontal line of check mark, the row picture ordinate that air exercise is checked the number, obtain covering all 0 The minimum straight line number of element.

S3095: obtain new cost matrix through above-mentioned conversion.The element not covered by straight line is looked for Go out least member, and each element not drawing linear rows is all deducted this least member, to each unit drawing alignment array Element all adds this least member, obtains new matrix, enters S3092.

So, can be for each user based on the N × N cost matrix employing Hungary Algorithm obtained, can With according to this user's it needs to be determined that go out the subchannel distributed for this user.

S310, determine at least one residue subchannel and this base station total being not yet assigned to any user Launch the residue after removing the minimum transmitting power of each subchannel being already allocated to user in power to launch Power.

Further, using Hungary Algorithm in above-mentioned steps is that user determines that the subchannel of distribution only meets The minimum speed limit demand of user, the resource of needs is less, so base station resource distribution often exists subchannel Residue with power.

S311, for each user in each user, according to this user respectively at least one residue described The message transmission rate of channel, and this user minimum at least one residue subchannel described respectively Penetrate power, determine this user efficiency respectively at least one residue subchannel described.

In this step, in order to fully use remaining power resource, it is possible to use remaining power resource Meet the maximum speed of user, residue subchannel n given the user k making this subchannel efficiency maximum, User k uses efficiency EE of channel n_k,nCan be determined by formula (5):

{EE}_{k, n} = \frac{R_{k, n}}{P (k, n)}

Formula (5)

In formula (5), R_k,nCan be determined by formula (1) on the premise of the MCS of user k is certain, and P (k, n) Can be determined by formula (4) on the premise of the MCS of user k is certain.

Have in this residue subchannel if at least one residue subchannel is respectively allocated to by S312, judgement The user of high energy efficiency, if can transmission power all be distributed, the most then enter step S313； Otherwise, step S314 is entered.

S313, by least one residue subchannel distribute to, in this residue subchannel, there is the use that can imitate Family.Enter step S315.

In this step, use limited power resource can obtain bigger speed, until residue sub channel resource Divide, or dump power resource has been divided.

S314, by least one residue subchannel be respectively allocated to, in this residue subchannel, there is the maximum data The user of transfer rate so that at least one residue subchannel and transmission power are all distributed, or,

At least one residue subchannel is respectively allocated to have, in this residue subchannel, the use that can imitate Family, and at least one residue subchannel is respectively allocated to have the maximum data biography in this residue subchannel The user of defeated speed so that at least one residue subchannel and described transmission power are all distributed.

Further, in this step, if only considering to distribute in correspondence residue subchannel and dump power All residue subchannels and dump power cannot be divided by the user in residue subchannel with maximum efficiency completely Join, then, do not consider further that the user that efficiency is maximum, because efficiency the most very much not represents acquisition, speed is maximum.Can To distribute to residue subchannel make in this residue subchannel transmitting data speed R_k,nMaximum user, or Person, it may be considered that some residual subchannel and dump power are distributed to correspondence residue subchannel on have The user of big efficiency, remains subchannel by another part and dump power is distributed to have in corresponding subchannel The user of peak transfer rate, the concrete method of salary distribution used depends on whether this kind of method of salary distribution can be by surplus Remaining subchannels and dump power are fully allocated.

S315, determine this base station based on corresponding with this MCS numerical value set subchannel distributed for each user Data transmit total speed.

Further, each with the MCS value that correspond to per family in this MCS numerical value set, Yi Jiwei The subchannel number of this user distribution, can use formula (1) to determine this user transmission speed under this MCS Rate, and the transfer rate of each user of resident base station is added, obtain total speed of this base station.

S316, judging whether this iteration meets and preset iteration termination condition, if being unsatisfactory for, then entering step S317；If meeting, then enter step S318.

Further, presetting iteration termination condition can be configured according to practical situation, generally can arrange Iterations is for presetting iteration termination condition, when iterations reaches the iterations arranged, then stops repeatedly Generation.

S317, the subchannel institute distributed for each user of the highest total speed of base station in this iteration will be determined Corresponding MCS numerical value set is updated to new initial vector, enters step S302.

Further, in an iteration, need the initial sets to this iteration and neighborhood correspondence respectively MCS numerical value set determine total speed of base station of correspondence respectively, if being unsatisfactory for presetting after this iteration Iteration termination condition, then can will make the MCS numerical value set that the total speed in base station is the highest in this iteration, As the initial sets of iteration next time, determine that rule determines in iteration next time as neighborhood according to default neighborhood MCS numerical value set, and carry out iteration next time.

S318, determine MCS numerical value set,

Wherein, based on a determination that the subchannel distributed for each user corresponding to MCS numerical value set, determine This base station data transmit total speed the highest.

Further, in this step, the data making base station are transmitted the MCS numerical value set that total speed is the highest It is defined as the MCS numerical value set for user's distribution.

S319, add up the sum of each user's lowest data transmission rate demand of resident base station.

S320, by statistics each user's lowest data transmission rate demand and be sent to preset network element.

The time point information indicating described base station to carry out resource distribution that S321, the default network element of reception send.

S322, the time point characterized at the described time point information received, according to the MCS determined for base station Numerical value set characterize for this base station resident each user distribute MCS, and with the MCS numerical value determined Each user that subchannel is resident base station that each user for this base station resident of set correspondence distributes distributes money Source.

Further, the execution of step S319～step S321 does not has with the execution of step S301～step S318 There is strict sequencing.

Further, in step S319～step S322, owing to interference mutually can be produced between base station, and And this interference is as adjacent base station distribution power and the change of carrier wave and changes, in order to realize point The resource distribution of cloth, the when of making single base station carry out resource distribution around the environment of interference constant, can With by default network element (such as: central processing module (CPM, Central Processing Module)) Determine priority for base station, and make the base station that priority is the highest carry out the time point of resource distribution more early, that , base station can carry out the money of this community according to the priority (i.e. the time point of self Resources allocation) of self Source is distributed, and the most different base stations has the different time points carrying out resource distribution, in time can be wrong Opening, base station is carried out the when that resource being distributed it is believed that the disturbed condition of peripheral base station is constant.

Further, after the priority of base station determines, each base station carries out resource distribution, resource independently The relevant parameter of distribution can be such that

Sets of sub-channels N={1 of base station ..., n ..., N}, every sub-channels at most gives a user；MCS Set M={1 ..., m ..., M}, MCS and SINR thresholding relation are shown in Table 1, and each user is at a time slot only A kind of MCS can be used；User's collection is combined into K={1 ..., k ..., K}；The maximum transmission power of base station is P_max。

Fig. 6 is for presetting the system architecture schematic diagram of network element (as a example by CPM) and each base station, such as Fig. 6 institute Show, a central processing module CPM, this CPM can be increased on the basis of normal cellular network framework For the service conditions about this base station of self administered base station feedback in collection network.CPM is according to base The situation of business of standing determines that each base station independently carries out priority level and the time point of resource distribution.So may be used To ensure to stagger with the resource allocation operations of adjacent base station when resource is distributed in each base station as far as possible, it is believed that The disturbed condition of adjacent base station is constant, thus ensures the effectiveness that resource is distributed.

After priority and operating time determine, CPM carries out resource distribution by determine for each base station Time point information is sent respectively to respective base station, and all sub channel resource are carried out point by each base station individually Join.Carrying out considering the distribution to MCS while subchannel is distributed with power joint, first base station meets uses The rate requirement at family, then uses remaining resource to maximize system velocity.

In CPM side, the priority that can carry out each base station in accordance with the following steps determines:

If collection of base stations be Β=1 ..., b ..., B}, each base station b add up minimum speed limit demand feelings in respective community Condition, in the Minimum requirements Liang Wei community of whole community all user's Minimum requirements speed add and, and be designated as R_minB (), base station b feeds back R to CPM_minB (), CPM is according to the situation of all base station feedback, to all R_min(b),It is sorted in ascending order, according to being ordered as base station distribution priority, R_minB () maximum priority is Height, minimum priority is minimum.Sequence according to priority determines that base station performs the time point of resource distribution, First execution that priority is the highest, the last execution that priority is minimum, the sequence according to priority of other base station Analogize execution time point.

Determine that base station performs the priority of resource distribution according to priority, it is ensured that base station carries out resource and divides Timing time disturbed condition around is constant, and then beneficially resource distribution, is additionally favorable for ensureing the rate requirement of user, Such as, when the rate requirement of base station b is higher when, higher priority can ensure that resident base station b's User has more preferable chance to obtain more preferable channel and power distribution, thus more rate requirement is expired Foot.

Further, in the embodiment of the present invention, first, it is base station according to the minimum speed limit conditions of demand of base station Resource allocation operations distribution priority, it is ensured that base station carry out resource distribution time around disturbed condition not Become, and then beneficially resource distribution, it is additionally favorable for ensureing the rate requirement of user；

Secondly, distribute, in conjunction with MCS, subchannel distribution and power, the speed that three dimensions carry out maximization network Rate.First it is fixed as the MCS of each user distribution, as subchannel distribution and the basis of power distribution, at MCS The distribution of channel and resource is carried out on the basis of determining.Use tabu search algorithm configures each of all users MCS grade, until meeting iterations, quickly and accurately makes whole network throughput for user's configuration Optimum MCS grade.

Again, after determining the MCS of each user, base station uses minimum power consumption preferentially to meet and uses The rate requirement at family, it is ensured that the general power of network consumption is minimum, always launches power limited due to base station, therefore The method can also allow base station have the more power of residue to carry out maximization network speed simultaneously.Again will residue son letter The user that efficiency is maximum in this subchannel is preferentially given in road, if power resource still has residue, and will residue son letter Road sub-distribution again, preferentially distributes to the user in this subchannel with maximum data transfer rate.Not only grasp Make the easiest, and can ensure that the speed of network maximizes.

Based on same inventive concept, the embodiment of the present invention additionally provides a kind of base station and related network elements, due to this The principle of a little base stations problem solved with network element is similar with aforementioned one resource allocation methods, therefore this base station with The enforcement of network element may refer to the enforcement of preceding method, repeats no more in place of repetition.

A kind of base station that the embodiment of the present invention provides, as it is shown in fig. 7, comprises such as lower module:

Iteration module 701, is used for using tabu search algorithm, distributes each user for resident described base station MCS constitute MCS numerical value set be iterated, until meet preset iteration termination condition；And pin To each MCS numerical value set used in each iteration, according to this MCS numerical value set and described each user Minimum transmission rate requirements, determines the son letter for described each user distribution corresponding with this MCS numerical value set Road, and determine described based on the subchannel for described each user distribution corresponding with this MCS numerical value set The data of base station transmit total speed；

MCS determines module 702, is used for determining MCS numerical value set, wherein, based on a determination that MCS The subchannel for described each user distribution that numerical value set is corresponding, the data transmission of the described base station determined is total Speed is the highest；

Resource distribution module 703, for characterize according to the MCS numerical value set determined for described base station be The MCS of each user distribution of this base station resident, and corresponding with the MCS numerical value set determined for resident Each user resource allocation that subchannel is resident described base station of each user distribution of this base station.

Further, described iteration module 701, specifically for determine as initial sets for resident described The MCS numerical value set that the MCS of each user distribution of base station is constituted；Use tabu search algorithm, according to such as Under type is iterated: determine rule according to initial sets and default neighborhood, determine as neighborhood for staying The MCS numerical value set that the MCS staying each user of this base station to distribute is constituted；Make respectively in this iteration For the MCS numerical value set of initial sets and neighborhood, according to this MCS numerical value set and described each user Minimum transmission rate requirements, determines the son letter for described each user distribution corresponding with this MCS numerical value set Road, and determine described based on the subchannel for described each user distribution corresponding with this MCS numerical value set The data of base station transmit total speed；Judge whether this iteration meets and preset iteration termination condition, if being unsatisfactory for, Then the maximum data determining base station described in this iteration is transmitted distributing for described each user of total speed The MCS numerical value set corresponding to subchannel be updated to new initial vector, enter next iteration；If Meet, then terminate iteration.

Further, described iteration module 701, specifically for for each user in described each user, This use in sub-carrier number, symbolic number, persistent period and this MCS numerical value set according to every sub-channels The efficiency of the MCS that family is corresponding, determines this user message transmission rate at every sub-channels；According to this use The family message transmission rate at every sub-channels and the minimum transmission rate requirements of this user, determine that this user needs The subchannel number wanted；Minimum according to needed for the MCS that this user in this MCS numerical value set is corresponding SINR, this user experienced interference on each of the sub-channels and this base station are to the channel gain of this user, really Fixed this user minimum transmitting power on each of the sub-channels；Needs according to described each user correspondence respectively Subchannel number and the respectively minimum transmitting power in each subchannel, construct cost matrix, wherein, institute State the row of cost matrix and represent user, and for the more than one use of subchannel number required in described each user Family, the line number of this user that described cost matrix comprises is identical with the subchannel number needed for this user；Described The row of cost matrix represent subchannel, and the element of described cost matrix represents this element corresponding user that is expert at and exists The minimum transmitting power of this element column correspondence subchannel；Judge whether the line number of described cost matrix is less than Columns；The most then increase in described cost matrix full 0 exercise the line number of described cost matrix is equal to Columns；Hungary Algorithm is used to be defined as the subchannel of described each user distribution based on the cost matrix obtained； Otherwise, Hungary Algorithm is used to be defined as the subchannel of described each user distribution based on cost matrix.

Further, described iteration module 701, it is additionally operable to using Hungary Algorithm to be defined as described each use After the subchannel of family distribution, determine and be not yet assigned at least one residue subchannel of any user and be somebody's turn to do After total transmitting power of base station removes the minimum transmitting power of each subchannel being already allocated to user Transmission power；For each user in described each user, according to this user respectively described at least The message transmission rate of one residue subchannel, and this user is respectively at least one residue subchannel described On minimum transmitting power, determine this user respectively described at least one residue subchannel on efficiency；Sentence If disconnected at least one residue subchannel described being respectively allocated to has and can imitate in this residue subchannel User, if described transmission power all can be distributed, the most then by described at least one remain Remaining subchannels distributes to have, in this residue subchannel, the user that can imitate；Otherwise, by described at least one Individual residue subchannel is respectively allocated to the user in this residue subchannel with the maximum data transfer rate, makes At least one residue subchannel described and described transmission power are all distributed, or, by described at least One residue subchannel is respectively allocated to have in this residue subchannel the user that can imitate, and by institute State at least one residue subchannel and be respectively allocated to, in this residue subchannel, there is the maximum data transfer rate User so that described at least one residue subchannel and described transmission power all distribute.

Further, described base station, also include: statistical module 704, sending module 705 and reception mould Block 706；

Described statistical module 704, for before each user resource allocation for resident described base station, adds up The sum of the minimum transmission rate requirements of each user of resident described base station；

Described sending module 705, for the sum by described each user's lowest data transmission rate demand of statistics It is sent to preset network element；

Described receiver module 706, the described base station of instruction sent for receiving default network element carries out resource distribution Time point information；

Described resource distribution module 703, specifically for the time point characterized at the described time point information received, The each user for this base station resident characterized according to the MCS numerical value set determined for described base station distributes MCS, and the son letter that each user for resident this base station corresponding with the MCS numerical value set determined distributes Road is each user resource allocation of resident described base station.

A kind of network element that the embodiment of the present invention provides, as shown in Figure 8, including such as lower module:

Receiver module 801, for for each base station, receiving each use of this base station resident of this base station statistics The sum of the minimum transmission rate requirements in family；

Determine module 802, for determining the minimum transmission rate requirements of each user and the biggest base station priorities The highest；

Distribution module 803, for according to each base station priorities order from high to low, dividing for described each base station Join the time point carrying out resource distribution so that the base station that priority is the highest carries out the time point of resource distribution more Early；

Sending module 804, for described each base station respectively send indicate this base station carry out resource distribution time Between point time point information.

The function of above-mentioned each unit may correspond to the respective handling step in flow process shown in Fig. 1 to Fig. 4, at this Repeat no more.

Through the above description of the embodiments, those skilled in the art is it can be understood that arrive the present invention Embodiment can be realized by hardware, it is also possible to the mode of the general hardware platform adding necessity by software is come real Existing.Based on such understanding, the technical scheme of the embodiment of the present invention can embody with the form of software product Come, this software product can be stored in a non-volatile memory medium (can be CD-ROM, USB flash disk, Portable hard drive etc.) in, including some instructions with so that computer equipment (can be personal computer, Server, or the network equipment etc.) perform the method described in each embodiment of the present invention.

It will be appreciated by those skilled in the art that accompanying drawing is the schematic diagram of a preferred embodiment, the mould in accompanying drawing Block or flow process are not necessarily implemented necessary to the present invention.

It will be appreciated by those skilled in the art that the module in the device in embodiment can describe according to embodiment Carry out being distributed in the device of embodiment, it is also possible to carry out respective change and be disposed other than one of the present embodiment Or in multiple device.The module of above-described embodiment can merge into a module, it is also possible to is further split into Multiple submodules.

The invention described above embodiment sequence number, just to describing, does not represent the quality of embodiment.

Obviously, those skilled in the art can carry out various change and modification without deviating from this to the present invention Bright spirit and scope.So, if the present invention these amendment and modification belong to the claims in the present invention and Within the scope of its equivalent technologies, then the present invention is also intended to comprise these change and modification.

Claims

1. a resource allocation methods, it is characterised in that including:

Base station uses tabu search algorithm, the modulating-coding strategy distributing each user for resident described base station The MCS numerical value set that MCS is constituted is iterated, and presets iteration termination condition until meeting；And

2. the method for claim 1, it is characterised in that base station uses tabu search algorithm, right The MCS numerical value set constituted for the MCS of each user distribution of resident described base station is iterated, until full Foot presets iteration termination condition；And for each MCS numerical value set used in each iteration, according to this MCS Numerical value set and the minimum transmission rate requirements of described each user, determine corresponding with this MCS numerical value set For the subchannel of described each user distribution, specifically include:

Determine the MCS that the MCS that each user for resident described base station as initial sets distributes is constituted Numerical value set；

Use tabu search algorithm, be iterated as follows:

Determine rule according to initial sets and default neighborhood, determine each for this base station resident as neighborhood The MCS numerical value set that the MCS of user's distribution is constituted；For in this iteration respectively as initial sets with And the MCS numerical value set of neighborhood, according to this MCS numerical value set and the minimum transfer rate of described each user Demand, determines corresponding with this MCS numerical value set subchannel for described each user distribution, and based on The subchannel for described each user distribution corresponding with this MCS numerical value set determines that the data of described base station pass Defeated total speed；Judging whether this iteration meets and preset iteration termination condition, if being unsatisfactory for, then will determine The maximum data of base station described in this iteration transmits the subchannel institute for described each user distribution of total speed Corresponding MCS numerical value set is updated to new initial vector, enters next iteration；If meeting, then tie Bundle iteration.

3. method as claimed in claim 1 or 2, it is characterised in that according to this MCS numerical value set and The minimum transmission rate requirements of described each user, determines corresponding with this MCS numerical value set for described each use The subchannel of family distribution, specifically includes:

For each user in described each user, according to sub-carrier number, the symbolic number of every sub-channels, hold The efficiency of the MCS that the continuous time is corresponding with this user in this MCS numerical value set, determines that this user is each The message transmission rate of subchannel；

According to the minimum transmission rate requirements of this user message transmission rate at every sub-channels He this user, Determine the subchannel number that this user needs；

According to the minimum Signal to Interference plus Noise Ratio SINR needed for the MCS that this user in this MCS numerical value set is corresponding, This user experienced interference on each of the sub-channels and this base station, to the channel gain of this user, determine this use Family minimum transmitting power on each of the sub-channels；

The subchannel number of corresponding needs is distinguished and respectively in each subchannel according to described each user Minimum transmitting power, constructs cost matrix,

Wherein, the row of described cost matrix represents user, and for subchannel number required in described each user Subchannel needed for more than one user, the line number of this user that described cost matrix comprises and this user Number is identical；The row of described cost matrix represent subchannel, and the element of described cost matrix represents this element place The corresponding user of row is at the minimum transmitting power of this element column correspondence subchannel；

Judge that whether the line number of described cost matrix is less than columns；

The most then in described cost matrix increase full 0 exercise described cost matrix line number equal to row Number；Hungary Algorithm is used to be defined as the subchannel of described each user distribution based on the cost matrix obtained；

Otherwise, Hungary Algorithm is used to be defined as the subchannel of described each user distribution based on cost matrix.

4. method as claimed in claim 3, it is characterised in that be defined as institute using Hungary Algorithm After stating the subchannel of each user distribution, also include:

Determine at least one residue subchannel and the total transmitting merit of this base station being not yet assigned to any user Rate removes the transmission power after the minimum transmitting power of each subchannel being already allocated to user；

For each user in described each user, according to this user respectively at least one residue son letter described The message transmission rate in road, and this user minimum transmitting at least one residue subchannel described respectively Power, determines this user efficiency respectively at least one residue subchannel described；

Have in this residue subchannel if at least one residue subchannel described is respectively allocated to by judgement The user of high energy efficiency, if described transmission power all can be distributed, the most then by described at least One residue subchannel distributes to have, in this residue subchannel, the user that can imitate；

Otherwise, at least one residue subchannel described is respectively allocated to have in this residue subchannel the highest The user of message transmission rate so that at least one residue subchannel described and described transmission power are whole Distribution, or,

It is respectively allocated to have and can imitate in this residue subchannel by least one residue subchannel described User, and be respectively allocated to have in this residue subchannel by least one residue subchannel described The user of high data rate so that at least one residue subchannel described and described transmission power are complete Part is joined.

5. the method for claim 1, it is characterised in that each user for resident described base station Before Resources allocation, also include:

Add up the sum of the minimum transmission rate requirements of each user of resident described base station；

By statistics described each user's lowest data transmission rate demand and be sent to preset network element；

Receive the time point information indicating described base station to carry out resource distribution that default network element sends；

The each user for this base station resident characterized according to the MCS numerical value set determined for described base station distributes MCS, and the son that corresponding with the MCS numerical value set the determined each user for this base station resident distributes Channel is each user resource allocation of resident described base station, specifically includes:

At the time point that the described time point information received characterizes, according to the MCS number determined for described base station Value set characterize for this base station resident each user distribute MCS, and with the MCS set of values determined Close each user that subchannel is resident described base station distribution that the corresponding each user for this base station resident distributes Resource.

6. a resource allocation methods, it is characterised in that including:

7. a base station, it is characterised in that including:

Iteration module, is used for using tabu search algorithm, the tune distributing each user for resident described base station Make the MCS numerical value set constituted with coding strategy MCS to be iterated, until meeting default iteration to terminate bar Part；And for each MCS numerical value set used in each iteration, according to this MCS numerical value set and institute State the minimum transmission rate requirements of each user, determine corresponding with this MCS numerical value set for described each user The subchannel of distribution, and based on the son letter for described each user distribution corresponding with this MCS numerical value set Road determines that the data of described base station transmit total speed；

8. base station as claimed in claim 7, it is characterised in that described iteration module, specifically for really It is set for the MCS set of values constituted for the MCS that each user for resident described base station of initial sets distributes Close；Use tabu search algorithm, be iterated as follows: according to initial sets and default neighborhood Determine rule, determine the MCS that the MCS that each user for this base station resident as neighborhood distributes is constituted Numerical value set；For MCS numerical value set respectively as initial sets and neighborhood in this iteration, root According to this MCS numerical value set and the minimum transmission rate requirements of described each user, determine and this MCS set of values Close the corresponding subchannel for described each user distribution, and based on corresponding with this MCS numerical value set be The subchannel of described each user distribution determines that the data of described base station transmit total speed；Judge this iteration whether Meeting and preset iteration termination condition, if being unsatisfactory for, then will determine the highest number of base station described in this iteration It is updated to newly according to the MCS numerical value set corresponding to the subchannel for described each user distribution of the total speed of transmission Initial vector, enter next iteration；If meeting, then terminate iteration.

9. base station as claimed in claim 7 or 8, it is characterised in that described iteration module, specifically uses In for each user in described each user, according to sub-carrier number, the symbolic number of every sub-channels, continue The efficiency of the MCS that the time is corresponding with this user in this MCS numerical value set, determines that this user is at every height The message transmission rate of channel；According to this user the message transmission rate of every sub-channels and this user Low transmission rate demand, determines the subchannel number that this user needs；It is somebody's turn to do according in this MCS numerical value set Minimum SINR needed for the MCS that user is corresponding, this user experienced interference on each of the sub-channels and should Base station, to the channel gain of this user, determines this user minimum transmitting power on each of the sub-channels；According to Described each user the subchannel number of needs of correspondence and the minimum transmitting in each subchannel respectively respectively Power, constructs cost matrix, and wherein, the row of described cost matrix represents user, and for described each user The user that needed in, subchannel number is more than one, the line number of this user that described cost matrix comprises and this use Subchannel number needed for family is identical；The row of described cost matrix represent subchannel, the unit of described cost matrix Element represents this element and is expert at the corresponding user minimum transmitting power in this element column correspondence subchannel；Sentence Whether the line number of disconnected described cost matrix is less than columns；In described cost matrix, the most then increase full 0 Exercise the line number of described cost matrix equal to columns；Use Hungary Algorithm true based on the cost matrix obtained It is set to the subchannel of described each user distribution；Otherwise, Hungary Algorithm is used to be defined as institute based on cost matrix State the subchannel of each user distribution.

10. base station as claimed in claim 9, it is characterised in that described iteration module, is additionally operable to adopting Be defined as the subchannel of described each user distribution with Hungary Algorithm after, determine and be not yet assigned to any user's Total removing in power of launching of at least one residue subchannel and this base station is already allocated to each of user Transmission power after the minimum transmitting power of subchannel；For each user in described each user, According to this user respectively in the message transmission rate of at least one residue subchannel described, and this user is respectively Minimum transmitting power at least one residue subchannel described, determines that this user is respectively described at least one Efficiency in individual residue subchannel；If judging to be respectively allocated to remain at this by least one residue subchannel described There is the user that can imitate, if described transmission power all can be distributed on remaining subchannels, if It is then at least one residue subchannel described to be distributed to have, in this residue subchannel, the use that can imitate Family；Otherwise, at least one residue subchannel described is respectively allocated to have in this residue subchannel the highest The user of message transmission rate so that at least one residue subchannel described and described transmission power are whole Distribution, or, it is respectively allocated to have in this residue subchannel by least one residue subchannel described The user of high energy efficiency, and at least one residue subchannel described is respectively allocated in this residue subchannel There is the user of the maximum data transfer rate so that at least one residue subchannel described and described residue are launched Power all distributes.

11. base stations as claimed in claim 7, it is characterised in that also include: statistical module, transmission mould Block and receiver module；

Described statistical module, for before each user resource allocation for resident described base station, adds up resident The sum of the minimum transmission rate requirements of each user of described base station；

Described sending module, for will statistics described each user's lowest data transmission rate demand and send Give and preset network element；

Described receiver module, for receive default network element send indicate described base station carry out resource distribution time Between dot information；

Described resource distribution module, specifically for the time point characterized at the described time point information received, presses The each user for this base station resident characterized according to the MCS numerical value set that determines for described base station distributes MCS, and the son letter that each user for resident this base station corresponding with the MCS numerical value set determined distributes Road is each user resource allocation of resident described base station.

12. 1 kinds of network elements, it is characterised in that including: