CN106413029B - A kind of more relay selection methods for decoding forwarding bidirectional relay system - Google Patents

A kind of more relay selection methods for decoding forwarding bidirectional relay system Download PDF

Info

Publication number
CN106413029B
CN106413029B CN201610824531.1A CN201610824531A CN106413029B CN 106413029 B CN106413029 B CN 106413029B CN 201610824531 A CN201610824531 A CN 201610824531A CN 106413029 B CN106413029 B CN 106413029B
Authority
CN
China
Prior art keywords
relay
source point
subset
relaying
point
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.)
Active
Application number
CN201610824531.1A
Other languages
Chinese (zh)
Other versions
CN106413029A (en
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.)
Chongqing University
Original Assignee
Chongqing University
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 Chongqing University filed Critical Chongqing University
Priority to CN201610824531.1A priority Critical patent/CN106413029B/en
Publication of CN106413029A publication Critical patent/CN106413029A/en
Application granted granted Critical
Publication of CN106413029B publication Critical patent/CN106413029B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Radio Relay Systems (AREA)

Abstract

The invention discloses a kind of more relay selection methods for decoding forwarding bidirectional relay system.This method comprises: source point 1 and source point 2 mutually pass data using several relay points, it will be properly received the bi-directional relaying composition candidate relay subset of data transmitted by two source points simultaneously;The channel capacity weighted value that source point 1 and source point 2 are respectively relayed into candidate relay subset is calculated separately, after channel capacity weighted value summation, carries out descending descending sort;It selects relaying corresponding to top n channel capacity weighted value to enter from the candidate relay subset after sequence to have chosen after subset;According to normalization thresholding, from the remaining relaying of candidate relay subset, continue to select to relay to enter to have chosen after subset;Finally, the source point data received are respectively sent to source point 1 and source point 2 by the relay point for having chosen stepchild to concentrate, the data completed between source point are mutually passed.The method have the characteristics that the diversity order of Turbo Detection for Cooperative Communication is effectively increased, the situation out-of-date especially suitable for channel state information in Practical Project.

Description

A kind of more relay selection methods for decoding forwarding bidirectional relay system
Technical field
The present invention relates to more relay selection methods of decoding forwarding bidirectional relay system.
Background technique
Communication for coordination technology is effective against the wireless fading channel of channel by space diversity.In in Turbo Detection for Cooperative Communication After due to data forwarding mode difference, it is divided into amplification forwarding relaying (forwarding after amplifying to reception signal) and decoding forwards Relaying (is re-encoded after being decoded to reception signal and is forwarded).
Each node usually transmits data in a manner of semiduplex in traditional Turbo Detection for Cooperative Communication, and this results in a data Symbol is sent to destination node from source node and needs to occupy two channels.In order to improve the availability of frequency spectrum, bi-directional relaying collaboration is logical Letter system is come into being.Since bidirectional relay system has apparent superiority compared with one-way junction system, receive increasingly More concerns.
In order to reduce the complexity of bidirectional relay system, cooperative relaying selection technique is widely adopted.Cooperative relaying selection Technology can be divided into single relay selection and more relay selections, basic thought be selected in numerous available relayings some or it is certain Relay node participates in data forwarding and is effective against the wireless fading channel of channel using space diversity, can not only improve information transmission Reliability, moreover it is possible to effectively improve the safety of transmission, current research is concentrated mainly on single relay selection.Due to single relaying choosing Selecting technology only selects a most suitable relaying for data forwarding, therefore compared with more relay selection technologies, single relay selection Computation complexity it is lower.However, the major defect of single relay selection method is not make full use of space diversity, especially exist Under time varying channel, the diversity gain of system is only 1.And actual channel is nearly all time varying channel, due to its propagation delay time, in Channel state information after the channel state information and relay forwarding data moment that select the moment is often inconsistent, i.e. channel status It is out-of-date that information produces, at this time can extreme influence relay selection scheme performance.Therefore, in practical engineering applications, need pair It is improved, to improve the diversity gain of system.
Summary of the invention
In view of the problems of above-mentioned prior art, the present invention is mentioned according to the characteristics of forwarding bidirectional relay system is decoded For a kind of more relay selection methods for decoding forwarding bidirectional relay system, this method effectively increases Turbo Detection for Cooperative Communication Diversity order, the situation out-of-date especially suitable for channel state information in Practical Project.
What the purpose of the present invention was achieved through the following technical solutions:
A kind of more relay selection methods for decoding forwarding bidirectional relay system characterized by comprising
A, source point 1 and source point 2 mutually pass data using several relay points, will be properly received 2 institute of source point 1 and source point simultaneously The bi-directional relaying for sending data forms candidate relay subset, if the relaying number of the candidate relay subset is K, and assumes to need The optimal relaying number first selected in this K relaying is N, meets K >=N;
B, the channel capacity of each relay point into candidate relay subset of source point 1 is calculated, and multiplied by weighting coefficient, obtains channel Capacity weighted value I1k, k=1 ..., K;Similarly, the channel capacity weighting of each relay point into candidate relay subset of source point 2 is calculated Value I2k
C, channel capacity weighted value sums to obtain Ik=I1k+I2k, and by IkCarry out descending descending sort;
D, according to the channel capacity weighted value after sequence, top n I is selected from candidate relay subsetkIt is corresponding it is N number of in It has chosen after an entrance after subset;
E, according to the n-th channel capacity weighted value I after sequenceN, multiplied by parameter μ ∈ [0,1], obtain normalization thresholding I(N)=μ IN.According to normalization thresholding, in remaining (K-N) a relaying of the candidate relay subset, continues selection relaying and enter It has chosen after subset;
F, the source point data received are respectively sent to source point 1 and source point 2 by the relay point for having chosen stepchild to concentrate, and are completed Data between source point mutually pass.
The step A further comprises:
A1, source point 1 and source point 2 click through row data using several bi-directional relayings and mutually pass;
A2, the bi-directional relaying that can be properly received data transmitted by source point 1 and source point 2 simultaneously form candidate relay subset, If the relaying number of the candidate relay subset is K, and assumes that needing the optimal relaying number first selected in this K relaying is N, Meet K >=N.
The step B further comprises:
B1, the channel capacity weighted value that source point 1 is respectively relayed into candidate relay subset is calculated, its calculation formula is I1k=| h2k|2log2(1+SNR|h1k|2), wherein | h1k|2With | h2k|2It is each into candidate relay subset to respectively indicate source point 1 and source point 2 The channel coefficients of relay point, SNR indicate the average signal-to-noise ratio of channel;
B2, the channel capacity weighted value that source point 2 is respectively relayed into candidate relay subset is calculated, its calculation formula is I2k=| h1k|2log2(1+SNR|h2k|2)。
The step E further comprises:
N-th channel capacity weighted value I after E1, sequenceN, multiplied by parameter μ ∈ [0,1], obtain normalization thresholding I(N)= μIN
In E2, candidate relay subset the channel capacity weighted value of remaining (K-N) a relaying successively with I(N)Compare, if greatly In or be equal to I (N), then relaying corresponding to the channel capacity weighted value enters and has chosen after subset;If be less than I (N), then in this It has chosen after not can enter after subset.
Detailed description of the invention
Fig. 1 is the schematic diagram of the method for the invention
Fig. 2 is the basic flow chart of the method for the invention
Specific embodiment
The present invention provides a kind of more relay selection methods for decoding forwarding bidirectional relay system.
Basic ideas of the invention are: source point 1 and source point 2 mutually pass data using several relay points, will be correct simultaneously Receive the bi-directional relaying composition candidate relay subset of data transmitted by two source points;Source point 1 and source point 2 are calculated separately into candidate Stepchild concentrates the channel capacity weighted value of each relaying, after channel capacity weighted value summation, carries out descending descending Sequence;From the candidate relay subset after sequence select top n channel capacity weighted value corresponding to relaying enter chosen after Subset;According to normalization thresholding, from the remaining relaying of candidate relay subset, continue to select to relay to enter to have chosen after subset; Finally, the source point data received are respectively sent to source point 1 and source point 2 by the relay point for having chosen stepchild to concentrate, source point is completed Between data mutually pass.This method effectively increases the diversity order of Turbo Detection for Cooperative Communication, especially suitable for channel in Practical Project The out-of-date situation of status information.
Basic principle of the invention is as follows:
Assuming that including source point 1, source point 2 and M relay node in bidirectional relay system, it is denoted as Rm, m=0,1 ..., M-1. Assuming that needing mutually to send data between source point 1 and source point 2, and multiple relay nodes are selected from M relay node, for counting According to forwarding due to actual channel shadow fading it is serious, therefore assume between source point 1 and source point 2 without direct transmission link.
Data exchange between source point 1 and source point 2 needs two time slots.First time slot, source point 1 and source point 2 are sent out respectively The number of delivering letters x1And x2To M relay node, then any relay point RmThe signal received can indicate are as follows:Wherein, P1And P2Respectively indicate the data transmission power of source point 1 and source point 2;h1mIt indicates Source point 1 and RmBetween channel, h2mIndicate source point 2 and RmBetween channel;wmIndicate that mean value is zero, variance N0Additivity it is multiple White Gaussian noise.Assuming that channel meets reciprocity, and source point 1 and source point 2 eliminate self-interference, then in second time slot, Source point 1 and source point 2 receive the signal of relay forwarding.
The basic flow chart of more relay selection methods of the present invention is as shown in Fig. 2, include the following steps:
Step 20: source point 1 and source point 2 mutually pass data using several relay points, will be properly received source point 1 and source simultaneously The bi-directional relaying of data transmitted by point 2 forms candidate relay subset, executes step 21;
Step 21: setting the relaying number of candidate relay subset as K, execute step 22;
Step 22: calculating the channel capacity weighted value that source point 1 is respectively relayed into candidate relay subset, its calculation formula is I1k =| h2k|2log2(1+SNR|h1k|2), wherein | h1k|2With | h2k|2Source point 1 and source point 2 are respectively indicated into candidate relay subset The channel coefficients of each relay point, k=1 ..., K, SNR indicate the average signal-to-noise ratio of channel, execute step 23;
Step 23: calculating the channel capacity weighted value that source point 2 is respectively relayed into candidate relay subset, its calculation formula is I2k =| h1k|2log2(1+SNR|h2k|2), execute step 24;
Step 24: channel capacity weighted value sums to obtain Ik=I1k+I2k, and by IkDescending descending sort is carried out, Execute step 25;
Step 25: according to the channel capacity weighted value after sequence, top n I is selected from candidate relay subsetkCorresponding N number of relaying, which enters, have been chosen after subset, and step 26 is executed;
Step 26: the n-th channel capacity weighted value after sequence obtains normalization thresholding I multiplied by parameter μ ∈ [0,1](N), Execute step 27;
Step 27: the channel capacity weighted value of (K-N) a relaying remaining in candidate relay subset successively with I(N)Compare, If more than or be equal to I (N), then relaying corresponding to the channel capacity weighted value enters and has chosen after subset;If be less than I (N), then It not can enter and chosen after subset;Execute step 28;
Step 28: the source point data received are respectively sent to source point 1 and source point by the relay point for having chosen stepchild to concentrate 2, the data completed between source point mutually pass.

Claims (1)

1. a kind of more relay selection methods of the bidirectional relay system for decoding forwarding, first select N number of optimal relaying, further according to Normalization thresholding continues selection relaying, has been chosen with generating after subset characterized by comprising
A, source point 1 and source point 2 mutually pass data using several relay points, will be properly received simultaneously transmitted by source point 1 and source point 2 The bi-directional relaying of data forms candidate relay subset, if the relaying number of the candidate relay subset is K, and assumes to need in this K The optimal relaying number first selected in a relaying is N, meets K >=N;
B, the channel capacity log of each relay point into candidate relay subset of source point 1 is calculated2(1+SNR|h1k|2), and multiplied by channel system Number | h2k|2, obtain channel capacity weighted value I1k=| h2k|2log2(1+SNR|h1k|2), wherein k=1 ..., K, | h1k|2With | h2k|2The channel coefficients of source point 1 and source point 2 each relay point into candidate relay subset are respectively indicated, SNR indicates being averaged for channel Signal-to-noise ratio;Similarly, the channel capacity weighted value I of each relay point into candidate relay subset of source point 2 is calculated2k=| h1k|2log2(1+ SNR|h2k|2);
C, channel capacity weighted value sums to obtain Ik=I1k+I2k, and by IkCarry out descending descending sort;
D, according to the channel capacity weighted value after sequence, top n I is selected from candidate relay subsetkCorresponding N number of relay point Into having chosen after subset;
E, by the n-th channel capacity weighted value I after sequenceN, multiplied by parameter μ ∈ [0,1], obtain normalization thresholding I(N)=μ IN, By the channel capacity weighted value of (K-N) remaining in candidate relay subset a relaying successively with I(N)Compare, if more than or equal to I(N), then relaying corresponding to the channel capacity weighted value enters and has chosen after subset;If being less than I(N), then the relaying not can enter It has chosen after subset;
F, the source point data received are respectively sent to source point 1 and source point 2 by the relay point for having chosen stepchild to concentrate, and complete source point Between data mutually pass.
CN201610824531.1A 2016-09-14 2016-09-14 A kind of more relay selection methods for decoding forwarding bidirectional relay system Active CN106413029B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610824531.1A CN106413029B (en) 2016-09-14 2016-09-14 A kind of more relay selection methods for decoding forwarding bidirectional relay system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610824531.1A CN106413029B (en) 2016-09-14 2016-09-14 A kind of more relay selection methods for decoding forwarding bidirectional relay system

Publications (2)

Publication Number Publication Date
CN106413029A CN106413029A (en) 2017-02-15
CN106413029B true CN106413029B (en) 2019-10-29

Family

ID=57997104

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610824531.1A Active CN106413029B (en) 2016-09-14 2016-09-14 A kind of more relay selection methods for decoding forwarding bidirectional relay system

Country Status (1)

Country Link
CN (1) CN106413029B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107124749A (en) * 2017-05-09 2017-09-01 北京汇通金财信息科技有限公司 The relay selection method and device of a kind of full duplex relaying system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20130031651A (en) * 2011-09-21 2013-03-29 아주대학교산학협력단 Method for selective distributed beamforming in two way relaying system
CN105007105A (en) * 2015-05-26 2015-10-28 广西师范大学 Method for antenna selection and relay selection based on node classification
CN105282815A (en) * 2015-09-23 2016-01-27 广西师范大学 Multiple relay selection method in DF cooperative network
CN105517096A (en) * 2015-09-30 2016-04-20 河南科技大学 Relay selection method for multi-relay amplification forwarding collaborative network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20130031651A (en) * 2011-09-21 2013-03-29 아주대학교산학협력단 Method for selective distributed beamforming in two way relaying system
CN105007105A (en) * 2015-05-26 2015-10-28 广西师范大学 Method for antenna selection and relay selection based on node classification
CN105282815A (en) * 2015-09-23 2016-01-27 广西师范大学 Multiple relay selection method in DF cooperative network
CN105517096A (en) * 2015-09-30 2016-04-20 河南科技大学 Relay selection method for multi-relay amplification forwarding collaborative network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
A Simple Nth Best-Relay Selection Criterion for Opportunistic Two-Way Relay Networks under Outdated Channel State Information;Jinglan Ou,et al.;《KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS》;20141031;第8卷(第10期);全文 *

Also Published As

Publication number Publication date
CN106413029A (en) 2017-02-15

Similar Documents

Publication Publication Date Title
CN103763015B (en) It is a kind of to have transmission antenna system of selection in the multiple antennas junction network of direct connected link
CN109039411B (en) One-way full-duplex MIMO relay antenna selection safety transmission method
CN106921418B (en) Relay cooperative precoding method based on non-ideal channel state information
Som et al. End-to-end BER analysis of space shift keying in decode-and-forward cooperative relaying
CN110808764B (en) Joint information estimation method for large-scale MIMO relay system
Ji et al. Partial inter-relay interference cancellation in two path successive relay network
CN105940625A (en) Base station device, wireless communication system, and communication method
Lai et al. End-to-end virtual MIMO transmission in ad hoc cognitive radio networks
WO2009063425A1 (en) Bi directional decode and forward relay
CN108111439B (en) Non-iterative channel estimation method in bidirectional MIMO relay system
Liu et al. A threshold-based hybrid relay selection scheme
CN106413029B (en) A kind of more relay selection methods for decoding forwarding bidirectional relay system
CN105791203B (en) A kind of non-orthogonal multiple access downlink signal acceptance method
CN108462562B (en) Space-time precoding method of relay selection system based on log-likelihood ratio
CN105940700A (en) Base station device, wireless communication system, and communication method
CN107733514B (en) Combined input signal MIMO wireless communication receiving terminal and signal detection method thereof
CN105490721B (en) A kind of estimation retransmission method of full duplex traffic cooperative communication network
CN104994043B (en) Satellite mobile communication adaptive cooperation transmission method based on node selection
Vaze et al. Cascaded orthogonal space–time block codes for wireless multi-hop relay networks
CN107017930B (en) Precoding method of MIMO (multiple input multiple output) bidirectional relay system with channel feedback delay and estimation error
CN103401657A (en) Non-differential distributed space-time coding method for cooperative communication partially-coherent network
Gao et al. On communication protocol and beamforming design for amplify-and-forward N-way relay networks
CN108900225A (en) A kind of bi-directional full-duplex MIMO relay antenna selection safe transmission method
CN102665226A (en) DF (decoded-and-forward) protocol based full duplex relay method of similar repeater
Zhang et al. Transmit antenna selection in the Alamouti-coded MIMO relay systems

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant