CN105050188A - Wireless resource allocation system and method in orthogonal frequency division multiple access (OFDMA) full frequency reuse relay network - Google Patents

Abstract

The invention provides a wireless resource allocation system in an orthogonal frequency division multiple access (OFDMA) full frequency reuse relay network. The wireless resource allocation system comprises following modules: a base station subframe channel allocation module and a relay subframe channel allocation module. The base station subframe channel allocation module is used for allocating each subchannel in a base station subframe till all subchannels in the base station subframe are allocated or a base station user queue is empty. The relay subframe channel allocation module is used for allocating each subchannel in a relay subframe till all subchannels in the relay subframe are allocated or a base station user queue and a relay user queue are empty. The invention also provides a wireless resource allocation method in the OFDMA full frequency reuse relay network. The method comprises a first step of allocating each subchannel in the base station subframe till all subchannels in the base station subframe are allocated or the base station user queue is empty; and a second step of allocating each subchannel in the relay subframe till all subchannels in the relay subframe are allocated or the base station user queue and the relay user queue are empty.

Description

Allocation of radio resources system and method in the multiplexing junction network of OFDMA full rate

Technical field

The present invention relates to wireless communication technology field, particularly allocation of radio resources system and method in the multiplexing junction network of a kind of OFDMA full rate.

Background technology

The theme of next generation mobile communication is that ubiquitous two-forty covers to meet the growing communication requirement of people.On the frequency spectrum of given preciousness, the frequency spectrum that the requirement that reach ubiquitous two-forty covering must utilize these limited efficiently, improves the utilization ratio of frequency spectrum, only in this way could improve the throughput of whole community to meet the communication requirement of people.So the combination of orthogonal frequency-time multiple access (OFDMA) air interface technologies and relaying technique is the development trend of radio communication.The combination of these two kinds of technology can provide larger potential multi-user and frequency diversity gain to improve the receptivity of user, and adaptive distribution technique can be utilized to realize the requirement of user rationally and effectively, so the advantage of these two kinds of technology of simultaneously stability can improve the throughput of system thus meet the demand for services of all users in community.In addition along with the introducing of relaying also brings the possibility of channeling, such as full rate multiplexing scheme, the frequency reuse plan about base station in community and relaying has been proved to be can the throughput of raising community of high degree.

In the resource allocation problem of wireless communication system, spectrum efficiency and fairness compare the systematic function of contradiction for a pair.In the environment of wireless network, because the channel condition difference between different user is very large, so want them, in certain performance, reach absolute justice be very difficult.Such as edge customer and central user, the channel condition that the channel condition of edge customer compares central user is mutually far short of what is expected, if require that the data rate of the data rate of edge customer and central user is similar, just need to distribute more frequency spectrum resource to edge customer, the utilization ratio of frequency spectrum will be caused so very low.Therefore to reach the spectrum efficiency that high fairness performance will reduce system, thus sacrifice the throughput of system.On the other hand, if we distribute to the best user of channel condition such as central user all resources of system, so the spectrum efficiency of system will reach can reach the highest, but between user, fairness can be very low like this, the throughput that therefore will improve system will sacrifice the fairness performance between user.

But prior art is difficult to find a kind of half-way house efficiently between user fairness and throughput of system.

Summary of the invention

In view of this, the invention provides and a kind ofly can either reach allocation of radio resources system and method in the multiplexing junction network of OFDMA full rate of fairness between user that higher spectrum efficiency can keep certain height again simultaneously.

Allocation of radio resources system in the multiplexing junction network of a kind of OFDMA full rate, comprises as lower module:

Base station sub-frame chan-nel distribution module, for distributing the every sub-channels in the subframe of base station, until in the subframe of base station all subchannels be all assigned or base station user queue for empty;

Relay sub-frame channel assignment module, for distributing the every sub-channels in relay sub-frame, until the every sub-channels in relay sub-frame is all assigned or base station user queue and trunk subscriber queue for empty.

Wireless resource allocation methods in the multiplexing junction network of a kind of OFDMA full rate, comprises the steps:

S1, the every sub-channels in the subframe of base station to be distributed, until in the subframe of base station all subchannels be all assigned or base station user queue for empty;

S2, the every sub-channels in relay sub-frame to be distributed, until the every sub-channels in relay sub-frame is all assigned or base station user queue and trunk subscriber queue for empty.

Allocation of radio resources system and method in the multiplexing junction network of OFDMA full rate provided by the invention, base station is avoided user data to be sent the relaying being given to subscriber channel condition difference by the mode dividing relay candidate user collection, and combine and consider link transmission rate and the Subscriber Queue length measure coefficient as Resourse Distribute, thus ensure that all customer data can both fair high efficiency of transmission, additionally by the multiplexing throughput improving community user further of full rate of base station and relaying as far as possible.

Accompanying drawing explanation

Fig. 1 is the illustraton of model of OFDMA relaying cell network.

Fig. 2 is the frame structure of OFDMA relaying cell network.

Fig. 3 is the multiplexing model of full rate of OFDMA relaying cell network.

Fig. 4 is allocation of radio resources system architecture diagram in the multiplexing junction network of OFDMA full rate of the embodiment of the present invention;

Fig. 5 is the structured flowchart of sub-frame chan-nel distribution module in base station in Fig. 4;

Fig. 6 is the structured flowchart of relay sub-frame channel assignment module in Fig. 4;

Fig. 7 is the flow chart of wireless resource allocation methods in the multiplexing junction network of OFDMA full rate of the embodiment of the present invention;

Fig. 8 is the sub-process figure of step S1 in Fig. 7;

Fig. 9 is the sub-process figure of step S2 in Fig. 8.

Embodiment

Fig. 1 is the downlink transfer sight of OFDMA cell relay network, in a hexagonal cell, base station (BaseStation, BS) at M relaying (RelayStation, RS) auxiliary lower and K user terminal (UserTerminals, UT) carry out data communication, and base station is placed on the center of hexagonal cell.Under the help of routing mechanism, each user terminal can communicate with relaying or base station simultaneously on different sub-channels, and Adaptive Modulation and Coding will be adopted in systems in which in data transmission procedure.。

Fig. 2 is the frame structure of native system, and all relayings are all operated in time division mode, so data frame length will be divided into two isometric continuous print subframes, subframe lengths will be isometric and be called base station subframe and relay sub-frame.In the subframe of base station, base station is only only had to transmit data to relaying and user.Be relay sub-frame, base station will be shared frequency spectrum and all be transmitted data to user with relaying.We suppose that the channel coherency time of all channels is all longer than frame length in addition, and namely channel condition is that supposition is constant in a frame, and only between different frame, channel just changes.

Fig. 3 is the multiplexing model of full rate of native system, base station and the multiplexing whole frequency spectrum resource of all relayings.Concerning base station, base station uses all frequency spectrum resources in its overlay area, and all users in base station overlay area have an opportunity to use any subchannel.Concerning relaying, whole frequency spectrum resource is divided into six parts, and each relaying uses a copy of it subchannel.The subchannel that the sub-channel allocation scheme of base station and relaying comprises base station subframe distributes and the subchannel of relay sub-frame distributes two steps.

As shown in Figure 4, allocation of radio resources system in the multiplexing junction network of a kind of OFDMA full rate, comprises as lower module:

Base station sub-frame chan-nel distribution module 10, for distributing the every sub-channels in the subframe of base station, until in the subframe of base station all subchannels be all assigned or base station user queue for empty;

Relay sub-frame channel assignment module 20, for distributing the every sub-channels in relay sub-frame, until the every sub-channels in relay sub-frame is all assigned or base station user queue and trunk subscriber queue for empty.

Alternatively, as shown in Figure 5, described base station sub-frame chan-nel distribution module 10 comprises as lower unit:

User selection unit 11, for sub-channels every in the subframe of base station, chooses the maximum relaying of this user transmission rate and adds the candidate user collection of selected relaying by each user;

User link measure coefficient acquiring unit 12, for sub-channels every in the subframe of base station, calculates the measure coefficient of each base station user link, and the measure coefficient of base station user link to be multiplied with base station user queue length by base station user link transmission rate and to obtain;

Repeated link measure coefficient acquiring unit 13, for calculating the measure coefficient of each base station repeated link, the measure coefficient of base station repeated link to be multiplied with the maximum difference of base station trunk subscriber queue by base station repeated link transmission rate and to obtain, wherein the maximum difference of base station trunk subscriber queue refer in the queue of the candidate user centralized base-station Subscriber Queue of relaying and the maximum user of trunk subscriber queue difference poor;

The measure coefficient acquiring unit 14 of subchannel, for choosing the measure coefficient of the maximum link of measure coefficient as this base station subframe sub-channels in base station user link and base station repeated link;

Base station subframe sub-channels allocation units 15, distribute to respective links for the base station subframe sub-channels choosing measure coefficient maximum, and upgrade the Subscriber Queue of respective base station or relaying according to link transmission rate;

First iteration unit 16, for measure coefficient acquiring unit 14, the base station subframe sub-channels allocation units 15 of repeated priming user link measure coefficient acquiring unit 12, repeated link measure coefficient acquiring unit 13, subchannel, until all base stations subframe sub-channels distributes.

Alternatively, described user selection unit 11 comprises:

To all links in relay network system, according to the dry transmission rate calculating every bar link than the bit error rate (BER) required by (SINR) and transfer of data of the letter of link, such as R _{m, k, n}(t) represent on subcarrier n base station (m=0) or relaying (m=1,2 ..., M) and to the transmission rate of user k, its computing formula is:

$R_{m,k,n}\left(t\right)={\mathrm{Wlog}}_2(1+\frac{-1.5{\mathrm{\β}}_{m,k,n}}{ln\left(5BER\right)})$

β in formula _{m, k, n}represent that transmitting terminal m is to the reception SINR accepting user k in carrier wave n.BER and W represents the bandwidth of every sub-channels in the bit error rate of system and base station subframe respectively.

According to the link transmission rate calculated, in the subframe of base station on every sub-channels, each user chooses the maximum relaying of this user transmission rate, and adds the candidate user collection of selected relaying.Like this in the subframe of base station on every sub-channels, user used is divided into the candidate user collection of relaying.

Alternatively,

In described user link measure coefficient acquiring unit 12: the measure coefficient computing formula of base station user link is as follows:

$D_{n,BS-k}=R_{BS,k,n}{Q}_k^{BS}$

Wherein, D _{n, BS-k}represent that base station is to the link metric factor of a kth user on the subframe sub-channels n of base station, R _{bS, k, n}represent that on the subframe sub-channels n of base station, base station is to the link transmission rate of a kth user, represent the length of data queue of a kth user in base station.

Alternatively,

In described repeated link measure coefficient acquiring unit 13: the measure coefficient computing formula of base station repeated link is as follows:

$D_{n,BS-{\mathrm{RS}}_m}=R_{BS,{\mathrm{RS}}_m,n}{\max }_k\left\{{(Q_k^{BS}-Q_k^{{\mathrm{RS}}_m})}^{+}{C}_{m,k,n}\right\}$

Wherein, D _{n, BS-RSm}represent that base station is to the link metric factor of m relaying on the subframe sub-channels n of base station, R _{bS, RSm, n}represent that on the subframe sub-channels n of base station, base station is to the link transmission rate of m relaying, with represent the kth user length of data queue at base station and m relaying respectively, C _{m, k, n}be 1 expression user k on the subframe sub-channels n of base station be the candidate user of relaying m, be 0 and represent that user k is not the candidate user of relaying m on the subframe sub-channels n of base station.

Alternatively, if the measure coefficient acquiring unit 14 of subchannel comprise select be base station user link, then record this user; If what select is base station repeated link, record makes base station and the maximum user of trunk queue difference.

Alternatively,

In described base station subframe sub-channels allocation units 15, choose the residue unallocated base station subframe sub-channels vacuum metrics factor maximum distribute to respective link, if base station subframe sub-channels distributes to base station user link, then upgrade the queue length of respective user in base station according to the transmission rate of base station user link and base station subframe duration calculated data transmission quantity; If base station subframe sub-channels distributes to base station repeated link, then upgrade the queue length of respective user at base station and relaying according to the transmission rate of base station repeated link and base station subframe duration calculated data transmission quantity.

Alternatively, as shown in Figure 6, described relay sub-frame channel assignment module 20 comprises as lower unit:

Base station user link and trunk subscriber link metric factor calculating unit 21, for the every sub-channels in relay sub-frame, calculate the measure coefficient of each base station user link and trunk subscriber link when considering the multiplexing interference of full rate;

Base station relaying is to the measure coefficient computing unit 22 of this channel multiplexing, for the every sub-channels in relay sub-frame, choose the maximum base station user link of measure coefficient sum and trunk subscriber link as this base station relaying to the measure coefficient of this channel multiplexing for each relaying;

The measure coefficient computing unit 23 that base station relaying is right, for after having calculated the measure coefficient that on the every sub-channels in relay sub-frame, all base stations relaying is right, the measure coefficient right by the base station relaying calculated builds two-dimensions moment matrix, this matrix behavior subchannel is classified as base station relaying pair, and matrix element is the measure coefficient that on corresponding subchannel, base station relaying is right;

The Subscriber Queue updating block 24 of base station and relaying, for utilize Hungary Algorithm to metric matrix carry out subchannel and base station user right optimum pairing, and according to the amount of user data of allocation result calculation base station and relay transmission, thus upgrade the Subscriber Queue of base station and relaying;

Secondary iteration unit 25, distribute for repeated priming base station user link and trunk subscriber link metric factor calculating unit 21 in the unappropriated subchannel of residue, the function of base station relaying to the Subscriber Queue updating block 24 of the right measure coefficient computing unit 23 of the measure coefficient computing unit 22 of this channel multiplexing, base station relaying, base station and relaying, until relaying right subchannel in base station distributes or base station and trunk subscriber queue are that sky then stops iteration, the channel allocation of this frame completes simultaneously.

Alternatively, when base station user link and trunk subscriber link metric factor calculating unit 21 comprise calculating relaying measure coefficient, choose maximum in all trunk subscriber links, instead of the user only selecting candidate user to concentrate, therefore on the n-th subchannel in relay sub-frame, the computing formula of the measure coefficient of relaying is as follows

$D_{n,RS}={\max }_k\left\{R_{RS,k,n}{q}_k^{RS}\right\}.$

Alternatively, base station relaying is to comprising on each of the sub-channels in relay sub-frame in the measure coefficient computing unit 22 of this channel multiplexing, the maximum base station user link of measure coefficient sum and trunk subscriber link is chosen as this base station relaying to the measure coefficient of this channel multiplexing for each relaying, therefore m base station relaying is as follows to the measure coefficient computing formula on the n-th subchannel in relay sub-frame

$D_{n,m}={\max }_k\left\{R_{m,k,n}{q}_k^m\right\}+{\max }_k\left\{R_{BS,k,n}{Q}_k^{BS}\right\}.$

Alternatively, relaying right measure coefficient computing unit 23 vacuum metrics matrix D in described base station is the two-dimensional matrix of a N*M, and wherein N is the subchannel number in relay sub-frame, and M is relaying number; Each element D of metric matrix D _n,mall that base station relaying is to the measure coefficient on the subchannel n in relay sub-frame.

Alternatively,

In the Subscriber Queue updating block 24 of described base station and relaying, by the subchannel in the every sub-distribution M relay sub-frame of Hungary Algorithm to M base station relaying pair, base station relaying upgrades relative users queue according to the subchannel in the relay sub-frame of distributing.

As shown in Figure 7, the embodiment of the present invention also provides wireless resource allocation methods in the multiplexing junction network of a kind of OFDMA full rate, comprises the steps:

S1, the every sub-channels in the subframe of base station to be distributed, until in the subframe of base station all subchannels be all assigned or base station user queue for empty;

S2, the every sub-channels in relay sub-frame to be distributed, until the every sub-channels in relay sub-frame is all assigned or base station user queue and trunk subscriber queue for empty.

Alternatively, as shown in Figure 8, described step S1 comprises following sub-step:

S11, to sub-channels every in the subframe of base station, each user chosen the maximum relaying of this user transmission rate and add the candidate user collection of selected relaying;

S12, to sub-channels every in the subframe of base station, calculate the measure coefficient of each base station user link, the measure coefficient of base station user link to be multiplied with base station user queue length by base station user link transmission rate and to obtain;

S13, to sub-channels every in the subframe of base station, calculate the measure coefficient of each base station repeated link, the measure coefficient of base station repeated link to be multiplied with the maximum difference of base station trunk subscriber queue by base station repeated link transmission rate and to obtain, wherein the maximum difference of base station trunk subscriber queue refer in the queue of the candidate user centralized base-station Subscriber Queue of relaying and the maximum user of trunk subscriber queue difference poor;

S14, in base station user link and base station repeated link, choose the measure coefficient of the maximum link of measure coefficient as this base station subframe sub-channels;

S15, the base station subframe sub-channels choosing measure coefficient maximum distribute to respective links, and upgrade the Subscriber Queue of respective base station or relaying according to link transmission rate;

S16, repetition step S12 to S15, until all base stations subframe sub-channels distributes.

Alternatively, described step S11 comprises all links in relay network system, according to the dry transmission rate calculating every bar link than the bit error rate (BER) required by (SINR) and transfer of data of the letter of link, and such as R _{m, k, n}(t) represent on subcarrier n base station (m=0) or relaying (m=1,2 ..., M) and to the transmission rate of user k, its computing formula is:

$R_{m,k,n}\left(t\right)={\mathrm{Wlog}}_2(1+\frac{-1.5{\mathrm{\β}}_{m,k,n}}{ln\left(5BER\right)})$

β in formula _{m, k, n}represent that transmitting terminal m is to the reception SINR accepting user k in carrier wave n.BER and W represents the bandwidth of every sub-channels in the bit error rate of system and base station subframe respectively.

According to the link transmission rate calculated, in the subframe of base station on every sub-channels, each user chooses the maximum relaying of this user transmission rate, and adds the candidate user collection of selected relaying.Like this in the subframe of base station on every sub-channels, user used is divided into the candidate user collection of relaying.

Alternatively,

In described step S12: the measure coefficient computing formula of base station user link is as follows:

$D_{n,BS-k}=R_{BS,k,n}{Q}_k^{BS}$

Wherein, D _{n, BS-k}represent that base station is to the link metric factor of a kth user on the subframe sub-channels n of base station, R _{bS, k, n}represent that on the subframe sub-channels n of base station, base station is to the link transmission rate of a kth user, represent the length of data queue of a kth user in base station.

Alternatively,

In described step S13: the measure coefficient computing formula of base station repeated link is as follows:

$D_{n,BS-{\mathrm{RS}}_m}=R_{BS,{\mathrm{RS}}_m,n}{\max }_k\left\{{(Q_k^{BS}-Q_k^{{\mathrm{RS}}_m})}^{+}{C}_{m,k,n}\right\}$

Wherein, D _{n, BS-RSm}represent that base station is to the link metric factor of m relaying on the subframe sub-channels n of base station, R _{bS, RSm, n}represent that on the subframe sub-channels n of base station, base station is to the link transmission rate of m relaying, with represent the kth user length of data queue at base station and m relaying respectively, C _{m, k, n}be 1 expression user k on the subframe sub-channels n of base station be the candidate user of relaying m, be 0 and represent that user k is not the candidate user of relaying m on the subframe sub-channels n of base station.

Alternatively, if described step S14 comprise select be base station user link, then record this user; If what select is base station repeated link, record makes base station and the maximum user of trunk queue difference.

Alternatively,

In described step S15, choose the residue unallocated base station subframe sub-channels vacuum metrics factor maximum distribute to respective link, if base station subframe sub-channels distributes to base station user link, then upgrade the queue length of respective user in base station according to the transmission rate of base station user link and base station subframe duration calculated data transmission quantity; If base station subframe sub-channels distributes to base station repeated link, then upgrade the queue length of respective user at base station and relaying according to the transmission rate of base station repeated link and base station subframe duration calculated data transmission quantity.

Alternatively, as shown in Figure 9, described step S2 comprises following sub-step:

On S21, every sub-channels in relay sub-frame, calculate the measure coefficient of each base station user link and trunk subscriber link when considering the multiplexing interference of full rate;

On S22, every sub-channels in relay sub-frame, choose the maximum base station user link of measure coefficient sum and trunk subscriber link as this base station relaying to the measure coefficient of this channel multiplexing for each relaying;

S23, after having calculated the measure coefficient that on the every sub-channels in relay sub-frame, all base stations relaying is right, the measure coefficient right by the base station relaying calculated builds two-dimensions moment matrix, this matrix behavior subchannel is classified as base station relaying pair, and matrix element is the measure coefficient that on corresponding subchannel, base station relaying is right;

S24, Hungary Algorithm is utilized to carry out subchannel and the right optimum pairing of base station user to metric matrix, and according to the amount of user data of allocation result calculation base station and relay transmission, thus upgrade the Subscriber Queue of base station and relaying;

S25, repeat step S21 to S24 and distribute in the unappropriated subchannel of residue, until relaying right subchannel in base station distributes or base station and trunk subscriber queue are that sky then stops iteration, while this frame channel allocation complete.

Alternatively, when described step S21 comprises calculating relaying measure coefficient, choose maximum in all trunk subscriber links, instead of the user only selecting candidate user to concentrate, therefore on the n-th subchannel in relay sub-frame, the computing formula of the measure coefficient of relaying is as follows

$D_{n,RS}={\max }_k\left\{R_{RS,k,n}{q}_k^{RS}\right\}.$

Alternatively, described step S22 comprises alternatively, base station relaying is to comprising on each of the sub-channels in relay sub-frame in the measure coefficient computing unit of this channel multiplexing, the maximum base station user link of measure coefficient sum and trunk subscriber link is chosen as this base station relaying to the measure coefficient of this channel multiplexing for each relaying, therefore m base station relaying is as follows to the measure coefficient computing formula on the n-th subchannel in relay sub-frame

$D_{n,m}={\max }_k\left\{R_{m,k,n}{q}_k^m\right\}+{\max }_k\left\{R_{BS,k,n}{Q}_k^{BS}\right\}.$

Alternatively, described step S23 vacuum metrics matrix D is the two-dimensional matrix of a N*M, and wherein N is the subchannel number in relay sub-frame, and M is relaying number; Each element D of metric matrix D _n,mall that base station relaying is to the measure coefficient on the subchannel n in relay sub-frame.

Alternatively,

In described step S24, by the subchannel in the every sub-distribution M relay sub-frame of Hungary Algorithm to M base station relaying pair, base station relaying upgrades relative users queue according to the subchannel in the relay sub-frame of distributing.

Above embodiment of the method and system embodiment one_to_one corresponding, therefore the content of embodiment of the method can also be used for system embodiment.

The software module that the method described in conjunction with embodiment disclosed herein or the step of algorithm can directly use hardware, processor to perform, or the combination of the two is implemented.Software module can be placed in any other forms of storage medium known in random access memory, internal memory, read-only memory, electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technical field.

Be understandable that, for the person of ordinary skill of the art, other various corresponding change and distortion can be made by technical conceive according to the present invention, and all these change the protection range that all should belong to the claims in the present invention with distortion.

Claims (10)

1. an allocation of radio resources system in the multiplexing junction network of OFDMA full rate, is characterized in that, comprise as lower module:

Base station sub-frame chan-nel distribution module, for distributing the every sub-channels in the subframe of base station, until in the subframe of base station all subchannels be all assigned or base station user queue for empty;

Relay sub-frame channel assignment module, for distributing the every sub-channels in relay sub-frame, until the every sub-channels in relay sub-frame is all assigned or base station user queue and trunk subscriber queue for empty.

2. allocation of radio resources system in the multiplexing junction network of OFDMA full rate as claimed in claim 1, it is characterized in that, described base station sub-frame chan-nel distribution module comprises as lower unit:

User selection unit, for sub-channels every in the subframe of base station, chooses the maximum relaying of this user transmission rate and adds the candidate user collection of selected relaying by each user;

User link measure coefficient acquiring unit, for sub-channels every in the subframe of base station, calculates the measure coefficient of each base station user link, and the measure coefficient of base station user link to be multiplied with base station user queue length by base station user link transmission rate and to obtain;

Repeated link measure coefficient acquiring unit, for calculating the measure coefficient of each base station repeated link, the measure coefficient of base station repeated link to be multiplied with the maximum difference of base station trunk subscriber queue by base station repeated link transmission rate and to obtain, wherein the maximum difference of base station trunk subscriber queue refer in the queue of the candidate user centralized base-station Subscriber Queue of relaying and the maximum user of trunk subscriber queue difference poor;

The measure coefficient acquiring unit of subchannel, for choosing the measure coefficient of the maximum link of measure coefficient as this base station subframe sub-channels in base station user link and base station repeated link;

Base station subframe sub-channels allocation units, distribute to respective links for the base station subframe sub-channels choosing measure coefficient maximum, and upgrade the Subscriber Queue of respective base station or relaying according to link transmission rate;

First iteration unit, for measure coefficient acquiring unit, the base station subframe sub-channels allocation units of repeated priming user link measure coefficient acquiring unit, repeated link measure coefficient acquiring unit, subchannel, until all base stations subframe sub-channels distributes.

3. allocation of radio resources system in the multiplexing junction network of OFDMA full rate as claimed in claim 2, is characterized in that,

In the subframe sub-channels allocation units of described base station, choose the residue unallocated base station subframe sub-channels vacuum metrics factor maximum distribute to respective link, if base station subframe sub-channels distributes to base station user link, then upgrade the queue length of respective user in base station according to the transmission rate of base station user link and base station subframe duration calculated data transmission quantity; If base station subframe sub-channels distributes to base station repeated link, then upgrade the queue length of respective user at base station and relaying according to the transmission rate of base station repeated link and base station subframe duration calculated data transmission quantity.

4. allocation of radio resources system in the multiplexing junction network of OFDMA full rate as claimed in claim 1, it is characterized in that, described relay sub-frame channel assignment module comprises as lower unit:

Base station user link and trunk subscriber link metric factor calculating unit, for the every sub-channels in relay sub-frame, calculate the measure coefficient of each base station user link and trunk subscriber link when considering the multiplexing interference of full rate;

Base station relaying is to the measure coefficient computing unit of this channel multiplexing, for the every sub-channels in relay sub-frame, choose the maximum base station user link of measure coefficient sum and trunk subscriber link as this base station relaying to the measure coefficient of this channel multiplexing for each relaying;

The measure coefficient computing unit that base station relaying is right, for after having calculated the measure coefficient that on the every sub-channels in relay sub-frame, all base stations relaying is right, the measure coefficient right by the base station relaying calculated builds two-dimensions moment matrix, this matrix behavior subchannel is classified as base station relaying pair, and matrix element is the measure coefficient that on corresponding subchannel, base station relaying is right;

The Subscriber Queue updating block of base station and relaying, for utilize Hungary Algorithm to metric matrix carry out subchannel and base station user right optimum pairing, and according to the amount of user data of allocation result calculation base station and relay transmission, thus upgrade the Subscriber Queue of base station and relaying;

Secondary iteration unit, distribute for repeated priming base station user link and trunk subscriber link metric factor calculating unit in the unappropriated subchannel of residue, the function of base station relaying to the Subscriber Queue updating block of the right measure coefficient computing unit of the measure coefficient computing unit of this channel multiplexing, base station relaying, base station and relaying, until relaying right subchannel in base station distributes or base station and trunk subscriber queue are that sky then stops iteration, the channel allocation of this frame completes simultaneously.

5. wireless resource allocation methods in the multiplexing junction network of OFDMA full rate as claimed in claim, it is characterized in that, relaying right measure coefficient computing unit vacuum metrics matrix D in described base station is the two-dimensional matrix of a N*M, and wherein N is the subchannel number in relay sub-frame, and M is relaying number; Each element D of metric matrix D _n,mall that base station relaying is to the measure coefficient on the subchannel n in relay sub-frame.

6. a wireless resource allocation methods in the multiplexing junction network of OFDMA full rate, is characterized in that, comprise the steps:

S1, the every sub-channels in the subframe of base station to be distributed, until in the subframe of base station all subchannels be all assigned or base station user queue for empty;

S2, the every sub-channels in relay sub-frame to be distributed, until the every sub-channels in relay sub-frame is all assigned or base station user queue and trunk subscriber queue for empty.

7. wireless resource allocation methods in the multiplexing junction network of OFDMA full rate as claimed in claim 6, it is characterized in that, described step S1 comprises following sub-step:

S11, to sub-channels every in the subframe of base station, each user chosen the maximum relaying of this user transmission rate and add the candidate user collection of selected relaying;

S12, to sub-channels every in the subframe of base station, calculate the measure coefficient of each base station user link, the measure coefficient of base station user link to be multiplied with base station user queue length by base station user link transmission rate and to obtain;

S13, to sub-channels every in the subframe of base station, calculate the measure coefficient of each base station repeated link, the measure coefficient of base station repeated link to be multiplied with the maximum difference of base station trunk subscriber queue by base station repeated link transmission rate and to obtain, wherein the maximum difference of base station trunk subscriber queue refer in the queue of the candidate user centralized base-station Subscriber Queue of relaying and the maximum user of trunk subscriber queue difference poor;

S14, in base station user link and base station repeated link, choose the measure coefficient of the maximum link of measure coefficient as this base station subframe sub-channels;

S15, the base station subframe sub-channels choosing measure coefficient maximum distribute to respective links, and upgrade the Subscriber Queue of respective base station or relaying according to link transmission rate;

S16, repetition step S12 to S15, until all base stations subframe sub-channels distributes.

8. wireless resource allocation methods in the multiplexing junction network of OFDMA full rate as claimed in claim 6, it is characterized in that, described step S2 comprises following sub-step:

On S21, every sub-channels in relay sub-frame, calculate the measure coefficient of each base station user link and trunk subscriber link when considering the multiplexing interference of full rate;

On S22, every sub-channels in relay sub-frame, choose the maximum base station user link of measure coefficient sum and trunk subscriber link as this base station relaying to the measure coefficient of this channel multiplexing for each relaying;

S23, after having calculated the measure coefficient that on the every sub-channels in relay sub-frame, all base stations relaying is right, the measure coefficient right by the base station relaying calculated builds two-dimensions moment matrix, this matrix behavior subchannel is classified as base station relaying pair, and matrix element is the measure coefficient that on corresponding subchannel, base station relaying is right;

S24, Hungary Algorithm is utilized to carry out subchannel and the right optimum pairing of base station user to metric matrix, and according to the amount of user data of allocation result calculation base station and relay transmission, thus upgrade the Subscriber Queue of base station and relaying;

S25, repeat step S21 to S24 and distribute in the unappropriated subchannel of residue, until relaying right subchannel in base station distributes or base station and trunk subscriber queue are that sky then stops iteration, while this frame channel allocation complete.

9. wireless resource allocation methods in the multiplexing junction network of OFDMA full rate as claimed in claim 8, it is characterized in that, described step S23 vacuum metrics matrix D is the two-dimensional matrix of a N*M, and wherein N is the subchannel number in relay sub-frame, and M is relaying number; Each element D of metric matrix D _n,mall that base station relaying is to the measure coefficient on the subchannel n in relay sub-frame.

10. wireless resource allocation methods in the multiplexing junction network of OFDMA full rate as claimed in claim 8, is characterized in that,

In described step S24, by the subchannel in the every sub-distribution M relay sub-frame of Hungary Algorithm to M base station relaying pair, base station relaying upgrades relative users queue according to the subchannel in the relay sub-frame of distributing.