CN103415078A - Dynamic resource distributing method using mobile terminal as relay in OFDMA system - Google Patents

Abstract

A dynamic resource distributing method using a mobile terminal as a relay in an OFDMA system comprises the following steps that the step 1, a base state can collect channel information of all scheduling links, and the rate of the links for sending data is calculated according to the information; 2, the base state can distribute resource blocks meeting the minimum requirements for the service quality to all link on the premise of guaranteeing the service quality of all mobile stations and guaranteeing that no caching data is left in the relay when a frame is finished; 3, the base station can round up the resource blocks distributed to all links to integers; 4, the base state can distribute remaining resource blocks to a link group with the maximum conversion rate; 5, the base station can adjust the resource blocks distributed to links in a first stage and links in a second stage and broadcasts information of the resource blocks distributed to all links. The dynamic resource distributing method using the mobile terminal as the relay reduces caching spending of relay nodes, effectively prevents data from being lost due to the mobility of the relay nodes, reduces networking complexity and reduces operation cost.

Description

In the OFDMA system, using the dynamic resource allocation method of mobile terminal as relaying

Technical field

What the present invention relates to is a kind of method of wireless communication technology field, specifically relates in a kind of OFDMA system usining the dynamic resource allocation method of mobile terminal as repeater.

Background technology

The LTE-Advanced(Long Term Evolution) in system, introduce the coverage that relaying (Relay) technology enlarges community, improved the throughput of Cell Edge User.At present, mainly using immobilizing foundation equipment as relay, increased like this systematic cost input, reduced the flexibility of networking.Yet the standard proposals that 3GPP is new have provided the network architecture of mobile terminal as relay.

Through the retrieval to the prior art document, find, Karthikeyan Sundaresan etc. are at " INFOCOM, 2012Proceedings IEEE, 25-30March2012, pp.1080-1088 " on delivered and be entitled as " Adaptive resource scheduling in wireless OFDMA relay networks " literary composition, this article has proposed the resource allocation methods under a kind of relay framework, and the method can adapt to the OFDMA frame structure dynamically; Separately through retrieval, find, Byung-Gook Kim etc. are at " IEEE TRANSACTIONS ON WIRELESS COMMUNICATION, VOL.11, NO.1, JANUARY2012 " on delivered and be entitled as " Opportunistic Resource Scheduling for OFDMA Networks with Network Coding at Relay Stations " literary composition, power and frequency spectrum resource combined distributing method under a kind of relay framework have been proposed.But when above two kinds of methods did not consider that the relay node is mobile terminal, relay data can bring extra buffer memory expense for node, and this expense may stop the mobile terminal of part of cache resource scarcity as the relay node.On the other hand, during as the relay node, the movement of relay node may cause there is no the data failure forwarded in time when mobile terminal, thus the waste frequency spectrum resource.

Summary of the invention

The present invention is directed to the deficiency on prior art, proposed in a kind of OFDMA system to using the dynamic resource allocation method of mobile terminal as relaying.Guaranteeing the QoS(Quality of Service service quality of mobile terminal) under prerequisite, via node is the data in forwarding cache in time, have reduced the buffer memory expense, have promoted spectrum efficiency.

To achieve these goals, the technical solution used in the present invention is as follows:

In the OFDMA system, using mobile terminal as the dynamic resource allocation method of relaying, have base station, repeater and travelling carriage said method comprising the steps of:

The first step, described base station is collected and is respectively participated in the information of schedule link and described repeater and described travelling carriage, and according to described collection information, calculates the transmission rate of each schedule link channel;

Second step, described base station, under the prerequisite of the service quality that ensures each travelling carriage, are the Resource Block that each link assignment minimum quality of service requires, and, after guaranteeing a frame end, in described repeater, do not have data cached in a frame;

The Resource Block that minimum quality of service requires that meets that the 3rd step, described base station will be distributed to each link rounds up, and, after guaranteeing a frame end, in described repeater, does not have data cached;

The 4th step, the link group of described base station selection conversion speed maximum, and the surplus resources piece in descending sub frame is distributed to the link group of converting the speed maximum;

The 5th step, total number of resource blocks that described base station statistics first stage link distributes, the number of resource blocks that the first stage is total is adjusted into the integral multiple of N, and the Resource Block information broadcasting that will distribute to each link is to all repeaters and travelling carriage in system.

It should be noted that, the transmission rate of described each link is respectively: base station to the transmission rate of the link of travelling carriage is

I ∈ [1, M]; Base station to the link transmission speed of repeater is

I ∈ [1, R]; Repeater to the link transmission speed of travelling carriage is

I ∈ [1, R], j ∈ [1, M (i)];

Wherein, R means the repeater number in system, and M means the travelling carriage number directly be connected with base station, and M (i) means the mobile number of units be connected with i repeater; The base station that i travelling carriage of i ∈ [1, M] expression is connected with base station is to travelling carriage link transmission speed;

The base station that i repeater of i ∈ [1, R] expression is connected with base station is to the repeatered line transmission rate;

I ∈ [1, R], the repeater that i repeater of j ∈ [1, M (i)] expression is connected with j travelling carriage is to travelling carriage link transmission speed.

It should be noted that, described second step comprises the following steps:

(1) described base station is according to the channel speed of each link, and the minimum speed limit requirement of each travelling carriage, for the Resource Block of base station to travelling carriage link and repeater to the minimum requirements of travelling carriage link assignment, wherein in a frame, a sub-channels and a time slot form a Resource Block; Be for base station to the Resource Block of travelling carriage link assignment:

I ∈ [1, M]; Be for repeater to the Resource Block of travelling carriage link assignment:

I ∈ [1, R], j ∈ [1, M (i)];

(2) described base station is by distributing to the Resource Block of each repeater to the travelling carriage link, and data cached in order to guarantee in described repeater, not have after a frame end, the Resource Block that calculation base station distributes to repeatered line; The Resource Block of distributing for each base station to repeatered line is:

$\frac{T\·\underset{j=1}{\overset{M\left(i\right)}{\mathrm{\Σ}}}{\mathrm{\γ}}_j}{V_{0,i}^1},$ i∈[1,R]；

Wherein, γ _iMean the minimum Mean Speed demand of described travelling carriage, T means the timeslot number in a frame.

It should be noted that, described the 3rd step comprises the following steps:

(1) after completing second step, base station to the Resource Block of travelling carriage link assignment is:

I ∈ [1, M]; The Resource Block that base station is distributed to repeatered line is:

I ∈ [1, R]; Repeater to the Resource Block of travelling carriage link is:

I ∈ [1, R], j ∈ [1, M (i)]; Respectively the Resource Block of link assignment corresponding to each travelling carriage is rounded up and show that base station to the Resource Block of travelling carriage link assignment is

I ∈ [1, M]; The Resource Block that base station is distributed to repeatered line is: I ∈ [1, R]; Repeater to the Resource Block of travelling carriage link is:

i∈[1,R]，j∈[1,M(i)]；

(2) guarantee that each is less than by the data volume that repeater and base station first stage link corresponding to connected travelling carriage can send the data volume that corresponding second stage link can send; The data volume that link corresponding to first stage sends is:

The data volume that the second stage link sends is:

I ∈ [1, R], j ∈ [1, M (i)].For

$\∀j\∈[1,M\left(i\right)],$ If Any processing that it goes without doing, otherwise the Resource Block of repeater to the travelling carriage link is adjusted into:

Wherein, the first stage link is base station and repeater or the base station link corresponding with travelling carriage, and the second stage link is the link that repeater is corresponding with travelling carriage,

That x is rounded up.

It should be noted that, described the 4th step comprises the following steps:

(1) the conversion speed of the link group that each travelling carriage is corresponding is calculated in described base station; When travelling carriage and base station direct-connected, its link group comprises a base station to the travelling carriage link, its conversion speed be the transmission rate of this base station to the travelling carriage link; When travelling carriage is connected with base station by repeater, link group comprises base station to repeatered line and repeater to the travelling carriage link, and conversion speed is: $\frac{V_{0,i}^1\·V_{i,j}^2}{V_{0,i}^1+V_{i,j}^2};$

Wherein,

For the link transmission speed of base station to repeater, i ∈ [1, R];

For the link transmission speed of repeater to travelling carriage, i ∈ [1, R], j ∈ [1, M (i)];

(2) the surplus resources piece in descending sub frame is calculated in described base station, and wherein the surplus resources piece in descending sub frame is that total Resource Block in descending sub frame deducts the Resource Block distributed, that is:

$N^{\′}=N\·T^{\′}-\underset{i=1}{\overset{M}{\mathrm{\Σ}}}{\mathrm{\λ}}_{0,i}^0-\underset{i=1}{\overset{R}{\mathrm{\Σ}}}{\mathrm{\λ}}_{0,i}^1-\underset{i=1}{\overset{R}{\mathrm{\Σ}}}\underset{j=1}{\overset{M\left(j\right)}{\mathrm{\Σ}}}{\mathrm{\λ}}_{i,j}^2;$

Wherein, N means the number of subchannels in a frame, and N' is the surplus resources piece, and T' means the timeslot number of descending sub frame;

(3) described base station, according to the conversion speed of above-mentioned each link group calculated, is found out the link group of conversion speed maximum, and the surplus resources piece is distributed to this link group; When the maximum rate link group be base station to the travelling carriage link, surplus resources piece N' is distributed to this link; When the maximum rate link group is base station to repeatered line and repeater to the travelling carriage link, by surplus resources piece N' these two links of pro rate by two link transmission speed; Base station to the Resource Block that repeater distributes is

Repeater to the Resource Block of mobile assignment is

Wherein, V ₁Mean in the maximum rate link group that base station is to the link rate of repeater, V ₂Mean in the maximum rate link group that repeater is to the link rate of travelling carriage,

Mean to round downwards.

It should be noted that, described the 5th step comprises the following steps:

(1) total number of resource blocks of first stage link assignment is obtained in described base station, and whether detect this number of resource blocks is the integral multiple of N; If be left intact; Otherwise, total number of resource blocks of first stage link is adjusted into

Wherein, K ₁Total number of resource blocks for the first stage distribution;

(2) find out the first stage link of the link group of conversion speed maximum, namely when the link group of conversion speed maximum be base station to the travelling carriage link, the first stage link is that base station is to the travelling carriage link; When the link group of converting the speed maximum is the link of base station to repeater to travelling carriage, the link of first stage is the link of base station to repeater, from the Resource Block that this link has distributed, deducting K ₁-K ' ₁Individual Resource Block;

(3) the Resource Block information broadcasting of the link that each travelling carriage is corresponding will be distributed to all travelling carriages and repeater in system in described base station.

Compared with prior art, beneficial effect of the present invention is: consider the scene of mobile terminal as via node, the OFDMA resource block assignments scheme of invention can not introduced extra buffer memory expense to via node, and has avoided because via node moves the wasting of resources caused.

The accompanying drawing explanation

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

Fig. 2 is the scene graph of embodiment;

Fig. 3 is the embodiment frame assumption diagram;

Fig. 4 is that possible structural representation is distributed in step 1 in the present invention～4.

Embodiment

Below in conjunction with accompanying drawing, embodiments of the invention are elaborated.The present embodiment is implemented take technical solution of the present invention under prerequisite, provided detailed execution mode and concrete operating process, but protection scope of the present invention is not limited to following embodiment.

Embodiment

As shown in Figure 2, the present embodiment is under double bounce OFDMA system, to using mobile terminal to participate in as relaying the Dynamic Resource Allocation for Multimedia that single cellular downlink of scheduling is carried out, native system comprises: R repeater (RS), i repeater (RS) has the individual travelling carriage of M (i) (MS) coupled, and M travelling carriage (MS) is connected with base station (BS).

As shown in Figure 3, wherein a frame is divided into descending sub frame (DL-Subframe) and sub-frame of uplink (UL-Subframe); Descending sub frame is divided into again two territories, and first territory is relay domain (Relay Zone), can only be sent out by base station in this territory; Second territory is input field (Access Zone), can only issue travelling carriage by repeater in this territory.N sub-carrier number arranged in one frame, and T time slot, have T' time slot in descending sub frame.

As shown in Figure 1, concrete steps of the present invention are as follows:

The first step, the information that respectively participates in schedule link and repeater and travelling carriage is collected in base station; The channel speed of each schedule link, according to these information of collecting, is calculated in base station, and the base station wherein obtained to the transmission rate of the link of travelling carriage is

I ∈ [1, M], base station to the link transmission speed of repeater is

I ∈ [1, R], repeater to the link transmission speed of travelling carriage is

I ∈ [1, R], j ∈ [1, M (i)].

Second step, base station, under the prerequisite of the service quality that ensures each travelling carriage, are the Resource Block that each link assignment minimum quality of service requires, and, after guaranteeing a frame end, in repeater, do not have data cached in a frame.

Concrete steps are:

1) base station is according to the channel speed of each link, and the minimum quality of service requirement of each travelling carriage, for base station, distribute the Resource Block (in a frame, a sub-channels and a time slot form a Resource Block) of minimum requirements to travelling carriage link and base station to repeatered line.Be for base station to the Resource Block of travelling carriage link assignment:

I ∈ [1, M]; Be for repeater to the Resource Block of travelling carriage link assignment:

I ∈ [1, R], j ∈ [1, M (i)].

2) base station is by distributing to the Resource Block of repeater to the travelling carriage link, and data cached in order to guarantee in repeater, not have after a frame end, the Resource Block that calculation base station distributes to repeatered line.The Resource Block of distributing for base station to repeatered line is:

I ∈ [1, R].

The Resource Block that minimum speed limit requires that meets that the 3rd step, base station will be distributed to each link rounds up, and, after guaranteeing a frame end, in repeater, does not have data cached.

Concrete steps are:

1) after second step, base station to the Resource Block of travelling carriage link assignment is:

I ∈ [1, M]; The Resource Block that base station is distributed to repeatered line is:

I ∈ [1, R]; Repeater to the Resource Block of travelling carriage link is:

I ∈ [1, R], j ∈ [1, M (i)].Respectively the Resource Block of link assignment corresponding to each travelling carriage rounded up.Rounding rear base station to the Resource Block of travelling carriage link assignment is

I ∈ [1, M]; The Resource Block that base station is distributed to repeatered line is: I ∈ [1, R]; Repeater to the Resource Block of travelling carriage link is:

I ∈ [1, R], j ∈ [1, M (i)].Wherein

That x is rounded up.

2) for after guaranteeing a frame end, in repeater, do not have data cachedly, need to guarantee that the data volume that first stage link that each travelling carriage be connected with BS by repeater is corresponding can send is less than the data volume that corresponding second stage link can send.The data volume that link corresponding to first stage can send is:

The data volume that the second stage link can send is: I ∈ [1, R], j ∈ [1, M (i)].For $\∀i\∈[1,R],$ $\∀j\∈[1,M\left(i\right)],$ If

Any processing that it goes without doing, otherwise the Resource Block of repeater to the travelling carriage link is adjusted into

The 4th step, base station are found out the link group of conversion speed maximum, and the surplus resources piece in downlink frame are distributed to the link group of conversion speed maximum.

Concrete steps are:

1) the conversion speed of the link group that each travelling carriage is corresponding is calculated in base station.If travelling carriage and base station are direct-connected, its link group comprises a base station to the travelling carriage link, and its conversion speed is the transmission rate of this base station to the travelling carriage link; If travelling carriage is connected with base station by repeater, link group comprises base station to repeatered line and repeater to the travelling carriage link, and conversion speed is $\frac{V_{0,i}^1\·V_{i,j}^2}{V_{0,i}^1+V_{i,j}^2}.$

2) the surplus resources piece in descending sub frame is calculated in base station, and wherein the surplus resources piece in descending sub frame is that total Resource Block in descending sub frame deducts the Resource Block distributed in the 3rd step.Surplus resources piece in the descending sub frame obtained is:

$N^{\′}=N\·T^{\′}-\underset{i=1}{\overset{M}{\mathrm{\Σ}}}{\mathrm{\λ}}_{0,i}^0-\underset{i=1}{\overset{R}{\mathrm{\Σ}}}{\mathrm{\λ}}_{0,i}^1-\underset{i=1}{\overset{R}{\mathrm{\Σ}}}\underset{j=1}{\overset{M\left(j\right)}{\mathrm{\Σ}}}{\mathrm{\λ}}_{i,j}^2.$

3) base station, according to the conversion speed of above-mentioned each link group calculated, is found out the link group of conversion speed maximum, and the surplus resources piece is distributed to this link group.If the maximum rate link group be base station to the travelling carriage link, surplus resources piece N' is distributed to this link; If the maximum rate link group is base station to repeatered line and repeater to the travelling carriage link, by surplus resources piece N' these two links of pro rate by two link transmission speed.Base station to the Resource Block that repeater distributes is

Repeater to the Resource Block of mobile assignment is

Wherein, V ₁Mean in the maximum rate link group that base station is to the link rate of repeater, V ₂Mean in the maximum rate link group that repeater is to the link rate of travelling carriage,

Mean to round downwards.

The 5th step, the allocative decision of step 1～4 may cause situation as shown in Figure 3.Yet, according in 3GPP based on the description of the relaying framework of OFDMA, the number of resource blocks that base station sends must be the integral multiple of N.Therefore, need to carry out following steps.

1) total number of resource blocks K of first stage distribution is obtained in base station ₁, whether detect this number of resource blocks is the integral multiple of N; If so, any processing that it goes without doing; If not, total number of resource blocks of first stage is adjusted into

2) choose the first stage link of the link group of conversion speed maximum, if namely the link group of conversion speed maximum be base station to the travelling carriage link, the first stage link is just that base station is to the travelling carriage link; If the link group of conversion speed maximum is the link of base station to repeater to travelling carriage, the link of first stage is the link of base station to repeater, from the Resource Block that this link has distributed, deducting K ₁-K ' ₁Individual Resource Block.

3) the Resource Block information broadcasting of the link that each travelling carriage is corresponding will be distributed to all travelling carriages and repeater in system in base station.

For a person skilled in the art, can make other various corresponding changes and distortion according to technical scheme described above and design, and these all changes and the distortion all should belong to the protection range of the claims in the present invention within.

Claims (6)

1.OFDMA in system, using mobile terminal as the dynamic resource allocation method of relaying, have base station, repeater and travelling carriage, is characterized in that, said method comprising the steps of:

The first step, described base station are collected each link that participates in scheduling and the information of described repeater and described travelling carriage, and according to described collection information, calculate the transmission rate of each schedule link channel;

Second step, described base station, under the prerequisite of the service quality that ensures each travelling carriage, is the Resource Block of each link assignment service quality minimum requirements, and, after guaranteeing a frame end, in described repeater, does not have data cached in a frame;

The Resource Block that meets the service quality minimum requirements that the 3rd step, described base station will be distributed to each link rounds up, and, after guaranteeing a frame end, in described repeater, does not have data cached;

The 4th step, the link group of described base station selection conversion speed maximum, and the surplus resources piece in descending sub frame is distributed to the link group of converting the speed maximum;

The 5th step, total number of resource blocks that described base station statistics first stage link distributes, the number of resource blocks that the first stage is total is adjusted into the integral multiple of N, and the Resource Block information broadcasting that will distribute to each link is to all repeaters and travelling carriage in system.

2. according to the dynamic resource allocation method described in claim 1, it is characterized in that, the transmission rate of described each link is respectively: base station to the transmission rate of the link of travelling carriage is

I ∈ [1, M]; Base station to the link transmission speed of repeater is

I ∈ [1, R]; Repeater to the link transmission speed of travelling carriage is

I ∈ [1, R], j ∈ [1, M (i)];

Wherein, R means the repeater number in system, and M means the travelling carriage number directly be connected with base station, and M (i) means the mobile number of units be connected with i repeater;

The base station that i travelling carriage of i ∈ [1, M] expression is connected with base station is to travelling carriage link transmission speed;

The base station that i repeater of i ∈ [1, R] expression is connected with base station is to the repeatered line transmission rate; I ∈ [1, R], the repeater that i repeater of j ∈ [1, M (i)] expression is connected with j travelling carriage is to travelling carriage link transmission speed.

3. according to the dynamic resource allocation method described in claim 1, it is characterized in that, described second step comprises the following steps:

(1) described base station is according to the channel speed of each link, and the minimum speed limit requirement of each travelling carriage, for the Resource Block of base station to travelling carriage link and repeater to the minimum requirements of travelling carriage link assignment, wherein in a frame, a sub-channels and a time slot form a Resource Block; Be for base station to the Resource Block of travelling carriage link assignment:

I ∈ [1, M]; Be for repeater to the Resource Block of travelling carriage link assignment:

I ∈ [1, R], j ∈ [1, M (i)];

(2) described base station is by distributing to the Resource Block of each repeater to the travelling carriage link, and data cached in order to guarantee in described repeater, not have after a frame end, the Resource Block that calculation base station distributes to repeatered line; The Resource Block of distributing for each base station to repeatered line is:

$\frac{T\·\underset{j=1}{\overset{M\left(i\right)}{\mathrm{\Σ}}}{\mathrm{\γ}}_j}{V_{0,i}^1},$ i∈[1,R]；

Wherein, γ _iMean the minimum Mean Speed demand of described travelling carriage, T means the timeslot number in a frame.

4. according to the dynamic resource allocation method described in claim 1, it is characterized in that, described the 3rd step comprises the following steps:

(1) after completing second step, base station to the Resource Block of travelling carriage link assignment is:

I ∈ [1, M]; The Resource Block that base station is distributed to repeatered line is: I ∈ [1, R]; Repeater to the Resource Block of travelling carriage link is:

I ∈ [1, R], j ∈ [1, M (i)]; Respectively the Resource Block of link assignment corresponding to each travelling carriage is rounded up and show that base station to the Resource Block of travelling carriage link assignment is

I ∈ [1, M]; The Resource Block that base station is distributed to repeatered line is:

I ∈ [1, R]; Repeater to the Resource Block of travelling carriage link is:

i∈[1,R]，j∈[1,M(i)]；

(2) guarantee that each is less than by the data volume that repeater and base station first stage link corresponding to connected travelling carriage can send the data volume that corresponding second stage link can send; The data volume that link corresponding to first stage sends is:

The data volume that the second stage link sends is:

I ∈ [1, R], j ∈ [1, M (i)].For

$\∀j\∈[1,M\left(i\right)],$ If Any processing that it goes without doing, otherwise the Resource Block of repeater to the travelling carriage link is adjusted into:

Wherein, the first stage link is base station and repeater or the base station link corresponding with travelling carriage, and the second stage link is the link that repeater is corresponding with travelling carriage,

That x is rounded up.

5. according to the dynamic resource allocation method described in claim 1, it is characterized in that, described the 4th step comprises the following steps:

(1) the conversion speed of the link group that each travelling carriage is corresponding is calculated in described base station; When travelling carriage and base station direct-connected, its link group comprises a base station to the travelling carriage link, its conversion speed be the transmission rate of this base station to the travelling carriage link; When travelling carriage is connected with base station by repeater, link group comprises base station to repeatered line and repeater to the travelling carriage link, and conversion speed is: $\frac{V_{0,i}^1\·V_{i,j}^2}{V_{0,i}^1+V_{i,j}^2};$

Wherein,

For the link transmission speed of base station to repeater, i ∈ [1, R];

For the link transmission speed of repeater to travelling carriage, i ∈ [1, R], j ∈ [1, M (i)];

(2) the surplus resources piece in descending sub frame is calculated in described base station, and wherein the surplus resources piece in descending sub frame is that total Resource Block in descending sub frame deducts the Resource Block distributed, that is:

$N^{\′}=N\·T^{\′}-\underset{i=1}{\overset{M}{\mathrm{\Σ}}}{\mathrm{\λ}}_{0,i}^0-\underset{i=1}{\overset{R}{\mathrm{\Σ}}}{\mathrm{\λ}}_{0,i}^1-\underset{i=1}{\overset{R}{\mathrm{\Σ}}}\underset{j=1}{\overset{M\left(j\right)}{\mathrm{\Σ}}}{\mathrm{\λ}}_{i,j}^2;$

Wherein, N means the number of subchannels in a frame, and N' is the surplus resources piece, and T' means the timeslot number of descending sub frame;

(3) described base station, according to the conversion speed of above-mentioned each link group calculated, is found out the link group of conversion speed maximum, and the surplus resources piece is distributed to this link group; When the maximum rate link group be base station to the travelling carriage link, surplus resources piece N' is distributed to this link; When the maximum rate link group is base station to repeatered line and repeater to the travelling carriage link, surplus resources piece N' is distributed to this two links by the inverse ratio of two link transmission speed, the surplus resources piece that namely in this link group, base station is distributed to repeatered line is

Repeater to the surplus resources piece of travelling carriage link assignment is

Wherein, V ₁Mean in the maximum rate link group that base station is to the link rate of repeater, V ₂Mean in the maximum rate link group that repeater is to the link rate of travelling carriage,

Mean to round downwards.

6. according to the dynamic resource allocation method described in claim 1, it is characterized in that, described the 5th step comprises the following steps:

(1) total number of resource blocks of first stage link assignment is obtained in described base station, and whether detect this number of resource blocks is the integral multiple of N; If be left intact; Otherwise, total number of resource blocks of first stage link is adjusted into

Wherein, K ₁Total number of resource blocks for the first stage distribution;

(2) find out the first stage link of the link group of conversion speed maximum, namely when the link group of conversion speed maximum be base station to the travelling carriage link, the first stage link is that base station is to the travelling carriage link; When the link group of converting the speed maximum is the link of base station to repeater to travelling carriage, the link of first stage is the link of base station to repeater, from the Resource Block that this link has distributed, deducting K ₁-K ' ₁Individual Resource Block;

(3) the Resource Block information broadcasting of the link that each travelling carriage is corresponding will be distributed to all travelling carriages and repeater in system in described base station.

Images