CN107071886A - A kind of optimal power allocation method of insincere junction network under bounded CSI - Google Patents

A kind of optimal power allocation method of insincere junction network under bounded CSI Download PDF

Info

Publication number
CN107071886A
CN107071886A CN201610893300.6A CN201610893300A CN107071886A CN 107071886 A CN107071886 A CN 107071886A CN 201610893300 A CN201610893300 A CN 201610893300A CN 107071886 A CN107071886 A CN 107071886A
Authority
CN
China
Prior art keywords
node
bob
relay node
power allocation
alice
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
CN201610893300.6A
Other languages
Chinese (zh)
Other versions
CN107071886B (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.)
Northwestern Polytechnical University
Original Assignee
Northwestern Polytechnical University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Northwestern Polytechnical University filed Critical Northwestern Polytechnical University
Priority to CN201610893300.6A priority Critical patent/CN107071886B/en
Publication of CN107071886A publication Critical patent/CN107071886A/en
Application granted granted Critical
Publication of CN107071886B publication Critical patent/CN107071886B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04TPC
    • H04W52/18TPC being performed according to specific parameters
    • H04W52/24TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters
    • H04W52/241TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters taking into account channel quality metrics, e.g. SIR, SNR, CIR, Eb/lo
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04TPC
    • H04W52/18TPC being performed according to specific parameters
    • H04W52/26TPC being performed according to specific parameters using transmission rate or quality of service QoS [Quality of Service]
    • H04W52/267TPC being performed according to specific parameters using transmission rate or quality of service QoS [Quality of Service] taking into account the information rate
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04TPC
    • H04W52/30TPC using constraints in the total amount of available transmission power
    • H04W52/34TPC management, i.e. sharing limited amount of power among users or channels or data types, e.g. cell loading
    • H04W52/346TPC management, i.e. sharing limited amount of power among users or channels or data types, e.g. cell loading distributing total power among users or channels
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04TPC
    • H04W52/38TPC being performed in particular situations
    • H04W52/46TPC being performed in particular situations in multi hop networks, e.g. wireless relay networks

Landscapes

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

Abstract

The invention provides a kind of optimal power allocation method of insincere junction network under bounded CSI, the communication plan of double bounce half-duplex relay network is described first, optimal power allocation scheme is provided, and then obtains the lower bound of safe rate, ultimate analysis channel ESR, obtains reachable safe rate.Distribute formula to maximize safe rate The present invention gives the optimized power in transmitting procedure, the ESR under high SNR is further analyzed, for assessing reachable average security speed.Approximate optimized power distribution, which can be brought, distributes higher safe rate than constant power.

Description

Optimal power distribution method for untrusted relay network under bounded CSI
Technical Field
The invention relates to an optimal power distribution scheme of an untrusted relay network under the condition of bounded channel estimation errors.
Background
The multi-hop relay is considered as an energy-efficient transmission scheme and is the optimal approach for solving the wireless communication safety. The method for the physical layer secure transmission has the advantages of low computational complexity and resource saving. In recent years, cooperative diversity techniques have attracted the attention of many scholars because they can improve the security of the physical layer against eavesdropping.
In the physical layer there is a gaming problem of power distribution between users and interference sources. The interferer wants to transmit an interfering signal with sufficient power to avoid eavesdroppers from eavesdropping on the user's transmitted information, and the user also wants the transmitted signal to have sufficient power to guarantee the rate of signal transmission. Under the condition of a certain total power, many scholars have made corresponding researches on how to find an optimal power allocation scheme to maximize the safe rate.
Document 1, "originating He, affinity based with an undirected relay [ J ]. IEEE trans. inf. theory,2010,56(8): 3807-.
Document 2 "Li Sun, Taiyi Zhang, Yubo Li and Hao niu. performance study ofwo-hop amplification-and-forward systems with untrue process release nodes [ J ]. ieee trans. 3801-, the scheme can maximize the achievable system safety capacity, realize the safety communication of an untrusted Amplified Forward (AF) relay system, but does not consider the optimized power distribution, furthermore, document 2 is studied based on a perfect Channel State Information (CSI) condition, and a perfect CSI cannot be obtained in an actual communication environment.
Document 3 "life Wang, large Elkashlan, king Huang, Nghi h. tan, et al. secure transmission with optimal power allocation in undiusted delaynetworks [ J ]. ieee commun. let, 2014,3(3): 289-292" expands the study of document 2 to a two-hop amplified repeater network and tests the effects of large-scale antenna arrays. When the large-scale antenna array is at the source node, the ESC only depends on the channel state information between the relay and the destination node; when the large-scale antenna array is at the destination node, the ESC depends only on the channel state information between the relay and source nodes. However, document 3 only considers maximizing the safe capacity and does not consider the energy efficiency, and the same research is performed under the assumption that the state information is perfect.
The above documents all develop studies under the assumption of perfect CSI,however, in a real communication environment, perfect CSI is substantially impossible to achieve. The invention considers the actual communication model and researches the cooperative interference relay communication scheme under the condition of bounded channel estimation error. Extracting a maximum safe rate R under the condition that the statistical information of the channel estimation error can be obtainedsAnd further analyzing a lower bound of the safe Rate and a channel achievable traversal safe Rate (ESR) to obtain an optimal power allocation factor that maximizes both.
Disclosure of Invention
In order to overcome the defects of the prior art, the invention provides an improved optimal power distribution scheme under bounded channel estimation errors on the basis of document 3, and under the condition that a relay node is not credible and the total power is limited, an optimal power distribution factor α is extracted under the condition that the statistical information of the channel estimation errors is availableoptAnd further analyzing the lower bound of the security Rate and the traversal security Rate achievable by the channel (ESR).
The technical scheme adopted by the invention for solving the technical problem comprises the following steps:
step one, in a two-hop half-duplex relay network, in a first time slot, a source node Alice transmits information x to an untrusted relay node RAWhile the destination node Bob transmits the information x to the untrusted relay node RBSignals received by the relay node RWherein, PAAnd PBRespectively representing the transmission power, h, of nodes Alice and BobA-RAnd hB-RComplex channel gains, h, from nodes Alice and Bob to the Relay node R, respectivelyB-R=hR-BnRRepresenting additive white Gaussian noise at the relay node R, and the total power transmitted by the nodes Alice and Bob is P, α∈ [0, 1 ]]Representing the power distribution factor, the node Alice sends the encrypted information power PAα P, the power P of the encrypted information sent by the node BobB(1- α) P, instantaneous signal to interference plus noise ratio received at relay node RWherein, the ratio mu of the equivalent signal-to-noise ratios of the nodes Alice and Bob is gammaA-RB-RAnd equivalent signal-to-noise ratios of the nodes Alice and Bob to the relay node R are respectively expressed as gammaA-R=||hA-R||2P/N0And gammaB-R=||hB-R||2P/N0,N0=1;
Step two, in a second time slot, the relay node R amplifies the received signal and sends the amplified signal to the destination node Bob, wherein the amplification factor is beta; signals sent from the relay node R to the node Bob
Considering that both time slots transmit signals with the same power P, yRNormalized to yR||2Get the amplification factor P
The node Bob receives the signal sent from the untrusted relay node R
Wherein n isBIs additive white gaussian noise received by node Bob,is the estimated channel gain, h, between the untrusted relay node R and the node BobeIs the channel estimation error, hB-RAnd heSatisfy the requirement ofE[he]=0;
Assuming that the channel estimation error obeys 0,]is uniformly distributed, and the signal received by the node Bob is eliminated by self-interference
Thus, for a given channel gain hA-RAnd hB-RThe equivalent SINR obtained at node Bob is
When gamma isB-RWhen the equivalent SINR of the node Bob is more than or equal to 20dB, the equivalent SINR of the node Bob is approximately
Step three, defining the instantaneous safe rateWherein, [ t ]]+=max[t,0](ii) a Firstly, toMaking a derivative with respect to α to obtain a resulting safe rate Rs(α) a maximum optimal power allocation factor;
step four, defining a lower bound of the safety rate
Wherein, Delta1=αμ-α+2;
Substituting the accurate power allocation factor and the approximate power allocation factor at high SNR into each otherObtaining an accurate lower bound of the maximum safe speed and an approximate lower bound of the maximum safe speed under high SNR;
step five, defining ESR as | | | he||2Mathematical expectations for the maximum safe rate achievable over all implementations, i.e.To pairDerived by α derivation
At gammaB-RUnder the condition of more than or equal to 20dB, theIs approximately expressed as
Gamma is more than or equal to 0A-R≤2γB-RUnder the conditions of (1), obtainingThe maximum approximately optimal power allocation factor is
The invention has the beneficial effects that: under the condition that the channel estimation error is bounded, in order to reduce complexity, an approximately Optimized Power Allocation (OPA) formula in the transmission process is given to maximize a safe rate. And further analyzing the lower bound of the safety rate and the ESR under high SNR to evaluate the achievable average safety rate, and the simulation result proves the effectiveness of the scheme.
Drawings
Fig. 1 is a schematic diagram of two-hop relay network cooperative interference and secure transmission;
fig. 2 shows that when μ ═ 1, α and γ are differentB-RSchematic diagram of ESR distribution under;
FIG. 3 is a graph of traversal safety rate, upper and lower bounds of safety rate with gamma for an optimal power allocation factorB-RA trend graph of the change.
Detailed Description
The present invention will be further described with reference to the following drawings and examples, which include, but are not limited to, the following examples.
The system model used by the present invention is a relay network with three nodes, the principle of which is shown in fig. 1. The model consists of a source node (Alice), an untrusted amplify-and-forward relay node (R) and a destination node (Bob)), each node uses a single antenna configuration, and one transmission process needs 2 time slots to complete. Assuming that there is no direct communication link between Alice and Bob due to shadow fading or too far distance, communication can only be performed through one untrusted relay node R. In the first time slot, Alice transmits information x to the untrusted relay node RAWhile Bob transmits information x to the untrusted relay node RBIn the second time slot, the relay node R amplifies the received signal by an amplifier and retransmits the amplified signal to Bob, wherein the amplification factor is β. further, assuming that all the wireless channels are time-varying rayleigh fading channels, the noise received by each node is 0 on average, and the power spectral density is N0Additive White Gaussian Noise (AWGN).
The invention firstly describes a communication scheme of a two-hop half-duplex relay network, gives an optimal power distribution scheme, then obtains a lower bound of a safe speed, and finally analyzes a channel ESR to obtain a reachable safe speed.
As can be seen from fig. 1, the communication process of the half-duplex relay network needs to be completed by two time slots, and in the first time slot, the signal received by the relay node R can be represented as
Wherein, PAAnd PBRespectively representing the transmission power, h, of nodes Alice and BobA-RAnd hB-RThe complex channel gains to the relay node R for Alice and Bob, respectively, are assumed to be mean 0 and variance σ2Complex gaussian variable of (a). The channel satisfies the reciprocity theorem, i.e., hB-R=hR-BAnd is andnRassuming that the total power transmitted by nodes Alice and Bob is P, α∈ [0, 1 ]]Representing the power distribution factor, the power of the encrypted information sent by Alice is PAα P, Bob transmits power PBP. (1- α) thus, the instantaneous signal to interference and noise ratio (SINR) γ received at the relay node RRCan be expressed as:
wherein, | | hB-R||2(1- α) P represents the interference signal sent by Bob and received at R in the transmission process of Alice, and the equivalent signal-to-noise ratios (SNR) from the nodes Alice and Bob to the relay node R can be respectively represented as gammaA-R=||hA-R||2P/N0,γB-R=||hB-R||2P/N0μ is defined as the ratio of the equivalent signal-to-noise ratios of the nodes Alice and Bob, i.e.: mu-gammaA-RB-R. Without loss of generality, we assume N0The SNR can be adjusted by the transmit power, 1. Based on the above definition, the SINR received at the relay node R shown in equation (2) can be simplified as:
in the second time slot, the relay node R amplifies the received signal by beta times and then retransmits the amplified signal to Bob, and the signal transmitted from the relay node R to the node Bob can be represented as
Will yRNormalized to yR||2P, resulting in an amplification factor β
The node Bob receives the signal sent from the untrusted relay node R as follows:
wherein n isBIs that the node Bob receives additivity highWhite noise. Due to xBIs the interference signal sent by Bob in the last time slot, and under the condition that Bob has perfect CSI, the self-interference term in the formula (6)An accurate estimate can be obtained. Here we consider a more practical application scenario where the state information (CSI) of the channel is not perfect for node Bob, but statistical information about channel estimation errors is available. In the present invention, imperfect channel state information is consideredIs known, then
Wherein,is the estimated channel gain, h, between the untrusted relay node R and the node BobeIs the channel estimation error, hB-RAnd heSatisfy the requirement ofE[he]=0。
In the present invention, assuming that the channel estimation error follows a uniform distribution over [0, ], then
||he||2=∶~unif(0,) (8)
After self-interference elimination, the node Bob receives the signal of
For a given letterChannel gain hA-RAnd hB-RAn equivalent SINR of Bob may be obtained at node Bob
When gamma isB-RThe equivalent SINR at the node B may be approximated as ≧ 20dB
Based on the above analysis, optimization of the power allocation factor is next sought.
First, an instantaneous safety rate is defined based on formula (3) and formula (11)
Wherein the preceding factorsBecause a transmission requires 2 time slots to complete, [ t ]]+=max[t,0]。
The invention aims to maximize the safe rate by optimizing the power distribution of the nodes Alice and Bob under imperfect CSI. Based on equation (12), the maximum power allocation problem is mathematically expressed as
s.t.:α∈[0,1]) (13)
Wherein,is monotonically increasing, sinceA maximum value of ζ (α) is present.
Typically, to get the maximum, the optimal power division factor α is foundoptThe present invention obtains by making a derivative operation on ζ (α) with respect to α and equaling it to 0
Wherein ΔL=γB-RΔ1+2(1-α)+1,Δ1=αμ-α+2。
Solving equation (14) yields the optimized power division factor αopt
Wherein,
in the interference signal gammaB-RThe optimized power division factor α of equation (15) for ≧ 20dBoptCan be approximated as
As can be seen from equation (16), the interference signal γB-RThe optimal power allocation factor α when being equal to or more than 20dBoptDetermined only by mu, i.e. channel estimation error versus optimum power allocation factor αoptThere is no effect.
As can be seen from the formula (10), γB(α) with | | | he||2Monotonically decreasing, therefore, at | | he||2When, the lower bound of safe rates can be defined as
When α is α ═ boptWhen, the formula (15) is taken into (17), and let us say, the safe lower rate bound can be maximized. Particularly, when γB-RWhen the speed is more than or equal to 20dB, the lower limit of the obtained approximate safe speed is that the formula (16) is brought into the formula (17)
Wherein,furthermore, an upper bound on the safe rate is obtained when the node has perfect CSI, as described in detail in document 3.
The safety Rate is traversed (Ergodic security Rate,ESR) characterizes the maximum safe rate that can be achieved on average. In the present invention, ESR is defined as being in | | | he||2Mathematical expectations for the maximum safe rate achievable over all implementations, i.e.
Substituting the equations (3), (11) and (12) into the equation (19) can obtain
Wherein f () is | | he||2Is defined as the Probability Density Function (PDF)Therefore, equation (20) can be further expressed as
Wherein, Delta 1 is α mu- α +2For the derivation of α, it can be found. However, direct solvingWith difficulty, when gammaB-RWhen the power is more than or equal to 20dB, the power can be adjustedIs approximately expressed as
Gamma is more than or equal to 0A-R≤2γB-RBy solving the equation (22) under the conditions (2), the
Fig. 1 shows a system model and a transmission method of a cooperative interference relay network according to the present invention. The system consists of nodes Alice, a point adding Bob and an untrusted relay node Alice which plays a role in amplification and forwarding. Each node is configured with a single antenna.
Fig. 2 shows that when μ ═ 1, α and γ are differentB-RFIG. 2 shows that the ESR increases and then decreases with increasing α, when γ isB-RWhen 5dB, make maximum ESR optimum power distribution factorWhen gamma isB-RAt 20, 25, and 30dB, the optimal power allocation factors for these three cases are almost equal to
FIG. 3 is a graph of traversal safety rate, upper and lower bounds of safety rate with gamma for an optimal power allocation factorB-RThe lower bound in fig. 3 is by αoptAnd 10-3Obtained by substituting equation (17), the approximate lower bound is αoptAnd 10-3Obtained by substituting into formula (17). As can be seen from FIG. 3, when γ isB-RLarger, the exact lower bound and the approximate lower bound are nearly identical. Furthermore, the upper bound is the safe rate under accurate CSI. By mixing he||2Substituting 0 into the formula(15) Is obtained byThis is defined in document 3 as the optimal power allocation factor under perfect CSI. By substituting equation (23) into equation (21), the difference in γ can be obtainedB-RThe average of (c) can reach the maximum safe rate. As can be seen from fig. 3, under the condition of low snr, the channel estimation error has a significant effect on ESR, but when γ is equal toB-RWhen the ESR is more than or equal to 20dB, the ESR is consistent with the upper bound of the safe speed. As can be seen from fig. 3, the approximate power allocation factor is effective for both the safe rate lower bound and the average achievable safe rate under high snr conditions. Moreover, the achievable safe rate is always greater than the safe rate lower bound. Under high snr conditions, the effect of channel estimation errors is negligible, and thus, the achievable safe rate and the upper bound of the safe rate are almost matched at this time.

Claims (2)

1. An optimal power allocation method for an untrusted relay network under bounded CSI is characterized by comprising the following steps:
step one, in a two-hop half-duplex relay network, in a first time slot, a source node Alice transmits information x to an untrusted relay node RAWhile the destination node Bob transmits the information x to the untrusted relay node RBSignals received by the relay node RWherein, PAAnd PBRespectively representing the transmission power, h, of nodes Alice and BobA-RAnd hB-RComplex channel gains, h, from nodes Alice and Bob to the Relay node R, respectivelyB-R=hR-BnRRepresenting additive white Gaussian noise at the relay node R, and the total power transmitted by the nodes Alice and Bob is P, α∈ [0, 1 ]]Representing the power distribution factor, the node Alice sends the encrypted information power PAα P, the power P of the encrypted information sent by the node BobB(1- α) P, instantaneous signal to interference plus noise ratio received at relay node RWherein, the ratio mu of the equivalent signal-to-noise ratios of the nodes Alice and Bob is gammaA-RB-RAnd equivalent signal-to-noise ratios of the nodes Alice and Bob to the relay node R are respectively expressed as gammaA-R=||hA-R||2P/N0And gammaB-R=||hB-R||2P/N0,N0=1;
Step two, in a second time slot, the relay node R amplifies the received signal and sends the amplified signal to the destination node Bob, wherein the amplification factor is beta; signals sent from the relay node R to the node Bob
Considering that both time slots transmit signals with the same power P, yRNormalized to yR||2Get the amplification factor P
The node Bob receives the signal sent from the untrusted relay node R
Wherein n isBIs additive white gaussian noise received by node Bob, is the estimated channel gain, h, between the untrusted relay node R and the node BobeIs the channel estimation error, hB-RAnd heSatisfy the requirement ofE[he]=0;
Assuming that the channel estimation error obeys 0,]is uniformly distributed, and the signal received by the node Bob is eliminated by self-interference
Thus, for a given channel gain hA-RAnd hB-RThe equivalent SINR obtained at node Bob is
When gamma isB-RWhen the equivalent SINR of the node Bob is more than or equal to 20dB, the equivalent SINR of the node Bob is approximately
Step three, defining the instantaneous safe rateWherein, [ t ]]+=max[t,0](ii) a Firstly, toMaking a derivative with respect to α to obtain a resulting safe rate Rs(α) a maximum optimal power allocation factor;
step four, defining a lower bound of the safety rate
Wherein, Delta 1αμ-α+2;
Substituting the accurate power allocation factor and the approximate power allocation factor at high SNR into each otherObtaining an accurate lower bound of the maximum safe speed and an approximate lower bound of the maximum safe speed under high SNR;
step five, defining ESR as | | | he||2Mathematical expectations for the maximum safe rate achievable over all implementations, i.e.To pairDerived by α derivation
2. The method for optimal power allocation for an untrusted relay network under bounded CSI as claimed in claim 1, wherein: in the fifth step, the alpha isB-RUnder the condition of more than or equal to 20dB, theIs approximately expressed as
Gamma is more than or equal to 0A-R≤2γB-RUnder the conditions of (1), obtainingThe maximum approximately optimal power allocation factor is
CN201610893300.6A 2016-10-13 2016-10-13 A kind of optimal power allocation method of insincere junction network under bounded CSI Active CN107071886B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610893300.6A CN107071886B (en) 2016-10-13 2016-10-13 A kind of optimal power allocation method of insincere junction network under bounded CSI

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610893300.6A CN107071886B (en) 2016-10-13 2016-10-13 A kind of optimal power allocation method of insincere junction network under bounded CSI

Publications (2)

Publication Number Publication Date
CN107071886A true CN107071886A (en) 2017-08-18
CN107071886B CN107071886B (en) 2019-08-09

Family

ID=59616995

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610893300.6A Active CN107071886B (en) 2016-10-13 2016-10-13 A kind of optimal power allocation method of insincere junction network under bounded CSI

Country Status (1)

Country Link
CN (1) CN107071886B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107659991A (en) * 2017-10-09 2018-02-02 西北工业大学 A kind of energy distributing method in double bounce collection of energy junction network
CN108601019A (en) * 2018-03-27 2018-09-28 西北工业大学 Insincere relaying transmitted in both directions network security transmission method based on relay selection
CN108924067A (en) * 2018-07-03 2018-11-30 西北工业大学 The time dividing method of training sequence and data symbol in interference alignment network
CN111970718A (en) * 2020-07-22 2020-11-20 西北工业大学 Deep learning-based power distribution method in energy collection untrusted relay network

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090186617A1 (en) * 2006-05-17 2009-07-23 Telefonaktiebolaget L M Ericsson (Publ) Best-Effort Macro Diversity
US20090221231A1 (en) * 2008-02-29 2009-09-03 The Hong Kong University Of Science And Technology Multi-user mimo relay protocol with self-interference cancellation
CN103068027A (en) * 2012-12-07 2013-04-24 南京邮电大学 Optimal power distribution method of multiple relays in frequency flat fading channel
CN104093200A (en) * 2014-07-25 2014-10-08 哈尔滨工业大学 Dual-jump full-duplex DF relay system optimization power distribution method for single-node power limitation

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090186617A1 (en) * 2006-05-17 2009-07-23 Telefonaktiebolaget L M Ericsson (Publ) Best-Effort Macro Diversity
US20090221231A1 (en) * 2008-02-29 2009-09-03 The Hong Kong University Of Science And Technology Multi-user mimo relay protocol with self-interference cancellation
CN103068027A (en) * 2012-12-07 2013-04-24 南京邮电大学 Optimal power distribution method of multiple relays in frequency flat fading channel
CN104093200A (en) * 2014-07-25 2014-10-08 哈尔滨工业大学 Dual-jump full-duplex DF relay system optimization power distribution method for single-node power limitation

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107659991A (en) * 2017-10-09 2018-02-02 西北工业大学 A kind of energy distributing method in double bounce collection of energy junction network
CN107659991B (en) * 2017-10-09 2020-07-03 西北工业大学 Energy distribution method in two-hop energy collection relay network
CN108601019A (en) * 2018-03-27 2018-09-28 西北工业大学 Insincere relaying transmitted in both directions network security transmission method based on relay selection
CN108601019B (en) * 2018-03-27 2021-01-15 西北工业大学 Safe transmission method of untrusted relay bidirectional transmission network based on relay selection
CN108924067A (en) * 2018-07-03 2018-11-30 西北工业大学 The time dividing method of training sequence and data symbol in interference alignment network
CN108924067B (en) * 2018-07-03 2020-09-22 西北工业大学 Time division method for training sequence and data symbol in interference alignment network
CN111970718A (en) * 2020-07-22 2020-11-20 西北工业大学 Deep learning-based power distribution method in energy collection untrusted relay network
CN111970718B (en) * 2020-07-22 2022-03-11 西北工业大学 Deep learning-based power distribution method in energy collection untrusted relay network

Also Published As

Publication number Publication date
CN107071886B (en) 2019-08-09

Similar Documents

Publication Publication Date Title
CN106413074B (en) A kind of optimal power allocation method of untrusted junction network under imperfect CSI
CN106992803B (en) Artificial noise pre-coding safe transmission method of full-duplex relay system
CN106059705B (en) A kind of relaying safe transmission method of physical layer
CN107124215B (en) Full-duplex multi-antenna destination node interference transmission method based on optimal antenna selection
Yue et al. Outage performance of full/half-duplex user relaying in NOMA systems
CN106376073B (en) A kind of optimal power allocation method in insincere junction network
CN107071886B (en) A kind of optimal power allocation method of insincere junction network under bounded CSI
CN113692711B (en) Online MIMO wireless network virtualization with unknown channel information
Jameel et al. Secure communications in three-step two-way energy harvesting DF relaying
CN104837110B (en) Transmission strategy implementation method based on interruption performance lifting in honeycomb D2D communication systems
CN108809365A (en) A kind of cooperation scrambling safe transmission method based on the selection of repeated link optimal user
CN106332259B (en) A kind of bilateral relay network increases the optimal power allocation method of safe energy efficiency
Xia et al. Outage performance of AF-based time division broadcasting protocol in the presence of co-channel interference
Akoum et al. On imperfect CSI for the downlink of a two-tier network
CN106102044B (en) A kind of multi-user's junction network downlink cooperation physical layer method for secret protection
Ni et al. Two-way DF relaying assisted D2D communication: ergodic rate and power allocation
Bello et al. Computing amplify-and-forward relay amplification factor to improve total capacity at destination
Ouyang et al. Secrecy energy efficiency in full-duplex AF relay systems with untrusted energy harvesters
Yue et al. Outage performance of two-way relay non-orthogonal multiple access systems
Bhattacharyya et al. Full duplex relay assisted coded cooperation for next generation wireless networks
Cai et al. Energy‐efficient cooperative two‐hop amplify‐and‐forward relay protocol in cognitive radio networks
Gao et al. Optimal training power allocation for amplify and forward relay networks
Liu et al. On the performance of mode selection for hybrid-duplex D2D communications
Zeng et al. Multiple device-to-device users overlaying cellular networks
Huang et al. Joint decode-and-forward and cooperative jamming for secure wireless communications

Legal Events

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