CN102186220B - Communication method of wireless cooperative relay network - Google Patents

Communication method of wireless cooperative relay network Download PDF

Info

Publication number
CN102186220B
CN102186220B CN2011101102371A CN201110110237A CN102186220B CN 102186220 B CN102186220 B CN 102186220B CN 2011101102371 A CN2011101102371 A CN 2011101102371A CN 201110110237 A CN201110110237 A CN 201110110237A CN 102186220 B CN102186220 B CN 102186220B
Authority
CN
China
Prior art keywords
node
cooperative
source
candidate
source 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.)
Active
Application number
CN2011101102371A
Other languages
Chinese (zh)
Other versions
CN102186220A (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.)
Henan Tongfang Technology Co., Ltd
Original Assignee
DESIREE COX (BEIJING) COMMUNICATIONS EQUIPMENT Co Ltd
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 DESIREE COX (BEIJING) COMMUNICATIONS EQUIPMENT Co Ltd filed Critical DESIREE COX (BEIJING) COMMUNICATIONS EQUIPMENT Co Ltd
Priority to CN2011101102371A priority Critical patent/CN102186220B/en
Publication of CN102186220A publication Critical patent/CN102186220A/en
Application granted granted Critical
Publication of CN102186220B publication Critical patent/CN102186220B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention provides a communication method of a wireless cooperative relay network. The network comprises a plurality of source nodes and different destination nodes corresponding to the plurality of source nodes respectively. By the method, a gain function, a cost function and an arbitration function are constructed, so that when two source nodes correspond to the different destination nodes respectively, the two source nodes can still perform cooperative communication, and when one source node can perform cooperative communication with a plurality of neighbor source nodes, the best neighbor source node can be selected from the plurality of neighbor source nodes as a cooperative node.

Description

Communication method of wireless cooperative relay network
Technical field
The present invention relates to wireless communication field, especially the technical field of wireless cooperative relay network.
Background technology
The definition of cooperation refers to that a group object reaches certain target by collaborative work.Cooperation main thought behind is that each partner can obtain corresponding gain by consistent action.Cooperation can be seen as a kind of by giving, share to obtain the behavior of some benefits.Be subjected to the especially enlightenment of cooperation behavior pattern in the human society behavior of occurring in nature, scholars have quoted the concept-collaboration communication of cooperation in radio communication.Collaboration communication helps to realize sharing of antenna, power and computing capability between adjacent node, thereby promotes whole network performance.The concept of collaboration communication is on the basis of trunk channel model, proposed by the inspiration of multi-antenna technology.Therefore, relaying technique can be regarded the special applications scene of collaboration communication as.
Document " A Cooperation Strategy Based on Nash Bargaining Solution in Cooperative Relay Networks " and document " Fair Resource Sharing for Cooperative Relay Networks using Nash Bargaining Solutions " are used Cooperative Game Theory the user's collaborative problem in the cooperative relay network are launched research.This two pieces of documents have all adopted an access point and two users' symmetrical system model: on the one hand, two users are all source node, send data to the access point as destination node respectively; On the other hand, the user is all again via node, assists the another one user to carry out data transfer.Under such system model, suppose that the user can cooperate with the resource (bandwidth or power) of certain form, the cooperation between the user is modeled as two users' problem of negotiating a price, and obtains cooperation policy by receiving assorted agreed-upon price solution.Simulation result shows, under certain condition, the user can benefit simultaneously by cooperating with each other.There is certain limitation in the research of these two pieces of documents: 1. source node is corresponding to identical destination node, this is applicable to the centralized network of unified access point, but be not suitable for ununified access point, the not identical distributed network of destination node that source node is corresponding; When 2. only having considered that two users are all source node, the cooperation between two users, and reckon without when having a plurality of users to be all source node the How to choose collaboration object.
Summary of the invention
The purpose of this invention is to provide a kind of communication method of wireless cooperative relay network, so that when two source nodes correspond respectively to different destination nodes, still can carry out collaboration communication, and when a source node can carry out collaboration communication with a plurality of neighbours' source nodes, can therefrom choose optimum neighbours' source node as cooperative node.
To achieve these goals, technical scheme of the present invention is:
The invention provides a kind of communication method of wireless cooperative relay network, have a plurality of source nodes in the described wireless cooperative relay network, different source node s eCorresponding different destination node d e,
Wherein, e is the source node label,
Figure BDA0000058465120000021
E is the source node number, i, j, k, i n,
It is characterized in that source node s iThe step of selecting collaboration node is:
Step 1, source node s iCalculate respectively self node and a plurality of neighbours' source node s jBetween revenue function U i(i, j), choose so that
Figure BDA0000058465120000023
Neighbours' source node as the target candidate cooperative node;
Wherein, j ≠ i,
Figure BDA0000058465120000024
J is neighbours' source node number;
Figure BDA0000058465120000025
Source node s iDefault income threshold value,
Figure BDA0000058465120000026
Step 2, if there is no target candidate cooperative node, source node s iAbandon collaboration communication;
If there is the target candidate cooperative node, execution in step 3;
Step 3, target candidate cooperative node s kCalculate self node and source node s iBetween revenue function U k(i, k) chooses
Figure BDA0000058465120000027
The target candidate cooperative node as candidate's cooperative node;
Wherein, k ≠ i,
Figure BDA0000058465120000028
K is target candidate node number;
Figure BDA0000058465120000029
Source node s kDefault income threshold value,
Figure BDA00000584651200000210
Step 4, if there is no candidate's cooperative node, source node s iAbandon collaboration communication;
If only have unique candidate's cooperative node, execution in step 5.
If have the candidate's cooperative node more than, execution in step 6.
Step 5, choose described unique candidate's cooperative node as source node s iCooperative node s c
Step 6, be directed to more than each the candidate's cooperative node in candidate's cooperative node of one
Figure BDA00000584651200000211
s iCalculate respectively self node with
Figure BDA00000584651200000212
Between cost function Ω i(i, i n);
Wherein, i n≠ i;
Figure BDA00000584651200000213
N is the both candidate nodes number;
Step 7, be directed to each candidate's cooperative node source node
Figure BDA0000058465120000031
s iAccording to revenue function
Figure BDA0000058465120000032
With cost function Ω i(i, i n) calculating s iWith
Figure BDA0000058465120000033
Between arbitration function phi (i, i n);
Step 8, choose so that arbitrate function phi (i, i n) value be that peaked candidate's cooperative node is as source node s iCooperative node s c
Source node s iWith cooperative node s cCarry out collaboration communication, i.e. s cAs source node s iWith destination node d iBetween the via node of communication, s iAs source node s cWith destination node d cBetween the via node of communication.
Described revenue function can be set as the basis take signal to noise ratio or throughput.
Described source node s iWith cooperative node s cThe implication of carrying out collaboration communication can be specially:
With s iAnd s cThe transmission of data time be divided into respectively the time slot of two equal in length.s iThe 1st time slot at self issued d iSignal, simultaneously by s cReceive s cThe 1st time slot at self issued d cSignal, simultaneously by s iReceive.s iAt self the 2nd time slot with the s that receives cSignal, amplification forwarding is to d c, s cAt self the 2nd time slot with the s that receives iSignal, amplification forwarding is to d i
Described revenue function can be specially:
U i ( i , j ) = G s i , d i ( P s i , d i G s i , s j + P s j , d i G s j , d i + σ 2 ) + G s i , s j P s j , d i G s j , d i 2 G s i , d i ( P s i , d i G s i , s j + P s j , d i G s j , d i + σ 2 )
Wherein, Expression is from node s iTo node d iBetween transmitting power on the link,
Figure BDA0000058465120000036
Expression is from node s jTo node d iBetween transmitting power on the link.
Figure BDA0000058465120000037
Expression is from node s iTo node d iBetween channel gain, Expression is from node s jTo node d iBetween channel gain,
Figure BDA0000058465120000039
Expression is from node s iTo node s jBetween channel gain.The noise power of each receiving terminal equates, uses σ 2Expression.
Described cost function Ω i(i, i n) can be specially:
Ω i ( i , i n ) = p s i d i n p s i , d i n + p s i , d i
Wherein, Expression is from node s iTo node d iBetween transmitting power on the link,
Figure BDA00000584651200000312
Expression is from node s iTo node
Figure BDA00000584651200000313
Between transmitting power on the link.
Described revenue function Φ (i, i n) can be specially:
Φ ( i , i n ) = α U i ( i , i n ) + β Ω i ( i , i n )
Wherein, α and β are weighted factor, and alpha+beta=1,0＜α＜1,0＜β＜1.
Description of drawings
Fig. 1 is wireless cooperative relay network framework map of the present invention..
Fig. 2 be two group nodes of the present invention between the collaboration communication schematic diagram.
Fig. 3 be two group nodes of the present invention between collaboration communication transmission means figure.
Fig. 4 is wireless cooperation relay communication method flow chart of the present invention.
Embodiment
The present invention is described further below in conjunction with specific embodiment.
Fig. 1 is the schematic diagram of the described wireless cooperative relay network of the application.There are a plurality of source node s in this network i(be the s among Fig. 1 1～s 4), with and corresponding destination node d separately i(be the d among Fig. 1 1～d 4).If this network does not carry out collaboration communication, its initial signal transmits shown in the solid line among Fig. 1, i.e. node s iDirectly and d iCommunicate.When network carries out collaboration communication, with node to (s 1, d 1) be example, source node s 1With destination node d 1Between except direct communication, can also be with source node s i(i ≠ 1) is for via node communicates, shown in the dotted line among Fig. 1.Be convenient and understand, Fig. 1 has described four nodes pair, but it will be appreciated by those skilled in the art that the application is not limited to four networks that node is right.
Further specify node to (s with reference to figure 2 i, d i) and (s j, d j) between how to cooperate.When node to (s i, d i) and (s j, d j) when not carrying out collaboration communication, shown in the solid line of Fig. 2, node s iDirectly and d iCommunicate node s jDirectly and d jCommunicate.When node to (s i, d i) with node to (s j, d j) when reaching collaboration communication, shown in the solid line and dotted line of Fig. 2, s iAnd s jVia node each other.Be that node is to (s i, d i) between a communication part directly carry out, a part is passed through s jCarry out relaying; Node is to (s simultaneously j, d j) between a communication part directly carry out, a part is passed through s iCarry out relaying.
In order to be without loss of generality, adopt the collaboration protocols of amplification forwarding (AF:amplify-and-forward).The user can be chosen in independent transmission on separately the channel, also can select to cooperate with each other, for the other side makees relaying.If select to cooperate with each other, as shown in Figure 3, the time period of considering is divided into the time slot of two equal in length.s iIssue d at the 1st time slot iSignal, simultaneously by s j(j ≠ i) receive, and at the 2nd time slot, amplification forwarding is to d iSimultaneously, s jIssue d at the 1st time slot jSignal, simultaneously by s iReceive, and at the 2nd time slot, amplification forwarding is to d j
Among the present invention
Figure BDA0000058465120000051
Expression is from node s iTo node d iBetween transmitting power on the link,
Figure BDA0000058465120000052
Expression is from node s jTo node d iBetween transmitting power on the link.
Figure BDA0000058465120000053
Expression is from node s iTo node d iBetween channel gain,
Figure BDA0000058465120000054
Expression is from node s jTo node d iBetween channel gain,
Figure BDA0000058465120000055
Expression is from node s iTo node s jBetween channel gain.The noise power of each receiving terminal equates, uses σ 2Expression.
At the 1st time slot, from s iTo d iThe signal to noise ratio of direct transmission can be expressed as:
Γ s i , d i = P s i , d i G s i , d i / σ 2 Formula 1
Suppose
Figure BDA0000058465120000057
S iSend to d iSignal, s then jThe signal of receiving is:
Y s i , s j = P s i , d i G s i , s j X s i , d i + η s i , s j Formula 2
With
Figure BDA0000058465120000059
Expression s iTo s jNoise signal, use
Figure BDA00000584651200000510
Expression s jTo d iNoise signal.Subsequently in the 2nd time slot, s jRight
Figure BDA00000584651200000511
Amplification also is transmitted to d i, d iThe signal of receiving is
Y s j , d i = P s j , d i G s j , d i X s i , s j + η s j , d i Formula 3
Wherein
X s i , s j = Y s i , s j / | Y s i , s j | Formula 4
S jBe transferred to d iThe signal that has unit energy after the normalization.Formula 3 can be write as again
Y s j , d i = P s j , d i G s j , d i ( P s i , d i G s i , s j X s i , d i + η s i , s j ) P s i , d i + G s i , s j + σ 2 + η s j , d i . Formula 5
Utilize formula 5, can obtain by s jDo the signal to noise ratio that relaying obtains:
Γ s i , s j , d i = Γ s i , s j Γ s j , d i Γ s i , s j + Γ s j , d i + 1 Formula 6
= P s i , d i G s i , s j P s j , d i G s j , d i σ 2 ( P s i , d i G s i , s j + P s j , d i G s j , d i + σ 2 )
According to formula 1 and formula 6, can obtain the effective signal-to-noise ratio of cognitive user i under the collaboration situation:
Γ ( i , j ) i coop = Γ s i , d i + Γ s i , s j , d i Formula 7
Figure BDA0000058465120000064
Be under identical power consumption condition, do not cooperate but the signal to noise ratio that obtains by direct transmission.Wherein Can be expressed as:
Γ ( i , j ) i noncoop = 2 P s i , d i G s i , d i σ 2 Formula 8
Therefore, source node s iWith source node s jReach collaboration communication, to source node s iRevenue function U i(i, j) is
U i ( i , j ) = Γ ( i , j ) i coop Γ ( i , j ) i noncoop Formula 9
Be than the added value of signal to noise ratio in the uncooperative situation under the cooperation.
Bringing formula 1, formula 6, formula 7 and formula 8 into formula 9 can get:
U i ( i , j ) = G s i , d i ( P s i , d i G s i , s j + P s j , d i G s j , d i + σ 2 ) + G s i , s j P s j , d i G s j , d i 2 G s i , d i ( P s i , d i G s i , s j + P s j , d i G s j , d i + σ 2 ) Formula 10
When making by cooperation
Figure BDA0000058465120000069
The time, here
Figure BDA00000584651200000610
Source node s iDefault income threshold value, wherein
Figure BDA00000584651200000611
When
Figure BDA00000584651200000612
When satisfying, source node s iWill tend to carry out collaboration communication.Equally, establish
Figure BDA00000584651200000613
Source node s jDefault income threshold value is when making by cooperation The time, source node s jWill tend to carry out collaboration communication.And only has the s of working as iAnd s jWhen both sides tend to carry out collaboration communication, just can reach collaboration communication before both.
When N group node pair is arranged simultaneously
Figure BDA00000584651200000615
Can with node to (s i, d i) when reaching collaboration communication, wherein, n=1,2 ... N, N＞1, i n≠ i.
That is, U i ( i , i 1 ) > U i min and U i 1 ( i , i 1 ) > U i 1 min U i ( i , i 2 ) > U i min and U i 2 ( i , i 2 ) > U i 2 min · · · · · · U i ( i , i N ) > U i min and U i N ( i , i N ) > U i N min Formula 11
During to the choosing of cooperative node, when considering the financial value that communication is brought by cooperation, also consider the cost that collaboration communication causes to source node.
Adopt cost function Ω i(i, i n) represent as node s iWith node
Figure BDA0000058465120000072
When carrying out collaboration communication, source node s iThe cost that need to pay:
Ω i ( i , i n ) = p s i , d i n p s i , d i n + p s i , d i Formula 12
Each user wishes to exchange maximum value for minimum cost, therefore arbitrates function phi (i, i n) be:
Φ ( i , i n ) = α U i ( i , i n ) + β Ω i ( i , i n ) Formula 13
Wherein α and β are weighted factor, and alpha+beta=1,0＜α＜1,0＜β＜1.
Source node s iChoose so that arbitrate function phi (i, i n) value be peaked source node
Figure BDA0000058465120000075
As the cooperative node communication that cooperates with each other.
Although the application sets revenue function take signal to noise ratio as the basis, one skilled in the art will appreciate that and to set revenue function take throughput as the basis.
Next further describe source node s by Fig. 4 iIdiographic flow when carrying out collaboration communication:
Step 1, source node s iCalculate respectively self node and a plurality of neighbours' source node s jBetween revenue function U i(i, j), choose so that Neighbours' source node as the target candidate cooperative node.
Step 2, if there is no target candidate cooperative node, source node s iAbandon collaboration communication;
If there is the target candidate cooperative node, execution in step 3.
Step 3, target candidate cooperative node s kCalculate self node and node s iBetween revenue function U k(i, k) chooses
Figure BDA0000058465120000077
The target candidate cooperative node as candidate's cooperative node.
Step 4, if there is no candidate's cooperative node, source node s iAbandon collaboration communication;
If only have unique candidate's cooperative node, execution in step 5.
If have a plurality of candidate's cooperative nodes, execution in step 6.
Step 5, choose this unique candidate's cooperative node as source node s iCooperative node s c
Step 6, be directed to each candidate's cooperative node source node
Figure BDA0000058465120000081
s iCalculate respectively with
Figure BDA0000058465120000082
Between cost function Ω i(i, i n).
Step 7, be directed to each candidate's cooperative node source node s iPass through revenue function
Figure BDA0000058465120000084
With cost function Ω i(i, i n) calculate with
Figure BDA0000058465120000085
Between arbitration function phi (i, i n).
Step 8, choose so that arbitrate function phi (i, i n) value be that peaked candidate's cooperative node is as source node s iCooperative node s c

Claims (3)

1. there are a plurality of source nodes in a communication method of wireless cooperative relay network in the described wireless cooperative relay network, different source node s eCorresponding different destination node d e,
Wherein, e is the source node label, E is the source node number, i, and j, k, in,
Figure FDA00002787486400012
It is characterized in that source node s iThe step of selecting collaboration node is:
Step 1, source node s iCalculate respectively self node and a plurality of neighbours' source node s jBetween revenue function U i(i, j), choose so that
Figure FDA00002787486400013
Neighbours' source node as the target candidate cooperative node;
Wherein, j ≠ i,
Figure FDA00002787486400014
J is neighbours' source node number;
Figure FDA00002787486400015
Source node s iDefault income threshold value,
Figure FDA00002787486400016
Step 2, if there is no target candidate cooperative node, source node s iAbandon collaboration communication;
If there is the target candidate cooperative node, execution in step 3;
Step 3, target candidate cooperative node s kCalculate self node and source node s iBetween revenue function U k(i, k) chooses
Figure FDA00002787486400017
The target candidate cooperative node as candidate's cooperative node;
Wherein, k ≠ i,
Figure FDA00002787486400018
K is target candidate node number;
Figure FDA00002787486400019
Source node s kDefault income threshold value,
Figure FDA000027874864000110
Step 4, if there is no candidate's cooperative node, source node s iAbandon collaboration communication;
If only have unique candidate's cooperative node, execution in step 5;
If have the candidate's cooperative node more than, execution in step 6;
Step 5, choose described unique candidate's cooperative node as source node s iCooperative node s c
Step 6, be directed to more than each the candidate's cooperative node in candidate's cooperative node of one
Figure FDA000027874864000111
s iCalculate respectively self node with
Figure FDA000027874864000112
Between cost function Ω i(i, i n);
Wherein, i n≠ i;
Figure FDA000027874864000113
N is the both candidate nodes number;
Step 7, be directed to each candidate's cooperative node
Figure FDA000027874864000114
Source node s iAccording to revenue function
Figure FDA000027874864000115
With cost function Ω i(i, i n) calculating s iWith Between arbitration function phi (i, i n);
Step 8, choose so that arbitrate function phi (i, i n) value be that peaked candidate's cooperative node is as source node s iCooperative node s c
Source node s iWith cooperative node s cCarry out collaboration communication, i.e. s cAs source node s iWith destination node d iBetween the via node of communication, s iAs source node s cWith destination node d cBetween the via node of communication;
Described revenue function is specially:
U i ( i , j ) = G s i , d i ( P s i , d i G s i , d i + P s j , d i G s j , d i + σ 2 ) + G s i , s j P s j , d i G s j , d i 2 G s i , d i ( P s i , d i G s i , s j + P s j , d i G s j , d i + σ 2 )
Described cost function Ω i(i, i n) be specially:
Ω i ( i , i n ) = p s i , d i n p s i , d i n + p s i , d i
Described arbitration function phi (i, i n) be specially:
Φ ( i , i n ) = α U i ( i , i n ) + β Ω i ( i , i n )
Wherein,
Figure FDA00002787486400024
Expression is from node s iTo node d iBetween transmitting power on the link, Expression is from node s jTo node d iBetween transmitting power on the link;
Figure FDA00002787486400026
Expression is from node s iTo node d iBetween channel gain,
Figure FDA00002787486400027
Expression is from node s jTo node d iBetween channel gain,
Figure FDA00002787486400028
Expression is from node s iTo node s jBetween channel gain; The noise power of each receiving terminal equates, uses σ 2Expression;
Figure FDA00002787486400029
Expression is from node s iTo node
Figure FDA000027874864000210
Between transmitting power on the link; α and β are weighted factor, and alpha+beta=1,0＜α＜1,0＜β＜1.
2. the method for claim 1 is characterized in that, described revenue function is set as the basis take signal to noise ratio or throughput.
3. method as claimed in claim 1 or 2 is characterized in that, described source node s iWith cooperative node s cThe implication of carrying out collaboration communication is specially:
With s iAnd s cThe transmission of data time be divided into respectively the time slot of two equal in length; s iThe 1st time slot at self issued d iSignal, simultaneously by s cReceive s cThe 1st time slot at self issued d cSignal, simultaneously by s iReceive; s iAt self the 2nd time slot with the s that receives cSignal, amplification forwarding is to d c, s cAt self the 2nd time slot with the s that receives iSignal, amplification forwarding is to d i
CN2011101102371A 2011-04-29 2011-04-29 Communication method of wireless cooperative relay network Active CN102186220B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2011101102371A CN102186220B (en) 2011-04-29 2011-04-29 Communication method of wireless cooperative relay network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2011101102371A CN102186220B (en) 2011-04-29 2011-04-29 Communication method of wireless cooperative relay network

Publications (2)

Publication Number Publication Date
CN102186220A CN102186220A (en) 2011-09-14
CN102186220B true CN102186220B (en) 2013-04-24

Family

ID=44572276

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2011101102371A Active CN102186220B (en) 2011-04-29 2011-04-29 Communication method of wireless cooperative relay network

Country Status (1)

Country Link
CN (1) CN102186220B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102769517B (en) * 2012-07-16 2016-05-25 遵义天义利威机电有限责任公司 A kind of relay and control method of reliable feedback channel information
CN103415040B (en) * 2013-07-19 2016-07-06 南京邮电大学 Wireless Heterogeneous Networks multi-node optimal relay alliance cooperation motivational techniques
CN107995531B (en) * 2016-10-26 2020-10-09 中国电信股份有限公司 Method, device and system for transmitting IPTV video of mobile terminal

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101364823A (en) * 2008-07-17 2009-02-11 上海交通大学 Power distribution method based on MCPA threshold in cooperative communication
CN101388849A (en) * 2008-10-29 2009-03-18 北京航空航天大学 Method for selecting collaboration node
CN101764679A (en) * 2009-12-16 2010-06-30 北京航空航天大学 Distributed collaborative multiple access method and system thereof
CN101860418A (en) * 2009-04-10 2010-10-13 华为技术有限公司 Wireless network cooperative method and system, and network node

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8023524B2 (en) * 2007-10-09 2011-09-20 Nokia Corporation Cooperative relay system enabling simultaneous broadcast-unicast operation with efficient automatic repeat request functionality

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101364823A (en) * 2008-07-17 2009-02-11 上海交通大学 Power distribution method based on MCPA threshold in cooperative communication
CN101388849A (en) * 2008-10-29 2009-03-18 北京航空航天大学 Method for selecting collaboration node
CN101860418A (en) * 2009-04-10 2010-10-13 华为技术有限公司 Wireless network cooperative method and system, and network node
CN101764679A (en) * 2009-12-16 2010-06-30 北京航空航天大学 Distributed collaborative multiple access method and system thereof

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
协作分集中的中继选择方案;陈立娜;《中国优秀硕士论文》;20070615(第2007年第06期);全文 *
陈立娜.协作分集中的中继选择方案.《中国优秀硕士论文》.2007,(第2007年第06期),全文.

Also Published As

Publication number Publication date
CN102186220A (en) 2011-09-14

Similar Documents

Publication Publication Date Title
CN102006658B (en) Chain game based synergetic transmission method in wireless sensor network
CN101868030B (en) Distributed wireless network wireless resource distribution method
CN101827418B (en) Energy optimization-based cognitive radio multicast routing method
CN103415077B (en) A kind of joint relay selection and the method and system of power distribution
Ning et al. Integration of scheduling and network coding in multi-rate wireless mesh networks: Optimization models and algorithms
CN103167587B (en) A kind of relay node selecting method of relaying cooperation mobile communication system
Zhang et al. Resource allocation for wireless cooperative networks: A unified cooperative bargaining game theoretic framework
CN104581780A (en) Preprocessing-based branch dividing and cutting combined network optimizing and wave beam forming method
CN105873219A (en) GASE based TDMA wireless Mesh network resource allocation method
CN107769823A (en) A kind of information energy cooperative beam manufacturing process based on cognition bilateral relay network
CN102186220B (en) Communication method of wireless cooperative relay network
CN107426792A (en) A kind of work(of purpose user scrambling divides energy acquisition to relay safe transmission scheme
Banerjee et al. A decision model for selecting best reliable relay queue for cooperative relaying in cooperative cognitive radio networks: the extent analysis based fuzzy AHP solution
Sivakumar et al. Node scheduling problem in underwater acoustic sensor network using genetic algorithm
Vassaki et al. Spectrum leasing in cognitive radio networks: A matching theory approach
Iqbal et al. Access mechanism in wireless powered communication networks with harvesting access point
CN104202790A (en) Power self-adaptation based MIMO-CCRN bottleneck effect elimination method
CN104320839A (en) Relay selection method based on multi-source multi-relay wireless network power minimization
CN105959043A (en) Multi-base station cooperative transmission strategy in energy efficiency drive
Majid Butt et al. Relay selection schemes to minimise outage in wireless powered communication networks
Liu et al. Approximation algorithms for minimum latency data aggregation in wireless sensor networks with directional antenna
CN109639473B (en) Full-to-full communication method for double-sided array radar ad hoc network
CN103297108A (en) Upstream beam forming method for multisource multi-relay collaborative network
CN103068027A (en) Optimal power distribution method of multiple relays in frequency flat fading channel
CN103580811B (en) A kind of interference alignment schemes, relevant apparatus and system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C53 Correction of patent for invention or patent application
CB02 Change of applicant information

Address after: 100101 room 1, International Building, No. 801, Haidian District, Beijing, Zhichun Road

Applicant after: DESIREE COX (BEIJING) COMMUNICATIONS EQUIPMENT CO., LTD.

Address before: 100101 room 1, International Building, No. 801, Haidian District, Beijing, Zhichun Road

Applicant before: Cylix (Beijing) Communication Equipment Co., Ltd.

COR Change of bibliographic data

Free format text: CORRECT: APPLICANT; FROM: CYLIX (BEIJING) COMMUNICATIONS EQUIPMENT CO., LTD. TO: CYLIX COMMUNICATION TECHNOLOGY CO., LTD.

C14 Grant of patent or utility model
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20190704

Address after: 450000 Science, Technology and Culture Exchange Center of Beijing Beipu Post, No. 10 Xitucheng Road, Zhengzhou City, Henan Province, 111102

Patentee after: Henan Lemon Zhongchuang Space Co., Ltd.

Address before: Room 801, International Building, No. 1 Zhichun Road, Haidian District, Beijing 100101

Patentee before: DESIREE COX (BEIJING) COMMUNICATIONS EQUIPMENT CO., LTD.

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20200911

Address after: No. 503-39, floor 5, beilifeng international building, Mingli Road West and Shangxian street, Zhengdong New District, Zhengzhou, Henan Province

Patentee after: Henan Tongfang Technology Co., Ltd

Address before: 450000 Science, Technology and Culture Exchange Center of Beijing Beipu Post, No. 10 Xitucheng Road, Zhengzhou City, Henan Province, 111102

Patentee before: Henan Lemon Zhongchuang Space Co.,Ltd.