CN101860873A - Distributed relay selection method based on cross-layer information exchange - Google Patents

Distributed relay selection method based on cross-layer information exchange Download PDF

Info

Publication number
CN101860873A
CN101860873A CN201010179909A CN201010179909A CN101860873A CN 101860873 A CN101860873 A CN 101860873A CN 201010179909 A CN201010179909 A CN 201010179909A CN 201010179909 A CN201010179909 A CN 201010179909A CN 101860873 A CN101860873 A CN 101860873A
Authority
CN
China
Prior art keywords
relay
source node
timer
cooperating relay
cooperating
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
CN201010179909A
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.)
Nanjing Post and Telecommunication University
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing Post and Telecommunication 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 Nanjing Post and Telecommunication University filed Critical Nanjing Post and Telecommunication University
Priority to CN201010179909A priority Critical patent/CN101860873A/en
Publication of CN101860873A publication Critical patent/CN101860873A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)
  • Radio Relay Systems (AREA)

Abstract

The invention relates to a distributed relay selection method based on cross-layer information exchange, which comprises the following steps: firstly, obtaining the distributed selection protocol of the best cooperative relay according to the best selection criteria of the cooperative relay in the dynamic network environment, and providing a self-adaptive cooperative transmission scheme according to the wireless channel quality between the cooperative relay and a source node. Therefore, the method mainly comprises two parts: one part provides the best selection criteria of the cooperative relay in the dynamic network environment and the distributed selection protocol of the best cooperative relay, and the second part provides the self-adaptive cooperative transmission scheme according to the wireless channel quality between the cooperative relay and the source node, thereby effectively resisting against the wireless fading in the multi-user network environment.

Description

A kind of distributed relay system of selection based on cross-layer information exchange
Technical field
The present invention relates to new generation of wireless network (Adhoc, WSN and MESH) in opportunistic cooperation communicate by letter, especially a kind of distributed relay system of selection based on cross-layer information exchange (cross-layer information interaction) belongs to the technical field that wireless network signal is handled.
Background technology
Make a general survey of the whole development course of cordless communication network, promptly from analog to digital, mobile from being fixed to, from centralized to distributed, the multipath fading characteristic that wireless channel has all is to hinder that channel capacity increases and the one of the main reasons of service quality improvement all the time.MIMO technology based on space diversity thought has remarkable advantages aspect the anti-channel multi-path decline, and can under the prerequisite that does not increase power and frequency spectrum, increase substantially channel capacity, the popular protocol of being communicated by letter by new generation of wireless is adopted gradually, but still existing problems.Specifically, existing many antennas mostly are arranged on the base station end, yet portable terminal is difficult to settle many antennas usually owing to the harsh requirement to volume, quality and power consumption.For this reason, people such as Sendonaris have proposed the conceptual model of collaboration communication, its basic thought is the formal construction " virtual multi-antenna array " by shared antenna each other and other Internet resources between a plurality of users, and in conjunction with the cooperation of distributed treatment generation definitely, thereby can obtain further performance gain, improve network capacity.
Collaboration communication is as a kind of emerging radio network technique, its current most of work all are the concrete cooperation schemes of research, as: the cooperation scheme that Barbarossa proposes, and the coding cooperative (Coded Cooperation) of Hunter proposition based on distributed space time packet (Distributed Space-Time Block Code).About " who and who cooperation ", promptly the selection problem of cooperating relay fails effectively to be solved so far, and this is to concern one of key issue that can the collaboration communication technology practicability.In addition, because the time-varying characteristics of wireless communications environment, whom selects cooperate with source node belong to probability event, in other words, all nodes in the network all have an opportunity to be chosen as best cooperating relay, and its key depends on current state information of channel between network node and the source node (Channel State Information).Based on this 2 point, the present invention proposes a kind of distributed relay selection scheme, and be applied to the technology realization of opportunistic cooperation communication.
Summary of the invention
The purpose of this invention is to provide a kind of distributed relay system of selection, from all candidate relay, select best cooperating relay, in order to realize opportunistic cooperation communication by distributed earth based on cross-layer information exchange.This just requires data source nodes can know in real time which node is the optimal candidate relaying in the current network, and can only utilize local information (local information) to satisfy the requirement of distributed realization in whole relay selection process.In addition, after knowing best cooperating relay, how to realize very effectively that the cooperation transmission of source node and best relay also will be the problem that the present invention need consider to obtain big as far as possible performance gain.
A kind of distributed relay system of selection of the present invention based on cross-layer information exchange, at first according to the optimal selection criterion of cooperating relay in the dynamic network environment, obtain the distributed selection agreement of best cooperating relay, then according to the quality of wireless channel between cooperating relay and source node, provide the adaptive cooperation transmission plan, mainly comprise two parts, the optimal selection criterion of cooperating relay in the dynamic network environment has at first been proposed, and provided the distributed selection agreement of best cooperating relay, secondly according to the quality of wireless channel between cooperating relay and source node, a kind of adaptive cooperation transmission plan has further been proposed, with the wireless fading channel in effective opposing multiple-user network environment, the job step of its entire method is as follows:
(1) distributed selection algorithm of best cooperating relay
Distributed collaborative relay selection algorithm mainly comprises timer setting and relay selection design of protocol two parts:
1) timer setting
According to best cooperating relay selection criterion, can adopt channel condition information to weigh parameter based on amplifying the cooperating relay that retransmits and retransmit, promptly as its performance based on decoding
BalaPara AF ( i ) = | α p i d ( k + 1 ) | 2 | α sp i ( k ) | 2 | α sp i ( k ) | 2 + | α p i d ( k + 1 ) | 2 ;
BalaPara DF ( i ) = | α p i d ( k + 1 ) | 2 ;
In order to realize that distributed earth selects best cooperating relay, respectively the relaying timer initial value based on AF and DF strategy is done as giving a definition here
T AF ( i ) = λ AF BalaPara AF ( i ) T DF ( i ) = λ DF log BalaPara DF ( i ) ;
In the formula, λ AFAnd λ DFAll represent the normalization time constant, unit is generally millisecond or microsecond.Obviously, the T that defines in the formula AF(i) and T DF(i) all be greater than zero positive number, so can be used as the timer initial value all the time.Simultaneously, corresponding to the timer initial value T of best cooperating relay AF(best) and T DF(best) all be minimum in all candidate relay, in other words, the timer of best cooperating relay will make zero at first.Therefore, the initial value of best relay timer is
T AF(best)=min{T AF(i)},T DF(best)=min{T DF(i)};
2) distributed collaborative relay selection agreement
According to timer method to set up set forth above, the specific implementation process that we provide distributed collaborative relay selection agreement is as follows:
At first, source node is intercepted channel status.If channel is busy, source node then begins to wait for, is in the free time until channel.If wireless network adopts to amplify and retransmits as trunk protocol, source node broadcasting RTS frame; If adopt decoding to retransmit, source node is then broadcasted the V-RTS frame.In case receive RTS or V-RTS bag, destination node will be broadcasted CTS (Clear to Send) frame.
Case I (adopt amplify retransmit as trunk protocol): all candidate relay will be carried out channel estimating according to the RTS and the CTS that successively receive from source node and destination node, to obtain source node to relaying be relayed to channel condition information between the destination node.Estimating to obtain source node to relaying and after being relayed to channel condition information between the destination node, via node is according to the relay selection criterion, according to following formula calculating timer initial value separately,
T AF ( i ) = λ AF | α sp i ( k ) | 2 + λ AF | α p i d ( k + 1 ) | 2 ;
Wherein, λ AFExpression normalization time constant, unit is generally millisecond or microsecond.
Case II (adopting decoding to retransmit as trunk protocol): all candidate relay are wrapped the channel condition information of estimating to be relayed between destination node according to the CTS that receives, and solve pilot frequency sequence to carry out CRC check from the V-RTS bag.If the CRC check success then is labeled as this candidate relay " better " relaying (preferable candidate), corresponding timer initial value is set to
T DF ( i ) = λ DF | α id ( k ) | 2 ;
Otherwise the timer initial value is arranged to infinity, generally only need be set to bigger number in the reality certainly and get final product.Wherein, λ DFExpression normalization time constant, unit is generally millisecond or microsecond.Simultaneously, corresponding to the timer initial value T of best cooperating relay AF(best) and T DF(best) all be minimum in all candidate relay, in other words, the timer of best cooperating relay will make zero at first.Therefore, the timer of best cooperating relay will take the lead in reducing to zero, afterwards with broadcast transmission HTS.
All candidate relay with timer zero clearing separately, and begin to keep out of the way in order to avoid cause conflict after receiving the HTS bag.If source node is received the HTS controlling packet, source node will solve the MAC Address territory in the HTS bag, and beginning is to best cooperating relay transfer data packets.If source node is not received the HTS bag yet in a HTS time out period, then adopt the pattern that direct transfers, promptly directly send packet to destination node.
Destination node is received after the packet, will send an ACK and reply.If source node can not receive the ACK of destination node and replys always, think behind a time out period that then this sends failure, and start exponential backoff algorithm.
(2) adaptive cooperation transmission plan
According to the quality of wireless channel from the source node to the cooperating relay, we propose a kind of new adaptive cooperation transmission plan, as shown in Figure 2.At first, source node successively through constellation modulation and power division, obtains launching symbol s with bit stream b to be sent 1, and it is broadcast to cooperating relay and destination node with power Es/2.Then, cooperating relay will be carried out coherent reception to the broadcast singal of source node, according to its received signal
Figure GSA00000138291700041
Come the detection signal-to-noise ratio value, judge with this whether source node produces interruption to the wireless channel between cooperating relay.If received signal to noise ratio is greater than interrupting judging threshold (meaning that source node does not interrupt to the wireless channel of cooperating relay), cooperating relay is with its received signal
Figure GSA00000138291700042
After carrying out the relaying amplification, Es/2 sends to destination node with power; Otherwise remaining Es/2 power will be transmitted to destination node by source node oneself.At last, destination node will be carried out high specific to the two paths of signals of receiving and be merged, and finally obtain the estimated sequence of bit stream b by the maximum likelihood decision device
Figure GSA00000138291700043
Whether obviously, interrupt to the wireless channel between cooperating relay according to source node, the adaptive cooperation scheme that is proposed comprises two kinds of transmission policys that may adopt.
Advantage of the present invention and beneficial effect:
1. propose the selection criterion of two kinds of best cooperating relay based on amplifying re-transmission reconciliation code weight biography, and provided the distributed selection agreement of cooperating relay, thereby realized the optimal selection of cooperating relay under the multiple-user network environment.Error performance at the cooperating relay selection criterion has carried out system emulation, and the result shows that the cooperating relay selection criterion that is proposed obviously is better than traditional relay selection criterion, and system's average error bit rate significantly descends.
2. according to the quality of wireless channel of source node, proposed a kind of adaptive cooperation transmission plan, can effectively resist the wireless fading channel in the multiple-user network environment to cooperating relay.The numerical simulation experiment shows that the adaptive cooperation transmission plan that we propose has obtained further performance gain, and bit error rate significantly descends.
Description of drawings:
Fig. 1 is the distributed selection course of best cooperating relay;
Fig. 2 is the realization block diagram of adaptive cooperation transmission plan;
Fig. 3 retransmits following impact of performance figure that puies forward the relay selection criterion for amplification;
Fig. 4 retransmits following impact of performance figure that puies forward the relay selection criterion for decoding;
Fig. 5 is the characteristic curve of error code of adaptive cooperation transmission plan.
Embodiment
The distributed relay system of selection that the present invention is based on cross-layer information exchange is mainly used in multi-user's collaboration communication of realizing in the wireless network, have advantages such as implementation complexity is low, distributed treatment, be fit to very much novel wireless communication network of future generation, as wireless sensor network, Ad hoc network and MESH network etc.Specific embodiments is as follows:
As Fig. 1, distributed collaborative relay selection algorithm need additionally increase the HTS controlling packet on the basis of conventional I EEE802.11MAC, comprises the MAC Address territory in the packet format definition of HTS.The effect of HTS mainly contains two aspects: the one, be convenient to the MAC Address that source node obtains best cooperating relay; The 2nd, obtain to other relayings statement best relay, other relaying receives behind the HTS bag will be with the timer zero clearing of oneself, and begins to keep out of the way.Implementation procedure mainly comprises three steps: at first, all candidate relay nodes carry out channel estimating by RTS/CTS, secondly, candidate relay is estimating to obtain source node calculating timer initial value and start timer to relaying and after being relayed to the channel condition information of destination, the timer of final best relay will take the lead in making zero, and broadcasting HTS controlling packet; At last, source node demodulation HTS packet header begins to send packet afterwards to obtain the MAC Address of best relay.Detailed process is seen Fig. 2.
1) at first, source node begins to intercept channel status, if channel is in idle condition at a DIFS in the time period, and source node finished backoff procedure, then broadcasts a RTS bag.If channel busy, source node then must be waited for until DIFS cycle of channel idle, and then send RTS.Meanwhile, destination will send the CTS bag after receiving the RTS bag.
2) all candidate relay will be carried out channel estimating according to the RTS and the CTS that successively receive from source node and destination node, with the acquisition source to relaying be relayed to channel condition information between the destination node.Estimating to obtain source node to relaying and after being relayed to channel condition information between the destination node, via node will begin to calculate timer initial value separately, and the startup timer.Obviously, the timer of best cooperating relay will take the lead in reducing to zero, afterwards with broadcast transmission HTS.
3) all candidate relay with timer zero clearing separately, and begin to keep out of the way in order to avoid cause conflict after receiving the HTS bag.If source node is received the HTS controlling packet, with the MAC Address territory that solves in the HTS bag, beginning is to best cooperating relay transfer data packets.If source node is not received the HTS bag yet in a HTS time out period, then adopt the pattern that direct transfers, promptly directly send packet to destination node.
4) destination node is received after the packet, will send an ACK and reply.If source node can not receive the ACK of destination and replys always, think behind a time out period that then this sends failure, and start exponential backoff algorithm.
To the cooperating relay selection algorithm that the present invention proposes, we have carried out Matlab emulation, and the 8PSK modulation is adopted in system emulation, and all wireless channels all adopt the Jakes model to carry out modeling, and normalization Doppler frequency shift fdTs=0.0113.The scale of wireless network is set to five network nodes, comprising a source node, and a purpose terminal and three candidate relay.In addition, need carry out energy normalized when carrying out signal forwarding based on the cooperating relay of amplifying re-transmission policy and handle, female sign indicating number of RCPC coding is that a kind of speed is 1/3 simultaneously, and generator polynomial is G (D)=[11+D 1+D+D 2] convolution code, receiving terminal adopts the viterbi decoder based on hard decision.
Fig. 3 compares with the error performance that Fig. 4 has provided cooperative diversity system under the different relay selection criterions respectively, Fig. 3 provides is based on to amplify and retransmits the decoding that is based on of adopting system's error performance of relay selection, minimum criteria and best cooperating relay selection criterion at random, Fig. 4 then to provide down respectively and retransmit the system's error performance that adopts minimum criteria, harmonic average criterion and best cooperating relay selection criterion down respectively.Find out easily that from figure the cooperating relay criterion that this paper proposes obviously is better than other criterion, has improved systematic function greatly, this has also illustrated the validity and the optimality of the best cooperating relay selection criterion that this paper proposed.
When Fig. 5 has provided message transmission rate R=2bit/s/Hz the BER performance of adaptive cooperation transmission plan and coding cooperative transmission plan relatively, the error code curve among the figure correspond respectively to (η, μ)=(3,-3), (η, μ)=(3,3) and (η, μ)=(10,10).From Fig. 5, find out easily, when (η, μ)=(3 ,-3) and (η, in the time of μ)=(3,3), during respectively less than 20dB and 10dB, corresponding error performance is inferior to non-cooperation transmission to coding cooperative in the signal to noise ratio of source node between destination node.Yet the adaptive cooperation transmission plan that we propose all is better than non-cooperation transmission in whole signal to noise ratio zone, this also side light the adaptive cooperation transmission be better than the coding cooperative transmission.In addition, compare coding cooperative, adaptive cooperation can obtain the more property gain, further illustrates the superiority of adaptive cooperation transmission plan.What deserves to be mentioned is that compare with the coding cooperative scheme, system's implementation complexity of adaptive cooperation transmission plan is lower, this mainly is because the coding cooperative transmission plan has used the higher Viterbi decoder of complexity.

Claims (1)

1. distributed relay system of selection based on cross-layer information exchange, it is characterized in that at first optimal selection criterion according to cooperating relay in the dynamic network environment, obtain the distributed selection agreement of best cooperating relay, then according to the quality of wireless channel between cooperating relay and source node, provide the adaptive cooperation transmission plan, comprise
(1) distributed selection algorithm of best cooperating relay contains timer setting and relay selection design of protocol two parts:
1) timer setting
According to best cooperating relay selection criterion, adopt channel condition information to weigh parameter based on amplifying the cooperating relay that retransmits and retransmit, promptly as its performance based on decoding
BalaPar a AF ( i ) = | α p i d ( k + 1 ) | 2 | α sp i ( k ) | 2 | α sp i ( k ) | 2 + | α p i d ( k + 1 ) | 2 ;
BalaP ara DF ( i ) = | α p i d ( k + 1 ) | 2 ;
In order to realize that distributed earth selects best cooperating relay, respectively the relaying timer initial value based on AF and DF strategy is done as giving a definition
T AF ( i ) = λ AF BalaPar a AF ( i ) T DF ( i ) = λ DF log BalaPara DF ( i ) ;
In the formula, λ AFAnd λ DFAll represent the normalization time constant, be used as the timer initial value; Timer initial value T corresponding to best cooperating relay AF(best) and T DF(best) all be minimum in all candidate relay, the timer of best cooperating relay will make zero at first, and therefore, the initial value of best relay timer is
T AF(best)=min{T AF(i)},T DF(best)=min{T DF(i)};
2) distributed collaborative relay selection agreement
According to timer setting set forth above, the specific implementation process that provides distributed collaborative relay selection agreement is as follows:
At first, source node is intercepted channel status, if channel is busy, source node then begins to wait for, is in the free time until channel; If wireless network adopts to amplify and retransmits as trunk protocol, source node broadcasting RTS frame; If adopt decoding to retransmit, source node is then broadcasted the V-RTS frame, in case receive RTS or V-RTS bag, destination node will be broadcasted the CTS frame;
Adopt to amplify retransmit as trunk protocol: all candidate relay will be carried out channel estimating according to the RTS and the CTS that successively receive from source node and destination node, to obtain source node to relaying be relayed to channel condition information between the destination node, estimating to obtain source node to relaying and after being relayed to channel condition information between the destination node, via node is according to the relay selection criterion, according to following formula calculating timer initial value separately
T AF ( i ) = λ AF | α sp i ( k ) | 2 + λ AF | α p i d ( k + 1 ) | 2 ;
Wherein, λ AFExpression normalization time constant;
Adopt decoding to retransmit as trunk protocol, all candidate relay are wrapped the channel condition information of estimating to be relayed between destination node according to the CTS that receives, and from the V-RTS bag, solve pilot frequency sequence to carry out CRC check, if CRC check success, then this candidate relay is labeled as " better " relaying, corresponding timer initial value is set to
T DF ( i ) = λ DF | α id ( k ) | 2 ;
Otherwise the timer initial value is arranged to infinity, wherein, and λ DFExpression normalization time constant is corresponding to the timer initial value T of best cooperating relay AF(best) and T DF(best) all be minimum in all candidate relay, the timer of best cooperating relay will make zero at first, and therefore, the timer of best cooperating relay will take the lead in reducing to zero, afterwards with broadcast transmission HTS;
All candidate relay with timer zero clearing separately, and begin to keep out of the way in order to avoid cause conflict after receiving the HTS bag, if source node is received the HTS controlling packet, source node will solve the MAC Address territory in the HTS bag, and beginning is to best cooperating relay transfer data packets; If source node is not received the HTS bag yet in a HTS time out period, then adopt the pattern that direct transfers, promptly directly send packet to destination node;
Destination node is received after the packet, will send an ACK and reply, and replys if source node can not receive the ACK of destination node always, thinks behind a time out period that then this sends failure, and starts exponential backoff algorithm;
(2) adaptive cooperation transmission plan
According to the quality of wireless channel from the source node to the cooperating relay, at first, source node successively through constellation modulation and power division, obtains launching symbol s with bit stream b to be sent 1, and it is broadcast to cooperating relay and destination node with power Es/2, then, cooperating relay will be carried out coherent reception to the broadcast singal of source node, according to its received signal
Figure FSA00000138291600023
Come the detection signal-to-noise ratio value, judge with this whether source node produces interruption to the wireless channel between cooperating relay, if received signal to noise ratio is greater than interrupting judging threshold, promptly source node does not interrupt to the wireless channel of cooperating relay, and cooperating relay is with its received signal
Figure FSA00000138291600024
After carrying out the relaying amplification, Es/2 sends to destination node with power; Otherwise remaining Es/2 power will be transmitted to destination node by source node oneself; At last, destination node will be carried out high specific to the two paths of signals of receiving and be merged, and finally obtain the estimated sequence of bit stream b by the maximum likelihood decision device
Figure FSA00000138291600025
CN201010179909A 2010-05-21 2010-05-21 Distributed relay selection method based on cross-layer information exchange Pending CN101860873A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201010179909A CN101860873A (en) 2010-05-21 2010-05-21 Distributed relay selection method based on cross-layer information exchange

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201010179909A CN101860873A (en) 2010-05-21 2010-05-21 Distributed relay selection method based on cross-layer information exchange

Publications (1)

Publication Number Publication Date
CN101860873A true CN101860873A (en) 2010-10-13

Family

ID=42946462

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201010179909A Pending CN101860873A (en) 2010-05-21 2010-05-21 Distributed relay selection method based on cross-layer information exchange

Country Status (1)

Country Link
CN (1) CN101860873A (en)

Cited By (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102111209A (en) * 2011-03-24 2011-06-29 山东大学 Narrow pulse-based relaying method for cooperative ultra wideband communication system
CN102123438A (en) * 2011-03-22 2011-07-13 上海交通大学 Dynamic selection multi-relay station cooperative transmission method
CN102291784A (en) * 2011-09-28 2011-12-21 重庆邮电大学 Cognitive-flow-based cooperative MAC (medium assess control) method
CN102523619A (en) * 2011-12-15 2012-06-27 西安交通大学 Distributed coherent cooperation method in long distance wireless communication system
CN102523588A (en) * 2011-12-08 2012-06-27 东南大学 Method for reducing interruption probability of large-scale wireless self-organizing network
CN102708445A (en) * 2012-04-26 2012-10-03 江苏航泰电子科技有限公司 Bank lobby interactive system and operation method thereof
CN102780993A (en) * 2012-08-20 2012-11-14 哈尔滨工业大学 Terminal D2D (device-to-device) cooperation relay communication implementation method in TD-LTE-A (time division-long term evolution-advanced) system
CN103037486A (en) * 2012-12-21 2013-04-10 南京大学 Energy-saving transmission scheme of opportunity relay system
CN103686948A (en) * 2013-12-23 2014-03-26 天津大学 Underwater sensor network cooperative communication relay selection method
CN104244362A (en) * 2014-08-29 2014-12-24 朱今兰 Broadband wireless communication relay dispatching method
CN104378151A (en) * 2014-11-10 2015-02-25 中国电子科技集团公司第二十研究所 Greed relay selection method based on time slot ALOHA in large-scale relay network
CN104684042A (en) * 2015-03-13 2015-06-03 深圳酷派技术有限公司 Data transmission method and system in IOT, IOT equipment and terminal
CN105392175A (en) * 2015-12-11 2016-03-09 重庆邮电大学 Relay selection methods for solving multi-user wireless network cooperation conflict
CN105430709A (en) * 2015-12-11 2016-03-23 重庆邮电大学 Relay selection and power distribution method in multisource and multi-objective wireless network
CN105450270A (en) * 2015-12-04 2016-03-30 重庆邮电大学 Selective cooperative transmission method adopting channel between relays
CN105873167A (en) * 2016-05-17 2016-08-17 中国人民解放军海军航空工程学院 Cooperative MAC (media access control) protocol based relay communication method for navigation sensor network
CN105898875A (en) * 2016-05-12 2016-08-24 华南师范大学 Communication method and system of distributed multichannel network
CN108683444A (en) * 2018-07-31 2018-10-19 Oppo广东移动通信有限公司 Data transmission method and related product
CN111641453A (en) * 2020-06-08 2020-09-08 西安电子科技大学 Adaptive protocol selection method based on serial relay free space optical communication system
CN113395720A (en) * 2021-05-28 2021-09-14 西北工业大学 Relay node guided multi-hop mobile ad hoc network MAC layer communication method

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101465814A (en) * 2009-01-16 2009-06-24 清华大学 Transmission method for network data of distributed opportunity relay
CN101656600A (en) * 2009-09-14 2010-02-24 西安交通大学 Implementation method of opportunistic cooperation diversity protocol based on reinforced selective amplification-forwarding

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101465814A (en) * 2009-01-16 2009-06-24 清华大学 Transmission method for network data of distributed opportunity relay
CN101656600A (en) * 2009-09-14 2010-02-24 西安交通大学 Implementation method of opportunistic cooperation diversity protocol based on reinforced selective amplification-forwarding

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
《电子学报》 20090131 邹玉龙等 基于分布式中继选择的自适应协作传输方案 第13-20页 1 第37卷, 第1期 *
《通信学报》 20080831 邹玉龙等 基于跨层机制的最佳协作中继选择及其系统实现 1 第29卷, 第8期 *

Cited By (32)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102123438A (en) * 2011-03-22 2011-07-13 上海交通大学 Dynamic selection multi-relay station cooperative transmission method
CN102123438B (en) * 2011-03-22 2013-07-03 上海交通大学 Dynamic selection multi-relay station cooperative transmission method
CN102111209A (en) * 2011-03-24 2011-06-29 山东大学 Narrow pulse-based relaying method for cooperative ultra wideband communication system
CN102111209B (en) * 2011-03-24 2013-08-21 山东大学 Narrow pulse-based relaying method for cooperative ultra wideband communication system
CN102291784A (en) * 2011-09-28 2011-12-21 重庆邮电大学 Cognitive-flow-based cooperative MAC (medium assess control) method
CN102291784B (en) * 2011-09-28 2014-07-02 重庆邮电大学 Cognitive-flow-based cooperative MAC (medium assess control) method
CN102523588A (en) * 2011-12-08 2012-06-27 东南大学 Method for reducing interruption probability of large-scale wireless self-organizing network
CN102523588B (en) * 2011-12-08 2014-06-04 东南大学 Method for reducing interruption probability of large-scale wireless self-organizing network
CN102523619B (en) * 2011-12-15 2014-04-23 西安交通大学 Distributed coherent cooperation method in long distance wireless communication system
CN102523619A (en) * 2011-12-15 2012-06-27 西安交通大学 Distributed coherent cooperation method in long distance wireless communication system
CN102708445A (en) * 2012-04-26 2012-10-03 江苏航泰电子科技有限公司 Bank lobby interactive system and operation method thereof
CN102780993B (en) * 2012-08-20 2015-04-15 哈尔滨工业大学 Terminal D2D (device-to-device) cooperation relay communication implementation method in TD-LTE-A (time division-long term evolution-advanced) system
CN102780993A (en) * 2012-08-20 2012-11-14 哈尔滨工业大学 Terminal D2D (device-to-device) cooperation relay communication implementation method in TD-LTE-A (time division-long term evolution-advanced) system
CN103037486A (en) * 2012-12-21 2013-04-10 南京大学 Energy-saving transmission scheme of opportunity relay system
CN103686948A (en) * 2013-12-23 2014-03-26 天津大学 Underwater sensor network cooperative communication relay selection method
CN104244362A (en) * 2014-08-29 2014-12-24 朱今兰 Broadband wireless communication relay dispatching method
CN104378151B (en) * 2014-11-10 2017-08-29 中国电子科技集团公司第二十研究所 Greedy relay selection method based on CDMA slotted ALOHA in extensive junction network
CN104378151A (en) * 2014-11-10 2015-02-25 中国电子科技集团公司第二十研究所 Greed relay selection method based on time slot ALOHA in large-scale relay network
CN104684042A (en) * 2015-03-13 2015-06-03 深圳酷派技术有限公司 Data transmission method and system in IOT, IOT equipment and terminal
CN105450270B (en) * 2015-12-04 2018-10-12 重庆邮电大学 A kind of selection cooperation transmission method using relay well channel
CN105450270A (en) * 2015-12-04 2016-03-30 重庆邮电大学 Selective cooperative transmission method adopting channel between relays
CN105392175B (en) * 2015-12-11 2019-04-09 重庆邮电大学 For solving the relay selection method of multi-user wireless network cooperation conflict
CN105430709A (en) * 2015-12-11 2016-03-23 重庆邮电大学 Relay selection and power distribution method in multisource and multi-objective wireless network
CN105430709B (en) * 2015-12-11 2018-12-28 重庆邮电大学 The relay selection and power distribution method of multi-source multi-target wireless network
CN105392175A (en) * 2015-12-11 2016-03-09 重庆邮电大学 Relay selection methods for solving multi-user wireless network cooperation conflict
CN105898875A (en) * 2016-05-12 2016-08-24 华南师范大学 Communication method and system of distributed multichannel network
CN105873167A (en) * 2016-05-17 2016-08-17 中国人民解放军海军航空工程学院 Cooperative MAC (media access control) protocol based relay communication method for navigation sensor network
CN105873167B (en) * 2016-05-17 2019-05-21 中国人民解放军海军航空大学 Based on the relay communication method of cooperative MAC protocol in navigation sensor network
CN108683444A (en) * 2018-07-31 2018-10-19 Oppo广东移动通信有限公司 Data transmission method and related product
CN111641453A (en) * 2020-06-08 2020-09-08 西安电子科技大学 Adaptive protocol selection method based on serial relay free space optical communication system
CN111641453B (en) * 2020-06-08 2021-08-10 西安电子科技大学 Adaptive protocol selection method based on serial relay free space optical communication system
CN113395720A (en) * 2021-05-28 2021-09-14 西北工业大学 Relay node guided multi-hop mobile ad hoc network MAC layer communication method

Similar Documents

Publication Publication Date Title
CN101860873A (en) Distributed relay selection method based on cross-layer information exchange
CN101656600B (en) Implementation method of opportunistic cooperation diversity protocol based on reinforced selective amplification-forwarding
Luo et al. New approaches for cooperative use of multiple antennas in ad hoc wireless networks
CN103561447B (en) Increment based on opportunistic relay hybrid decoding amplification forward collaboration method
CN101291197B (en) Distributing and transmitting scheme with amplified forwarding power for wireless sensor network of two-hops
Zou et al. Diversity-multiplexing tradeoff in selective cooperation for cognitive radio
Chen et al. Virtual MIMO protocol based on clustering for wireless sensor network
Lee et al. Dynamic cooperative retransmission scheme for TDMA systems
CN101848060A (en) Self-adaptive cooperation relay method through network coding
Gokturk et al. Cooperation in wireless sensor networks: design and performance analysis of a MAC protocol
CN101951645A (en) Downlink self-adaptive transmission method in cellular relay network
CN102769486A (en) Method for processing relay end signals in bidirectional multi-hop relay system
Saha et al. Learning-based relay selection for cooperative networks
Liu et al. Regenerative cooperative diversity with path selection and equal power consumption in wireless networks
Wang et al. Distributed cooperation and diversity for hybrid wireless networks
CN102624498A (en) Method for eliminating interference of downlink multi-base station cooperation system by using joint distributed space-time coding
Mainaud et al. Cooperative communication for wireless sensors network: a mac protocol solution
CN104837194A (en) Bidirectional relay system power distribution method based on AF (Amplify-and-Forward) mechanism
CN101656560B (en) Collaboration communication method of high-efficiency frequency spectrum utilization ratio
Zou et al. An optimal relay selection scheme for cooperative diversity
Liu et al. Robust cooperative relaying in a wireless LAN: Cross-layer design and performance analysis
Shi et al. Cross-layer combination of cooperative HARQ with AMC in wireless ad-hoc networks
Osman et al. Energy efficiency and achievable data rate of device-to-device communications in cellular networks
Maham et al. Efficient cooperative protocols for general outage-limited multihop wireless networks
Boukerche et al. Energy-efficient multi-hop virtual MIMO wireless sensor network

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

Application publication date: 20101013