CN103826295A - Resource optimization algorithm applicable to two-way relay system - Google Patents

Resource optimization algorithm applicable to two-way relay system Download PDF

Info

Publication number
CN103826295A
CN103826295A CN201410033701.5A CN201410033701A CN103826295A CN 103826295 A CN103826295 A CN 103826295A CN 201410033701 A CN201410033701 A CN 201410033701A CN 103826295 A CN103826295 A CN 103826295A
Authority
CN
China
Prior art keywords
power
transceivers
via node
relay
beta
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.)
Granted
Application number
CN201410033701.5A
Other languages
Chinese (zh)
Other versions
CN103826295B (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.)
Xian University of Science and Technology
Original Assignee
Xian University of Science and Technology
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 Xian University of Science and Technology filed Critical Xian University of Science and Technology
Priority to CN201410033701.5A priority Critical patent/CN103826295B/en
Publication of CN103826295A publication Critical patent/CN103826295A/en
Application granted granted Critical
Publication of CN103826295B publication Critical patent/CN103826295B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

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

Abstract

The invention relates to a resource optimization algorithm applicable to a two-way relay system and relates to relay selection and power allocation. Two transceivers uses wireless channels to send pilot sequences respectively; each relay node estimates two hop channel coefficients of each relay node respectively, sets and starts a timer and is then in an intercepting mode, and once a relay access network is intercepted, all other relays stop timers at once and are quilt; the relay which accesses the network is the optimal relay, and the optimal relay broadcasts the channel state information to the two transceivers; the two transceivers calculate each optimal transmitting power and broadcast information with information quantity included; after the optimal relay receives the mixed signals of the two transceivers, PNC mapping is applied to obtain transmitting signals, the optimal transmitting power is calculated, and mapped signals are broadcast; and after the two transceivers receive data transmitted by the optimal relay, each acquires the information transmitted by the other transceiver through PNC demodulation processing. The system transmission speed is improved through allocating resources.

Description

A kind of resource optimization algorithm that is applicable to bidirectional relay system
Technical field
The present invention relates to the resource optimization of bidirectional relay system, is specifically a kind of power division and relay selection algorithm that is applicable to two-way cooperative transmission system.
Background technology
Bi-directional relaying is the efficient protocal that promotes spectrum efficiency, and in bi-directional relaying mechanism, one or more via nodes are configured between two transceivers to set up the transfer of data of both direction.Transmitted in both directions has 3 kinds of implementations: 4 traditional one step process comprise two one-way junction mechanism, and it does not also rely on network code; TDBC (time division broadcast, the time-division multicast) mode of 3 steps needs 3 transmission time slots to exchange two groups of information symbols, has therefore promoted the bandwidth availability of 4 one step process; In order further to promote spectrum efficiency, there is again the MABC (multiple access broadcast, multiple access multicast) of 2 steps, it only needs to take two time slots and can complete the exchange of two groups of information symbols.According to via node different processing mode to received signal, the mode of operation of MABC can be divided into again: ANC (Analog Network Coding, analog network coding) and PNC (Physical-layer Network coding, physical-layer network coding).
In addition studies show that, for specific node pair, only select an optimum relaying for it and can make cooperating relay mechanism obtain maximum value with minimum expense.Document " Relay Selection in Dual-Hop Vehicular Networks " has been studied double bounce DF (Decode-and-Forward, decoding forwards) mobile network's relay selection." Performance Analysis of Hybrid Relay Selection in Cooperative Wireless Systems " considered that via node not only can be operated in DF but also can be operated in AF (Amplify-and-Forward, amplification forwarding) when pattern, the mixed mode relay selection that to maximize received signal to noise ratio be target.And from the analysis that has document, by tasked to source and selected relaying dividing of limited power optimized, the performance of system also can get a promotion.S.Talwar has discussed joint relay selection and the power division of bilateral relay network while using ANC in document " Joint Relay Selection and Power Allocation for Two-Way Relay Networks ".Due to relay forwarding be that in above-mentioned document, in each direction, the transmission of data can exist some power losses from the copy after the mixed signal convergent-divergent of two transceivers, even this loss still exists under optimal power allocation.By contrast, PNC can make up this defect.
As shown in Figure 1, for using the system model of two-way cooperation transmission of PNC, comprise two transceiver (S 1and S 2), M via node (R m, m=1 ..., M), each node is all equipped with an antenna and is operated in semiduplex mode.Imagine direct link between two transceivers very weak to such an extent as to can ignore, they only can complete communication by the help of via node so.This sight may occur in when direct link is by barrier, while blocking as high mountain etc.Every link in hypothetical network all experiences smooth slow fading, and channel remains unchanged in multiple transmission time slots, and mark is relayed to transceiver S from m respectively 1and S 2between multiple symmetric channel coefficient be h mand g m.
In Fig. 1, show the MABC of two steps of carrying out relay selection, in the first step, two transceiver S 1and S 2send data to via node, this can be called MAC (multiple access access) time slot simultaneously.Make x irepresent by S ithe information symbol sending, and meet E{|x i| 2}=P i, E{} represents mathematic expectaion here, P irepresent signal x itransmitted power, the reception signal of m relaying can be expressed as:
y R m = h m x 1 + g m x 2 + n R m
Wherein
Figure BDA0000460909900000022
relaying R m, m=1 ..., the noise at M place.In second step, in M relaying one, supposes that it is m relaying without loss of generality, chosen it is received after signal is modulated and is transmitted to two transceivers.This is called BC (broadcast) time slot.The PNC modulation that via node uses, it does not need to carry out to received signal decoding, has shone upon (PNC mapping process can referring to document " Hot topic:Physical-layer network coding ") and only need simply to apply a kind of PNC.Therefore the signal that two transceivers receive is respectively:
y 1 = h m x R m + n 1
y 2 = g m x R m + n 2
Wherein relaying R msymbol after the PNC of place modulation, meets
Figure BDA0000460909900000034
n i, i=1,2 is the noises at i transceiver place.Afterwards, because each transceiver is known the own data that send before, by PNC demodulation process, they can obtain the data of another transceiver.
For the sake of simplicity, we suppose that noise sample all in network is independent identically distributed AWGN (additive white Gaussian noise), obey and distribute
Figure BDA0000460909900000037
and by transmission bandwidth unitization.According to document " Spectral efficient protocols for half-duplex fading relay channels " and " Hot topic:Physical-layer network coding ", from S 1to S 2and from S 2to S 1, use R machievable rate during as selected relaying is expressed as:
I 12 m = 1 2 min ( C ( P 1 | h m | 2 / σ 2 ) , C ( P R m | g m | 2 / σ 2 ) )
I 21 m = 1 2 min ( C ( P 2 | g m | 2 / σ 2 ) , C ( P R m | h m | 2 / σ 2 ) )
Wherein C (x)=log 2(1+x), exist the factor 1/2 to be because the transmission reality of every information symbol all takies two time slots, cause the spectrum efficiency drop by half in each direction, efficiency of transmission is low.
Summary of the invention
For the defect existing in prior art, the object of the present invention is to provide a kind of resource optimization algorithm that is applicable to bidirectional relay system, improve the transmission rate of system by Resources allocation.
For reaching above object, the technical scheme that the present invention takes is: a kind of resource optimization algorithm that is applicable to bidirectional relay system, comprise two transceiver and multiple potential via nodes that have information interaction, comprise the steps: that S1. two transceivers utilize wireless channel to send respectively pilot frequency sequence, each via node is received after pilot frequency sequence, estimates respectively the channel coefficients h of its two hop channel mand g m, and according to this via node R mdouble bounce channel coefficients h mand g msetting a parameter is
Figure BDA0000460909900000041
timer, wherein a=max (α, β), b=min (α, β), α=| h m| 2/ σ 2represent this via node R mthe unit received signal to noise ratio of the first hop link, β=| g m| 2/ σ 2represent this via node R mthe unit received signal to noise ratio of the second hop link, σ 2for noise power; S2. each via node R mwith one and parameter θ mthe initial value that is inversely proportional to is opened own timer, and decays in zero process all in listen mode at wait timer separately; Once listen to any one relay access network network, other all via nodes stop at once the timer of oneself and exit; S3. the via node of access network is optimum via node, and it broadcasts the channel coefficients h of its two hop channel to two transceivers mand g m; S4. two transceivers calculate respectively optimum transmit power separately according to described channel condition information, broadcast the information of inclusion information amount separately with optimum transmit power simultaneously; S5. described optimum via node receives after the mixed signal from the constant power of two transceivers, and application PNC mapping obtains transmitted signal, calculates optimum transmit power according to local channel state information simultaneously, and the signal after mapping is broadcasted away; S6. two transceivers are all received after the data of optimum via node transmission, according to the data that send before separately, by PNC demodulation process, obtain separately the information that another transceiver sends.
On the basis of technique scheme, in described S2, each via node is according to T m=λ/θ mopen the timer of oneself, wherein T mfor with parameter θ mthe initial value being inversely proportional to, the constant value that λ is initial setting, is used for coordinating the time that between relaying, competition expends.
On the basis of technique scheme, described two transceivers are respectively S 1and S 2, they and via node R moptimum transmit power be by maximize S 1→ R m→ S 2and S 2→ R m→ S 1on both direction, the little person of transmission rate obtains.
On the basis of technique scheme, while optimizing transmitted power, first bi-directional relaying is regarded as to two one-way junction systems, then obtain the suboptimum power of bidirectional relay system.
On the basis of technique scheme, when described suboptimum power is assigned to three node S that participate in communication 1, S 2and R mtime, then promote targeted rate by adjusting suboptimum power or redistributing useless power
Figure BDA0000460909900000051
On the basis of technique scheme, by described power adjustment, as α>=β, to S 1, S 2and relaying R mpower adjustment meet Δ P 1 * = α ( α - β ) ( 2 α + β ) β P ‾ 1 , Δ P 2 * = ( 1 + α β ) Δ P 1 * ,
Figure BDA0000460909900000053
time power optimization problem reach optimum point, wherein
Figure BDA0000460909900000054
for S 1suboptimum performance number; The optimum transmit power value of two transceivers and best relay is:
Figure BDA0000460909900000055
wherein P tfor gross power restriction; Targeted rate now
Figure BDA0000460909900000057
if α≤β, can regard two transceiver S as 1with S 2exchange position.
Beneficial effect of the present invention is: using in the bidirectional relay system of physical-layer network coding, improve the transmission rate of system by Resources allocation.Underway continuing while selection, each via node only needs to know the channel coefficients between own and two transceivers, does not need to know overall CSI (channel condition information).In addition, optimum via node only need be broadcast to local CSI two transceivers and can carry out power optimization.Resource of the present invention is distributed the distributed algorithm that belongs to low expense, in the two-way cooperation transmission of assurance, in two transmission direction fairness, has promoted the transmission rate of system.
Accompanying drawing explanation
Fig. 1 is the system model figure that uses the two-way cooperation transmission of PNC;
The capacity relationship of each link in network when Fig. 2 is the present invention's application suboptimum power policy;
Fig. 3 is for maximizing the link capacity bringing because of Modulating Power for target changes schematic diagram;
When Fig. 4 is M=4 in different mechanisms two directions the little person of speed with the change curve of SNR;
When Fig. 5 is M=1, SNR=15dB in different mechanisms two directions the little person of speed with the change curve of via node position d.
Embodiment
Below in conjunction with drawings and Examples, the present invention is described in further detail.
As shown in Figure 1, first need to draw the optimum transmit power that maximizes the little person of transmission rate in two directions.Maximize two transmission direction S 1→ S 2and S 2→ S 1with R mthe little person of transmission rate during as via node
Figure BDA0000460909900000061
can be regarded as speed equalization problem, can be described as
max P 1 , P 2 , P R m I min m s . t . P 1 + P 2 + P R m ≤ P T
Wherein P 1, P 2represent respectively S 1and S 2transmitted power, P tbe gross power restriction, because the target function in above formula is not continuously differentiable, therefore find optimum transmit power value according to above formula just so not directly perceived.Q.Zhang has introduced the power division of unidirectional DF relay system in document " Power allocation for regenerative relay channel with Rayleigh fading ", and points out distribute more power to the node with poor channel.
As a simple expansion, first the present invention regards bilateral relay network as two one-way junction systems, and obtains suboptimum power by solving following two optimization subproblems:
max P 1 , P R m I 12 m = 1 2 min ( C ( P 1 | h m | 2 / σ 2 ) , C ( P R m | g m | 2 / σ 2 ) ) s . t . P 1 + P R m ≤ P T - P 2
With
max P 2 , P R m I 21 m = 1 2 min ( C ( P 2 | g m | 2 / σ 2 ) , C ( P R m | h m | 2 / σ 2 ) ) s . t . P 2 + P R m ≤ P T - P 1
The solution of two formulas is respectively above
Figure BDA0000460909900000071
Figure BDA0000460909900000072
With
Figure BDA0000460909900000073
Figure BDA0000460909900000074
Wherein α=| h m| 2/ σ 2, β=| g m| 2/ σ 2.The suboptimum power of bidirectional relay system can obtain by merging two formulas above
P ‾ 1 = β 2 α 2 + β 2 + αβ P T
P ‾ 2 = α 2 α 2 + β 2 + αβ P T
P ‾ R m = αβ α 2 + β 2 + αβ P T
In order to understand more intuitively the gap between initial optimization problem and suboptimum power, we utilize the method for drawing to be described.Meanwhile, because bidirectional relay system has symmetry, we only consider here | h m|>=| g m| situation, under symmetric case, | h m|≤| g m|, can be counted as two transceivers and exchanged their position.
As shown in Figure 2, shown in the time that suboptimum power is assigned to 3 nodes that participate in communication the relation of 4 link capacities in system.In the drawings, we are I by the capacity marking of link u → v uv, wherein u, v ∈ { S 1, S 2, R m.In addition, figure link capacity divides into groups according to the data flow in each direction, and the height of each grid has been indicated the size of link capacity.Can find out, suboptimum power policy has caused useless power consumption, and they are not to targeted rate
Figure BDA0000460909900000078
increase play positive acting.Therefore, can promote by adjusting suboptimum power or redistributing those useless power
Figure BDA0000460909900000081
Mark
Figure BDA0000460909900000082
for the suboptimum power according to above-mentioned divides timing link S 1→ S 2achievable rate,
Figure BDA0000460909900000083
for the suboptimum power according to above-mentioned divides timing link S 2→ S 1achievable rate, △ P i>=0, i=1,2 with
Figure BDA0000460909900000084
represent respectively terminal S iwith R mthe performance number of adjusting.Due to
Figure BDA0000460909900000085
as seen from Figure 2, target capacity now be limited to first link pair.Therefore should meet P to the adjustment of power 2decline, P 1rise,
Figure BDA0000460909900000087
rise, increase here
Figure BDA0000460909900000088
in order to promote moreover, transceiver S 2the power of saving should all be assigned to S 1and R m, meet
Figure BDA00004609099000000810
like this, former optimization problem can be equivalent to
max Δ P 1 , Δ P 2 , Δ P R m I min m = min ( I 12 m , I 21 m ) s . t . Δ P 2 = Δ P 1 + Δ P R m
Here meet P 1 = P ‾ 1 + Δ P 1 , P 2 = P ‾ 2 - Δ P 2 And P R m = P ‾ R m + Δ P R m . Obviously, the optimal solution of above formula will be
Figure BDA00004609099000000814
in time, reaches.Due to P 2↓ and
Figure BDA00004609099000000815
s 2→ S 1the transmission rate of direction can be defined as
Figure BDA00004609099000000816
and because P 1with
Figure BDA00004609099000000817
all increase,
Figure BDA00004609099000000818
can not be determined intuitively.But we notice a fact, unless reached exactly
Figure BDA00004609099000000819
otherwise useless power can exist always.Therefore above formula will be
Figure BDA00004609099000000820
time,
C ( α ( P ‾ 1 + Δ P 1 ) ) = C ( β ( P ‾ R m + Δ P R m ) ) = C ( β ( P ‾ 2 - Δ P 2 ) )
Arrive optimum point.Meet constraint
Figure BDA00004609099000000822
under condition, the optimal solution that we finally obtain power adjustment is:
Δ P 1 * = α ( α - β ) ( 2 α + β ) β P ‾ 1
Δ P 2 * = ( 1 + α β ) Δ P 1 *
Δ P R m * = α β Δ P 1 *
Therefore the optimum transmit power value of former problem is
P 1 * = β ( 2 α + β ) P T
P 2 * = P R m * = α ( 2 α + β ) P T
Now relaying R mreceive from S at MAC time slot 1with S 2signal-to-Noise (SNR) meet
Figure BDA0000460909900000093
the result of visible above formula meets PNC and modulates required power control requirement.At this moment targeted rate
I min m * = C ( αβ P T 2 α + β )
As shown in Figure 3, the adjustment of link capacity while having described application optimum transmit power value.Wherein
Figure BDA0000460909900000095
i, j=1,2 marks power adjust to the variation bringing.Although R mplace still has some excess power to cause
Figure BDA0000460909900000097
but these power can not be transferred to other node, otherwise can cause
Figure BDA0000460909900000098
decline, then reduced
Figure BDA0000460909900000099
As shown in Figure 1, in the resource optimization algorithm the present invention relates to, comprise that two have the mutual transceiver of informational needs and multiple potential via node, distributed resource optimization algorithm implementation step is as follows:
S1. two transceiver S 1and S 2utilize wireless channel to send respectively pilot frequency sequence, each via node R m, m=1 ..., M, is receiving after pilot frequency sequence, estimates respectively the channel coefficients h of its two hop channel mand g m, and according to this via node R mdouble bounce channel coefficients h mand g msetting a parameter is
Figure BDA00004609099000000910
timer, wherein a=max (α, β), b=min (α, β), from the expression formula of optimal objective speed, that can make function # mmaximum via node just can form optimal path between two transceivers, and its timer can be designed to reduce at first zero.
S2. each via node R mwith a channel quality θ with them mthe initial value T being inversely proportional to m=λ/θ mopen the timer of oneself, the constant value that λ is initial setting here, is used for coordinating the time that between relaying, competition expends, and its unit depends on θ munit.And each relaying wait for timer separately decay to zero process in listen mode, once listen to via node access network, other all via nodes stop at once the timer of oneself and exit.
S3. the via node of access network is optimum via node, and it broadcasts its double bounce channel condition information h to two transceivers mand g m.
S4. useful signal transmission starts, and two transceivers calculate respectively optimum transmit power separately according to described channel condition information, broadcasts the information that needs transmission with optimum transmit power simultaneously, and this is called multiple access access slot.
S5. described optimum via node receives after the mixed signal from the constant power of two transceivers, and application PNC mapping obtains transmitted signal, calculates optimum transmit power according to local channel state information simultaneously, and the signal after mapping is broadcasted away.
S6. two transceivers are received after the data that optimum via node sends, and according to the data that send before separately, by PNC demodulation process, obtain the information that another transceiver sends respectively.
We assess the performance of described resource optimization algorithm by emulation.A linear one dimension geometric network that comprises M via node for example, and by S 1to S 2parasang.Mark S 1to R mdistance be d m, channel is modeled as
Figure BDA0000460909900000101
and
Figure BDA0000460909900000102
wherein
Figure BDA0000460909900000103
be generated as independent identically distributed multiple Gaussian random variable, κ=3rd, path loss index.By noise power unitization and define SNR=P t/ σ 2.Mechanism relatively comprises random selection via node (RRS, random relay selection), mean allocation transmitted power (EPA, equal power allocation), the joint relay selection that is applicable to two-way ANC junction network and power distribution algorithm (JRSPA) that the document " Joint Relay Selection and Power Allocation for Two-Way Relay Networks " of mentioning in suboptimum power division (SOPA, suboptimal power allocation) and background technology proposes.And we also will show that the embodiment of the present invention is as the performance of the described one-way junction system of document " Power allocation for regenerative relay channel with Rayleigh fading " of spread foundation as benchmark.
As shown in Figure 4, while comparing M=4, each mechanism can reach the little person of transmission rate with the situation of change of SNR on both direction.Apart from d m, m=1 ..., M is produced as and independently between 0 to 1, obeys equally distributed stochastic variable." OPA+RS " is power division and the relay selection algorithm that the present invention proposes, and the optimal solution that its power obtains according to the present invention is estimated.First we observe, and OPA strategy is compared with SOPA mechanism with EPA within the scope of the whole SNR of emulation, can obtain the rate gain of 1-2dB and 3-4dB always, and select can obtain compared with RRS the gain of 4-5dB based on the distributed relay of OPA.And, in Fig. 4, show, be applicable to the JRSPA algorithm performance of two-way ANC relay system far away not as good as the OPA+RS of the present invention's proposition, description in background technology conforms to us for this.In addition,, compared with one-way junction transmission, the performance advantage of the bi-directional relaying of use PNC is along with the increase of SNR is more and more obvious.
As shown in Figure 5, describe each mechanism in the time of M=1, SNR=15dB and on both direction, can reach the little person of transmission rate with the variation of relaying position d.In Fig. 5, clearly show, no matter where relaying is positioned at, the OPA strategy that the present invention proposes can present best performance.By contrast, SOPA poor-performing, the performance of succeeding to the throne in the middle of especially while putting near two transceivers is poorer.We further observe, and because targeted rate has been considered the fairness of two transmission directions, the mid point of two transceivers is optimum positions of relaying.
The present invention is not limited to above-mentioned execution mode, for those skilled in the art, under the premise without departing from the principles of the invention, can also make some improvements and modifications, within these improvements and modifications are also considered as protection scope of the present invention.The content not being described in detail in this specification belongs to the known prior art of professional and technical personnel in the field.

Claims (6)

1. be applicable to a resource optimization algorithm for bidirectional relay system, comprise two transceiver and multiple potential via nodes that have information interaction, it is characterized in that, comprise the steps:
S1. two transceivers utilize wireless channel to send respectively pilot frequency sequence, and each via node is received after pilot frequency sequence, estimates respectively the channel coefficients h of its two hop channel mand g m, and according to this via node R mdouble bounce channel coefficients h mand g msetting a parameter is
Figure FDA0000460909890000011
timer, wherein a=max (α, β), b=min (α, β), α=| h m| 2/ σ 2represent this via node R mthe unit received signal to noise ratio of the first hop link, β=| g m| 2/ σ 2represent this via node R mthe unit received signal to noise ratio of the second hop link, σ 2for noise power;
S2. each via node R mwith one and parameter θ mthe initial value that is inversely proportional to is opened own timer, and decays in zero process all in listen mode at wait timer separately; Once listen to any one relay access network network, other all via nodes stop at once the timer of oneself and exit;
S3. the via node of access network is optimum via node, and it broadcasts the channel coefficients h of its two hop channel to two transceivers mand g m;
S4. two transceivers calculate respectively optimum transmit power separately according to described channel condition information, broadcast the information of inclusion information amount separately with optimum transmit power simultaneously;
S5. described optimum via node receives after the mixed signal from the constant power of two transceivers, and application PNC mapping obtains transmitted signal, calculates optimum transmit power according to local channel state information simultaneously, and the signal after mapping is broadcasted away;
S6. two transceivers are all received after the data of optimum via node transmission, according to the data that send before separately, by PNC demodulation process, obtain separately the information that another transceiver sends.
2. a kind of resource optimization algorithm that is applicable to bidirectional relay system as claimed in claim 1, is characterized in that: in described S2, each via node is according to T m=λ/θ mopen the timer of oneself, wherein T mfor with parameter θ mthe initial value being inversely proportional to, the constant value that λ is initial setting, is used for coordinating the time that between relaying, competition expends.
3. a kind of resource optimization algorithm that is applicable to bidirectional relay system as claimed in claim 1, is characterized in that: described two transceivers are respectively S 1and S 2, they and via node R moptimum transmit power be by maximize S 1→ R m→ S 2and S 2→ R m→ S 1on both direction, the little person of transmission rate obtains.
4. a kind of resource optimization algorithm that is applicable to bidirectional relay system as claimed in claim 3, is characterized in that: while optimizing transmitted power, first bi-directional relaying is regarded as to two one-way junction systems, then obtained the suboptimum power of bidirectional relay system.
5. a kind of resource optimization algorithm that is applicable to bidirectional relay system as claimed in claim 4, is characterized in that: when described suboptimum power is assigned to three node S that participate in communication 1, S 2and R mtime, then promote targeted rate by adjusting suboptimum power or redistributing useless power
Figure FDA0000460909890000021
6. a kind of resource optimization algorithm that is applicable to bidirectional relay system as claimed in claim 5, is characterized in that: by described power adjustment, as α>=β, to S 1, S 2and relaying R mpower adjustment meet Δ P 1 * = α ( α - β ) ( 2 α + β ) β P ‾ 1 , Δ P 2 * = ( 1 + α β ) Δ P 1 * , Δ P R m * = α β Δ P 1 * Time power optimization problem reach optimum point, wherein
Figure FDA0000460909890000023
for S 1suboptimum performance number; The optimum transmit power value of two transceivers and best relay is: P 1 * = β ( 2 α + β ) P T , P 2 * = P R m * = α ( 2 α + β ) P T , Wherein P tfor gross power restriction; Targeted rate now
If α≤β, can regard two transceiver S as 1with S 2exchange position.
CN201410033701.5A 2014-01-23 2014-01-23 Resource optimization algorithm applicable to two-way relay system Expired - Fee Related CN103826295B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410033701.5A CN103826295B (en) 2014-01-23 2014-01-23 Resource optimization algorithm applicable to two-way relay system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410033701.5A CN103826295B (en) 2014-01-23 2014-01-23 Resource optimization algorithm applicable to two-way relay system

Publications (2)

Publication Number Publication Date
CN103826295A true CN103826295A (en) 2014-05-28
CN103826295B CN103826295B (en) 2017-04-12

Family

ID=50761059

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410033701.5A Expired - Fee Related CN103826295B (en) 2014-01-23 2014-01-23 Resource optimization algorithm applicable to two-way relay system

Country Status (1)

Country Link
CN (1) CN103826295B (en)

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103619059A (en) * 2013-12-09 2014-03-05 西安科技大学 Power distribution method of bi-directional collaboration transmission system based on physical-layer network coding
CN104540208A (en) * 2014-12-29 2015-04-22 东北大学 Speed and power self-adaptation method based on physical layer network coding
CN104837194A (en) * 2015-05-11 2015-08-12 南通大学 Bidirectional relay system power distribution method based on AF (Amplify-and-Forward) mechanism
CN104981008A (en) * 2015-05-12 2015-10-14 江苏省邮电规划设计院有限责任公司 Interference-limited relay user power control method
CN105490724A (en) * 2015-12-21 2016-04-13 东南大学 Energy-carrying communication system bidirectional relay selection scheme based on maximization of minimum receiving signal-to-noise ratio
CN105610486A (en) * 2015-12-21 2016-05-25 东南大学 Energy-carrying communication system bidirectional relay selection method based on weight
CN105721027A (en) * 2016-01-20 2016-06-29 西安电子科技大学 On-board bidirectional communication roadside base station antenna and relay vehicle combined selection method
CN106102119A (en) * 2016-08-24 2016-11-09 深圳天珑无线科技有限公司 Link terminal system of selection and device and relay and control method and device
CN106936555A (en) * 2017-03-01 2017-07-07 南通大学 The distribution of bidirectional relay system bit and Poewr control method based on OFDM
CN109219089A (en) * 2018-08-20 2019-01-15 南京航空航天大学 Wirelessly take the maximum capacity transmission method of user oriented fairness in energy bilateral relay network
CN109819510A (en) * 2019-01-30 2019-05-28 天津工业大学 Based on the maximized energy distributing method of user's public information rate

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005094326A2 (en) * 2004-03-29 2005-10-13 Nokia Corporation Method and apparatus to provide power control with finite rate feedback for cooperative relay networks
CN101572654A (en) * 2008-04-30 2009-11-04 华为技术有限公司 Method and equipment for resource allocation
WO2010077291A1 (en) * 2009-01-05 2010-07-08 Thomson Licensing Resource allocation for orthogonal decode-and-forward multiple-input multiple-output relay channels with finite rate feedback
CN102740303A (en) * 2012-05-28 2012-10-17 上海交通大学 Combined power distribution and sub-carrier matching method of improved type relay system
CN102868512A (en) * 2012-09-25 2013-01-09 清华大学 OFDM (orthogonal frequency division multiplexing) two-way relay network resource allocation method for pairing joint sub-carriers

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005094326A2 (en) * 2004-03-29 2005-10-13 Nokia Corporation Method and apparatus to provide power control with finite rate feedback for cooperative relay networks
CN101572654A (en) * 2008-04-30 2009-11-04 华为技术有限公司 Method and equipment for resource allocation
WO2010077291A1 (en) * 2009-01-05 2010-07-08 Thomson Licensing Resource allocation for orthogonal decode-and-forward multiple-input multiple-output relay channels with finite rate feedback
CN102740303A (en) * 2012-05-28 2012-10-17 上海交通大学 Combined power distribution and sub-carrier matching method of improved type relay system
CN102868512A (en) * 2012-09-25 2013-01-09 清华大学 OFDM (orthogonal frequency division multiplexing) two-way relay network resource allocation method for pairing joint sub-carriers

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103619059A (en) * 2013-12-09 2014-03-05 西安科技大学 Power distribution method of bi-directional collaboration transmission system based on physical-layer network coding
CN104540208A (en) * 2014-12-29 2015-04-22 东北大学 Speed and power self-adaptation method based on physical layer network coding
CN104837194A (en) * 2015-05-11 2015-08-12 南通大学 Bidirectional relay system power distribution method based on AF (Amplify-and-Forward) mechanism
CN104837194B (en) * 2015-05-11 2018-08-21 南通大学 A kind of bidirectional relay system power distribution method based on AF mechanism
CN104981008B (en) * 2015-05-12 2018-04-27 江苏省邮电规划设计院有限责任公司 It is a kind of to disturb limited trunk subscriber Poewr control method
CN104981008A (en) * 2015-05-12 2015-10-14 江苏省邮电规划设计院有限责任公司 Interference-limited relay user power control method
CN105610486B (en) * 2015-12-21 2019-01-25 东南大学 A kind of portable communications system bi-directional relaying selection method based on weight
CN105610486A (en) * 2015-12-21 2016-05-25 东南大学 Energy-carrying communication system bidirectional relay selection method based on weight
CN105490724A (en) * 2015-12-21 2016-04-13 东南大学 Energy-carrying communication system bidirectional relay selection scheme based on maximization of minimum receiving signal-to-noise ratio
CN105721027A (en) * 2016-01-20 2016-06-29 西安电子科技大学 On-board bidirectional communication roadside base station antenna and relay vehicle combined selection method
CN106102119A (en) * 2016-08-24 2016-11-09 深圳天珑无线科技有限公司 Link terminal system of selection and device and relay and control method and device
CN106936555A (en) * 2017-03-01 2017-07-07 南通大学 The distribution of bidirectional relay system bit and Poewr control method based on OFDM
CN106936555B (en) * 2017-03-01 2020-02-18 南通大学 OFDM-based bidirectional relay system bit allocation and power control method
CN109219089A (en) * 2018-08-20 2019-01-15 南京航空航天大学 Wirelessly take the maximum capacity transmission method of user oriented fairness in energy bilateral relay network
CN109219089B (en) * 2018-08-20 2020-01-21 南京航空航天大学 User fairness oriented capacity maximization transmission method in wireless energy-carrying bidirectional relay network
CN109819510A (en) * 2019-01-30 2019-05-28 天津工业大学 Based on the maximized energy distributing method of user's public information rate
CN109819510B (en) * 2019-01-30 2021-06-25 天津工业大学 Energy distribution method based on user public information rate maximization

Also Published As

Publication number Publication date
CN103826295B (en) 2017-04-12

Similar Documents

Publication Publication Date Title
CN103826295A (en) Resource optimization algorithm applicable to two-way relay system
Pitaval et al. Full-duplex self-backhauling for small-cell 5G networks
Li et al. 2D time-frequency interference modelling using stochastic geometry for performance evaluation in low-power wide-area networks
CN103118414B (en) Wireless access control and timeslot allocation method applicable to ultra-wideband
CN102573033B (en) Multi-Femtocell downlink power interference control method based on game theory
Shalmashi et al. Cooperative device-to-device communications in the downlink of cellular networks
CN102332963B (en) Symbol-based physical-layer network coding method for two-way relay communication system
CN105071840B (en) A kind of joint implementation method of the control of AF bidirectional relay systems node transmitting power and intermediate position deployment
CN101527587A (en) Method, system and relay equipment for power control
CN104702396A (en) Joint resource allocation method for collaboration multi-relay cognitive system based on effectiveness
CN104918239A (en) Secure transmission method based on non-trusted cognitive user collaboration interference
CN104967472A (en) Optimal power distribution and relay deployment method of full duplex bidirectional decoding forwarding relay
CN103957597A (en) Relay selection and power combined optimization method based on selective subcarrier pairing
CN103619059B (en) The power distribution method of two-way cooperative transmission system based on physical-layer network coding
CN104717662A (en) Cooperation relay transmission method based on joint space-time frequency spectrum sharing
CN106572542A (en) Combined optimal time/power resource distribution method of opportunistic cofrequency full-duplex/bidirectional relay
Hisham et al. Radio resource management for V2V multihop communication considering adjacent channel interference
CN102123490B (en) Power distribution method of two-way multi-hop network based on physical layer network coding
CN104683008A (en) Self-adaptive switch transmission method applicable to bi-directional relay system
CN103368692A (en) Self-adaption variable-time slot analog network coding strategy in two-way relay system
CN105142200A (en) Multi-user selection method of full duplex both-way relay system based on instantaneous state information
CN103281695B (en) A kind of hop relay network frequency spectrum planing method
CN101800567A (en) Method for distributing forwarding time slot and selecting relay node in cooperative ultra-wide band
CN105307268A (en) Bidirectional cooperation type anti-interference spectrum access method based on time and bandwidth distribution
Fairouz et al. Uplink V2I communication based on non orthogonal multiple acess

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
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20170412

Termination date: 20200123