Abstract
For the self-energy recycling (SER) untrusted relay network, a two-phase destination-based jamming (DBJ) protocol is proposed, in which the destination transmits the jamming signal to reduce the received SNR of the untrusted relay node in the first phase and the relay node operated in full-duplex (FD) mode for simultaneous energy transfer and information relaying in the second phase. In addition, the loopback interference (LI) generated by FD relay node can be reused as part of energy. To satisfy some practical application scenarios, we consider the imperfect channel estimation error at the destination. Considering the total power constraint and the quality of service (QoS) requirement at the destination, the secrecy rate maximization problem is formulated by optimizing the transmission power of source and destination. However, the formulated problem is non-convex and difficult to solve directly. To cope with this difficulty, an iterative power allocation algorithm is proposed. The key idea of the proposed algorithm first integrates the non-convex constraint into the objective function by the exact penalty method. Then the difference of convex functions (DC) programming can be utilized to convert the non-convex objective function into the approximate convex function and the sub-optimal transmission power of source and destination can be obtained by the traditional convex programming. Simulation results show the superiority security performance of the proposed scheme with the traditional schemes.
Highlights
To achieve long-distance communication transmission, distributed cooperative systems have been applied to many different communication scenarios
We assume the source, the destination and the untrusted relay are placed on a horizontal line, where dSR and dRD denote the distances of source-relay and relay-destination
With the consideration of the total power constraint and the quality of service (QoS) requirement, the maximization secrecy rate optimization is formulated with the imperfect channel estimation error at the destination
Summary
To achieve long-distance communication transmission, distributed cooperative systems have been applied to many different communication scenarios. The rest of this paper is organized as follows: Section 2 describes the proposed two-phase DBJ wirelesspowered relay network with SER, and the secrecy rate maximization problem is formulated with the total power constraint and the minimum information rate requirement at the destination. With the consideration of the total power constraint and the QoS requirement at the destination, the secrecy rate maximization problem with respect to PS and PD can be formulated as max Rsec (PS , PD). POWER ALLOCATION ALGORITHM FOR SECRECY RATE MAXIMIZATION PROBLEM As shown in (16), the optimization problem with respect to PS and PD is non-convex because of the non-convex objective function Rsec (PS , PD) and non-convex constraint RD (PS , PD) ≥ Rth. To solve the non-convexity, we proposed an iterative algorithm based on the exact penalty method and DC programming. The convex programming can be used to obtain the suboptimal transmission power of source and destination
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
