CN101562863A - Method and device for relay selection - Google Patents

Method and device for relay selection Download PDF

Info

Publication number
CN101562863A
CN101562863A CNA2009100851987A CN200910085198A CN101562863A CN 101562863 A CN101562863 A CN 101562863A CN A2009100851987 A CNA2009100851987 A CN A2009100851987A CN 200910085198 A CN200910085198 A CN 200910085198A CN 101562863 A CN101562863 A CN 101562863A
Authority
CN
China
Prior art keywords
node
source node
source
destination
destination node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CNA2009100851987A
Other languages
Chinese (zh)
Inventor
梁慜
董飞
王亚峰
杨大成
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CNA2009100851987A priority Critical patent/CN101562863A/en
Publication of CN101562863A publication Critical patent/CN101562863A/en
Pending legal-status Critical Current

Links

Images

Abstract

The invention discloses a method for relay selection. The method comprises the following steps that a target node d determines to enter a relay mode; a relay node sj figures out reachable rate, compares the reachable rate with target rate, determines a source node set Tj that the relay node sj can help, and feeds the set back to the target node d; the target node d figures out the potential NT#-(i) of the Tj, determines a relay node set Ri which can help a source node si according to the Tj, and figures out the potential NR#-(i) of the Ri; the target node d figures out the priority ci of the source node si; a relay node s lambda is assigned to a source node sk; and the target node d broadcasts the assignment situation of a relay node sj. The invention also discloses a device for relay selection. The device comprises a unit for determining to enter the relay mode, a unit for determining the Tj and the Ri, a unit for calculating the NT#-(j) and the NR#-(i), a unit for calculating the ci, a unit for assigning the relay nodes, and a unit for broadcasting the assignment situation of the relay nodes. The proposal of the invention can obtain excellent outage probability, fairness and capacity performance at a low cost.

Description

A kind of method of relay selection and device
Technical field
The present invention relates to the mobile communication technology field, relate in particular to a kind of method and device of relay selection.
Background technology
OFDMA (Orthogonal Frequency Division Multiple Access, OFDM), MIMO (Multiple Input Multiple Output, multiple-input and multiple-output) though waits the use of some key technologies can promote spectrum efficiency to a certain extent and eliminate channel impairments, but under the legacy cellular planar network architecture, densely populated areas particularly, the 4th third-generation mobile communication two-forty, the requirement of spectral efficient and ubiquitous covering still is difficult to accomplished.For increasing the base station, the introducing of communication for coordination can promote capacity originally with lower one-tenth, enlarged to cover and the raising reliability.
Communication for coordination can effectively promote network performance, but its performance gain height depends on the selection of via node.Divide according to the relaying number of selecting, relay selection is divided into two classes, many relay selection and single relay selection.A former main cooperative approach that is based on STC (Space-Time Coded, distributed Space Time Coding) of using; The latter can obtain the diversity-multiplexing trade off performance identical with distributed STC cooperative approach, and does not need complicated STC design.Divide according to the relay selection mode, relay selection is divided into centralized and distributed two kinds.Though the former excellent performance needs huge information interaction, expense is excessive; Though latter's expense is very little, under multi-user's scene, be difficult to realize, cause bigger performance loss easily.
The relay selection method that is used for the multi-user collaborative wireless network at present is with centralized in the majority, as, based on Min-Max (minimum-maximum) method, PF (Proportional Fairness, direct ratio justice) method and RR (Round-Robin, poll) method.Above method all is that existing methods is used again, does not take the characteristics of contract network into consideration, and need return all channel condition information to destination node, and expense is huge, is difficult to realize in practice.
Summary of the invention
The embodiment of the invention provides a kind of method and device of relay selection, to obtain excellent outage probability, fairness and volumetric properties with less expense.
The embodiment of the invention provides a kind of method of relay selection, comprising: destination node d is according to source node s iAnd the channel condition information between the destination node d
Figure A20091008519800061
Determine and enter repeater mode; Via node s jAccording to source node s iAnd the channel condition information between the destination node d
Figure A20091008519800062
Source node s iWith via node s jBetween channel condition information
Figure A20091008519800063
Via node s jAnd the channel condition information between the destination node d
Figure A20091008519800064
Calculate achievable rate, and itself and targeted rate are compared, determine via node s jThe source node set T that can help j, it is fed back to destination node d; Destination node d is according to T jCalculate T jGesture
Figure A20091008519800065
According to T jDetermine and to help source node s iVia node set R i, and according to R iCalculate R iGesture
Figure A20091008519800066
Destination node d basis
Figure A20091008519800067
With
Figure A20091008519800068
Calculate source node s iPriority c iPriority and the via node set that can help each source node according to each source node are source node s kDistribute via node s λDestination node d broadcasting via node s jDistribution condition.
The embodiment of the invention provides a kind of device of relay selection, comprising: judge to enter the repeater mode unit, be used for destination node d according to source node s iAnd the channel condition information between the destination node d
Figure A20091008519800069
Determine and enter repeater mode; Judge T jAnd R iThe unit is used for determining via node s under repeater mode jThe source node set T that can help j, it is fed back to destination node d, destination node is according to T jDetermine and to help source node s iVia node set R iCalculate With The unit is used for destination node d according to T jCalculate T jGesture
Figure A200910085198000612
According to R iCalculate R iGesture Calculate c iThe unit is used for destination node d basis
Figure A200910085198000614
With
Figure A200910085198000615
Calculate source node s iPriority c iDistribute the via node unit, be used for priority and the via node set that can help each source node, be source node s according to each source node kDistribute via node s λBroadcasting via node distribution condition unit is used for destination node d broadcasting via node s jDistribution condition.
The embodiment of the invention provides a kind of half distributed relay selection method, is optimization aim with the outage probability, compares with existing scheme, can obtain a reasonable compromise between performance and expense when guaranteeing fairness and improving capacity.
Description of drawings
Fig. 1 is the method for relay selection in the embodiment of the invention;
Fig. 2 is source node s in the embodiment of the invention kDistribute via node s λMethod;
Fig. 3 is the device of relay selection in the embodiment of the invention.
Embodiment
The embodiment of the invention provides a kind of method of relay selection.
As shown in Figure 1, the method for relay selection mainly comprises the steps:
Step 11, destination node d are according to source node s iAnd the channel condition information between the destination node d
Figure A20091008519800071
Determine and enter repeater mode.
Step 12, via node s jAccording to source node s iAnd the channel condition information between the destination node d
Figure A20091008519800072
Source node s iWith via node s jBetween channel condition information Via node s jAnd the channel condition information between the destination node d
Figure A20091008519800074
Calculate achievable rate, and itself and targeted rate are compared, determine via node s jThe source node set T that can help j, it is fed back to destination node d.
Step 13, destination node d are according to T jCalculate T jGesture
Figure A20091008519800075
According to T jDetermine and to help source node s iVia node set R i, and according to R iCalculate R iGesture
Step 14, destination node d basis
Figure A20091008519800077
With
Figure A20091008519800078
Calculate source node s iPriority c i
Step 15, according to the priority of each source node with can help the via node set of each source node, be source node s kDistribute via node s λ
Step 16, destination node d broadcasting via node s jDistribution condition.
As shown in Figure 2, be source node s kDistribute via node s λMethod mainly comprise the steps:
Step 21, judge that whether W is empty, if not, then execution in step 22, if then execution in step 25.
Step 22, renewal
Figure A20091008519800081
With
Figure A20091008519800082
If equal 0, assignment M+1 then.
Step 23, be source node s κ = arg max s i ∈ W c i Select via node s λ = arg min s j ∈ R κ N T j .
Step 24, with s kShift out W and T j, with s λShift out R i, i=1,2 ..., M, j=1,2 ..., M, execution in step 21.
Step 25, destination node d broadcasting via node s jDistribution condition.
The embodiment of the invention provides a kind of device of relay selection.
As shown in Figure 3, the device of relay selection comprises: judge to enter repeater mode unit 31, judgement T jUnit 32, calculating
Figure A20091008519800085
With Unit 33, calculating c iUnit 34, distribution via node unit 35, broadcasting via node distribution condition unit 36.
Judge to enter repeater mode unit 31, be used for destination node d according to source node s iAnd the channel condition information between the destination node d
Figure A20091008519800087
Determine and enter repeater mode.
Judge T jAnd R iUnit 32 is used for determining via node s under repeater mode jThe source node set T that can help j, it is fed back to destination node d, destination node is according to T jDetermine and to help source node s iVia node set R i
Calculate
Figure A20091008519800088
With
Figure A20091008519800089
Unit 33 is used for destination node d according to T jCalculate T jGesture
Figure A200910085198000810
According to R iCalculate R iGesture
Figure A200910085198000811
Calculate c iUnit 34 is used for destination node d basis
Figure A200910085198000812
With
Figure A200910085198000813
Calculate source node s iPriority c i
Distribute via node unit 35, be used for priority and the via node set that can help each source node, be source node s according to each source node kDistribute via node s λ
Broadcasting via node distribution condition unit 36 is used for destination node d broadcasting via node s jDistribution condition.
The embodiment of the invention provides a kind of half distributed formula relay selection method, is optimization aim with the outage probability, and can guarantees fairness and the raising capacity.Also between performance and expense, obtain a reasonable compromise simultaneously.When using special-purpose via node, when perhaps a via node can help the multiple source node for data forwarding, the relay selection method that the embodiment of the invention is described stood good.
Obviously, those skilled in the art can carry out various changes and modification to the embodiment of the invention and not break away from the spirit and scope of the present invention.Like this, if of the present invention these are revised and modification belongs within the scope of claim of the present invention and equivalent technologies thereof, then the present invention also is intended to comprise these changes and modification interior.

Claims (9)

1, a kind of method of relay selection is characterized in that, comprising:
Destination node d is according to source node s iAnd the channel condition information between the destination node d
Figure A2009100851980002C1
Determine and enter repeater mode;
Via node s jAccording to source node s iAnd the channel condition information between the destination node d
Figure A2009100851980002C2
Source node s iWith via node s jBetween channel condition information
Figure A2009100851980002C3
Via node s jAnd the channel condition information between the destination node d
Figure A2009100851980002C4
Calculate achievable rate, and itself and targeted rate are compared, determine via node s jThe source node set T that can help j, it is fed back to destination node d;
Destination node d is according to T jCalculate T jGesture According to T jDetermine and to help source node s iVia node set R i, and according to R iCalculate R iGesture
Figure A2009100851980002C6
Destination node d basis
Figure A2009100851980002C7
With
Figure A2009100851980002C8
Calculate source node s jPriority c i
Priority and the via node set that can help each source node according to each source node are source node s kDistribute via node s λ
Destination node d broadcasting via node s jDistribution condition.
2, the method for claim 1 is characterized in that, M source node arranged, and each source node can become the via node of other source nodes, and the note source node set is combined into W={s 1, s 2..., s M.
3, the method for claim 1 is characterized in that, source node s iTo destination node d, via node s jThe training sequence signal of broadcast request communication, destination node d, via node s jEstimate source node s according to the training sequence signal of receiving respectively iAnd the channel condition information between the destination node d
Figure A2009100851980002C9
Source node s iWith via node s jBetween channel condition information
Figure A2009100851980002C10
I=1,2 ..., M, j=1,2 ..., M.
4, the method for claim 1 is characterized in that, judges Whether satisfy targeted rate;
If, then entering the pattern of direct transferring, destination node d is to source node s i, via node s jThe broadcasting ack signal, i=1,2 ..., M, j=1,2 ..., M;
If not, then enter repeater mode, destination node d is to source node s i, via node s jBroadcasting NACK signal, i=1,2 ..., M, j=1,2 ..., M.
5, method as claimed in claim 4 is characterized in that, under the repeater mode, and via node s jNACK signal according to receiving estimates via node s jAnd the channel condition information between the destination node d
Figure A2009100851980003C2
Source node s according to the NACK signal extraction of receiving iAnd the channel condition information between the destination node d
Figure A2009100851980003C3
I=1,2 ..., M, j=1,2 ..., M.
6, the method for claim 1 is characterized in that, c i = ( P out , i ) ξ / N R i , ζ is the positive integer that is used for regulating outage probability and fairness, P Out, iBe source node s iOutage probability, i=1,2 ..., M.
7, the method for claim 1 is characterized in that, s κ = arg max s i ∈ W c i , s λ = arg min s j ∈ R κ N T j .
8, the method for claim 1 is characterized in that, is source node s kDistribute via node s λAfter, with s kShift out W and T j, with s λShift out R i, i=1,2 ..., M, j=1,2 ..., M judges whether W is empty;
If then finish relay selection, destination node d broadcasting via node s jDistribution condition;
If not, then upgrade
Figure A2009100851980003C7
With
Figure A2009100851980003C8
If equal 0, then assignment M+1 is new source node s again kDistribute new via node s λ
9, a kind of device of relay selection is characterized in that, comprising:
Judge to enter the repeater mode unit, be used for destination node d according to source node s iAnd the channel condition information between the destination node d
Figure A2009100851980003C9
Determine and enter repeater mode;
Judge T jAnd R iThe unit is used for determining via node s under repeater mode jThe source node set T that can help j, it is fed back to destination node d, destination node is according to T jDetermine and to help source node s iVia node set R i
Calculate
Figure A2009100851980004C1
With
Figure A2009100851980004C2
The unit is used for destination node d according to T jCalculate T jGesture
Figure A2009100851980004C3
According to R iCalculate R iGesture
Figure A2009100851980004C4
Calculate c iThe unit is used for destination node d basis
Figure A2009100851980004C5
With
Figure A2009100851980004C6
Calculate source node s iPriority c i
Distribute the via node unit, be used for priority and the via node set that can help each source node, be source node s according to each source node kDistribute via node s λ
Broadcasting via node distribution condition unit is used for destination node d broadcasting via node s jDistribution condition.
CNA2009100851987A 2009-06-04 2009-06-04 Method and device for relay selection Pending CN101562863A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNA2009100851987A CN101562863A (en) 2009-06-04 2009-06-04 Method and device for relay selection

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNA2009100851987A CN101562863A (en) 2009-06-04 2009-06-04 Method and device for relay selection

Publications (1)

Publication Number Publication Date
CN101562863A true CN101562863A (en) 2009-10-21

Family

ID=41221432

Family Applications (1)

Application Number Title Priority Date Filing Date
CNA2009100851987A Pending CN101562863A (en) 2009-06-04 2009-06-04 Method and device for relay selection

Country Status (1)

Country Link
CN (1) CN101562863A (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102545992A (en) * 2011-12-21 2012-07-04 北京邮电大学 Optimal relay selection and power distribution method of DF (decode-forward) relay system
WO2012145560A1 (en) * 2011-04-20 2012-10-26 Qualcomm Atheros, Inc. Selecting forwarding devices in wireless communication networks
US8614956B2 (en) 2011-03-10 2013-12-24 Qualcomm Incorporated Placement of wireless repeaters in a wireless communication network
WO2015096072A1 (en) * 2013-12-25 2015-07-02 华为技术有限公司 Method, apparatus and system for establishing cooperative communication
CN103052132B (en) * 2011-10-17 2017-05-10 北京邮电大学 Multi-hop relay path selection method and system
CN107959957A (en) * 2017-11-10 2018-04-24 江苏省邮电规划设计院有限责任公司 A kind of relay selection method for realizing LTE network resource fixed direction allocation
US10200937B2 (en) 2013-12-25 2019-02-05 Huawei Technologies Co., Ltd Message broadcast method, base station, and user equipment

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8614956B2 (en) 2011-03-10 2013-12-24 Qualcomm Incorporated Placement of wireless repeaters in a wireless communication network
WO2012145560A1 (en) * 2011-04-20 2012-10-26 Qualcomm Atheros, Inc. Selecting forwarding devices in wireless communication networks
CN103052132B (en) * 2011-10-17 2017-05-10 北京邮电大学 Multi-hop relay path selection method and system
CN102545992B (en) * 2011-12-21 2014-07-23 北京邮电大学 Optimal relay selection and power distribution method of DF (decode-forward) relay system
CN102545992A (en) * 2011-12-21 2012-07-04 北京邮电大学 Optimal relay selection and power distribution method of DF (decode-forward) relay system
WO2015096072A1 (en) * 2013-12-25 2015-07-02 华为技术有限公司 Method, apparatus and system for establishing cooperative communication
CN105009680A (en) * 2013-12-25 2015-10-28 华为技术有限公司 Method, apparatus and system for establishing cooperative communication
US9860927B2 (en) 2013-12-25 2018-01-02 Huawei Technologies Co., Ltd Method, apparatus, and system for establishing cooperative communication
US10200937B2 (en) 2013-12-25 2019-02-05 Huawei Technologies Co., Ltd Message broadcast method, base station, and user equipment
CN105009680B (en) * 2013-12-25 2019-04-19 华为技术有限公司 A kind of method, apparatus and system for establishing communication for coordination
US10674548B2 (en) 2013-12-25 2020-06-02 Huawei Technologies Co., Ltd. Method, apparatus, and system for establishing cooperative communication
CN107959957A (en) * 2017-11-10 2018-04-24 江苏省邮电规划设计院有限责任公司 A kind of relay selection method for realizing LTE network resource fixed direction allocation
CN107959957B (en) * 2017-11-10 2020-01-14 中通服咨询设计研究院有限公司 Relay selection method for realizing directional distribution of LTE network resources

Similar Documents

Publication Publication Date Title
Sheng et al. Energy efficiency and delay tradeoff in device-to-device communications underlaying cellular networks
CN101562863A (en) Method and device for relay selection
CN101877887B (en) Downlink transmission control method and device of cooperative multicast system
CN102882644B (en) The check processing of Downlink Control Information, detection method and device
CN101291169B (en) Selection method of wireless relay station
CN101686549B (en) Resource allocation method
CN102013905B (en) The method and apparatus of cooperative scheduling
CN101764681B (en) Feedback method, system and device of multi-cell channel quality information
CN107148759A (en) Controller for SUDA systems
CN106465410A (en) Methods and apparatus for signaling user allocations in multi-user wireless communication networks
CN103229572B (en) Dynamically multiple-input and multiple-output cell cluster
CN105191380A (en) Systems and methods for downlink frequency domain multiplexing transmissions
CN102158307A (en) Group resource allocation system and technique
CN107409037A (en) Non-contiguous channels distribution and binding for cordless communication network
CN101895991A (en) Cognitive radio system based on relay cooperative transmission and resource allocation method thereof
CN103781050A (en) Resource allocation method for cell edge D2D user
CN102868423A (en) Device and method for dedication of resources in system of multiple access with frequency division at single carrier
CN104468448A (en) Method for optimizing energy efficiency in OFDM multi-relay network
CN102647727B (en) Selection method of mixed cooperation cluster
CN109005592A (en) Power distribution method in single antenna NOMA system
CN112073974A (en) Unauthorized spectrum edge access and anti-interference method and device for cooperative terminal communication
CN102724157A (en) Union resource distributing method of improved-type multi-user OFDM (orthogonal frequency division multiplexing) DF (decoding-forwarding) system
Xu et al. XOR-assisted cooperative diversity in OFDMA wireless networks: Optimization framework and approximation algorithms
CN102958172B (en) Based on the resource allocation algorithm of proportional fairness in grouping MIMO-MC-CDMA system
CN102084672B (en) Method for coordinated multi point communication and device therefor

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Open date: 20091021