CN106413074A - Optimal power allocation method of untrusted relay network under perfect CSI - Google Patents

Optimal power allocation method of untrusted relay network under perfect CSI Download PDF

Info

Publication number
CN106413074A
CN106413074A CN201610887666.2A CN201610887666A CN106413074A CN 106413074 A CN106413074 A CN 106413074A CN 201610887666 A CN201610887666 A CN 201610887666A CN 106413074 A CN106413074 A CN 106413074A
Authority
CN
China
Prior art keywords
gamma
alpha
node
bob
beta
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201610887666.2A
Other languages
Chinese (zh)
Other versions
CN106413074B (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 CN201610887666.2A priority Critical patent/CN106413074B/en
Publication of CN106413074A publication Critical patent/CN106413074A/en
Application granted granted Critical
Publication of CN106413074B publication Critical patent/CN106413074B/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/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)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention provides an optimal power allocation method of an untrusted relay network under perfect CSI. The method comprises the following steps: firstly, describing a communication scheme of a two-hop half-duplex relay network, then providing an optimal power allocation scheme, and finally analyzing channel ESR to acquire a reachable safety rate. According to the optimal power allocation method provided by the invention, an optimal power allocation formula in a transmission process is provided to maximize the safety rate, and the ESR under high SNR is further analyzed for evaluating the reachable average safety rate. The approximate optimal power allocation can bring a higher safety rate than equal power allocation.

Description

Optimal power distribution method for untrusted relay network under imperfect CSI
Technical Field
The invention relates to an optimal power allocation scheme of an untrusted relay network under the condition of non-ideal Channel State Information (CSI).
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 student-and-forward systems with untreatment process nodes [ J ]. ieee trans. veh.technol.,2012,61(8):3801 3807" obtains the lower bound of the traversal security Capacity (ESC) of a single untrusted relay by Destination-based interference techniques (DBJ), and expands it to a plurality of untrusted relay scenarios, proposing a security relay selection scheme that can maximize the system security Capacity that can be reached, realizes the secure communication of an untrusted amplified forward (amplitude formed, AF) relay system, but does not consider the optimized power allocation, and document 2 is a perfect based on the CSI and the actual communication environment that can not be obtained.
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 research under the assumption of perfect CSI, but perfect CSI is basically impossible to achieve in a real communication environment.
Disclosure of Invention
In order to overcome the defects of the prior art, the invention provides an optimal power allocation scheme improved under the condition of imperfect CSI on the basis of document 3, a cooperative interference relay communication scheme is researched, the conditions that a relay node is not credible and the total power is limited are considered, and an optimal power allocation factor α is extracted under the condition that the statistical information of channel estimation errors can be obtainedoptAnd further analyzing a channel-realizable traversal security Rate (ESR) to obtainThe average safe rate that can be achieved.
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 transmitted 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; the signal sent from the relay node R to the node Bob is denoted as
Both time slots transmit signals with the same power P, yRNormalized to yR||2Get the amplification factor P
The node Bob receives a signal sent from the untrusted relay node R as
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 a channel estimation error and obeys a complex Gaussian distributionhB-RAnd heSatisfy the requirement ofE(he)=0;
After self-interference elimination, the node Bob receives the signal of
Suppose thatThen for a given channel gain hA-RAnd hB-RThe equivalent SINR obtained at node Bob is
Step three, defining the instantaneous safe rateWherein, [ t ]]+=max[t,0](ii) a Firstly, toMaking a derivative with respect to α to obtain
Wherein Δ ═ 2 γB-R-αγB-Re 2+αμγB-R-αγe 2+1;
Calculating two roots of the denominatorConsider α∈ [0, 1 ]]The optimized power division factor α is obtained by solving the root of the numerator to find the solution of equation (12)opt
The invention has the beneficial effects that: an Optimized Power Allocation (OPA) formula during transmission is given to maximize the safe rate. To address the complexity of the optimization problem, the ESR at high SNR was further analyzed to evaluate the average safe rate that can be achieved. The approximate optimized power distribution can bring higher safety rate than equal power distribution, and the simulation result proves the effectiveness of the algorithm.
Drawings
Fig. 1 is a schematic diagram of two-hop relay network cooperative interference and secure transmission;
FIG. 2 shows different μ values and channel estimation errorsLower exact and approximate power optimized division factor αoptA schematic diagram;
FIG. 3 is a graph of the relative error between the exact and approximate optimum power factors;
FIG. 4 shows the difference γB-RComparing the optimal power distribution and the safe rate corresponding to the average power distribution when mu is 0.5;
FIG. 5 shows the difference γB-RComparing the optimal power distribution and the safe rate corresponding to the average power distribution when mu is 2;
fig. 6 is a schematic diagram of ESR distributions at 0.5 μ and different channel estimation errors;
fig. 7 is a diagram of ESR distributions at 2 and different channel estimation errors.
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 placeOne time slot, Alice transmits information x to an untrusted relay node RAWhile Bob transmits information x to the untrusted relay node RRIn 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, then gives an optimal power distribution scheme, and finally analyzes channel ESR to obtain the reachable safe rate.
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 node Bob additive white gaussian noise received. 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 a channel estimation error and obeys a complex Gaussian distributionhB-RAnd heSatisfy the requirement ofE(he) 0. After self-interference elimination, the node Bob receives the signal of
Suppose thatThen for a given channel gain hA-RAnd hB-RThe equivalent SINR can be obtained at the node Bob as
Based on the above analysis, optimization of the power allocation factor is next sought.
First, based on equation (3) and equation (9), an instantaneous safety rate is defined
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 (10), the maximum power allocation problem is expressed mathematically as
s.t.:α∈[0,1]) (11)
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 Δ ═ 2 γB-R-αγB-Re 2+αμγB-R-αγe 2+1. It can be seen from equation (12) that finding its root is somewhat difficult, but in the case where the denominator is not equal to 0, the present invention can use the numerator to obtain the solution of equation (12). First, two roots of the denominator are calculated asIt can be easily found that the method can be easily found out,thus consider α∈ [0, 1 ]]The present invention can find the solution of equation (12) by solving the root of the numerator, thereby resulting in the optimized power division factor αopt
In the formula (13), the first and second groups,
k1=s-μ+1, k2=s2-3μ+4s-sμ-1,
k3=s2-2μ+2s-sμ-1,k4=k3-2μs+2μ2+1,
whereinΔs=μ-s+γB-R(1+ μ). In the interference signal gammaB-ROptimized power division factor α of equation (13) with high signal-to-noise ratiooptCan be approximated as
Wherein, Deltaopt=μ(s+2)(1+μ),Δd=μ2+μ-s-2。
At perfect CSI, i.e., s-0, the approximate optimized power division factor αoptIs composed of
The Ergodic Security Rate (ESR) characterizes the maximum security Rate that can be achieved on average. In the present invention, ESR is defined as being γB-RAll mathematical expectations for achieving a maximum safe rate in implementation, i.e.
Wherein R iss(α) achievable safe Rate, α, expressed in equation (10)optFor the optimized power division factor calculated by equation (15), R is shown in equation (10)s(α) and γB(α) and γR(α) accordingly, when α is αoptWe first consider γB(α) and γR(α) substituting equation (15) into equations (3) and (9) yields the optimized SNR for the untrusted relay node R and the node Bob:
when gamma isB-R> 1 andγ in equation (19)Ropt) Can be simplified as follows:
similarly, γ in simplified formula (19)Bopt) Obtaining:
further, substituting equation (20) and equation (21) into equation (10), and finally substituting the result into equation (18), the general equation for ESR is as follows:
wherein,andis gammaB-RAnd is defined as follows:
due to the fact thatWhereinThus, the ESR in equation (22) can be further written as:
wherein,
in particular, in the case of Equal Power Allocation (EPA), that is,
α=0.5,when further considering gammaB-R> andwhen, gammaRAnd gammaBCan be approximated as
γR≈μ,
Calculating the ESR in the same manner, one can obtain:
wherein,
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 the difference between the mu value and the channel estimation errorLower exact and approximate power optimized division factor αoptBy comparison, as can be seen in FIG. 2, αoptIt can be seen from equation (3) that for larger values of μ, to avoid the relay intercepting the trusted message sent from the node Alice, we should reduce the power allocation to the node Alice, i.e. reduce α. with the value of μ unchanged, αoptError with channel estimationIncreases because node Alice needs to allocate more power to compensate for the effects introduced due to channel estimation errors. From the figure, we can also find that whenThe estimated value has relatively small error, and the error is followedIs increased.
In order to further carry out quantitative analysis on the error, a relative error variable R is introducedeAnd is defined as follows:
wherein d andrepresenting the exact and approximate power division factors, respectively. The relative error between the exact and near optimal power allocation factors under different scenarios is shown in fig. 3.
As can be seen from fig. 3, the relative error varies with the value of μ and the channel estimation errorIs increased. And, the relative error ReRelatively small at perfect CSI and, at large channel estimation errors, relative error ReIs relatively large, e.g. whenWhen mu is 3, relative error Re12% by weight. In the following simulations, we consider two scenarios for different μ: μ ═ 0.5 and μ ═ 2, demonstrated for γA-R>γB-RAnd gammaB-R>γA-RThe estimated value is valid.
In fig. 4 and 5, the safe rate at α ═ 0.5 and the error in different channel estimates are comparedAnd the maximum power allocation factor at μ ═ 0.5 or μ ═ 2. Considering different channel estimation errorsWe conclude that: an approximately optimal power allocation may result in a higher security rate than an equal power allocation. This conclusion is feasible even in the worst scenario (μ > 1) and large channel estimation errors. The presence of channel estimation errors both for maximum power allocation and equal power allocation reduces the achievable safe rate.
FIGS. 6 and 7 are differentBelow, forAnd μ ═ 0.5 or μ ═ 2, the realizations and the dashed lines represent the achievable ESRs at the optimum power allocation and at the equal power allocation, respectively. As can be seen from the figure, the optimized power allocation scheme can achieve a higher security rate than the equal power allocation. With signal to noise ratio gammaB-RThe channel estimation error decreases the impact on the achievable ESR.

Claims (1)

1. An optimal power distribution method of an untrusted relay network under imperfect 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 transmitted 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; the signal sent from the relay node R to the node Bob is denoted as
y R = β ( α P h A - R x A + ( 1 - α ) P h B - R x B + n R ) ;
Both time slots transmit signals with the same power P, yRNormalized to yR||2Get the amplification factor P
β = P α P | | h A - R | | 2 + ( 1 - α ) P | | h B - R | | 2 + 1 ;
The node Bob receives a signal sent from the untrusted relay node R as
z B = β α P h A - R x A h R - B + β ( 1 - α ) P h B - R x B h R - B + βn R h R - B + n B ;
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 a channel estimation error and obeys a complex Gaussian distributionhB-RAnd heSatisfy the requirement ofE(he)=0;
After self-interference elimination, the node Bob receives the signal of
z B * = β α P h A - R x A h R - B + β ( 1 - α ) P h e x B h e + βn R h R - B + n B ;
Suppose thatThen for a given channel gain hA-RAnd hB-RThe equivalent SINR obtained at node Bob is
γ B ( α ) = β 2 α P | | h A - R | | 2 | | h B - R | | 2 β 2 | | h B - R | | 2 + β 2 ( 1 - α ) P ( σ e 2 ) 2 + 1 = αγ A - R γ B - R γ B - R + αγ A - R + ( 1 - α ) ( ( Pσ e 2 ) 2 + γ B - R ) + 1 = αμγ B - R 2 - α + α μ + ( 1 - α ) ( ( γ e ) 2 ( γ B - R ) ) + 1 γ B - R ;
Step three, defining the instantaneous safe rateWherein, [ t ]]+=max[t,0](ii) a Firstly, toMaking a derivative with respect to α to obtain
d ζ d α = μγ B - R 2 ( γ B - R - αγ B - R + 1 ) ( 2 γ B - R + γ e 2 + 1 ) ( γ B - R - αγ B - R + αγ B - R μ + 1 ) Δ 2 - μγ B - R ( αγ B - R μ Δ + 1 ) ( γ B - R + 1 ) ( γ B - R - αγ B - R + αγ B - R μ + 1 ) 2 = 0
Wherein Δ ═ 2 γB-R-αγB-Re 2+αμγB-R-αγe 2+1;
Calculating two roots of the denominatorConsider α∈ [0, 1 ]]The optimized power division factor α is obtained by solving the root of the numerator to find the solution of equation (12)opt
CN201610887666.2A 2016-10-11 2016-10-11 A kind of optimal power allocation method of untrusted junction network under imperfect CSI Active CN106413074B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610887666.2A CN106413074B (en) 2016-10-11 2016-10-11 A kind of optimal power allocation method of untrusted junction network under imperfect CSI

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610887666.2A CN106413074B (en) 2016-10-11 2016-10-11 A kind of optimal power allocation method of untrusted junction network under imperfect CSI

Publications (2)

Publication Number Publication Date
CN106413074A true CN106413074A (en) 2017-02-15
CN106413074B CN106413074B (en) 2019-01-18

Family

ID=59228647

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610887666.2A Active CN106413074B (en) 2016-10-11 2016-10-11 A kind of optimal power allocation method of untrusted junction network under imperfect CSI

Country Status (1)

Country Link
CN (1) CN106413074B (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106992836A (en) * 2017-03-24 2017-07-28 华侨大学 Full duplex scrambling transmission method in a kind of untrusted junction network
CN107395646A (en) * 2017-09-05 2017-11-24 西北大学 A kind of user behavior method for secret protection for CSI time-frequency domain information attacks
CN107659991A (en) * 2017-10-09 2018-02-02 西北工业大学 A kind of energy distributing method in double bounce collection of energy junction network
CN110430566A (en) * 2019-07-26 2019-11-08 西北工业大学 A kind of more junction network safe transmission methods of double bounce based on collection of energy
CN112994762A (en) * 2021-02-04 2021-06-18 南京邮电大学 MIMO-NOMA downlink self-adaptive wireless transmission method based on statistical CSI
CN117560049A (en) * 2023-05-11 2024-02-13 武汉能钠智能装备技术股份有限公司四川省成都市分公司 Satellite ground station relay forwarding system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101588627A (en) * 2009-06-23 2009-11-25 北京邮电大学 Optimal joint distribution method for power of source and relaying nodes in collaborative communication
CN105188124A (en) * 2015-09-17 2015-12-23 重庆邮电大学 Robustness gaming power control method under imperfect CSI for multi-user OFDMA relay system
CN105764130A (en) * 2016-03-04 2016-07-13 山东大学 Power distribution method for full-duplex relay network in nonideal channel state
WO2016142888A1 (en) * 2015-03-12 2016-09-15 Telefonaktiebolaget Lm Ericsson (Publ) Power allocation for device-to-device communication underlaying cellular networks

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101588627A (en) * 2009-06-23 2009-11-25 北京邮电大学 Optimal joint distribution method for power of source and relaying nodes in collaborative communication
WO2016142888A1 (en) * 2015-03-12 2016-09-15 Telefonaktiebolaget Lm Ericsson (Publ) Power allocation for device-to-device communication underlaying cellular networks
CN105188124A (en) * 2015-09-17 2015-12-23 重庆邮电大学 Robustness gaming power control method under imperfect CSI for multi-user OFDMA relay system
CN105764130A (en) * 2016-03-04 2016-07-13 山东大学 Power distribution method for full-duplex relay network in nonideal channel state

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
陈德川等: "非可信中继网络中目的协同干扰方案性能分", 《军事通信技术》 *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106992836A (en) * 2017-03-24 2017-07-28 华侨大学 Full duplex scrambling transmission method in a kind of untrusted junction network
CN107395646A (en) * 2017-09-05 2017-11-24 西北大学 A kind of user behavior method for secret protection for CSI time-frequency domain information attacks
CN107395646B (en) * 2017-09-05 2020-06-05 西北大学 User behavior privacy protection method for CSI time-frequency domain information attack
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
CN110430566A (en) * 2019-07-26 2019-11-08 西北工业大学 A kind of more junction network safe transmission methods of double bounce based on collection of energy
CN112994762A (en) * 2021-02-04 2021-06-18 南京邮电大学 MIMO-NOMA downlink self-adaptive wireless transmission method based on statistical CSI
CN112994762B (en) * 2021-02-04 2022-04-26 南京邮电大学 MIMO-NOMA downlink self-adaptive wireless transmission method based on statistical CSI
CN117560049A (en) * 2023-05-11 2024-02-13 武汉能钠智能装备技术股份有限公司四川省成都市分公司 Satellite ground station relay forwarding system

Also Published As

Publication number Publication date
CN106413074B (en) 2019-01-18

Similar Documents

Publication Publication Date Title
CN106413074B (en) A kind of optimal power allocation method of untrusted junction network under imperfect CSI
CN106376073B (en) A kind of optimal power allocation method in insincere junction network
CN106059705B (en) A kind of relaying safe transmission method of physical layer
Yue et al. Outage performance of full/half-duplex user relaying in NOMA systems
Kader et al. Capacity and outage analysis of a dual-hop decode-and-forward relay-aided NOMA scheme
CN107071886B (en) A kind of optimal power allocation method of insincere junction network under bounded CSI
CN107124215B (en) Full-duplex multi-antenna destination node interference transmission method based on optimal antenna selection
CN106332259B (en) A kind of bilateral relay network increases the optimal power allocation method of safe energy efficiency
Kumar et al. Drone assisted device to device cooperative communication for critical environments
Xia et al. Outage performance of AF-based time division broadcasting protocol in the presence of co-channel interference
CN104540211A (en) Power optimization method in cooperative alliance
CN103812548B (en) Beam forming method considering channel Gaussian error and damage of transceiver
CN105450274A (en) Optimal energy efficiency-based user number optimization method for large-scale and multi-antenna relay system
CN103209427B (en) User-channel-quality-based collaborative user selection method for source users
Akoum et al. On imperfect CSI for the downlink of a two-tier network
US20170078014A1 (en) Bandwidth efficient cooperative two-way amplify-and- forward relaying method
CN104717035A (en) Interference alignment method of cellular network based on D2D communication
Li et al. Performance analysis of cooperative OFDM network with ordered subcarrier pairing
Li et al. Uplink-downlink duality of interference alignment in cellular relay networks
CN106211305A (en) A kind of power distribution method in amplification forwarding bidirectional relay system
Dong et al. Optimal downlink transmission in massive MIMO enabled SWIPT systems with zero-forcing precoding
Wu et al. MSE and outage probability based training power allocations for relay networks
Dziri et al. Performance analysis of decode and forward cooperative relaying over the generalized-K channel
Hesketh et al. Joint partial relay selection, power allocation and cooperative maximum likelihood detection for MIMO relay systems with limited feedback
Wang et al. Full-duplex cooperative non-orthogonal multiple access with spectrum sensing

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