CN105764145B - The method of power optimization distribution in the double relay systems of increment based on error sign ratio - Google Patents
The method of power optimization distribution in the double relay systems of increment based on error sign ratio Download PDFInfo
- Publication number
- CN105764145B CN105764145B CN201610074194.9A CN201610074194A CN105764145B CN 105764145 B CN105764145 B CN 105764145B CN 201610074194 A CN201610074194 A CN 201610074194A CN 105764145 B CN105764145 B CN 105764145B
- Authority
- CN
- China
- Prior art keywords
- node
- individual
- relay
- variable
- value
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0473—Wireless resource allocation based on the type of the allocated resource the resource being transmission power
-
- 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 proposes the systems and its transport protocol of the double relayings of increment under collaboration communication.It selects the purpose of two relay nodes to be that compared to one relay node improves the reliability of its system, the relay node compared to three or more, and the transmission rate of system can be improved.Meanwhile the expression formula of the approximate calculation amount very little of the bit error rate under this agreement is proposed with the distribution of the optimization for system power.The solution of optimization is found present invention utilizes the method evolved under binary system.After finding the solution of optimization, it can use to carry out the distribution of the optimization of system power, the performance of proposition system and agreement to further improve.Experimental result show proposed method can when not carrying out power optimization distribution the performance of error sign ratio be just significantly better than it is existing optimized using power distribution after best cooperation communication system and agreement, while the method for the optimization of the power distribution proposed can greatly reduce error sign ratio under proposition system and agreement.
Description
Technical field
The present invention relates to fields of communication technology, especially relate to the technical field of collaboration communication.In this neighborhood, this
Invention proposes in the double relay systems of increment with the transmission power of the minimum target of error sign ratio in source node and two relaying sections
The method of optimization distribution between point.
Background technique
In traditional collaboration communication, system model is as shown in Fig. 1.At this point, have a source node, a purpose section
Point and a relay node participate in communication for coordination.In first time slot, source node transmit information to destination node and
Relay node.In second time slot, relay node transmits information to destination node, destination node according to its first time slot and
The signal that second time slot receives carries out maximum-ratio combing, generates decoded signal.According to the forwarding information mode of relay node
Difference, cooperation can be divided into decoding forwarding (DF) agreement and amplification forwarding agreement (AF) and coding cooperative.
Wherein, under decode-forward protocol, relay node elder generation decoded information recompiles information transmission again；In amplification forwarding
Under agreement, relay node only amplifies received signal.Under coding cooperative, it is stronger that relay node generates error correcting capability
Coding is sent to destination node.
But there are the following problems for such trunk protocol and system: 1. when source node to relay node channel quality
When poor, the error sign ratio of relay node is very high.When such signal is transferred to destination node, beneficial effect is not often had,
The error sign ratio of destination node can be improved instead, rather than reduces the error sign ratio of destination node.2. when source node to purpose section
When the channel quality of point is preferable, the cooperation of relay node is not often needed, the mesh for meeting error sign ratio requirement just can be generated
The signal that receives of node.In this case, cooperation mode is still used, the rate of system transmission information can be reduced.
For this purpose, the present invention proposes and analyzes the error sign ratio performance of the double relay systems of increment.Give this system and
The approximate expression of the easy calculating of error sign ratio under agreement, and by this expression formula come the performance of optimization system.It is utilized
The evolvement method proposed, optimally to distribute the transmission power of source node and the transmission power of two relay nodes, so that
In the case that general power is certain, the error sign ratio of system is reduced as far as possible, larger improves the performance of proposed system.It is being proposed
Reduction error sign ratio evolvement method in, two independents variable are converted into binary number first, first fix one under binary system
A variable, another variable of evolving, then reduces the value range of this variable according to the result of evolution.Then, when two
When the value interval that each of variable allows is sufficiently small, the mode for taking joint to evolve carries out under binary system two variables
Intersection, variation and eliminate, optimally to find optimal solution.Finally, using optimal solution come the general power of distribution system.
Summary of the invention
In order to overcome the above-mentioned deficiencies of the prior art, the present invention provides a kind of agreements of communication for coordination, and analyze this
The error sign ratio of system under agreement.In order to further improve the performance of this agreement, the present invention is deduced this error sign ratio
The expression formula of approximate calculation amount very little.Based on this expression formula, the present invention provides a kind of Optimal Distributing System transmission powers
Method, and eliminate the region of search using the method for evolution and carry out Evolution of Population, and avoid falling into Local Minimum.It is obtained
Method can the optimally and accurately power of distribution system, that is, in the case where system total power is certain, by agreement
Power distribution reduce the error sign ratio of system to the greatest extent.
The technical scheme adopted by the invention is that: 1. provide the new agreement of communication for coordination, under this agreement, only in system mesh
Node decoding end occur decoding error when just enabling relay node, to accelerate the transmission rate of information.Meanwhile in decoding end
When needing to cooperate, two relay nodes of first use come guarantee transmission reliability.(traditional increment relay system only one
Relay node) 2. the accurate expression formula of error sign ratio under this agreement is provided, and approximation has been carried out to this expression formula, in favor of
The calculating of error sign ratio.3. the method for the power distribution under this agreement is provided, to lead in the case where system total power is certain
Overpower distributes to reduce the error sign ratio of system.4. improved using the evolvement method under binary system Solve problems precision and
Performance.
Compared with prior art, the beneficial effects of the present invention are: 1. under various channel models, experimental result is it is stated that institute
The performance of the agreement of proposition is better than the agreement of existing communication for coordination.2. experimental result illustrates under new agreement simultaneously by based on mistake
The power distribution method of symbol rate further can largely continue the performance of raising system.
System model proposed by the invention is as shown in Fig. 2, and the double relay systems of increment are by a source node S, in two
After node R 1, (traditional only one relay node of increment relay system, is selected in two for R2 and destination node D composition
It is to be balanced well between reliability and transmission rate after node, the relay node of selection will be greatly reduced too much
The transmission rate of system, and a relay node is only selected to will increase on error sign ratio).Source node to destination node, save by source
Point arrives relay node R1, source node to relay node R2, relay node R1 to destination node D, relay node R2 to destination node D
Channel gain be respectively hsd、hsr1、hsr2、hrd1、hrd2, it is zero that they, which obey mean value, and variance is respectivelyRayleigh distributed.Assuming that each node configures an antenna, and at each node
Noise be additive white Gaussian noise, and obey mean value be zero, variance N0Gaussian Profile.Under this system, only
When loading error occurring from source node to destination node, destination node just requests two relay nodes to cooperate simultaneously.Because this
In there are two relay node, and just enable them when really needing them and cooperating, it is increasing that the present invention, which names this system,
Measure double relay systems.
Communication protocol under the double relay systems of the increment proposed is described in detail below: in first systematic time slot,
Source node transmits signals to destination node, meanwhile, relay node R1, R2 also can receive the signal of source node transmitting, then
In two kinds of situation: 1) in case 1, destination node D judges correct (this of the signal interpretation received in first systematic time slot
When the code word that receives passed through the verifying of channel coding), destination node D directly exports decoding result, while destination node D is logical
Transmission bit " 1 " is crossed to notify two relay nodes R1 and R2 not to need to carry out cooperation transmission at this time, in this way, source node S is under
One system time gap can continue to send signal to improve transmission rate.2) in case 2, the signal that destination node D is received
Mistake (mistake occurs for the verifying of error correcting code) occurs in decoding, destination node D notifies two relayings by sending bit " 0 "
Node R 1 and R2 require to carry out reliability of the cooperation transmission to improve the transmission of system at this time, and two relay nodes R1 and R2 are logical
It crosses to receive the bit " 0 " that destination node is sent and just learn and needs to participate in cooperating at this time, in second time slot of system, relaying section
Signal of the point R1 after oneself is decoded and re-encoded by the way of DF (decoding forwarding) by this time slot is transmitted to destination node
D, in third time slot, another relay node R2 in this time slot by the way of same decoding forwarding by oneself decoding and again
Signal after coding is transmitted to destination node D, in this case, destination node is by the signal received in three time slots using maximum
It is exported again after being decoded than combined method.Meanwhile different, the traditional increment relay system with traditional increment relay system
Judge whether to allow relay node cooperation with the signal-to-noise ratio of destination node, and is verified using error correcting code here to decide whether to need
Two relay nodes are allowed all to cooperate, the method proposed is operationally easier.
Further, the first time slot, to the broadcast message of source node, destination node and relay node R1, what R2 was received
Signal ysd, ysr1And ysr2Respectively
Wherein, P1For the transmission power of source node S, x is the signal of transmitting, nsd、nsr1、nsr2Respectively destination node and
Additive white Gaussian noise at relay node R1, relay node R2.If the signal quality that the first time slot destination node receives is not
(noise is smaller) is reached, then relay node R1, R2 will be adopted after the signal interpretation received respectively in second and third time slot
It is encoded with coding mode identical with source node, relays to destination node.Second, third time slot receives destination node
Signal yrd1, yrd2Are as follows:
Wherein, P2, P3The transmission power of respectively relay node R1, R2, x ' are the signal of two relay nodes forwarding, nrd1
And nrd2For the additive white Gaussian noise at purpose node.
The performance of the error sign ratio (SER) of the double relay systems of this increment will be analyzed below.A signal warp is given first
The average SER expression formula after merging again by maximum-ratio combing mode after n independent pathway is decayed at destination node is crossed, is then transported
With this expression formula, the double relay systems of this increment is derived and have been averaged the accurate expression of SER.
When to using M-PSK modulation system transmitting signal, the SER of single receiving node can be exactly represented as
Wherein, r be single node at instantaneous signal-to-noise ratio, r=P | h |2/N0, h be rayleigh distributed channel gain coefficient and its
Variance is δ2, P is the transmission power of transmitting node, b=sin2(π/M), M are the index of modulation.Instantaneous signal-to-noise ratio r is to obey index
The stochastic variable of distribution, according to the Moment generating fuction (Moment Generating Function, MGF) of exponential function, at this time
The average SER of single receiving node is represented by
When destination node using maximum-ratio combing mode merge n item by independent channel it is weak and reach signal when,
Its output signal-to-noise ratio is the sum of the signal-to-noise ratio of the road n independent channel, and the transmission power for defining each node is P, then its instantaneous SER can
It is expressed as
Wherein, r1、r2、...、rnSignal-to-noise ratio on respectively n independent channel, h1、h2、...、hnRespectively n item is independent
The channel fading coefficient in path, it is zero that they, which obey mean value, and variance is respectively δ1 2、δ2 2、...、δn 2Rayleigh distributed.Because each
It is mutually indepedent between channel, according to the MGF of exponential function, merge what the road n process independently decayed using maximum-ratio combing mode
After signal, the average SER of output is
In the double relay systems of increment, the case where decoding error at destination node, can be classified as four kinds:
(1) decoding error, and two relay nodes occur for destination node under the link that direct transfers in first time slot of agreement
Decoding error occurs for R1, R2.
(2) decoding error occurs for the destination node in link that direct transfers, and relay node R1 decoding is correct, and relay node R2 is decoded
Mistake, after destination node merges source node and the signal of relay node R1 transmitting using maximum-ratio combing (MRC) mode, when output
Decoding error occurs.
(3) decoding error occurs for the destination node in link that direct transfers, and decoding error, relay node R2 solution occur for relay node R1
Code is correct, and after destination node merges source node and the signal of relay node R2 transmitting using MRC mode, it is wrong that decoding occurs for when output
Accidentally.
(4) decoding error occurs for the destination node in link that direct transfers, and relay node all decode correctly, and destination node is using MRC
After mode merges source node and the signal of relay node transmitting, decoding error occurs for when output.
So when being modulated using M-PSK, system is averaged error sign ratioIt can be expressed as
Wherein,Respectively corresponding in situation (1), (2), (3), (4) lower proposed agreement
Average error sign ratio at destination node.Since source node to destination node, source node is to relay node R1, and source node is in
After node R 2, relay node R1 to destination node D, the channel gain of relay node R2 to destination node D are respectively hsd、hsr1、
hsr2、hrd1、hrd2, it is zero that they, which obey mean value, and variance is respectivelyRayleigh distributed,
It is possible to further derive
Formula (11)~(14) are substituted into formula (10), the system that can be obtained is averaged the exact value of SER.
The error sign ratio expression formula of the double relay systems of increment is presented above, since its expression formula is very complicated, in order in source
Power distribution is optimally carried out between node and two relay nodes, it is necessary to be simplified to its expression formula.The present invention is in height
Approximation has been carried out to formula (10) under signal-to-noise ratio.I.e.
Work as P1/N0When → ∞,
Similarly
Then formula (11) can be written as following form
Similarly, formula (12), (13), (14) can distinguish abbreviation and are
WhereinB=sin2(π/M), Formula (15), (16), (17), (18) are added as increasing
Double approximate error sign ratios of the relay system under high s/n ratio are measured, i.e.,
Attached drawing 3 is the comparison diagram of increment double relay system error sign ratio approximations and exact value under high s/n ratio, by Fig. 3
It is found that curve of approximation is almost overlapped with exact value curve, therefore in high s/n ratio feelings when the general power of system is higher than 15db
Exact value can be substituted with approximation under condition carry out power distribution.And in cooperation communication system, it is usually that work is believed in height
It makes an uproar than under, therefore the calculating of the error sign ratio of proposed system can use the calculating of obtained approximate expression and come
At.
In this manner it is possible to the power distribution method of the optimization based on error sign ratio under the system proposed be converted into as
The optimization problem of lower with constraint conditions: that is, in condition (1) P=P1+P2+P3, (2) P1≥0 (3)P2≥0 (4)P3>=0 lower minimum
Change function phitotal(P1, P2, P3)=φtotal(e).Condition (1) is brought into formula (19), problem above can be converted into and be contained only
The optimization problem of two independents variable, that is, in constraint condition: (1) P >=P1>=0, (2) 0≤P2≤P-P1Lower minimum function
Here, due to needing to optimize there are two independent variable, first with the general power P of given system to the two independents variable
It is normalized, former problem can convert are as follows: in condition (1)With condition (2)
Lower minimum function
For this purpose, the invention proposes a kind of minimums in the method for superior function.Due to independent variable β1、β2All between zero and one,
They can be indicated with binary fractional fixed point of D bit.The present invention is optimally determined certainly using following two strategy
The value of the optimization of variable: (1) equal interal separations is carried out to the value range of the reservation of an independent variable, and in each section
S value is taken at random, (2) are determined by the method for the random evolution under binary system in the case where this independent variable is constant,
The value of the optimization of another independent variable, reduces objective function.Then, only retain the section that those of keeps objective function small, wash in a pan
Eliminate other sections.(3) to variable β1And β2Alternately execution above step (1) and (2) is taken turns repeatedly respectively, until each of they
The section of reservation is sufficiently small.(4) the joint value interval all remained to reasonable two independents variable is evolved by joint
Method reduces objective function.After all such joint section traversal processings, only retaining makes the smallest joint of objective function
The optimal solution evolved on section and this section.
The method of the optimization of the power distribution proposed can be described as:
1. first possible value interval of independent variable is divided into N number of equal-sized subinterval To each subinterval It, S value s in this section is evenly distributedly generated at randomT, i.To each sT, i, find
With the value p of second independent variable of its Optimized Matchingn, make φtotal(sT, i, pn) become smaller.
1.1) herein, first pnBinarization indicates p with binary numbern.For binary number (0.pn1,
pn2..., pnk..., pnD)2, D is its minimum binary decimal place, there is (0.pn1, pn2..., pnk..., pnD)2=
pn1*2-1+pn2*2-2+...+pnk*2-k+...+pnD*2-D.Then, with the random method generation first generation about (0.pn1,
pn2..., pnk..., pnD)2Initial populationN indicates kind
M-th of individual in group, 0 indicated for the 0th generation,The uniformly random value in its possible value interval, M are population rule
Mould.In this way, just producing the population in g=0 generation.
1.2) it then, utilizesFor fitness function, select to make from g generationIt is small
M/2Individual, eliminating M/2 makesBig M/2Individual.This selected M/
2 individuals constitute follow-on initial population
Optional group is set as the group in this initial g+1 generation.
1.3) then, kth (1≤k≤M/4) randomly selects two parent individualities, m from optional group secondaryly1It is a
IndividualWith m2IndividualThe randomly integer from 1 to D
In, determine crossover location c (m1, m2)=cm, cm are equally distributed random integers from 1 to D.Generate two friendships in the next generation
Son individual after fork
With
Complete crossover operation.Setting mutation probability is pm, the above individualWithEach of
Binary digit becomes 0 from original 1 with the probability of pm, or becomes 1 from original 0.Two offspring individuals point that variation is completed
It is not denoted asWithAnd g+1 is placed them into group.And m1Individual and the
m2Individual is deleted from optional group.The step for repeating, until optional group is that sky (has been carried out M/4 selection
Operation).
1.4) above 1.2nd step and the 1.3rd step are repeated, until producing g=gmaxUntil the population of algebra.It calculates
GmaxFor making in populationIt is worth the smallest individualFrom each subinterval institute
All s generatedT, iMiddle selection NS makeThe smallest sT, i, and seek these sT, iCorresponding to upperMean value, this mean value is denoted as
Then, retainIt is worth small N/NrA subinterval, eliminates remaining subinterval, thus reduces subsequent
First variable β in operation1Value range.
2. second possible value interval of independent variable is divided into N number of equal-sized subinterval To each subinterval Ju, R value in this section is generated uniformly at randomTo each
Find the value s in the section that do not eliminate in first independent variable with its Optimized Matchingi, makeBecome smaller.
2.1) herein, siBinarization indicates s with binary numberi.For binary number (0.si1,
si2..., sik..., siD)2, D is its minimum binary decimal place, there is (0.si1, si2..., sik..., siD)2=
si1*2-1+si2*2-2+...+sik*2-k+...+siD*2-D.Meanwhile siValue should its retain interval range in.Then, it uses
Random method generate the first generation about (0.si1, si2..., snk..., snD)2Initial populationM indicates m-th of individual in population, and 0 indicated for the 0th generation,
The uniformly random value in its possible value interval, M are population scale.Simultaneously in its initial population, each size phase
Deng reservation section should be comprising individual as much.In this way, just producing the population in g=0 generation.
2.2) it then, utilizesFor fitness function, select to make from g generationIt is small
M/2Individual, eliminating M/2 makesBig M/2Individual.This selected M/2
Individual constitutes follow-on initial population
Optional group is set as the group in this initial g+1 generation.
2.3) then, kth (1≤k≤M/4) randomly selects two parent individualities, m from optional group secondaryly1It is a
IndividualWith m2IndividualRandomly in the integer from 1 to D,
Determine crossover location c (m1, m2)=cm, cm are equally distributed random integers from 1 to D.After generating two intersections in the next generation
Son individual
With
Complete crossover operation.Setting mutation probability is pm, the above individualWithEach of
Binary digit becomes 0 from original 1 with the probability of pm, or becomes 1 from original 0.Two offspring individuals point that variation is completed
It is not denoted asWithAnd g+1 is placed them into group.And m1Individual and m2
Individual is deleted from optional group.The step for repeating, until optional group is that sky (has been carried out M/4 selection behaviour
Make).
2.4) above 2.2nd step and the 2.3rd step are repeated, until producing g=gmaxUntil the population of algebra.It calculates
GmaxFor making in populationIt is worth the smallest individualFrom each subinterval institute
What is generated is allMiddle selection NS makeIt is the smallestAnd ask theseCorresponding to upperMean value, this mean value is denoted as
Then, retainIt is worth small N/NrA subinterval eliminates remaining subinterval, after thus reducing
Second variable β in continuous operation2Value range.
To the value interval of the reservation of first independent variable, each interval division is smaller NrA section, it is then sharp
With the above step 1, the size of the value interval of the reservation of first independent variable is continued to zoom out.Then, to second independent variable
The value interval of reservation, each interval division are smaller NrA section, eliminating makes first independent variable and second change certainly
Amount is added the subinterval greater than 1, then utilizes the above step 2, continues to zoom out the value interval of the reservation of second independent variable
Size.This step is executed repeatedly, until the size in the subinterval of each reservation of two independents variable is both less than ls.
3. combining section composed by the section pair each retained as two independents variable, the joint for carrying out population is evolved, and is looked for
To the solution of optimization.
Combine section to composed by the section retained as two independents variableThe population evolved is generated, wherein sectionFor the section estimated where its optimal value obtained after the method optimization more than being used to first variable, t*For these sections
Call number,For the section estimated where its optimal value obtained after the method optimization more than being used to second variable, u*
For the call number in these sections.
3.1) initial group { (s is generatedi(g), pi(g))|1≤i≤Ng, wherein g=0, i indicate i-th in population
Individual, NgFor the scale of population, simultaneouslyAnd in sectionInterior equally distributed random number,And it is
In sectionInterior equally distributed random number.
3.2) fitness function φ is utilizedtotal(si(g), pi(g)) φ is eliminatedtotal(si(g), pi(g)) the big N of valueg/2
Individual only retains the small N of fitness functiong/ 2 individuals.Between remaining individual composition association areaUnder g+1 generation
Optional population, be arranged g=g+1.
3.3) then, kth (1≤k≤M/4) randomly selects two parent individualities, m from optional group secondaryly1It is a
Individual
With m2Individual Randomly in the integer from 1 to D, crossover location c (m is determined1, m2)=cm, cm be from 1 to D uniformly
The random integers of distribution.Then the son individual after generating the intersection in the next generationWith
Wherein
Complete crossover operation.Setting mutation probability is pm, the above binary number WithIn each binary digit become 0 from original 1 with the probability of pm, or by original 0
Become 1.The son individual that two offspring individuals that variation is completed are remembered respectivelyWithAnd g+1 is placed them into group.And m1Individual and m2Individual is from can
It selects in group and deletes.The step for repeating, until optional group is empty (having been carried out M/4 selection operation).G=is set
g+1。
3.4) above 4.2nd step and the 4.3rd step are repeated, until producing g=gmaxUntil the population of algebra.
Step 4.1-4.4 is traversed composed by all sections retained as two independents variable to combine section, find institute
There is the g in these sectionsmaxMake in big population composed by the individual in generation
It is worth the smallest individual
4. optimal power allocation scheme is source node useTransmission power, relay node 1 useTransmission power, relay node 2 useTransmission power.Wherein, P is
Given total emission power.
In this way, when the mode for finding the power distribution of optimization can be effectively avoided, falling into part by above operation
Minimum problem.And the precision of problem solving is improved, and effective optimization is done to system.
In Figure of description 4, it is shown that the superiority of the scheme of the communication for coordination proposed.It gives and is proposed in figure
System and agreement constant power distribution under error sign ratio curve, the definition of this figure and the SNR in Fig. 5-6 are SNR=10*
log10(P/N0), wherein P is the general power of system transmitting, N0It is the power spectral density of additive white Gaussian noise.SER is system
Error sign ratio, when using the modulation system of Golay mapping, its value is approximately bit error rate BER (the bit error of system
rate).Another curve in this figure be the best communication for coordination of present performance system and agreement do overpower distribution it is excellent
Performance after change.Although performance is as can be seen that the system and agreement that are proposed carry out the optimization of power distribution not yet
Better than the best way in existing communication for coordination.At the SNR of identical 15dB, the system that is proposed and agreement
Error sign ratio is reduced to originalBelow.And it can be seen that increase with Signal to Noise Ratio (SNR), the system proposed and association
View can reduce error sign ratio in bigger degree.
Fig. 5 and Fig. 6 shows that the method using proposed power optimization is capable of the gain of bring system.Fig. 5 be Channel condition under the optimal power allocation method that is proposed and constant power distribution method
Error sign ratio curve comparison figure under this kind of channel condition, utilize proposed optimal power allocation as seen from Figure 5
The error sign ratio performance of system is opposite to increase significantly with constant power distribution.Moreover, being mentioned with the increase of system total power
The performance advantage of optimal power allocation method out is more and more obvious relative to constant power distribution.When system total power is greater than 20db
When, under the requirement of identical error sign ratio, optimal power allocation is more total than the system that constant power distribution can about save 3db or more
Power.
Fig. 6 beOptimal power allocation is obtained under channel and constant power distributes
Error sign ratio curve comparison figure, as seen from Figure 6, under this kind of channel condition, the error symbol of optimal power allocation is forthright
Can advantage with respect to constant power distribution it is obvious that identical as the trend under Fig. 5 situation channel, with the increase of system total power, most
The performance advantage of excellent power distribution is more and more obvious.When system total power is greater than 20db, under the requirement of identical error sign ratio,
Optimal power allocation can about save the system total power of 5db or more than constant power distribution.
Detailed description of the invention
1. the schematic diagram that Fig. 1 is traditional Turbo Detection for Cooperative Communication；
2. the schematic diagram that Fig. 2 is the model of the double relay systems of increment proposed by the invention；
3. Fig. 3 is the approximation of the double relay system error sign ratios of increment and the comparison diagram of exact value；
4. Fig. 4 is system and agreement proposed by the invention (system and agreement 1) and communication for coordination agreement best at present
The error sign ratio comparison diagram of (system and agreement 2)；
5. Fig. 5 is that constant power distributes the figure compared with the error sign ratio of optimal power allocation method proposed by the invention；
6. Fig. 6 is that constant power is distributed with compared with the error sign ratio of optimal power allocation method proposed by the invention
Figure.
Specific embodiment
Following further describes the present invention with reference to the drawings.Attached drawing 2 is the system proposed and the schematic diagram of agreement,
In the agreement proposed, only when mistake occurs for the decoding of source node to destination node, two relay nodes are just joined simultaneously
With cooperate, forward signal；Otherwise source node continues to send signal.Therefore, the lines in figure from relay node to destination node are
Dotted line.Communication protocol under the double relay systems of the increment proposed is described in detail below: first time slot, source node transmitting letter
Number give destination node, meanwhile, R1, R2 also can receive source node transmitting signal, destination node is according to the signal received
Whether Quality estimation needs the cooperation of relay node.If the signal interpretation that destination node receives is correct, do not need to ask
Relay node is asked to participate in cooperation.If mistake occurs in decoding for the signal that destination node receives, (verifying of error correcting code occurs
Mistake), then two relay nodes just need to simultaneously participate in cooperation.At this point, signal of the destination node by one bit of transmission
To notify whether two relay nodes will carry out cooperation transmission.That is, if the signal that destination node receives is just in the first time slot
Really, then in the second time slot, the source node signal that send out next again new；If the signal that destination node receives is incorrect, that
In the second time slot and third time slot, relay node R1 and R2 are respectively adopted DF (decoding forwarding) agreement and signal are transmitted to mesh
Node, last destination node by the signal received in three time slots using maximum-ratio combing method be decoded after it is defeated again
Out.
The approximate solution of error sign ratio under this agreement may be expressed as:
Wherein, source node is to destination node, source node to relay node R1, source node to relay node R2, relay node
R1 to destination node D, the channel gain of relay node R2 to destination node D are respectively hsd、hsr1、hsr2、hrd1、hrd2, they are
Obeying mean value is zero, and variance is respectivelyRayleigh distributed, N0For additive white Gaussian noise
Power spectrum size, P1For the transmission power of transmitting node, P2For the transmission power of first relay node, P3It is second
The transmission power of relay node, b=sin2(π/M), M is signal tune
Coefficient processed.
The optimization problem of the power distribution under this agreement can be converted into following problem as a result: in condition (1)
With condition (2)Lower minimum function
Wherein P is total transmission power that system gives, β1P is the transmission power of source node, β2P is relay node R1's
Transmission power, (1- β1-β2) P be relay node R2 transmission power.
Through a large number of experiments, it is determined that the value of the parameter of the optimization in power optimization method proposed is as follows: the
N=20 subinterval once is divided into the value interval of first variable, takes D=32 decimals to indicate independent variable,
S=50 random point is generated to each subinterval.In Evolution of Population, population scale M=400, mutation probability pm=0.05.NS
=3, i.e., when subinterval is eliminated, each subinterval takes minimum value of 3 minimum values averagely to represent subinterval.Nr=4,
Retain N/N every timer=5 subintervals are for continuing to divide next time.Most algebra of evolution when evolution are gmax=50.The
R=20 subinterval once is divided into the value interval of second variable.To the subinterval of each reservation of two variables
When size is both less than ls=0.025, stop the further diminution to the subinterval of reservation.Kind when two variable joints are evolved
Group's scale Ng=200.
The step of optimization of power distribution, is as described below:
1. first possible value interval of independent variable is divided into N number of equal-sized subintervalTo each subinterval It, S value s in this section is evenly distributedly generated at randomT, i.To every
A sT, i, find the value p with second independent variable of its Optimized Matchingn, make φtotal(sT, i, pn) become smaller.
1.1) herein, first pnBinarization indicates p with binary numbern.For binary number (0.pn1,
pn2..., pnk..., pnD)2, D is its minimum binary decimal place, there is (0.pn1, pn2..., pnk..., pnD)2=
pn1*2-1+pn2*2-2+...+pnk*2-k+...+pnD*2-D.Then, with the random method generation first generation about (0.pn1,
pn2..., pnk..., pnD)2Initial populationM indicates kind
M-th of individual in group, 0 indicated for the 0th generation,The uniformly random value in its possible value interval, M are population rule
Mould.In this way, just producing the population in g=0 generation.
1.2) it then, utilizesFor fitness function, select to make from g generationIt is small
M/2Individual, eliminating M/2 makesBig M/2Individual.This selected M/
2 individuals constitute follow-on initial population
Optional group is set as the group in this initial g+1 generation.
1.3) then, kth (1≤k≤M/4) randomly selects two parent individualities, m from optional group secondaryly1It is a
IndividualWith m2IndividualThe randomly integer from 1 to D
In, determine crossover location c (m1, m2)=cm, cm are equally distributed random integers from 1 to D.Generate two friendships in the next generation
Son individual after fork
With
Complete crossover operation.Setting mutation probability is pm, the above individualWithEach of
Binary digit becomes 0 from original 1 with the probability of pm, or becomes 1 from original 0.Two offspring individuals point that variation is completed
It is not denoted asWithAnd g+1 is placed them into group.And m1Individual and the
m2Individual is deleted from optional group.The step for repeating, until optional group is that sky (has been carried out M/4 selection
Operation).
1.4) above 1.2nd step and the 1.3rd step are repeated, until producing g=gmaxUntil the population of algebra.It calculates
GmaxFor making in populationIt is worth the smallest individualFrom each subinterval institute
All s generatedT, iMiddle selection NS makeThe smallest sT, i, and seek these sT, iCorresponding to upperMean value, this mean value is denoted as
Then, retainIt is worth small N/NrA subinterval, eliminates remaining subinterval, thus reduces subsequent
First variable β in operation1Value range.
2. second possible value interval of independent variable is divided into N number of equal-sized subintervalTo each subinterval Ju, R value in this section is generated uniformly at randomTo eachFind the value in the section that do not eliminate in first independent variable with its Optimized Matching
si, makeBecome smaller.
2.1) herein, siBinarization indicates s with binary numberi.For binary number (0.si1,
si2..., sik..., siD)2, D is its minimum binary decimal place, there is (0.si1, si2..., sik..., siD)2=
si1*2-1+si2*2-2+...+sik*2-k+...+siD*2-D.Meanwhile siValue should its retain interval range in.Then, it uses
Random method generate the first generation about (0.si1, si2..., snk..., snD)2Initial populationM indicates m-th of individual in population, and 0 indicated for the 0th generation,
The uniformly random value in its possible value interval, M are population scale.Simultaneously in its initial population, each size phase
Deng reservation section should be comprising individual as much.In this way, just producing the population in g=0 generation.
2.2) it then, utilizesFor fitness function, select to make from g generationIt is small
M/2Individual, eliminating M/2 makesBig M/2Individual.This selected M/2
Individual constitutes follow-on initial population
Optional group is set as the group in this initial g+1 generation.
2.3) then, kth (1≤k≤M/4) randomly selects two parent individualities, m from optional group secondaryly1It is a
IndividualWith m2IndividualRandomly in the integer from 1 to D,
Determine crossover location c (m1, m2)=cm, cm are equally distributed random integers from 1 to D.After generating two intersections in the next generation
Son individual
With
Complete crossover operation.Setting mutation probability is pm, the above individualWithEach of
Binary digit becomes 0 from original 1 with the probability of pm, or becomes 1 from original 0.Two offspring individuals point that variation is completed
It is not denoted asWithAnd g+1 is placed them into group.And m1Individual and m2
Individual is deleted from optional group.The step for repeating, until optional group is that sky (has been carried out M/4 selection behaviour
Make).
2.4) above 2.2nd step and the 2.3rd step are repeated, until producing g=gmaxUntil the population of algebra.It calculates
GmaxFor making in populationIt is worth the smallest individualFrom each subinterval institute
What is generated is allMiddle selection NS makeIt is the smallestAnd ask theseCorresponding to upperMean value, this mean value is denoted as
Then, retainIt is worth small N/NrA subinterval eliminates remaining subinterval, after thus reducing
Second variable β in continuous operation2Value range.
3. the value interval of the reservation of pair first independent variable, each interval division is smaller NrA section, then
Using the above step 1, the size of the value interval of the reservation of first independent variable is continued to zoom out.Then, to second independent variable
Reservation value interval, each interval division be smaller NrA section, eliminate make first independent variable and second from
Addition of variables is greater than 1 subinterval, then utilizes the above step 2, continues to zoom out the value interval of the reservation of second independent variable
Size.This step is executed repeatedly, until the size in the subinterval of each reservation of two independents variable is both less than ls.
4. combining section composed by the section pair each retained as two independents variable, the joint for carrying out population is evolved, and is looked for
To the solution of optimization.
Combine section to composed by the section retained as two independents variableThe population evolved is generated, wherein sectionFor the section estimated where its optimal value obtained after the method optimization more than being used to first variable, t*For these sections
Call number,For the section estimated where its optimal value obtained after the method optimization more than being used to second variable, u*
For the call number in these sections.
4.1) initial group { (s is generatedi(g), pi(g))|1≤i≤Ng, wherein g=0, i indicate i-th in population
Individual, NgFor the scale of population, simultaneouslyAnd in sectionInterior equally distributed random number,And it is
In sectionInterior equally distributed random number.
4.2) fitness function φ is utilizedtotal(si(g), pi(g)) φ is eliminatedtotal(si(g), pi(g)) the big N of valueg/2
Individual only retains the small N of fitness functiong/ 2 individuals.I between remaining individual composition association areat×JuUnder g+1 generation
Optional population, be arranged g=g+1.
4.3) then, kth (1≤k≤M/4) randomly selects two parent individualities, m from optional group secondaryly1It is a
Individual
With m2Individual Randomly in the integer from 1 to D, crossover location c (m is determined1, m2)=cm, cm be from 1 to D uniformly
The random integers of distribution.Then the son individual after generating the intersection in the next generationWith
Wherein
Complete crossover operation.Setting mutation probability is pm, the above binary number WithIn each binary digit become 0 from original 1 with the probability of pm, or by original 0
Become 1.The son individual that two offspring individuals that variation is completed are remembered respectivelyWithAnd g+1 is placed them into group.And m1Individual and m2Individual is from can
It selects in group and deletes.The step for repeating, until optional group is empty (having been carried out M/4 selection operation).G=is set
g+1。
4.4) above 4.2nd step and the 4.3rd step are repeated, until producing g=gmaxUntil the population of algebra.
Step 4.1-4.4 is traversed composed by all sections retained as two independents variable to combine section, find institute
There is the g in these sectionsmaxMake in big population composed by the individual in generation
It is worth the smallest individual
5. optimal power allocation scheme is source node useTransmission power, relay node 1 useTransmission power, relay node 2 useTransmission power.Wherein, P is
Given total emission power.
Claims (3)
1. it is a kind of in the double relay systems of increment, it is saved with the system emission power of the minimum optimization aim of system error sign ratio in source
Optimize the method for distribution in point and two relay nodes, it is characterised in that: propose under optimization transmission rate and error sign ratio
The system and communication protocol of the double relayings of increment, analyze the error sign ratio of the system under this system and agreement, and propose calculating
The method for measuring small this error sign ratio of approximate calculation, while proposing under this system and agreement, when the total emission power one of system
Periodically, using error sign ratio as optimization aim, the downsizing and kind of section gradually are scanned for using the representation method of binary number
Group evolution, the method that general power is optimally distributed to source node and two relay nodes, to avoid fall into Local Minimum,
Optimize the performance of this system and agreement, further reduces the error sign ratio of system；
The method of the optimization of power distribution is proposed, the power optimization problem under this system and agreement is converted to belt restraining first
The function minimum problem containing two variables of condition, in this method first the power under the system and agreement proposed point
The optimization problem of following with constraint conditions is converted into using error sign ratio expression formula with problem:
In condition (1)With condition (2)Lower minimum function
Wherein P is total transmission power that system gives, β1P is the transmission power of source node, β2P is the transmitting of relay node R1
Power, (1- β1-β2) P be relay node R2 transmission power, then, utilize evolution method reply containing there are two variable letter
The target of several minimums reduces the value range of first variable, then exchanges the position of first variable and second variable
Reduce the value range of second variable with same method, constantly iteratively in turn reduces the possible of two variables in this way
The size of value interval, until the length until each possible section is less than ls；Then, two variables are remained every
The value of objective function is reduced in a united section using the method that joint is evolved,It is above excellent to take
The solution that change method obtains, then power allocation scheme optimal in the present invention is source node S useTransmission power,
Relay node 1 usesTransmission power, relay node 2 useTransmitting
Power, wherein P is given total emission power,
It proposes and the problem of the minimum of the function of variable, first reduces one of variable to containing there are two using the method evolved
Value range method, first possible value interval of independent variable is divided into N number of equal-sized subinterval firstTo each subinterval It, S value s in this section is evenly distributedly generated at randomT, i, right
Each sT, i, find the value p with second independent variable of its Optimized Matchingn, make φtotal(sT, i, pn) become smaller, to this problem, originally
Invention is utilized following method and is solved, to avoid falling into Local Minimum in optimization process and improving the essence of solution
Degree, herein, first second variable pnBinarization indicates p with binary numbern, for binary number (0.pn1,
pn2..., pnk..., pnD)2, D is its minimum binary decimal place, there is (0.pn1, pn2..., pnk..., pnD)2=
pn1*2-1+pn2*2-2+...+pnk*2-k+...+pnD*2-D, with the random method generation first generation about (0.pn1, pn2...,
pnk..., pnD)2Initial populationM indicates the in population
M individual, 0 indicated for the 0th generation,The uniformly random value in its possible value interval, M are population scale, in this way,
The population in g=0 generation is just produced, then,
A) it utilizesFor fitness function, select to make from g generationSmall M/2Individual, eliminating M/2 makesBig M/2Individual, this it is selected M/2 individual
Constitute follow-on initial populationIt can
Group is selected to be set as the group in this initial g+1 generation,
B) then, kth (1≤k≤M/4) randomly selects two parent individualities, m from optional group secondaryly1IndividualWith m2IndividualThe randomly integer from 1 to D
In, determine crossover location c (m1, m2)=cm, cm are equally distributed random integers from 1 to D, generate two friendships in the next generation
Son individual after fork
With
Crossover operation is completed, setting mutation probability is pm, the above individualWithEach of two into
Position processed becomes 0 from original 1 with the probability of pm, or becomes 1 from original 0, and two offspring individuals of the completion that makes a variation are remembered respectively
ForWithAnd g+1 is placed them into group, and m1Individual and m2It is a
The step for individual is deleted from optional group, is repeated, until optional group is that sky (has been carried out M/4 selection behaviour
Make), g=g+1 is set,
C) above step a) and b) is repeated, until producing g=gmaxUntil the population of algebra, g is calculatedmaxFor in population
MakeIt is worth the smallest individualAll s caused by each subintervalT, i
Middle selection NS makeThe smallest sT, i, and seek these sT, iCorresponding to upperIt is equal
Value, this mean value are denoted as
Then, retainIt is worth small N/NrA subinterval eliminates remaining subinterval, thus reduces subsequent operation
In first variable value range；
Combine section to composed by the section retained as two independents variableWherein sectionIt is excellent to first variable
What is obtained after change estimates the section where its optimal value, t*For the call number in these sections,After optimizing to second variable
What is obtained estimates the section where its optimal value, u*For the call number in these sections, propose that combined optimization finds two independents variable
The method of the value of optimization, step are described as follows:
(a) initial group { (s is generatedi(g), pi(g))|1≤i≤Ng, wherein g=0, i indicate i-th of individual in population,
NgFor the scale of population, simultaneouslyAnd in sectionInterior equally distributed random number,The area Qie Wei
BetweenInterior equally distributed random number,
(b) fitness function φ is utilizedtotal(si(g), pi(g)) φ is eliminatedtotal(si(g), pi(g)) the big N of valueg/ 2
Body only retains the small N of fitness functiong/ 2 individuals, remaining individual form between association areaUnder g+1 generation can
Choose seeds group,
(c) then, kth (1≤k≤M/4) randomly selects two parent individualities, m from optional group secondaryly1Individual
With m2Individual
Randomly in the integer from 1 to D, crossover location c (m is determined1, m2)=cm, cm be from 1 to D uniformly
The random integers of distribution, the son individual after then generating the intersection in the next generationWith
Wherein
Crossover operation is completed, setting mutation probability is pm, the above binary number
WithIn each binary digit become 0 from original 1 with the probability of pm, or become 1 from original 0, variation
Two offspring individuals completed are denoted as sub- individual respectivelyWith
And g+1 is placed them into group, and m1Individual and m2Individual is deleted from optional group, repeats this
Step, until optional group is empty (having been carried out M/4 selection operation), setting g=g+1,
(d) above step (b) and (c) are repeated, until producing g=gmaxUntil the population of algebra,
Step is traversed composed by all sections retained as two independents variable to combine section, find all these sections
gmaxMake in population composed by the individual in generationIt is worth the smallest individual
2. it is as described in claim 1 a kind of in the double relay systems of increment, with the minimum optimization aim of system error sign ratio
The method that system emission power optimizes distribution in source node and two relay nodes, it is characterised in that: propose in increment pair
After the method for the approximate calculation of the error sign ratio under system and agreement and this system and agreement, the double relay systems of increment are by one
A source node S, two relay node R1, R2 and destination node D composition, and traditional increment relay system is in only one
After node, under this system, when loading error occurring only from source node to destination node, destination node is just in request two simultaneously
It cooperates after node R 1 and R2, selects two relay nodes to be here fine in order to carry out between reliability and transmission rate
Balance, the relay node of selection will be greatly reduced the transmission rate of system too much, and select the error symbol under a relay node
Number rate will increase, the agreement proposed are as follows: and in first systematic time slot, source node transmits signals to destination node, meanwhile, in
After node R 1, R2 also can receive the signal of source node transmitting, then in two kinds of situation, 1) in case 1, destination node D
Judge that the signal interpretation received in first systematic time slot is correct, the code word received at this time has passed through testing for channel coding
Card, destination node D directly export decoding result, while destination node D notifies two relay nodes by sending bit " 1 "
R1 and R2 does not need to carry out cooperation transmission at this time, in this way, source node S can continue to send signal in next system time gap to mention
High transfer rate, 2) in case 2, mistake occurs in decoding for the signal that destination node D is received, and (verifying of error correcting code occurs
Mistake), destination node D notifies two relay nodes R1 and R2 to require to carry out cooperation transmission at this time by sending bit " 0 "
To improve the reliability of the transmission of system, two relay node R1 and R2 are by receiving the bit " 0 " of destination node transmission just
It learns and needs to participate at this time to cooperate, in second time slot of system, relay node R1 is in this time slot using the side of decoding forwarding
Formula, the i.e. mode of DF, the signal after oneself is decoded and is re-encoded are transmitted to destination node D, in third time slot, another relaying
Signal of the node R 2 after oneself is decoded and re-encoded by the way of same decoding forwarding by this time slot is transmitted to purpose
Node D, in this case, after the signal received in three time slots is decoded by destination node using the method for maximum-ratio combing
It exports again；Under this agreement, the error sign ratio φ of systemtotal(e) approximate expression formula are as follows:
Wherein, source node is to destination node, source node to relay node R1, source node to relay node R2, and relay node R1 is arrived
Destination node D, the channel gain of relay node R2 to destination node D are respectively hsd、hsr1、hsr2、hrd1、hrd2, they are obeyed
Mean value is zero, and variance is respectively Rayleigh distributed, N0For the power of additive white Gaussian noise
The size of spectrum, P1For the transmission power of transmitting node, P2For the transmission power of first relay node, P3It is saved for second relaying
The transmission power of point, parameter value are respectively as follows: M is signal modulation coefficient.
3. it is a kind of in the double relay systems of increment as described in claim 1, with the minimum optimization aim of system error sign ratio
System emission power optimize the method for distribution in source node and two relay nodes, which is characterized in that the ginseng in method
The method of several optimally values is described as follows: N=20 subinterval is divided into the value interval of first variable for the first time,
It takes D=32 decimals to indicate independent variable, S=50 random point, in Evolution of Population, population is generated to each subinterval
Scale M=400, mutation probability pm=0.05, NS=3, i.e., when subinterval is eliminated, each subinterval takes 3 minimum values to carry out
The average minimum value to represent subinterval, Nr=4, i.e., retain N/N every timerIt evolves for continuing to divide next time in=5 subintervals
When evolution most algebra be gmax=50, R=20 subinterval is divided into the value interval of second variable for the first time,
When being both less than ls=0.025 to the size in the subinterval of each reservation of two variables, stop to the subinterval of reservation into one
The diminution of step, population scale N when two variable joints are evolvedg=200.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610074194.9A CN105764145B (en) | 2016-01-27 | 2016-01-27 | The method of power optimization distribution in the double relay systems of increment based on error sign ratio |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610074194.9A CN105764145B (en) | 2016-01-27 | 2016-01-27 | The method of power optimization distribution in the double relay systems of increment based on error sign ratio |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105764145A CN105764145A (en) | 2016-07-13 |
| CN105764145B true CN105764145B (en) | 2019-10-25 |
Family
ID=56329625
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610074194.9A Active CN105764145B (en) | 2016-01-27 | 2016-01-27 | The method of power optimization distribution in the double relay systems of increment based on error sign ratio |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105764145B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107359928B (en) * | 2017-07-19 | 2020-02-21 | 湘潭大学 | Optimized power distribution algorithm of multi-user single-relay cooperative communication system |
| CN108924899B (en) * | 2018-06-28 | 2021-10-26 | 太原科技大学 | Double-relay selection method of two-hop multi-relay system |
| CN111342881B (en) * | 2020-02-05 | 2021-06-29 | 北京邮电大学 | Method and system for carrying out relay auxiliary transmission based on unmanned aerial vehicle |
| CN111431732B (en) * | 2020-02-11 | 2021-04-20 | 西安交通大学 | Method and system for carrying out increment verification on computer network data plane |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101159931A (en) * | 2007-11-06 | 2008-04-09 | 中兴通讯股份有限公司 | Method of determining relay group of communication relay network |
| CN101404530A (en) * | 2008-10-21 | 2009-04-08 | 西安电子科技大学 | Power distribution method for reducing symbol error rate in AF cooperation communication system |
| CN102790639A (en) * | 2012-07-02 | 2012-11-21 | 端木春江 | Cooperative communication method based on double relays and differential evolution |
| CN103188783A (en) * | 2011-12-27 | 2013-07-03 | 中国移动通信集团公司 | Data relay method, data relay system and relay node |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101434585B1 (en) * | 2008-01-03 | 2014-08-27 | 삼성전자주식회사 | Communication system for transmitting data by using cooperative communication relay |
-
2016
- 2016-01-27 CN CN201610074194.9A patent/CN105764145B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101159931A (en) * | 2007-11-06 | 2008-04-09 | 中兴通讯股份有限公司 | Method of determining relay group of communication relay network |
| CN101404530A (en) * | 2008-10-21 | 2009-04-08 | 西安电子科技大学 | Power distribution method for reducing symbol error rate in AF cooperation communication system |
| CN103188783A (en) * | 2011-12-27 | 2013-07-03 | 中国移动通信集团公司 | Data relay method, data relay system and relay node |
| CN102790639A (en) * | 2012-07-02 | 2012-11-21 | 端木春江 | Cooperative communication method based on double relays and differential evolution |
Non-Patent Citations (1)
| Title |
|---|
| 协作通信最优功率分配算法;端木春江，杨永铎，王培，肖艳丽;《计算机工程与设计》;20120316(第3期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105764145A (en) | 2016-07-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105764145B (en) | The method of power optimization distribution in the double relay systems of increment based on error sign ratio | |
| Li et al. | On the design of relay selection strategies in regenerative cooperative networks with outdated CSI | |
| US20050255808A1 (en) | Method and apparatus to provide power control with finite rate feedback for cooperative relay networks | |
| Berger et al. | Optimizing joint erasure-and error-correction coding for wireless packet transmissions | |
| Altman et al. | Dynamic control of coding in delay tolerant networks | |
| CN105282815B (en) | A kind of more relay selection methods in DF collaborative networks | |
| CN106130687B (en) | Polar code puncturing method based on decoding bit reliability under fading channel | |
| CN107197497B (en) | Optimal relay selection method and device | |
| CN110213016B (en) | Multi-relay selective polarization decoding forwarding method | |
| Boujemaa | Delay analysis of cooperative truncated HARQ with opportunistic relaying | |
| Li et al. | An improved relay selection scheme with hybrid relaying protocols | |
| CN108259135A (en) | The weak polarization code construction method of anti-atmospheric turbulance based on Gaussian approximation theory | |
| CN114390565B (en) | Sparse network coding-based density optimization decoding method | |
| CN110602759B (en) | Optimal dynamic power segmentation method suitable for energy-carrying communication system | |
| CN105897626A (en) | MPPM modulation soft demodulation algorithm and symbol error rate performance estimation method | |
| Sørensen et al. | Scalable denoise-and-forward in bidirectional relay networks | |
| CN105846955B (en) | Multi-beam mobile satellite communication system multi-user association iterative detection decoding method | |
| Geng et al. | Deep deterministic policy gradient for relay selection and power allocation in cooperative communication network | |
| CN104702323A (en) | Antenna selection method based on GA (Genetic Algorithm) | |
| CN108023679A (en) | Iterative decoding zoom factor optimization method based on parallel cascade system polarization code | |
| CN115378548A (en) | Connectionless-oriented binary superposition determined linear network coding transmission method | |
| Yi et al. | Error control code combining techniques in cluster-based cooperative wireless networks | |
| CN111865488B (en) | Code selection method for multi-hop short packet communication | |
| Iyer et al. | In-network computation in random wireless networks: a PAC approach to constant refresh rates with lower energy costs | |
| WO2016123776A1 (en) | Data transmission method and apparatus |
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 |