CN103634040B - Communication method and apparatus for relay network - Google Patents

Abstract

The invention provides a communication method and apparatus for relay network. The relay network includes a source node, a target node and a plurality of relay nodes. The method comprises the following steps that: pilot frequency information sent by each candidate relay node is received at the target node at one time slot, wherein the pilot frequency information at least includes first channel state information from the source node to corresponding candidate relay nodes; second channel state information from each of the candidate relay nodes to the target node is obtained; an optimum relay node is selected from the candidate relay nodes at least based on the first channel state information and the second channel state information; and a message that is received from the source node by the optimum relay node at a time slot previous to the time slot is forwarded. Moreover, on the basis of the precoding design of the source node and the relay nodes, interferences caused by other relays and the adjacent interference source can be eliminated, thereby further improving the system performance.

Description

Communication means for junction network and device

Technical field

The present invention relates to communication system, and more particularly, to being based on single time slot in the junction network of communication system The communication means of relay selection and device.

Background technology

Relaying is communication system, it is wireless to include and wired communication system in conventional technology.In recent years, relaying becomes One of core technology in 3GPP senior long term evolution (LTE-A) system.Relaying not only has the ability of extended network covering, and And the capacity of network can also be improved, network construction cost can be reduced using the feature of relaying low cost simultaneously.By little Area edge disposes via node, and Cell Edge User can experience the received signal power of the raising from service relay node, Such that it is able to improve the handling capacity of Cell Edge User.Relaying can be divided into layer one by the current difference according to relaying perform function Relaying, layer two relay and layer three relaying.Layer one relaying is the relaying of amplification forwarding (AF) type.

At present, the repetition policy for AF relay system is conducted extensive research, but in this relay system In relay selection aspect research work be mainly focused on ideal system construction, without consider collaborative processes in cell Between disturb.And in fact, presence of intercell interference has significantly for signal interference plus noise ratio (SINR) performance that traditional AF relays Impact.And, the relay selection for existing AF junction network is all based on double slot transmission, because two will be used Time slot, the therefore this relay selection based on double slot transmission undoubtedly can reduce the total rate capability of system.

Content of the invention

In order to solve the above-mentioned problems in the prior art, embodiments of the present invention propose for limiting interference The relay communication method based on single time slot relay selection of system and device.

According to an aspect of the invention, it is provided a kind of communication means for junction network, this junction network includes Source node, destination node and multiple via node, the method is included in one time slot：Each time is received at destination node Select the pilot frequency information that via node sends, this pilot frequency information at least includes the first letter from source node to corresponding candidate via node Channel state information；Obtain from candidate relay node each to destination node second channel status information；At least based on One channel condition information and second channel status information to select optimal relay node from candidate relay node；And from optimal Via node receives the message that it receives in a upper time slot from source node.

According to a further aspect in the invention, there is provided a kind of trunking method for junction network, this junction network includes Source node, destination node and multiple via node, the method includes：In one time slot, receive source node at both candidate nodes The message of broadcast；And in the next time slot of this time slot：Send pilot frequency information to destination node at both candidate nodes, This pilot frequency information at least includes the first channel condition information from source node to corresponding via node；Receive destination node to be broadcasted Message, this message at least includes which via node being selected as the information of optimal relay node with regard to；And during this is optimal Its message receiving from source node in a upper time slot is forwarded to destination node by the node that continues.

According to another aspect of the invention, there is provided a kind of communicator for junction network, this junction network includes Source node, destination node and multiple via node, this communicator is used at destination node, including：Receiving unit, is configured to use In the pilot frequency information receiving the transmission of each candidate relay node, during this pilot frequency information at least includes from source node to corresponding candidate Continue the first channel condition information of node；And in one time slot from optimal relay node receive its a upper time slot from The message that source node receives；And processing unit, be arranged to obtain from candidate relay node each to purpose section The second channel status information of point；And come from candidate at least based on the first channel condition information and second channel status information Continue and select optimal relay node in node.

According to another aspect of the invention, there is provided a kind of relay for junction network, this junction network includes Source node, destination node and multiple via node, this relay is used at each via node, including：Transmitting element, quilt It is configured to send pilot frequency information to destination node, during this pilot frequency information at least includes corresponding to from source node to relay Continue the first channel condition information of node；And if the via node corresponding to relay is selected as in a time slot Good via node, then forward, to destination node, the message that it receives in a upper time slot from source node in this timeslot；With And receiving unit, it is arranged to receive message from source node；And receive the message that destination node is broadcasted, this message is at least Including the information which via node to be selected as optimal relay node with regard to.

Brief description

In conjunction with accompanying drawing, the foregoing invention content of the present invention and other side, feature and advantage are by from following non-limiting Become more fully apparent in the detailed description of embodiment, wherein：

Fig. 1 shows the schematic diagram of the double bounce amplification forwarding junction network of prior art；

Fig. 2 shows the schematic diagram of the junction network according to exemplary embodiment of the invention；

Fig. 3 shows the relay communication method according to exemplary embodiment of the invention based on single time slot relay selection Schematically time slot map；

Fig. 4 shows the relay communication method according to exemplary embodiment of the invention based on single time slot relay selection Flow chart；

Fig. 5 shows that execution is according to the method for exemplary embodiment of the invention at the destination node in junction network Flow chart；

The flow chart that Fig. 6 shows the interference alignment algorithm of the allied signal according to exemplary embodiment of the invention；

Fig. 7 shows the structured flowchart according to exemplary embodiment of the invention for the relay of junction network；

Fig. 8 shows the structured flowchart according to exemplary embodiment of the invention for the communicator of junction network.

Specific embodiment

Below with reference to accompanying drawing, the illustrative embodiments of the present invention are described.In this illustrative embodiments, Taking LTE system as a example.It should be appreciated to those skilled in the art that the scope of the present invention is not limited to this, this exemplary enforcement Mode is only used for describing purpose, should be regarded as example rather than any limitation of the invention of the present invention, any make use of this The scheme of invention illustrative embodiments each falls within protection scope of the present invention.

Fig. 1 shows the schematic diagram of the double bounce amplification forwarding junction network of prior art.This junction network 100 wraps Include source node, via node and destination node.Source node is typically base station, NodeB or eNB in LTE etc., but the present invention Not limited to this.Destination node is typically user equipment, for example, can be, fixing or mobile phone, desk-top or portable computer, Personal digital assistant (or PDA), be likely to become communication equipment game console, be likely to become communication equipment household electrical appliance, It is likely to become television set or multimedia content receivers (such as STB or " Set Top Box ") of communication equipment etc., but the present invention is not It is limited to this.In this communication network 100, the link from source node to via node is commonly known as the first hop link, from relaying The link of node to destination node is commonly known as the second hop link.

Exemplary embodiment of the invention propose a kind of for double bounce junction network based on single time slot relay selection Communication means, the method considers the interference from neighbor cell simultaneously, can effectively suppress to disturb and improve system spectrum Efficiency.Fig. 2 shows the schematic diagram of the junction network 200 according to exemplary embodiment of the invention, and wherein cell C is Relaying enhancement type district, cell C ' be the neighbor cell adjacent with cell C, i.e. the interfered cell of cell C.Junction network 200 by The source node S with M root antenna, destination node D with N root antenna and K scattered and fixing via node group Become, wherein each via node has L root antenna, this K via node auxiliary is from the transmission of source node S to destination node D.This In it is assumed that there is no direct link between source node S and destination node D, all transmission will via from source node S to relaying section First hop link of point and the second hop link from via node to destination node D, and at via node and destination node D Can obtain respectively the first hop channel status information (CSI) and second jump CSI, and scattered K via node can to from The message that source node S receives is processed and is forwarded the message to destination node D.For clarity of illustration, this Place it is also supposed that interfered cell C ' using from interference source node S ' to destination direct transmission, this destination can be relaying save Point, destination node D or other purposes node.

The design philosophy bag of the communication means based on single time slot relay selection that exemplary embodiment of the invention is proposed Include：

(1) source node sends message to all scattered relay node broadcasts in first time slot；

(2) and then, each time slot starting from second time slot, each candidate relay node (that is, in this timeslot may It is selected as the via node of optimal relay node, in the case of second time slot, candidate relay node is all via nodes； In the case of more than the second time slot, candidate relay node be except in a upper time slot selected optimal relay node it Outer all via nodes) the first hop channel status information is included to destination node transmission by pilot tone, with regard to little from neighbours The information of transmission request (RTS) of the information of the interference in area and a bit, this pilot transmission can be neglected to the occupancy of time slot Slightly；

(3) detecting after the pilot frequency information of each candidate relay node, destination node uses the present invention exemplary The double bounce channel status letter based on combination for the relay selection method (hereafter will be described in detail) that embodiment is proposed Cease and to select optimal relay node to assist the transmission from source node to destination node, and by broadcast to each candidate relay Node notifies whether this via node is selected as optimal relay node, and this broadcast is fed back the occupancy to time slot and can be ignored；

(4) message receiving from source node in a upper time slot is sent to purpose by selected optimal relay node Node, in the same time slot that selected via node is transmitted, source node sends the next one to all relay node broadcasts and disappears Breath；

(5) due to the half-duplex property of via node, selected optimal relay node is same send to destination node When it is impossible to receive source node in (4) to broadcast to the message of all via nodes in this timeslot, therefore will cannot function as down The candidate relay node of one slot transmission.

Fig. 3 and Fig. 4 describes the relaying according to exemplary embodiment of the invention based on single time slot relay selection in detail Communication means.In figure 3, " √ " represents that via node receives, in this time slot, the message sending from source node, and " Tx " represents relaying Node forwards message in this time slot to destination node D and does not receive the message of source node S transmission, and " X " represents via node at this Time slot is not as candidate relay node.

Fig. 4 shows the relay communication method according to exemplary embodiment of the invention based on single time slot relay selection Flow chart.As shown in figure 4, in step 401, in first time slot, source node S sends to all scattered K via nodes Message.Then, in step 402, in second time slot, each via node passes through pilot frequency information and sends bag to destination node D Include the information of the RTS of the first jump CSI, the information with regard to the interference from neighbor cell C ' and a bit, destination node D will The the first jump CSI obtaining from pilot frequency information is combined with the CSI locally obtaining, to obtain the CSI of combination.In an embodiment In, destination node D can obtain the first hop channel gain from the CSI of pilot frequency information, and the second jump with local acquisition by it Channel gain combinations, to obtain the channel gain of combination.In yet, destination node D can be based on from pilot tone letter The receipt signal noise ratio (SNR) to calculate the first jump for the CSI obtaining in breath, and the reception SNR with the second jump of local computing It is used in combination.Afterwards, destination node D can based on combination CSI, in one embodiment, based on combination channel gain, In another embodiment, at least based on the reception SNR of double bounce, all K via nodes select optimal relay node M, and notify via node m to be selected as optimal relay node by broadcast to all K via nodes.In step 402, the message receiving in first time slot is forwarded to destination node D but does not receive by selected optimal relay node m The message sending from source node S in this time slot, in second time slot, other non-selected via nodes stop being directed to purpose The message of node D forwards, and receives the message sending in this time slot from source node S.In step 403, in the T time slot (T ＞ 2), all via nodes in addition to being selected as optimal relay node in a upper time slot, that is, candidate relay node to Destination node D sends pilot frequency information, and destination node D selects optimal relay node m by this in these candidate relay node Good via node m forwards, to destination node D, the message that it receives in a upper time slot, optimal selected in current time slots Via node m does not receive the message sending in this time slot from source node S.In step 404, judge whether source node S have sent and want The all message sending, if it is judged that be no, then flow process returns to step 403, continue by source node S transmission message and Message is forwarded by selected optimal relay node；If it is judged that being yes, then in last time slot, source node S Stop sending, selected optimal relay node m forwards last message to destination node D, and so far this flow process terminates.

Fig. 5 shows that execution is according to the method for exemplary embodiment of the invention at destination node D in junction network Flow chart.First, in step 501, in the individual time slot of T (T >=2), destination node D connects at each candidate relay node Receive pilot frequency information, therefrom obtain the first hop channel status information from source node S to each candidate relay node.In step 502, destination node D obtains from each candidate relay node to the second hop channel status information of its own.Next, in step Rapid 503, destination node D is based on the first jump status information and the second jump status information and selects optimal relay node m.Herein, work as T When=2, each candidate relay node includes all of K via node, and as T ＞ 2, each candidate relay node is included except K-1 via node outside the optimal relay node selecting in T-1 time slot.Afterwards, in step 504, destination node D is permissible Receive the message that it receives from source node S in a upper time slot from optimal relay node.Then judge whether in step 505 to connect Receive all of message, if it is, flow process terminates, if it is not, then return to proceed to process.

In described above, only give the exemplary order executing the method and step according to embodiment of the present invention, But execution the method step order be not limited to this, any execution order that can realize embodiment of the present invention, including on State the conversion between step, combination comes within the meaning and range of equivalents be intended to be embraced therein.

It is described more fully below according to the relay selection method under an exemplary embodiment of the present invention.Assume every One via node, it is possible to obtain from the interference information of neighbor cell C ' and calculate reception SINR, and in destination node D Place can also obtain the interference information from neighbor cell C ' and calculate reception SINR.Following calculations are used at destination node D Method is selecting optimal relay node.

This algorithm is based on following thoughts：That is, if double bounce relay transmission is carried out by optimal relay node, then optimal At via node obtain receipt signal noise ratio (SNR) and at destination node obtain receptions SNR in minimum SNR and The ratio of the reception SNR of the interference from interference source obtaining at destination node is maximum, and that is, this trunk node selection standard is permissible It is expressed as：

$m=\underset{k}{\arg \max }\left\{\frac{\min \{{\mathrm{\γ}}_{s,k},{\mathrm{\γ}}_{k,D}\}}{{\mathrm{\γ}}_{s^{\′},k}}\right\}(k=1,...,K)---\left(1\right),$

Wherein, γ_{S, k}Represent the signal noise ratio (SNR) from source node S to k-th via node, γ_{K, D}Represent k-th Via node is to the SNR of destination node D, γ_{S ', k}Interference source S ' from the C ' of neighbor cell for the expression is to k-th via node SNR.

In order to reduce the impact of the interference from neighbor cell further, embodiment of the present invention also proposed and have selected After optimal relay node, source node S and selected optimal relay node m are carried out with the interference registration process of allied signal.

The basic thought of interference be aligned is to be divided into two independent subspaces, i.e. signal subspace by receiving message space And interference space.The performance of the program is directly determined by the distance between two sub-spaces.At each receiver, to dry After disturbing signal execution ZF (ZF) process, receive SINR maximization to obtain, useful signal will be made as much as possible sub with interference Orthogonal space.

Receive SINR in order to be lifted as much as possible, the interference be aligned that embodiment of the present invention proposes a kind of allied signal is calculated Method.The basic thought of this algorithm is：The signal from source node is made to fall into signal subspace as much as possible at receiving node, That is, make the signal strength signal intensity falling into signal subspace as large as possible and signal strength signal intensity that is making to fall into interference space as much as possible Little, the signal simultaneously becoming interference both falls within interference space as far as possible.In the algorithm, come by using weighting parameters ω So that it maximizes, the reception SINR at the receiving node when expression formula (2) is maximum reaches maximum for adjustment expressions below (2)：

$H_{m,k}{V}_m{V}_m^H{H}_{m,k}^H+H_{S^{\′},k}{V}_{S^{\′}}{V}_{S^{\′}}^H{H}_{S^{\′},k}^H-\mathrm{\ω}{H}_{S,k}{V}_S{V}_S^H{H}_{S,k}^H---\left(2\right),$

Wherein, H_{S, k}And H_{S ', k}It is that source node S and interference source S ' arrive kth (k=1 ..., K, k ≠ m) individual via node respectively Channel matrix, H_{M, k}For the channel matrix of the non-selected via node of selected optimal relay node m to k-th, V_s, V_s′And V_mIt is the pre-coding matrix of source node S, interference source S ' and selected optimal relay node m respectively,Deng in H table Show conjugate transposition.Therefore, interference space U_kColumn vector be expression formula (2) L-d main characteristic vector, i.e. corresponding to The characteristic vector of L-d big characteristic value, to meet the requirement making SINR maximum, wherein L is the antenna number of via node, its Equal to the characteristic value number of expression formula (2), d is the data flow number of system transfers, and it is equal to V_mColumns.

Source node S is become with the pre-coding matrix design of selected optimal relay node m so that source node S and relaying save The interference that point m causes at non-selected via node falls into interference space U_k, k ≠ m, and make in selected The signal receiving at node m that continues falls into and U as far as possible_kOrthogonal subspace.Accordingly, selected optimal relay node m is pre- Encoder matrix V_mCan be determined that：

$V_m=\underset{{\hat{V}}_m}{\arg \min }\underset{k=1,k\≠m}{\overset{K}{\mathrm{\Σ}}}{\left|\right|H_{m,k}{\hat{V}}_m,U_k\left|\right|}_M^2---\left(3\right).$

It is hereby achieved that optimum transmission pre-coding matrix V at selected optimal relay node m_mRow beD non-master (least dominant) characteristic vector, i.e. corresponding to d minimum feature The characteristic vector of value.Similarly, using with select V_mSimilar technology, the pre-coding matrix V of source node S_sCan be determined that：

$V_S=\underset{{\hat{V}}_S}{\arg \min }\underset{k=1,k\≠m}{\overset{K}{\mathrm{\Σ}}}{\left|\right|H_{S,k}{\hat{V}}_S,U_k^{\⊥}\left|\right|}_M^2---\left(4\right).$

It is hereby achieved that optimum transmission pre-coding matrix V at source node S_sBe classified asD Non-master characteristic vector.

Fig. 6 shows the flow process of the interference alignment algorithm of the allied signal according to an exemplary embodiment of the present invention Figure.First, in step 601, in the T time slot (T >=2), destination node D selects optimal relay node m by equation (1), And each via node in addition to optimal relay node m obtains the pre-coding matrix V of neighbor cell C '_s′.Afterwards in step 602, initialize pre-coding matrix V respectively at via node m and source node S_mAnd V_s.Then, in step 603, each not by The via node selecting determines its interference space U_k(k=1 ..., K, k ≠ m), U_kRow by expression formula (2) L-d main spy Levy vector composition.Afterwards, in step 604, via node m and source node S are using the U obtaining from step 603_kBy equation And (4) are updating pre-coding matrix V (3)_mAnd V_s.Then, in step 605, judge the pre-coding matrix updating in step 604 V_mAnd V_sWith the distance between the pre-coding matrix obtained in last iteration whether in predetermined threshold range, this threshold value E.g. 0.001.If the judged result of step 605 is yes, illustrate to V_mAnd V_sIterative calculation restrain, therefore in step Rapid 606 calculating entering next time slot, flow process return to step 601.If the judged result of step 605 is no, it is right to illustrate V_mAnd V_sIterative calculation also not converged, therefore flow process return to step 603, using update pre-coding matrix V_mAnd V_sBy table Reach formula (2) to redefine the interference space U of non-selected via node_kUntil obtaining stable V_mAnd V_s.

According to exemplary embodiment of the invention, in each time slot, after have selected optimal relay node every time, all Carry out the interference registration process of allied signal, thus can more effectively suppress to disturb to obtain the reception SINR of maximum.

Exemplary embodiment of the invention additionally provides a kind of relay 700 for junction network.Referring to Fig. 7, Fig. 7 Show the structured flowchart for the relay of junction network according to exemplary embodiment of the invention.As shown in fig. 7, should Relay 700 includes：Memory cell 701, stores for execution according to the allied signal of exemplary embodiment of the invention The program data of interference alignment algorithm, and realize other necessary program sums of the method according to embodiment of the present invention According to memory cell 701 can also be used as buffer to be sent and received signal；Processing unit 702, single for execution storage In unit 701, the program of storage is to carry out being directed at relevant process with the interference of allied signal and to realize according to embodiment party of the present invention Other necessity of the method for formula are processed；Receiving unit 703, for receipt signal, be for example used for from source node receive message and Receive the message from destination node broadcast；Transmitting element 704, for sending signal, for example, sends pilot frequency information to destination node, Forward the message that it receives from source node in a upper time slot to destination node in one time slot.

Exemplary embodiment of the invention additionally provides a kind of communicator 800 for junction network.Referring to Fig. 8, Fig. 8 Show the structured flowchart of the communicator according to exemplary embodiment of the invention.This communicator can be for example that user sets Standby.As shown in figure 8, this communicator 800 includes：Memory cell 801, stores for execution according to the exemplary embodiment party of the present invention The program data of the relay selection algorithm of formula, and realize other necessary program according to the method for embodiment of the present invention and Data, memory cell 801 can also be used as buffer to be sent and received signal；Processing unit 802, for executing storage In unit 801, the program of storage is to carry out the process relevant with relay selection and to realize the method according to embodiment of the present invention Other necessity process, for example, for obtain from candidate relay node each to destination node second channel state letter Breath；And in select most preferably from candidate relay node at least based on the first channel condition information and second channel status information Continue node；Receiving unit 803, for receipt signal, for example, for each the reception pilot frequency information from candidate relay node, And receive, from optimal relay node, the message that it receives a upper time slot from source node in one time slot；Send single Unit 804, for sending signal, for example, sends broadcast to via node.

Memory cell 701,801 can be one or more memories, and have be applied to locally applied environment appoint What type, and can be realized using any suitable volatibility or nonvolatile data storage technology, such as it is based on and partly lead The storage component part of body, magnetic memory devices and system, optical memory device and system, read-only storage and removable storage Device.The program being stored in memory cell 701,801 can include programmed instruction or computer program code, programmed instruction or meter Calculation machine program code is when being executed by dependent processing unit so that device 700,800 is able to carry out task described herein.

Processing unit 702,802 can have any types being applied to locally applied environment, and can include conduct The all-purpose computer of non-restrictive example, special-purpose computer, microprocessor, digital signal processor (" DSP "), field programmable gate One of array (" FPGA "), special IC (" ASIC ") and the processor based on multi-core processor framework or many Individual.

The description done above in conjunction with accompanying drawing simply to illustrate that the present invention and exemplary be given.Those skilled in the art It is appreciated that can the principle based on the present invention described above different structures are proposed although these different structures not Specifically described herein or illustrate, but all embody the principle of the present invention and be included within its spirit and scope.Additionally, institute Have referring herein to example clearly mainly be served only for instruct purpose to help reader to understand principle and the inventor of the present invention The design of the promotion this area contributed, and it is not necessarily to be construed as limitation of the scope of the invention.Additionally, all herein mention this The statement of principle, aspect and embodiment of invention and its specific example comprise its equivalent.

Claims (27)

1. a kind of communication means for junction network, described junction network includes source node, destination node and multiple relaying section Point, methods described includes：

In one time slot：

Receive the pilot frequency information of each candidate relay node transmission at described destination node, wherein said pilot frequency information is at least Including the first channel condition information from described source node to corresponding candidate via node；

Obtain from described candidate relay node each to described destination node second channel status information；

Come from described candidate relay node at least based on described first channel condition information and described second channel status information Select optimal relay node；And

Receive the message that described optimal relay node receives in a upper time slot of one time slot from described source node.

2. method according to claim 1, wherein, for a time slot described candidate relay node include the plurality of In in via node, all in addition to the optimal relay node selected in a upper time slot of one time slot Continue node, and if a described upper time slot is first time slot, then described candidate relay node include all of described many Individual via node.

3. method according to claim 1, wherein, selects optimal relay node to include from described candidate relay node： Obtain the first channel gain and second channel respectively from described first channel condition information and described second channel status information Gain, and to select from described candidate relay node at least based on described first channel gain and described second channel gain Described optimal relay node.

4. method according to claim 1, wherein, selects optimal relay node to include from described candidate relay node： First receipt signal noise ratio and second are obtained according to described first channel condition information and described second channel status information Receipt signal noise ratio, and at least based on described first receipt signal noise ratio and described second receipt signal noise ratio come from Described optimal relay node is selected in described candidate relay node.

5. method according to claim 1, wherein, described pilot frequency information is also included with regard to the interference from interference source node Information.

6. method according to claim 5, wherein, selects optimal relay node to include from described candidate relay node： First receipt signal noise ratio and second are obtained according to described first channel condition information and described second channel status information Receipt signal noise ratio, obtains the 3rd receipt signal noise ratio according to the information of the described interference with regard to disturbing source node, and And based on described first receipt signal noise ratio, described second receipt signal noise ratio and described 3rd receipt signal noise ratio Lai Described optimal relay node is selected from described candidate relay node.

7. method according to claim 6, wherein, realizes the selection of described optimal relay node by following formula：

$\begin{array}{cc}m=\underset{k}{\arg \max }\left\{\frac{\min \{{\mathrm{\γ}}_{s,k},{\mathrm{\γ}}_{k,D}\}}{{\mathrm{\γ}}_{s^{\′},k}}\right\}& (k=1,\mathrm{...},K)\end{array},$

Wherein, γ_s,kRepresent the receipt signal noise ratio from described source node to k-th via node, γ_k,DRepresent from k-th Via node is to the receipt signal noise ratio of described destination node, γ_s',kRepresent from described interference source node to k-th relaying section The receipt signal noise ratio of point, K represents the number of the plurality of via node.

8. method according to claim 1, wherein, described destination node passes through broadcast to the plurality of via node Notify selected optimal relay node.

9. a kind of trunking method for junction network, described junction network includes source node, destination node and multiple relaying section Point, methods described includes：

In one time slot, receive the message of described source node broadcast at each candidate relay node；And

In the next time slot of one time slot：

Send pilot frequency information to described destination node at each described candidate relay node, wherein said pilot frequency information is at least Including the first channel condition information from described source node to corresponding via node；

Receive the message from the broadcast of described destination node, described message at least includes being selected as most preferably with regard to which via node The information of via node；And

Its message receiving from described source node in a upper time slot is forwarded to described by selected optimal relay node Destination node.

10. method according to claim 9, wherein, for a time slot described candidate relay node include described many In the individual via node, relaying in addition to the optimal relay node selected in a upper time slot of one time slot Node, and if a described upper time slot is first time slot, then described candidate relay node include all of the plurality of Via node.

11. methods according to claim 9, wherein, described optimal relay node is forwarding from institute to described destination node State the message not received in the time slot of the message that source node receives from described source node.

12. methods according to claim 9, further include：

The dry of allied signal is executed in being not selected in the plurality of via node at the via node of optimal relay node Disturb registration process.

13. methods according to claim 12, the interference registration process of wherein said allied signal include by following formula Lai Determine the interference space U of non-selected via node_k：

$H_{m,k}{V}_m{V}_m^H{H}_{m,k}^H+H_{S^{\′},k}{V}_{S^{\′}}{V}_{S^{\′}}^H{H}_{S^{\′},k}^H-{\mathrm{\ωH}}_{S,k}{V}_S{V}_S^H{H}_{S,k}^H---\left(1\right)$

Wherein, m represents the numbering of selected optimal relay node, V_mRepresent the precoding square of selected optimal relay node Battle array, k represents the numbering of any one via node in addition to selected optimal relay node, H_S,kBe source node arrive except The channel matrix of any one via node outside selected optimal relay node, H_m,kIt is selected optimal relay node To the channel matrix of any one via node other, H_S',kBe interference source node to except selected optimal relay node it The channel matrix of any one outer via node, V_SAnd V_S'It is source node and the pre-coding matrix of interference source node respectively, ω is Weight coefficient, H represents conjugate transposition,

Wherein, described interference space U_kColumn vector be the corresponding characteristic vector of L-d eigenvalue of maximum with expression formula (1), Wherein L is the characteristic value number of expression formula (1), and d is V_mColumn vector number.

14. methods according to claim 13, the matrix V that prelists of wherein said source node_SWith selected best relay section The matrix V that prelists of point_mDetermined by following two equatioies：

$V_S=\underset{{\hat{V}}_S}{\arg \min }\underset{k=1,k\≠m}{\overset{K}{\Σ}}\left|\right|H_{S,k}{\hat{V}}_S,U_k^{\⊥}|{|}_M^2$

$V_m=\underset{{\hat{V}}_m}{\arg \min }\underset{k=1,k\≠m}{\overset{K}{\Σ}}\left|\right|H_{m,k}{\hat{V}}_m,U_k|{|}_M^2.$

A kind of 15. communicators for junction network, described junction network includes source node, destination node and multiple relaying section Point, described communicator is used at described destination node, and described communicator includes：

Receiving unit, described receiving unit is arranged to receive the pilot frequency information of each candidate relay node transmission, wherein Described pilot frequency information at least includes the first channel condition information from described source node to corresponding candidate via node；And one Receive, from optimal relay node, the message that it receives a upper time slot from described source node in individual time slot；

Processing unit, described processing unit be arranged to obtain from described candidate relay node each to described purpose section The second channel status information of point；And come at least based on described first channel condition information and described second channel status information Described optimal relay node is selected from described candidate relay node.

16. communicators according to claim 15, wherein, for a time slot candidate relay node include described many In individual via node, all in addition to the optimal relay node selected in a upper time slot of one time slot Via node, and if a wherein described upper time slot is first time slot, described candidate relay node includes all of The plurality of via node.

17. communicators according to claim 15, wherein, described processing unit be further configured for：From described The first channel gain and second channel gain is obtained respectively in first channel condition information and described second channel status information, with And come described in selection from described candidate relay node at least based on described first channel gain and described second channel gain Good via node.

18. communicators according to claim 15, wherein, described processing unit be further configured for：According to institute State the first channel condition information and described second channel status information to believe to obtain the first receipt signal noise ratio and second and to receive Number noise ratio, and come from described time at least based on described first receipt signal noise ratio and described second receipt signal noise ratio Select and in via node, select described optimal relay node.

19. communicators according to claim 15, wherein, described pilot frequency information is also included with regard to from interference source node Interference information.

20. communicators according to claim 19, wherein, described processing unit be further configured for：According to institute State the first channel condition information and described second channel status information to believe to obtain the first receipt signal noise ratio and second and to receive Number noise ratio, obtains the 3rd receipt signal noise ratio according to the described information with regard to the interference from interference source node, and Based on described first receipt signal noise ratio, described second receipt signal noise ratio and described 3rd receipt signal noise ratio come from Described optimal relay node is selected in described candidate relay node.

21. communicators according to claim 20, wherein, described processing unit is further configured for by following formula Realize the selection of described optimal relay node：

$\begin{array}{cc}m=\underset{k}{\arg \max }\left\{\frac{\min \{{\mathrm{\γ}}_{s,k},{\mathrm{\γ}}_{k,D}\}}{{\mathrm{\γ}}_{s^{\′},k}}\right\}& (k=1,\mathrm{...},K)\end{array}$

Wherein, γ_s,kRepresent the receipt signal noise ratio from described source node to k-th via node, γ_k,DRepresent in k-th Continue node to the receipt signal noise ratio of described destination node, γ_s',kRepresent from described interference source node to k-th via node Receipt signal noise ratio, K represents the number of the plurality of via node.

22. communicators according to claim 15, further include transmitting element, and described transmitting element is arranged to Send broadcast to the plurality of via node to notify selected optimal relay node.

A kind of 23. relays for junction network, described junction network includes source node, destination node and multiple relaying section Point, described relay is used at each described via node, and described relay includes：

Transmitting element, described transmitting element is arranged to send pilot frequency information, wherein said pilot tone letter to described destination node Breath at least include from described source node to described relay corresponding to via node the first channel condition information；And such as Via node corresponding to really described relay is selected as optimal relay node in one time slot, then in this timeslot to The message that described destination node forwarding receives from described source node in a upper time slot；And

Receiving unit, described receiving unit is arranged to receive message from described source node；And receive from described purpose section The message of point broadcast, described message at least includes which via node being selected as the information of optimal relay node with regard to.

24. relays according to claim 23, wherein, described receiving unit is configured to, if described Via node corresponding to relay is selected as optimal relay node in one time slot, then do not receive in this timeslot Message from described source node.

25. relays according to claim 23, further include processing unit, and described processing unit is configured to, If the via node corresponding to described relay is not selected for optimal relay node in one time slot, in this time slot The interference registration process of middle execution allied signal.

26. relays according to claim 25, described processing unit is configured to, when described relay When corresponding via node is not selected for optimal relay node, determine interference space U by following formula_k：

$H_{m,k}{V}_m{V}_m^H{H}_{m,k}^H+H_{S^{\′},k}{V}_{S^{\′}}{V}_{S^{\′}}^H{H}_{S^{\′},k}^H-{\mathrm{\ωH}}_{S,k}{V}_S{V}_S^H{H}_{S,k}^H---\left(2\right)$

Wherein, m represents the numbering of selected optimal relay node, V_mRepresent the precoding square of selected optimal relay node Battle array, k represents the numbering of any one via node in addition to selected optimal relay node, H_S,kBe source node arrive except The channel matrix of any one via node outside selected optimal relay node, H_m,kIt is selected optimal relay node To the channel matrix of other any one via nodes, H_S',kIt is interference source node in addition to selected optimal relay node Any one via node channel matrix, V_SAnd V_S'It is source node and the pre-coding matrix of interference source node respectively, ω is to add Weight coefficient, H represents conjugate transposition,

Wherein, described interference space U_kColumn vector be to be source node and interference source section the most respectively with the L-d of expression formula (2) The pre-coding matrix of point, the corresponding characteristic vector of big characteristic value, the wherein characteristic value number of L expression formula (2), d is V_mRow to Amount number.

27. relays according to claim 26, described processing unit is configured to, when described relay When corresponding via node is not selected for optimal relay node, determine prelisting of described source node by following two equatioies Matrix V_SThe matrix V that prelists with selected optimal relay node_m：

$V_S=\underset{{\hat{V}}_S}{\arg \min }\underset{k=1,k\≠m}{\overset{K}{\Σ}}\left|\right|H_{S,k}{\hat{V}}_S,U_k^{\⊥}|{|}_M^2$

$V_m=\underset{{\hat{V}}_m}{\arg \min }\underset{k=1,k\≠m}{\overset{K}{\Σ}}\left|\right|H_{m,k}{\hat{V}}_m,U_k|{|}_M^2.$