CN105992358B

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

Info

Publication number: CN105992358B
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: 2019-04-02
Anticipated expiration: 2035-02-11
Also published as: CN105992358A

Abstract

The embodiment of the invention provides a kind of resource allocation methods, base station and related network elements, comprising: base station uses tabu search algorithm, is iterated to the MCS numerical value set constituted for the MCS for being resident each user distribution of the base station, until meeting default iteration termination condition；For each MCS numerical value set used in each iteration, total rate is transmitted according to the data of the minimum transmission rate requirements of the MCS numerical value set and each user, the subchannel and the base station that are determined as each user's distribution；Determine MCS numerical value set, based on the corresponding subchannel for each user distribution of determining MCS numerical value set, the data for the base station determined transmit total rate highest；According to for the base station determine MCS numerical value set and it is corresponding be resident the base station each user distribution subchannel be resident the base station each user distribute resource.Compared with using AMC mechanism to carry out resource allocation in the prior art more rationally.The present invention relates to mobile communication technology fields.

Description

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

Technical field

The present invention relates to mobile communication technology field more particularly to a kind of resource allocation methods, base station and related network elements.

Background technique

As mobile Internet business amount is skyrocketed through, orthogonal frequency division multiple access (OFDM, Aorthogonal frequency Division multiple access) system capacity and service quality (QoS, Quality of Service) problem is increasingly It is prominent.In order to solve the problems, such as to become increasingly conspicuous, on the one hand, need to design more flexible resource allocation mechanism to match business demand On the other hand dynamic characteristic needs to further increase the spectrum efficiency of OFDMA system to enhance network capacity.In this background Under, Adaptive Modulation and Coding (AMC, Adaptive Modulation and is introduced in Communication System Design of new generation Coding) mechanism promotes frequent spectrum efficiency, and the dynamic resource allocation transmission technology based on AMC mechanism then obtains increasingly depth Concern.

So-called dynamic resource allocation, mainly base station are imitated according to channel information in multi-user diversity effect and frequency diversity It is that multiple users in system dynamically distribute subchannel, bit and power, to promote spectrum efficiency under the influence of answering.Exist at present Resource allocation mechanism used in real system (such as: long term evolution (LTE, Long Term Evolution) system) is root According to corresponding physical resource dispatching algorithm (such as: max carrier to interference allocation algorithm, ratio fair allocation algorithm and poll dispenser System) combining with adaptive modulation encoding mode is bit number that user distributes transmission, power distribution is generally using impartial distribution.

But for AMC mechanism, firstly, the power given on each resource block of user in systems in practice is Equal.When the same user uses identical modulation coding scheme on different sub-channels, since user is different Gain and decline are different on channel, meet signal-noise ratio threshold required for identical modulation coding scheme and just need different function Rate there is the waste of power resource using equal power distribution.And for channel preferable for channel condition, using equal The performance number that constant power is got is possibly more than the performance number for meeting the maximum modulation coding mode that it is used, to cause Power dissipation；For the channel bad for channel condition, the underpower for using equal power to distribute is to meet its tune Coding mode processed, to influence the use of frequency resource.

Secondly, having dispatched resource first in AMC mechanism, preferable modulating-coding side is then selected according to channel situation Formula, this each channel of mode often selects best modulation coding scheme, and user may not be needed so high modulating-coding Mode, so AMC mechanism is not efficient coding mode distribution mechanism.

In summary, unreasonable using AMC mechanism progress resource allocation in the prior art.

Summary of the invention

The embodiment of the invention provides a kind of resource allocation methods, base station and related network elements, to solve in the prior art The unreasonable problem of resource allocation is carried out using AMC mechanism.

Based on the above issues, the embodiment of the invention provides a kind of one of resource allocation methods, comprising:

Base station use tabu search algorithm, to be resident the base station each user distribute modulation and coding strategy The MCS numerical value set that (MCS, Modulation and Coding Scheme) is constituted is iterated, until meeting default iteration Termination condition；And

For each MCS numerical value set used in each iteration, according to the minimum of the MCS numerical value set and each user Transmission rate requirements determine the subchannel for each user's distribution corresponding with the MCS numerical value set, and are based on and this The corresponding subchannel for each user's distribution of MCS numerical value set determines that the data of the base station transmit total rate；

Determine MCS numerical value set, wherein based on the corresponding son for each user's distribution of determining MCS numerical value set The data of channel, the base station determined transmit total rate highest；

It is the MCS for being resident each user distribution of the base station according to the MCS numerical value set characterization determined for the base station, with And corresponding with determining MCS numerical value set be the subchannel of each user distribution for being resident the base station is be resident the base station each User distributes resource.

The embodiment of the invention provides the two of a kind of resource allocation methods, comprising:

For each base station, the sum of the minimum transmission rate requirements of each user for being resident the base station of base station statistics is received；

Determine that the minimum transmission rate requirements of each user and bigger base station priorities are higher；

According to the sequence of each base station priorities from high to low, the time point of resource allocation is carried out for each base station distribution, So that the time point that the higher base station of priority carries out resource allocation is more early；

Send the time point information at the time point for indicating that the base station carries out resource allocation respectively to each base station.

The embodiment of the invention provides a kind of base stations, comprising:

Iteration module, for using tabu search algorithm, to what is constituted for the MCS for being resident each user distribution of the base station MCS numerical value set is iterated, until meeting default iteration termination condition；And for each MCS number used in each iteration Value set, according to the minimum transmission rate requirements of the MCS numerical value set and each user, the determining and MCS numerical value set pair Answer be each user distribution subchannel, and based on corresponding with the MCS numerical value set for each user's distribution Subchannel determines that the data of the base station transmit total rate；

MCS determining module, for determining MCS numerical value set, wherein corresponding for institute based on determining MCS numerical value set The subchannel of each user's distribution is stated, the data for the base station determined transmit total rate highest；

Resource distribution module, for being to be resident the base station according to the MCS numerical value set characterization determined for the base station The MCS of each user's distribution, and corresponding with determining MCS numerical value set is the subchannel for being resident each user distribution of the base station Resource is distributed to be resident each user of the base station.

The embodiment of the invention provides a kind of network elements, comprising:

Receiving module receives the minimum transmission of each user for being resident the base station of base station statistics for being directed to each base station The sum of rate requirement；

Determining module, for determining that the minimum transmission rate requirements of each user and bigger base station priorities are higher；

Distribution module carries out resource for the sequence according to each base station priorities from high to low for each base station distribution The time point of distribution, so that the time point that the higher base station of priority carries out resource allocation is more early；

Sending module, for sending the time at the time point for indicating that the base station carries out resource allocation respectively to each base station Point information.

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

A kind of resource allocation methods, base station and related network elements provided in an embodiment of the present invention, comprising: base station is searched using taboo Rope algorithm is iterated the MCS numerical value set constituted for the MCS for being resident each user distribution of the base station, default until meeting Iteration termination condition；And for each MCS numerical value set used in each iteration, according to the MCS numerical value set and each user Minimum transmission rate requirements determine the subchannel for each user distribution corresponding with the MCS numerical value set, and are based on and this The corresponding subchannel for each user distribution of MCS numerical value set determines that the data of the base station transmit total rate；Determine MCS set of values It closes, wherein based on the corresponding subchannel for each user distribution of determining MCS numerical value set, the data for the base station determined Transmit total rate highest；It is to be resident each user of the base station to distribute according to the MCS numerical value set characterization determined for the base station MCS, and the subchannel to be resident each user distribution of the base station corresponding with determining MCS numerical value set is to be resident the base station Each user distribute resource.Resource allocation methods provided in an embodiment of the present invention, using tabu search algorithm, to be resident base station The MCS numerical value set that constitutes of MCS of each user distribution be iterated, obtain so that the data of base station to transmit total rate highest MCS numerical value set will not be higher than the MCS that user needs to get to the MCS method of salary distribution for being suitble to each user for user's distribution, and It determines subchannel distribution mode corresponding with the MCS method of salary distribution, also ensures that the subchannel distribution power according to distribution, Without distributing identical power for each resource block, be not only able to meet user rate demand again can be promoted sub-channel resource with The utilization rate of power resource, compared with using AMC mechanism to carry out resource allocation in the prior art, more rationally.

Detailed description of the invention

Fig. 1 is a kind of resource allocation methods provided in an embodiment of the present invention, the flow chart applied to base station side；

Fig. 2 is a kind of resource allocation methods provided in an embodiment of the present invention, the flow chart applied to default network element side network element；

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

Fig. 4 is the method flow diagram provided in an embodiment of the present invention that MCS numerical value set is determined using tabu search algorithm；

Fig. 5 is the method stream provided in an embodiment of the present invention for being determined as the corresponding distribution subchannel of user using Hungary Algorithm Cheng Tu；

Fig. 6 is the system architecture schematic diagram of default network element and each base station provided in an embodiment of the present invention；

Fig. 7 is a kind of structural schematic diagram of base station provided in an embodiment of the present invention；

Fig. 8 is a kind of structural schematic diagram of network element provided in an embodiment of the present invention.

Specific embodiment

The embodiment of the invention provides a kind of resource allocation methods, base station and related network elements, below in conjunction with Figure of description Preferred embodiment of the present invention will be described, it should be understood that preferred embodiment described herein is only used for describing and explaining The present invention is not intended to limit the present invention.And in the absence of conflict, the spy in the embodiment and embodiment in the application Sign can be combined with each other.

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

S101, base station use tabu search algorithm, to the MCS number constituted for the MCS for being resident each user distribution of the base station Value set is iterated, until meeting default iteration termination condition.

S102, for each MCS numerical value set used in each iteration, most according to the MCS numerical value set and each user Low transmission rate demand determines the subchannel for each user distribution corresponding with the MCS numerical value set, and is based on and the MCS The corresponding subchannel for each user distribution of numerical value set determines that the data of the base station transmit total rate.

S103, MCS numerical value set is determined, wherein based on the corresponding son for each user distribution of determining MCS numerical value set The data of channel, the base station determined transmit total rate highest.

It S104, according to the MCS numerical value set characterization determined for the base station is to be resident each user of the base station to distribute MCS, and the subchannel to be resident each user distribution of the base station corresponding with determining MCS numerical value set is to be resident the base station Each user distribute resource.

Further, a kind of resource allocation methods provided in an embodiment of the present invention are that the angle a base station is write It writes, when specific implementation can be applied in multiple base stations.

The embodiment of the present invention provides a kind of resource allocation methods, is applied to default network element side network element, as shown in Figure 2, comprising:

S201, it is directed to each base station, receives the minimum transmission rate requirements of each user for being resident the base station of base station statistics Sum.

S202, determine that the minimum transmission rate requirements of each user and bigger base station priorities are higher.

S203, the sequence according to each base station priorities from high to low carry out the time point of resource allocation for the distribution of each base station, So that the time point that the higher base station of priority carries out resource allocation is more early.

S204, the time point information for sending the time point for indicating that the base station carries out resource allocation respectively to each base station.

With reference to the accompanying drawing, method provided by the invention and relevant device are described in detail with specific embodiment.

Embodiment 1:

In the embodiment of the present invention 1, a kind of resource allocation methods are provided, are applied to base station side, as shown in figure 3, specifically including Following steps:

S301, base station are determined as the MCS set of values that the MCS for each user distribution that initial sets are resident base station is constituted It closes.

Further, in this step, it is determined as the MCS numerical value set of initial sets, the MCS numerical value set is by being resident The corresponding ident value of MCS of each user distribution of the base station is constituted.The MCS numerical value set as initial sets can be by pre- If method of determination determines, such as: the random MCS number determined or constitute the corresponding ident value of the currently used MCS of each user Value set is determined as initial sets etc..

Using tabu search algorithm, it is iterated in the way of described in S302~S317:

S302, rule is determined according to initial sets and default neighborhood, being determined as neighborhood is be resident the base station each The MCS numerical value set that the MCS of user's distribution is constituted.

Tabu search algorithm has used for reference the intelligence thinking characteristic of the mankind, avoids detour search to constitute as far as possible using taboo strategy Tabu search algorithm.In tabu search algorithm, the solution of problem is indicated with the form of mathematics, and construct objective function and Neighborhood, objective function are used to measure the excellent situation of every group of solution in each iteration, and neighborhood is by the neighbour that currently solves and pass through definition All set being deconstructed into that domain movement can reach.Algorithm allows for receiving inferior solution, that is, iteration obtains each time Solution is not better than original solution necessarily, once receiving inferior solution, iteration may fall into circulation, and search follows in order to prevent Ring can also construct taboo list, can be using the value of the movement of neighborhood or objective function as taboo object, by newly received one A little movements are placed in taboo list, are forbidden in later iteration.Preferable solution i.e. only not in taboo list (may be than working as Preceding guards escorting prisoners) initial solution as next iteration could be received.With iterations going on, taboo list is constantly updated, by certain After the number of iterations, just lifts a ban step back from taboo list into the movement of taboo list earliest.The selection used in tabu search algorithm Strategy, it is ensured that tabu search algorithm has the ability for jumping out locally optimal solution, currently solves each step and is always moved to neighborhood In the optimal solution do not avoided.Special pardon criterion can also be set in tabu search algorithm, and the solution for meeting special pardon criterion can not be by The limitation of taboo list.

Fig. 4 is the flow chart of tabu search algorithm.As shown in figure 4, mainly executing following steps during TABU search:

S401, determine that algorithm initial solution, setting initial solution are current optimum solution, setting taboo list is sky.

S402, judge whether iteration meets default iteration termination condition, if satisfied, then terminating to search for, export optimal solution；It is no Then, S403 is entered step.

S403, neighborhood solution is generated based on current optimum solution, and determines candidate solution from the neighborhood solution of generation.

S404, judge whether to meet default special pardon criterion, if satisfied, then entering step S405；Otherwise, it enters step S406。

S405, the solution for meeting default special pardon criterion is determined as currently solving, the corresponding object replacement write-in earliest of the solution is prohibited Avoid the object of table, updates optimal solution.Enter step S402.

S406, candidate solution taboo attribute is judged, using the corresponding optimum solution of non-taboo object as current optimum solution, is made The object of write-in taboo list earliest is replaced with the object.Enter step S402.

The embodiment of the present invention uses tabu search algorithm, the ident value of the MCS of K user of resident base station can be constituted Solution of the MCS numerical value set S as tabu search algorithm problem.The MCS number that the ident value of the MCS of K user is constituted first Value set S as K dimension, such as: S=[1,2,3,13,5...] be expressed as user 1 distribution MCS ident value be 1, for The ident value for the MCS that family 4 is distributed is 13.Objective function can be set are as follows: f (S), as each user select different MCS numerical value Different target values can be corresponded to when set, objective function is calculated as presetting sub in the case where the MCS of each user configuration determines The data of channel and the base station under power distribution mode transmit total rate.Wherein, presetting subchannel and power distribution mode can be with Under the premise of meeting each subchannel lowest data transmission rate of user, the smallest subchannel of consumption power and power distribution side Formula.

Further, initial sets, that is, tabu search algorithm initial solution S₀, maximum order MCS can be chosen for each user Configuration, neighborhood movement can be defined as currently solve one displacement and move, such as: assuming that it is S=[1,1,1] that K=3, which is currently solved, then, The neighborhood currently solved can be constant for other two user configuration modes, only becomes the modulation system of a user, then obtain Neighborhood may include:

[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 limited, such as: the number of neighborhood is indicated by F=(M-1) × K, wherein M indicates that the present invention is real The MCS mode sum for including in system applied by example is applied, after neighborhood is all found out, Neighborhood Number can also be further reduced Amount, such as: it randomly selectsA neighborhood solution is iterated candidate solution as candidate solution.Taboo length Degree can be set to L=0.6L_n, iteration maximum times iter_max=i, wherein i can be configured according to actual needs.

S303, in the secondary iteration respectively as initial sets and the MCS numerical value set of neighborhood, for each use Each user in family, according to the use in the sub-carrier number of every sub-channels, symbolic number, duration and the MCS numerical value set The efficiency of the corresponding MCS in family determines the user in the message transmission rate of every sub-channels.

Further, in this step, for each iteration, to the MCS numerical value in the secondary iteration respectively as initial sets Set, and as the MCS numerical value set of neighborhood, determine each user of each MCS numerical value set in every sub-channels respectively Message transmission rate.

Further, for the same user, the subchannel being assigned to is needed using same MCS mode, selection Different MCS modes will affect the data rate of user, then, any user k is at any MCS modulation system m, in any son Transmission rate R on channel n_k,n,mIt can be determined by formula (1):

Formula (1)

In formula (1), SC_ofdmAnd SY_ofdmRespectively indicate the sub-carrier number and symbolic number of subchannel n, T_slotIndicate subchannel n Duration, eff_m(bits/symbol) efficiency of selection MCS modulation system m, k ∈ [1, K], m ∈ [1, M], n ∈ are indicated [1,N]；M characterizes maximum value in the value of statistical indicant of all MCS modes；N characterizes maximum subchannel number in all subchannel numbers；

The corresponding ident value of every kind of MCS and modulation system (Modulation), code rate (Code Rate), Signal to Interference plus Noise Ratio door Limit (SINR threshold, Signal and Interference to Noise Ratio threshold [dB]) and The corresponding relationship of efficiency (Efficiency) is as shown in table 1:

Table 1

S304, according in S303 determine the user in the message transmission rate of every sub-channels and the minimum biography of the user Defeated rate requirement determines the subchannel number that the user needs.

Further, each user is there are minimum transmission rate requirements, and in this step, all subchannels are distributed in base station Resource meets the minimum speed limit demand of user, it is assumed that any user k's is minimum to downlink user by minimum power first Rate requirement is R_min(k), and user MCS is R_k,m, it is possible to determine the subchannel number n (k) that user needs by formula (2):

Formula (2)

In formula (2), R_k,mIt can be determined by formula (1).

S305, minimum SINR, user according to needed for the corresponding MCS of the user in the MCS numerical value set are in every height The interference being subject on channel and the base station determine the minimum hair of the user on each of the sub-channels to the channel gain of the user Penetrate power.

Further, as shown in Table 1, every kind of MCS mode has corresponding SINR thresholding, then, user k is in subchannel n On SINR γ_k,nIt can be determined by formula (3):

Formula (3)

In formula (4),Indicate the power that base station b emits on subchannel n to user k；G_b,kIndicate base station b to user k Channel gain；I_k,nIndicate itself that user k receives interference of the base station on channel n except resident base station；σ²Expression is made an uproar Acoustical power.

For different users, different modulation systems is distributed, different subchannels, the power for needing to distribute is also different, So influence power is user's modulation system and subchannel.So, user k using subchannel n and meets distributed MCS The lowest power of corresponding SINR threshold requirement can be determined by the formula (4) that formula (3) are derived by:

Formula (4)

In formula (4), γ_mUser k is in the case where distributing MCS mode m for expression, required lowest sinr values； It is calculated by user feedback channel state information and disturbed condition.

Further, step S305 and the no strict sequence of step S303~step S304 execution.

S306, according to the subchannel number of the corresponding needs of each user and the minimum hair in each subchannel respectively Power is penetrated, cost matrix is constructed,

Wherein, the row of cost matrix represents user, and the user more than one for subchannel number required in each user, The line number for the user that cost matrix includes is identical as subchannel number needed for the user；The column of cost matrix represent son letter Road, the element of cost matrix represent the element corresponding user that is expert at and correspond to the minimum transmitting function of subchannel in the element column Rate.

Further, for any one MCS numerical value set, that is to say, that for any side for distributing MCS for each user Formula is used under the premise of the mode of the MCS distributed for each user determines, and under the premise of meeting the minimum transmission rate of user Family sub-channel number tool has different needs, then can by by the subchannel distribution of base station to user and consumption general power Minimum problem, the problem of being converted to task assignment, so that the cost that everyone completes each required by task is different, and it is final The number of sub-channels that the task of distribution will make total cost minimum and each user needs is different, meet the needs of users and The subchannel finally distributed makes base station consumption general power minimum.

It is possible to further use Hungary Algorithm to solve the standard assignments problem being converted into.Subchannel can be with Being equivalent in assignment problem for task, user selects subchannel that can be equivalent to user and completes a certain task, and has corresponding Cost, that is, power.

Assuming that in the cost matrix of construction, each user Zhan Yihang, every sub-channels Zhan Yilie, the serial number of every row and user Ordinal number correspond, every a line indicates that user k uses the minimum power cost of all subchannels respectively, and cost matrix has K × N A element.The cost matrix so obtained are as follows:

Wherein, p (k, n) characterizes minimum transmission power of the user k on subchannel n.But often due to subchannel number More than user's number, resource allocation problem is converted to standard assignments problem, i.e., one " user " only selects " sub- a letter Road " needs to convert cost matrix, virtually can be multiple Virtual User by each user, Virtual User number is equal to should Subchannel number needed for user itself, each user, which fictionalizes the user come, has phase from each subchannel with the user Same Power penalty, the cost matrix after conversion are as follows:

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

S307, judge whether the line number of the cost matrix constructed in S306 is less than columns, if so, entering step S308； Otherwise, S309 is entered step.

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

Further, when users all in step S306, which virtualize, to complete, if Virtual User number is less than number of subchannels, Increasing additional Virtual User makes Virtual User number be equal to number of subchannels, these additional users use the cost of all subchannels It can be set to zero, because they, which can get user, uses remaining channel.Cost matrix after converting is the side of a N × N Battle array, obtained N × N square matrix can be with are as follows:

Problem is converted to standard assignments problem at this time, and Hungary Algorithm can be used to solve.

S309, the subchannel for being determined as each user's distribution using Hungary Algorithm based on obtained cost matrix.

Further, due to being usually not in the case where line number of cost matrix is greater than columns, this step is to work as The line number of cost matrix is equal to the branch executed when columns.

Further, Fig. 5 is the method flow diagram for being determined as the corresponding distribution subchannel of user using Hungary Algorithm.Such as figure Shown in 5, it is determined as the process of the subchannel of each user's distribution using Hungary Algorithm based on obtained N × N cost matrix, It can be achieved by the steps of:

S3091: transformation cost matrix, so that each row in transformed cost matrix respectively arranges and 0 element occurs.

In this step, for every row element of cost matrix, the row element is made to subtract the smallest member of row element intermediate value Element, then for every column element of obtained new cost matrix, the column element is made to subtract the smallest element of column element intermediate value, if Certain row or existing 0 element of certain column, it is not necessary to subtract (there can be no negative elements) again.

S3092: carrying out examination appointment, to seek optimal solution.

In this step, by determining Independent 0 Elements as much as possible in the transformed cost matrix of step 1.By the 1st After step transformation, all existing 0 element of each row and column in cost matrix；But N number of independent 0 element need to be found out.If can find out, just with It is 1 that these Independent 0 Elements, which correspond to the element in dematrix, remaining is 0, obtains optimal solution.The step of determining Independent 0 Elements can be with It is as follows:

(1) since the row (column) of only one 0 element, this 0 element is given to add circle.This is indicated to use representated by this row Family, only a task can be assigned to the user.Then other 0 elements in the column (row) drawn a circle are scratched, indicate this column institute's generation The task of table has been assigned, it is not necessary to consider further that other users.

(2) add circle to 0 element of only-a 0 element column (row), 0 yuan of the element place row (column) then scratched plus enclosed Element.

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

(4) if there are still 0 elements that do not draw a circle, and with the neutral element of row (column) at least there are two, different sides can be used Case goes to sound out.Since remaining and having the least row (column) of 0 element, compare the number of 0 element in this 0 element column of row, alternative column In least 0 element of 0 element add circle, then cross out colleague same column other 0 elements.It is repeated, until all 0 elements all enclose Out or until crossing out.

S3093: judgement draw a circle 0 element number be equal to matrix dimension, if so, having obtained the optimal of assignment problem Solution；If the number for 0 element of drawing a circle is less than the dimension of matrix, enter S3094.

S3094: making least straight line and cover all 0 elements, and most independent zero can be found in the cost matrix to determine First prime number.

This step sequentially includes the following steps:

(1) check mark is beaten to the row that do not draw a circle；

(2) to thering are the column for crossing out neutral element to play check mark in the row for having played check mark；

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

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

(5) to without beating the row picture horizontal line checked the number, the column picture ordinate for check mark of fighting each other obtains covering the minimum of all 0 elements Straight line number.

S3095: new cost matrix is obtained by above-mentioned transformation.Not by straight line cover element in find out smallest element Element, and the least member is all subtracted to each element for not drawing linear rows, which is all added to each element for drawing alignment array, New matrix is obtained, into S3092.

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

S310, determination are not yet assigned at least one remaining subchannel of any user and total transmitting function of the base station The transmission power after the minimum transmission power for each subchannel for being already allocated to user is removed in rate.

Further, Hungary Algorithm is used to determine that the subchannel of distribution only meets user's for user in above-mentioned steps Minimum speed limit demand, the resource needed is less, so base station resource distribution often has the residue of subchannel and power.

S311, for each user in each user, according to the user respectively at least one remaining subchannel Message transmission rate and the user minimum transmission power at least one described remaining subchannel respectively, determine the use The family efficiency at least one described remaining subchannel respectively.

In this step, in order to sufficiently use remaining power resource, remaining power resource can be used and meet use The maximum rate at family, remaining subchannel n, which is given, makes the maximum user k of the subchannel efficiency, and user k uses the energy of channel n Imitate EE_k,nIt can be determined by formula (5):

Formula (5)

In formula (5), R_k,nFormula (1) can be passed through under the premise of the MCS of user k is certain and determine that P (k, n) can be in user It is determined under the premise of the MCS of k is certain by formula (4).

If at least one remaining subchannel is respectively allocated to have highest energy efficiency in the residue subchannel by S312, judgement User, if can by transmission power all distribute, if so, entering step S313；Otherwise, S314 is entered step.

S313, at least one remaining subchannel distribution is given to the user in the residue subchannel with highest energy efficiency.Into Enter step S315.

In this step, biggish rate can be obtained using limited power resource, until remaining sub-channel resource has been divided, or Person's dump power resource has been divided.

S314, at least one remaining subchannel is respectively allocated to have the maximum data transmission speed in the residue subchannel The user of rate, so that at least one remaining subchannel and transmission power are all distributed, alternatively,

At least one residue subchannel is respectively allocated to the user in the residue subchannel with highest energy efficiency, and At least one residue subchannel is respectively allocated to the user in the residue subchannel with the maximum data transmission rate, so that At least one remaining subchannel and the transmission power are all distributed.

Further, in this step, if only considering to distribute to remaining subchannel and dump power in corresponding remaining son There is the user of maximum efficiency all remaining subchannels and dump power can not be fully allocated on channel, then, it does not consider further that The maximum user of efficiency, because efficiency, which most very much not represents, obtains rate maximum.Remaining subchannel distribution can be made to remain at this Remaining subchannels transmitting data rate R_k,nMaximum user, or, it may be considered that by some residual subchannel and dump power point Dispensing has the user of maximum efficiency in corresponding remaining subchannel, and another part residue subchannel and dump power are distributed to Whether the user with peak transfer rate in corresponding subchannel, the method for salary distribution specifically used depend on this kind of method of salary distribution Remaining subchannel and dump power can be fully allocated.

S315, determine that the data of the base station pass based on the subchannel for each user distribution corresponding with the MCS numerical value set Defeated total rate.

Further, each with the MCS value corresponded in the MCS numerical value set per family, and distributed for the user Subchannel number, transmission rate of the user at the MCS can be determined using formula (1), and by each user of resident base station Transmission rate be added, obtain total rate of the base station.

S316, judge whether the secondary iteration meets default iteration termination condition, if not satisfied, then entering step S317；If Meet, then enters step S318.

Further, presetting iteration termination condition can be configured according to the actual situation, and iteration time usually can be set Number then stops iteration when the number of iterations reaches the number of iterations of setting for default iteration termination condition.

It S317, is corresponding to the subchannel of each user distribution by the total rate of highest for determining base station in the secondary iteration MCS numerical value set is updated to new initial vector, enters step S302.

Further, it in an iteration, needs to the corresponding MCS number of the initial sets and neighborhood of the secondary iteration Value set determines total rate of corresponding base station respectively, can be with if being unsatisfactory for default iteration termination condition after the secondary iteration It will make the highest MCS numerical value set of the total rate in base station in the secondary iteration, as the initial sets of next iteration, according to default neighbour Domain determines that rule determines the MCS numerical value set in next iteration as neighborhood, and carries out next iteration.

S318, MCS numerical value set is determined,

Wherein, based on determining MCS numerical value set it is corresponding for each user distribution subchannel, the base station determined Data transmit total rate highest.

Further, in this step, by the data for making base station transmit the total highest MCS numerical value set of rate be determined as with The MCS numerical value set of family distribution.

S319, the sum for being resident each user's lowest data transmission rate demand of base station is counted.

S320, the sum of each user's lowest data transmission rate demand of statistics is sent to default network element.

S321, the time point information that the instruction base station that default network element is sent carries out resource allocation is received.

S322, the time point characterized in the received time point information, according to the MCS numerical value collection table determined for base station Sign is the MCS for being resident each user distribution of the base station, and corresponding with determining MCS numerical value set is to be resident the base station The subchannel of each user's distribution is that each user of resident base station distributes resource.

Further, step S319~step S321 execution and step S301~step S318 are executed not stringent Sequencing.

Further, in step S319~step S322, due to can mutually generate interference, and this interference between base station It is the variation with adjacent base station distribution power and carrier wave and changes, in order to realize distributed resource allocation, makes list The environment of interference around when a base station carries out resource allocation is constant, can by default network element (such as: central processing mould Block (CPM, Central Processing Module)) it is that the base station that base station determines priority, and makes priority higher carries out The time point of resource allocation is more early, then, base station can according to itself priority (i.e. the time point of itself distribution resource) into The resource allocation of this cell of row, base stations different in this way have the time point of different carry out resource allocations, in time can be with It is staggered, base station carries out can consider that the disturbed condition of peripheral base station is constant when resource allocation.

Further, after the priority of base station determines, each base station independently carries out resource allocation, the phase of resource allocation Closing parameter can be such that

The sets of sub-channels N={ 1 ..., n ..., N } of base station, every sub-channels at most give a user；MCS set M={ 1 ..., m ..., M }, MCS and SINR thresholding relationship are shown in Table 1, and each user can only use a kind of MCS in a time slot； User collection be combined into K=1 ..., k ..., K }；The maximum transmission power of base station is P_max。

Fig. 6 is the system architecture schematic diagram of default network element (by taking CPM as an example) and each base station, as shown in fig. 6, can be common Increase a central processing module CPM on the basis of cellular network architecture, which is used to itself administered base station in collection network The service conditions about this base station of feedback.CPM determines that each base station independently carries out resource allocation according to the case where BTS service Priority level and time point.It can guarantee that each base station can be with the resource allocation operations of adjacent base station in resource allocation in this way It is staggered as far as possible, it is believed that the disturbed condition of adjacent base station is constant, to guarantee the validity of resource allocation.

After determining priority and operating time, CPM believes the time point of the carry out resource allocation determined for each base station Breath is sent respectively to respective base station, and each base station is individually allocated all sub-channel resources.Carry out subchannel and power The distribution to MCS is considered while co-allocation, base station meets the rate requirement of user first, then most using remaining resource Bigization system velocity.

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

If collection of base stations is Β={ 1 ..., b ..., B }, each base station b counts minimum speed limit demand feelings in respective cell The Minimum requirements amount of condition, entire cell is the adduction of all user's Minimum requirements rates in cell, and is denoted as R_min(b), base station b R is fed back to CPM_min(b), the case where CPM is according to all base station feedbacks, to all R_min(b),It is sorted in ascending order, according to sequence Priority, R are distributed for base station_min(b) maximum highest priority, the smallest priority are minimum.It is determined according to the sequence of priority Base station executes the time point of resource allocation, first execution of highest priority, the minimum last execution of priority, other base stations Sequence according to priority, which is analogized, executes time point.

Determine that base station executes the priority of resource allocation according to priority, it is ensured that when base station carries out resource allocation Surrounding disturbed condition is constant, and then is conducive to resource allocation, is additionally favorable for guaranteeing the rate requirement of user, for example, working as the rate of base station b When demand is higher, higher priority can guarantee that the user of resident base station b has better chance to obtain better channel And power distribution, so that more rate requirements are met.

Further, in the embodiment of the present invention, firstly, according to the resource point that the minimum speed limit conditions of demand of base station are base station Priority is distributed with operation, it is ensured that disturbed condition is constant around when the progress resource allocation of base station, and then conducive to resource point Match, is additionally favorable for guaranteeing the rate requirement of user；

Secondly, carrying out the rate of maximization network in conjunction with three MCS, subchannel distribution and power distribution dimensions.First it is fixed as The MCS of each user's distribution carries out channel and money as the basis of subchannel distribution and power distribution on the basis of MCS is determined The distribution in source.Each MCS grade that all users are configured using tabu search algorithm, it is quickly and quasi- until meeting the number of iterations Really make the MCS grade of whole network throughput-optimal for user configuration.

Again, after the MCS for determining each user, base station preferentially meets the rate need of user using the smallest power consumption It asks, guarantees that the general power of network consumption is minimum, since base station total transmission power is limited, this method can also allow base station simultaneously There are remaining more power to carry out maximization network rate.It is maximum that remaining sub-channel priority is given into the efficiency in the subchannel again User, if power resource still has residue, by the sub-distribution again of remaining subchannel, preferentially distribute to has maximum number in the subchannel According to the user of transmission rate.Not only operate rate maximization that is very easy, and can guaranteeing network.

Based on the same inventive concept, the embodiment of the invention also provides a kind of base station and related network elements, due to these base stations It is similar to a kind of aforementioned resource allocation methods with the principle of the solved problem of network element, therefore the implementation of the base station and network element can be joined See the implementation of preceding method, overlaps will not be repeated.

A kind of base station provided in an embodiment of the present invention, as shown in fig. 7, comprises following module:

Iteration module 701, for using tabu search algorithm, to the MCS structure to be resident each user distribution of the base station At MCS numerical value set be iterated, until meeting default iteration termination condition；And for each used in each iteration MCS numerical value set, according to the minimum transmission rate requirements of the MCS numerical value set and each user, the determining and MCS set of values The corresponding subchannel for each user's distribution is closed, and based on corresponding with the MCS numerical value set for each user point The subchannel matched determines that the data of the base station transmit total rate；

MCS determining module 702, for determining MCS numerical value set, wherein corresponding based on determining MCS numerical value set to be The subchannel of each user's distribution, the data for the base station determined transmit total rate highest；

Resource distribution module 703, for being to be resident the base station according to the MCS numerical value set characterization determined for the base station Each user distribution MCS, and it is corresponding with determining MCS numerical value set be resident the base station each user distribution son letter Road is each user distribution resource for being resident the base station.

Further, the iteration module 701 is be resident the base station each specifically for being determined as initial sets The MCS numerical value set that the MCS of user's distribution is constituted；Using tabu search algorithm, it is carried out as follows iteration: according to initial Set and default neighborhood determine rule, are determined as the MCS that the MCS that neighborhood is each user distribution for being resident the base station is constituted Numerical value set；For in the secondary iteration respectively as initial sets and the MCS numerical value set of neighborhood, according to the MCS set of values The minimum transmission rate requirements with each user are closed, determine that corresponding with the MCS numerical value set is each user's distribution Subchannel, and determine based on the subchannel for each user distribution corresponding with the MCS numerical value set number of the base station According to the total rate of transmission；Judge whether the secondary iteration meets default iteration termination condition, if not satisfied, will then determine the secondary iteration Described in the maximum data of base station transmit MCS numerical value set corresponding to the subchannel that total rate is each user distribution more It is newly new initial vector, into next iteration；If satisfied, then terminating iteration.

Further, the iteration module 701, specifically for each user being directed in each user, according to each The sub-carrier number of subchannel, symbolic number, the efficiency of duration MCS corresponding with the user in the MCS numerical value set determine Message transmission rate of the user in every sub-channels；Message transmission rate and the user according to the user in every sub-channels Minimum transmission rate requirements, determine the user need subchannel number；It is corresponding according to the user in the MCS numerical value set Interference that minimum SINR, the user needed for MCS are subject on each of the sub-channels and the base station to the user channel gain, Determine the minimum transmission power of the user on each of the sub-channels；According to the subchannel of the corresponding needs of each user Number and the respectively minimum transmission power in each subchannel construct cost matrix, wherein the row of the cost matrix, which represents, to be used Family, and the user more than one for required subchannel number in each user, the user that the cost matrix includes Line number is identical as subchannel number needed for the user；The column of the cost matrix represent subchannel, the member of the cost matrix Element represents the element corresponding user that is expert at and corresponds to the minimum transmission power of subchannel in the element column；Judge the cost Whether the line number of matrix is less than columns；If so, in the cost matrix increase full 0 exercise the cost matrix row Number is equal to columns；It is determined as the subchannel of each user's distribution using Hungary Algorithm based on obtained cost matrix；Otherwise, It is determined as the subchannel of each user's distribution using Hungary Algorithm based on cost matrix.

Further, the iteration module 701 is also used to be determined as each user's distribution using Hungary Algorithm After subchannel, determines and be not yet assigned at least one remaining subchannel of any user and total transmission power of the base station Transmission power after the middle minimum transmission power for removing each subchannel for being already allocated to user；For each user In each user, according to the user message transmission rate at least one remaining subchannel and the user respectively Minimum transmission power at least one described remaining subchannel respectively determines the user respectively at least one described residue Efficiency in subchannel；If at least one described remaining subchannel is respectively allocated to have most in the residue subchannel by judgement The user of high energy efficiency, if the transmission power can all be distributed, if so, will at least one described remaining son letter Distribute to the user in the residue subchannel with highest energy efficiency in road；It otherwise, will at least one described remaining subchannel difference Distribute to the user in the residue subchannel with the maximum data transmission rate so that at least one described remaining subchannel and The transmission power is all distributed, alternatively, at least one described remaining subchannel is respectively allocated to believe in residue There is the user of highest energy efficiency on road, and at least one described remaining subchannel is respectively allocated in the residue subchannel User with the maximum data transmission rate, so that at least one described remaining subchannel and the transmission power are all divided Match.

Further, the base station, further includes: statistical module 704, sending module 705 and receiving module 706；

The statistical module 704, for counting resident described before each user to be resident the base station distributes resource The sum of the minimum transmission rate requirements of each user of base station；

The sending module 705, for the sum of each user's lowest data transmission rate demand of statistics to be sent to Default network element；

The receiving module 706 carries out the time of resource allocation for receiving the instruction base station that default network element is sent Point information；

The resource distribution module 703, specifically for the time point in received time point information characterization, according to for The MCS numerical value set characterization that the base station determines be the MCS being resident each user of the base station and distributing, and with determining MCS The corresponding subchannel to be resident each user distribution of the base station of numerical value set is to be resident each user distribution resource of the base station.

A kind of network element provided in an embodiment of the present invention, as shown in figure 8, including following module:

Receiving module 801 receives the minimum biography of each user for being resident the base station of base station statistics for being directed to each base station The sum of defeated rate requirement；

Determining module 802, for determining that the minimum transmission rate requirements of each user and bigger base station priorities are higher；

Distribution module 803 is provided for the sequence according to each base station priorities from high to low for each base station distribution The time point of source distribution, so that the time point that the higher base station of priority carries out resource allocation is more early；

Sending module 804, for sending to each base station the time point for indicating that the base station carries out resource allocation respectively Time point information.

The function of above-mentioned each unit can correspond to the respective handling step in process shown in Fig. 1 to Fig. 4, no longer superfluous herein It states.

Through the above description of the embodiments, those skilled in the art can be understood that the embodiment of the present invention The mode of necessary general hardware platform can also be added to realize by software by hardware realization.Based on such reason Solution, the technical solution of the embodiment of the present invention can be embodied in the form of software products, which can store one In a non-volatile memory medium (can be CD-ROM, USB flash disk, mobile hard disk etc.), including some instructions are used so that a meter It calculates machine equipment (can be personal computer, server or the network equipment etc.) and executes side described in each embodiment of the present invention Method.

It will be appreciated by those skilled in the art that attached drawing is the schematic diagram of a preferred embodiment, module or stream in attached drawing Journey is not necessarily implemented necessary to the present invention.

It will be appreciated by those skilled in the art that the module in device in embodiment can describe be divided according to embodiment It is distributed in the device of embodiment, corresponding change can also be carried out and be located in one or more devices different from the present embodiment.On The module for stating embodiment can be merged into a module, can also be further split into multiple submodule.

The serial number of the above embodiments of the invention is only for description, does not represent the advantages or disadvantages of the embodiments.

Obviously, various changes and modifications can be made to the invention without departing from essence of the invention by those skilled in the art Mind and range.In this way, if these modifications and changes of the present invention belongs to the range of the claims in the present invention and its equivalent technologies Within, then the present invention is also intended to include these modifications and variations.

Claims

1. a kind of resource allocation methods characterized by comprising

Base station uses tabu search algorithm, to what is constituted for the modulating-coding strategy MCS for being resident each user distribution of the base station MCS numerical value set is iterated, until meeting default iteration termination condition；And

For each MCS numerical value set used in each iteration, according to the minimum transmission of the MCS numerical value set and each user Rate requirement determines the subchannel for each user's distribution corresponding with the MCS numerical value set, and is based on and the MCS number The corresponding subchannel for each user's distribution of value set determines that the data of the base station transmit total rate；

Determine MCS numerical value set, wherein based on the corresponding subchannel for each user distribution of determining MCS numerical value set, The data for the base station determined transmit total rate highest；

It is the MCS, Yi Jiyu for being resident each user distribution of the base station according to the MCS numerical value set characterization determined for the base station The corresponding subchannel to be resident each user distribution of the base station of determining MCS numerical value set is to be resident each user of the base station Distribute resource.

2. the method as described in claim 1, which is characterized in that base station uses tabu search algorithm, to be resident the base station The MCS numerical value set that constitutes of MCS of each user distribution be iterated, until meeting default iteration termination condition；And for every Each MCS numerical value set used in secondary iteration, according to the minimum transmission rate requirements of the MCS numerical value set and each user, It determines the subchannel for each user's distribution corresponding with the MCS numerical value set, specifically includes:

It is determined as the MCS numerical value set that the MCS that initial sets are each user distribution for being resident the base station is constituted；

Using tabu search algorithm, it is carried out as follows iteration:

Rule is determined according to initial sets and default neighborhood, and being determined as neighborhood is to be resident each user of the base station to distribute The MCS numerical value set that MCS is constituted；For in the secondary iteration respectively as initial sets and the MCS numerical value set of neighborhood, according to The minimum transmission rate requirements of the MCS numerical value set and each user determine that corresponding with the MCS numerical value set is described each The subchannel of user's distribution, and institute is determined based on the subchannel for each user's distribution corresponding with the MCS numerical value set The data for stating base station transmit total rate；Judge whether the secondary iteration meets default iteration termination condition, if not satisfied, will then determine The maximum data of base station described in the secondary iteration transmits MCS corresponding to the subchannel that total rate is each user's distribution out Numerical value set is updated to new initial vector, into next iteration；If satisfied, then terminating iteration.

3. method according to claim 1 or 2, which is characterized in that according to the minimum of the MCS numerical value set and each user Transmission rate requirements determine the subchannel for each user's distribution corresponding with the MCS numerical value set, specifically include:

For each user in each user, according to the sub-carrier number of every sub-channels, symbolic number, duration and it is somebody's turn to do The efficiency of the corresponding MCS of the user in MCS numerical value set, determines the user in the message transmission rate of every sub-channels；

According to the user in the message transmission rate of every sub-channels and the minimum transmission rate requirements of the user, the user is determined The subchannel number needed；

Believed according to minimum Signal to Interference plus Noise Ratio SINR needed for the corresponding MCS of the user in the MCS numerical value set, the user in every height The interference being subject on road and the base station determine the minimum transmitting of the user on each of the sub-channels to the channel gain of the user Power；

According to the subchannel number of the corresponding needs of each user and the minimum transmitting function in each subchannel respectively Rate constructs cost matrix,

Wherein, the row of the cost matrix represents user, and more than one for required subchannel number in each user User, the line number for the user that the cost matrix includes are identical as subchannel number needed for the user；The cost matrix Column represent subchannel, the element of the cost matrix represents the element and is expert at corresponding user in the corresponding son of the element column The minimum transmission power of channel；

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

If so, in the cost matrix increase full 0 exercise the cost matrix line number be equal to columns；Based on obtaining Cost matrix be determined as the subchannel of each user distribution using Hungary Algorithm；

Otherwise, it is determined as the subchannel of each user's distribution using Hungary Algorithm based on cost matrix.

4. method as claimed in claim 3, which is characterized in that be determined as each user's distribution using Hungary Algorithm After subchannel, further includes:

It determines to be not yet assigned at least one remaining subchannel of any user and total transmission power of the base station and remove Transmission power after the minimum transmission power of the allocated each subchannel to user；

For each user in each user, passed respectively in the data of at least one remaining subchannel according to the user Defeated rate and the user minimum transmission power at least one described remaining subchannel respectively, determine that the user distinguishes Efficiency at least one described remaining subchannel；

If at least one described remaining subchannel is respectively allocated to the use in the residue subchannel with highest energy efficiency by judgement Family, if the transmission power can all be distributed, if so, at least one described remaining subchannel distribution is given With the user of highest energy efficiency in the residue subchannel；

Otherwise, at least one described remaining subchannel is respectively allocated to have the maximum data transmission speed in the residue subchannel The user of rate, so that at least one described remaining subchannel and the transmission power are all distributed, alternatively,

At least one described remaining subchannel is respectively allocated to the user in the residue subchannel with highest energy efficiency, and At least one described remaining subchannel is respectively allocated to the user in the residue subchannel with the maximum data transmission rate, So that at least one described remaining subchannel and the transmission power are all distributed.

5. the method as described in claim 1, which is characterized in that before each user to be resident the base station distributes resource, Further include:

Statistics is resident the sum of the minimum transmission rate requirements of each user of the base station；

The sum of each user's lowest data transmission rate demand of statistics is sent to default network element；

Receive the time point information that the instruction base station that default network element is sent carries out resource allocation；

It is the MCS, Yi Jiyu for being resident each user distribution of the base station according to the MCS numerical value set characterization determined for the base station The corresponding subchannel to be resident each user distribution of the base station of determining MCS numerical value set is to be resident each user of the base station Resource is distributed, is specifically included:

At the time point of the received time point information characterization, according to the MCS numerical value set characterization determined for the base station To be resident the MCS that each user of the base station distributes, and each use to be resident the base station corresponding with determining MCS numerical value set The subchannel of family distribution is to be resident each user distribution resource of the base station.

6. a kind of resource allocation methods characterized by comprising

The time point information at the time point for indicating that the base station carries out resource allocation is sent respectively to each base station, so that described every A base station uses tabu search algorithm, to the MCS constituted for the modulating-coding strategy MCS for being resident each user distribution of the base station Numerical value set is iterated, until meeting default iteration termination condition；And for each MCS set of values used in each iteration It closes, according to the minimum transmission rate requirements of the MCS numerical value set and each user, determination is corresponding with the MCS numerical value set For the subchannel of each user distribution, and based on the son letter for each user's distribution corresponding with the MCS numerical value set Road determines that the data of the base station transmit total rate；Determine MCS numerical value set, wherein corresponding based on determining MCS numerical value set It is the subchannel of each user's distribution, the data for the base station determined transmit total rate highest；According to for the base The MCS numerical value set characterization for standing determining be the MCS being resident each user of the base station and distributing, and with determining MCS set of values Closing the corresponding subchannel to be resident each user distribution of the base station is to be resident each user distribution resource of the base station.

7. a kind of base station characterized by comprising

Iteration module, for using tabu search algorithm, to the modulation and coding plan to be resident each user distribution of the base station The MCS numerical value set that slightly MCS is constituted is iterated, until meeting default iteration termination condition；And for making in each iteration Each MCS numerical value set, according to the minimum transmission rate requirements of the MCS numerical value set and each user, the determining and MCS The corresponding subchannel for each user's distribution of numerical value set, and be based on corresponding with the MCS numerical value set being described each The subchannel of user's distribution determines that the data of the base station transmit total rate；

MCS determining module, for determining MCS numerical value set, wherein corresponding based on determining MCS numerical value set is described each The data of the subchannel of user's distribution, the base station determined transmit total rate highest；

Resource distribution module, for being each use for being resident the base station according to the MCS numerical value set characterization determined for the base station Family distribution MCS, and it is corresponding with determining MCS numerical value set be resident the base station each user distribution subchannel be in Each user of the base station is stayed to distribute resource.

8. base station as claimed in claim 7, which is characterized in that the iteration module, specifically for being determined as initial sets It is the MCS numerical value set that the MCS for each user distribution for being resident the base station is constituted；Using tabu search algorithm, according to as follows Mode is iterated: determining rule according to initial sets and default neighborhood, being determined as neighborhood is be resident the base station each The MCS numerical value set that the MCS of user's distribution is constituted；For in the secondary iteration respectively as initial sets and the MCS number of neighborhood Value set, according to the minimum transmission rate requirements of the MCS numerical value set and each user, the determining and MCS numerical value set pair Answer be each user distribution subchannel, and based on corresponding with the MCS numerical value set for each user's distribution Subchannel determines that the data of the base station transmit total rate；Judge whether the secondary iteration meets default iteration termination condition, if not Meet, then the maximum data for determining base station described in the secondary iteration is transmitted into the son that total rate is each user's distribution and believed MCS numerical value set corresponding to road is updated to new initial vector, into next iteration；If satisfied, then terminating iteration.

9. base station as claimed in claim 7 or 8, which is characterized in that the iteration module is specifically used for being directed to each user In each user, according to the user in the sub-carrier number of every sub-channels, symbolic number, duration and the MCS numerical value set The efficiency of corresponding MCS determines the user in the message transmission rate of every sub-channels；According to the user in every sub-channels The minimum transmission rate requirements of message transmission rate and the user determine the subchannel number that the user needs；According to the MCS number The interference and the base station that minimum SINR needed for the corresponding MCS of the user, the user are subject on each of the sub-channels in value set To the channel gain of the user, the minimum transmission power of the user on each of the sub-channels is determined；Distinguished according to each user The subchannel number of corresponding needs and the respectively minimum transmission power in each subchannel construct cost matrix, wherein institute The row for stating cost matrix represents user, and the user more than one for required subchannel number in each user, the generation The line number for the user that valence matrix includes is identical as subchannel number needed for the user；The column of the cost matrix represent son letter Road, the element of the cost matrix represent the element corresponding user that is expert at and correspond to the minimum hair of subchannel in the element column Penetrate power；Judge whether the line number of the cost matrix is less than columns；If so, increasing the row of full 0 in the cost matrix So that the line number of the cost matrix is equal to columns；Each use is determined as using Hungary Algorithm based on obtained cost matrix The subchannel of family distribution；Otherwise, it is determined as the subchannel of each user's distribution using Hungary Algorithm based on cost matrix.

10. base station as claimed in claim 9, which is characterized in that the iteration module is also used to true using Hungary Algorithm Be set to after the subchannel of each user distribution, determine at least one the remaining subchannel for being not yet assigned to any user and The remaining hair after the minimum transmission power for each subchannel for being already allocated to user is removed in total transmission power of the base station Penetrate power；For each user in each user, according to the user respectively in the number of at least one remaining subchannel According to transmission rate and the user minimum transmission power at least one described remaining subchannel respectively, the user is determined Efficiency at least one described remaining subchannel respectively；If at least one described remaining subchannel is respectively allocated to by judgement With the user of highest energy efficiency in the residue subchannel, if the transmission power can all be distributed, if so, By at least one described remaining subchannel distribution to the user in the residue subchannel with highest energy efficiency；It otherwise, will be described At least one remaining subchannel is respectively allocated to the user in the residue subchannel with the maximum data transmission rate, so that institute It states at least one remaining subchannel and the transmission power is all distributed, alternatively, will at least one described remaining subchannel It is respectively allocated to the user in the residue subchannel with highest energy efficiency, and will at least one described remaining subchannel difference Distribute to the user in the residue subchannel with the maximum data transmission rate so that at least one described remaining subchannel and The transmission power is all distributed.

11. base station as claimed in claim 7, which is characterized in that further include: statistical module, sending module and receiving module；

The statistical module, for before each user to be resident the base station distributes resource, statistics to be resident the base station The sum of each minimum transmission rate requirements of user；

The sending module, for the sum of each user's lowest data transmission rate demand of statistics to be sent to default net Member；

The receiving module carries out the time point information of resource allocation for receiving the instruction base station that default network element is sent；

The resource distribution module, specifically for the time point in received time point information characterization, according to for the base The MCS numerical value set characterization for standing determining be the MCS being resident each user of the base station and distributing, and with determining MCS set of values Closing the corresponding subchannel to be resident each user distribution of the base station is to be resident each user distribution resource of the base station.

12. a kind of network element characterized by comprising

Receiving module receives the minimum transmission rate of each user for being resident the base station of base station statistics for being directed to each base station The sum of demand；

Distribution module carries out resource allocation for the sequence according to each base station priorities from high to low for each base station distribution Time point so that the time point that the higher base station of priority carries out resource allocation is more early；

Sending module, for sending the time point letter at the time point for indicating that the base station carries out resource allocation respectively to each base station Breath, so that each base station uses tabu search algorithm, to the modulating-coding plan to be resident each user distribution of the base station The MCS numerical value set that slightly MCS is constituted is iterated, until meeting default iteration termination condition；And it is directed in each iteration and uses Each MCS numerical value set, it is determining with the MCS number according to the minimum transmission rate requirements of the MCS numerical value set and each user The corresponding subchannel for each user's distribution of value set, and based on corresponding with the MCS numerical value set for each use The subchannel of family distribution determines that the data of the base station transmit total rate；Determine MCS numerical value set, wherein based on determining MCS The corresponding subchannel for each user's distribution of numerical value set, the data for the base station determined transmit total rate highest； According to for the base station determine MCS numerical value set characterization be resident the base station each user distribution MCS, and with determination MCS numerical value set it is corresponding be resident the base station each user distribution subchannel be resident the base station each user distribution Resource.