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.
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.
This paper focuses on the secure transmission of wireless-powered relay systems with the imperfect eavesdropper channel state information. For efficient energy transfer and information relaying, a novel two-phase protocol is proposed, in which the relay operates in a full-duplex (FD) mode to achieve the simultaneous wireless power and information transmission. Compared with those existing protocols, the proposed design possesses two main advantages: 1) it fully exploits the available hardware resource (antenna element) of relay and can offer a higher secrecy rate and 2) it enables the self-energy recycling (S-ER) at relay, in which the loopback interference generated by the FD operation is harvested and reused for information relaying. To maximize the worst-case secrecy rate (WCSR) through jointly designing the source and relay beamformers coupled with the power allocation ratio, an optimization problem is formulated. This formulated problem is proved to be non-convex and the challenge to solve it is how to concurrently solve out the beamformers and the power allocation ratio. To cope with this difficulty, an alternative approach is proposed by converting the original problem into three subproblems. By solving these subproblems iteratively, the closed-form solutions of robust beamformers and power allocation ratio for the original problem are achieved. Simulations are done and results reveal that the proposed S-ER -based secure transmission scheme outperforms the traditional time-switching based relaying scheme at a maximum WCSR gain of 80%. Results also demonstrate that the WCSR performance of the scheme reusing all antennas for information reception is much better than that of schemes exploiting only one antenna.
In this article, we raise the concern on secure energy efficiency (SEE) over the wireless-powered untrusted relay networks with nonlinear energy harvesting (EH). To achieve data confidentiality and secrecy performance enhancement concurrently, the untrusted relay can enable simultaneous energy signal reception and confidential information forwarding during the second phase, where no dedicated energy transmission phase or relaying signal splitting is needed for the energy supply. In particular, with the help of destination jamming, the relay can also harvest energy from source signal and jamming signal during the first phase, which is different from conventional relaying protocol that only harvests energy from source and recycled energy. Considering the nonlinear EH efficiency, our objective is to maximize the SEE through piecewise region selection and power allocation. To address this intractable nonconvex problem, a two-layer algorithm based on optimization decoupling, fractional programming, Lagrange dual decomposition and difference of convex functions (DC) programming is proposed. The core idea of the proposed algorithm is to convert the primary problem into simple subproblems by sequentially exploiting the above-mentioned optimization methods. Simulation results reveal the superior secrecy performance of the proposed scheme. The proposed algorithm achieves near-optimal solutions with faster convergence rate.
In this paper, we examine the use of a friendly full-duplex (FD) relay to increase the secrecy rate over a fading channel between the legitimate source and the destination in the presence of residual self-interference (SI) and eavesdropper. In particular, we consider two different protocols based on the FD capability of relay: 1) FD transmission (FDT), in which the FD-Relay receives and sends data concurrently; 2) FD-Relay with jamming (FDJ), where first, the FD-Relay simultaneously receives data and sends jamming to the eavesdropper; then, it forwards the data, while the source jams the eavesdropper. We first develop the secrecy rate expressions for half-duplex transmission (HDT), half-duplex with jamming (HDJ), FDT, and FDJ relaying protocols, and then use them to derive their performance properties in terms of the channel gains between nodes, eavesdropper types, and more importantly, the SI level in FD-Relay. We further investigate the non-convex power allocation problems for the developed FDT and FDJ to maximize the secrecy rate under the power constraints. In particular, we develop an efficient iterative algorithm based on the difference-of-two-concave-functions programming. Analytical and simulation results show the strong influence of SI level on the achieved secrecy rate of the FDT and the FDJ. For sufficiently low SI, FDT achieves a much higher secrecy rate than FDJ, HDJ, and HDT. However, for higher SI, FDJ becomes more effective in enhancing the achieved secrecy rate. The results also indicate that adaptive power allocation can significantly improve the performance and confirm that the proposed FDT and FDJ outperform the HDT and the HDJ.
To guarantee secure information transmission within two sources, a full-duplex (FD) relay jamming scheme for two-way energy harvesting (EH) cooperative networks is proposed, in which the relay can achieve simultaneous information reception and jamming transmission. The EH relay node scavenges energy from two source signals, and then, uses the harvested energy for information relaying and jamming transmission by the power splitting (PS) protocol. Considering multiple eavesdroppers, the non-convex optimization for maximizing the smaller bidirectional secrecy rates is formulated by jointly optimizing the power allocation and PS factor. Furthermore, an iterative algorithm based on successive convex approximation and alternate search method is proposed to solve this non-convexity. Simulation results verify the proposed iterative algorithm and show that the proposed jamming scheme can achieve substantial performance gain than other conventional schemes.
Simultaneous wireless information and power transfer (SWIPT) is a promising technique for energy-constrained wireless networks. To improve the security of SWIPT-enabled relay networks, in this paper, a full-duplex (FD) destination-aided jamming strategy is proposed, where a power splitting (PS) scheme is considered and two transmission phases are designed. In the first phase, the energy-limited half-duplex relay receives the signal superposed by confidential information and artificial noise (AN) from the source and destination, respectively. And then the FD destination transmits AN to the passive eavesdropper and receives the signal from the relay concurrently in the second phase. To maximize the secrecy capacity (SC), the individual optimizations of the PS ratio and power allocation (PA) coefficient are investigated, and the approximate optimal closed-form solutions of PS and PA ratios are derived. Besides, an iterative algorithm is also proposed to obtain the global optimal SC by updating the PS and PA ratios alternately. Simulation results confirm that the theoretical PS and PA ratios coincide closely with the exact results, and demonstrate that the optimal SC obtained by the iterative algorithm matches well with that given by the exhaustive search.
In this paper, the secure information transmission of an energy harvesting (EH) cooperative network is considered, in which multiple eavesdroppers can overhear the forwarded relay signal. To prevent multiple eavesdroppers from decoding confidential signals, the destination transmits the jamming signal while the source transmits the confidential signal to the relay. Simultaneously, the relay can harvest more energy from source signals and destination jamming by the power splitting (PS) protocol, which is depicted as a non-linear EH process. Considering the imperfect self-interference cancellation (SIC) at the destination, secrecy rate maximization optimization is formulated to optimize the transmission power of source and destination. However, the formulated optimization is non-convex. To solve this problem, an iterative algorithm is proposed based on the difference of convex functions (DC) programming, which can transform non-convex optimization problems into successive approximate convex problems. Simulation results show that the proposed algorithm has a quick convergence rate, and the proposed scheme leads to a higher achievable secrecy rate.