Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Vehicular Technology

Secure Relay Beamforming for Simultaneous Wireless Information and Power Transfer in Nonregenerative Relay Networks

Quanzhong Li, Qi Zhang, Jiayin Qin

Published Jan 31, 2014• 110 citations
Publisher

Abstract

For simultaneous wireless information and power transfer (SWIPT), secure communication is an important issue. In this correspondence, we study the secure relay beamforming (SRB) scheme for SWIPT in a nonregenerative multiantenna relay network. We propose a constrained concave convex procedure (CCCP)-based iterative algorithm that is able to achieve a local optimum, where the secrecy rate is maximized, and the relay transmit power and energy harvesting constraints are satisfied. Simulation results have shown that our proposed CCCP-based iterative algorithm achieves a larger secrecy rate and lower computational complexity than the convectional SRB schemes. Since the CCCP-based iterative algorithm is still complex, we propose a semidefinite programming (SDP)-based noniterative suboptimal algorithm and a closed-form suboptimal algorithm. It is shown that when the maximum transmit power of the relay to noise power ratio is high, the SDP-based noniterative suboptimal algorithm performs close to the CCCP-based iterative algorithm.

DOI
10.1109/tvt.2013.2288318

Related papers

Joint Source and Relay Secure Beamforming for Nonregenerative MIMO Relay Systems With Wireless Information and Power Transfer

Quanzhong Li, Jiayin Qin

Simultaneous wireless information and power transfer (SWIPT) is able to prolong the lifetime of energy-constrained wireless networks. In this paper, we study the security issue of a nonregenerative multiple-input multiple-out (MIMO) relay system with SWIPT. When the full channel state information (CSI) of the eavesdropper is available, we aim to maximize the secrecy rate under the source and relay transmit power constraints and energy-harvesting (EH) constraints at the multiple EH receivers by jointly designing the source and relay beamforming matrices, which is a nonconvex optimization and is still an open problem. In order to enhance the secrecy rate effectively, we first transform the optimization into a difference of convex programming and propose a sequential parametric convex approximation-based iterative algorithm which is able to achieve a local optimum. To reduce the complexity, we also propose a singular value decomposition (SVD)-generalized SVD-based method to simplify the optimization into a joint source and relay power allocation problem. The alternating optimization is employed to find a suboptimal solution of the joint power allocation problem. When the CSI of the eavesdropper is unknown, we propose an artificial-noise (AN) aided joint source and relay beamforming scheme, which can maximize the AN power to jam the eavesdropper under the limited source and relay transmit power and satisfy the quality of service of the receiver. Simulation results have shown the effectiveness of our proposed schemes.

IEEE Transactions on Vehicular Technology•Nov 29, 2016•23 citations

Secure Relay Beamforming for SWIPT in Amplify-and-Forward Two-Way Relay Networks

Quanzhong Li, Qi Zhang, Jiayin Qin

In this paper, we investigate the secure relay beamforming problem for simultaneous wireless information and power transfer (SWIPT) in an amplify-and-forward (AF) two-way relay network. We consider scenarios that the eavesdropper's channel state information (CSI) is and is not available. When the eavesdropper's CSI is available, our objective is to maximize the achievable secrecy sum rate under transmit power constraint and energy harvesting constraint. Since the optimization problem is nonconvex, we derive its performance upper bound, which requires 2-D search, where a semidefinite programming is solved in each step. We also propose an upper bound-based rank-one solution by employing the Gaussian randomization method. To reduce computational complexity, we transform the optimization problem into a difference-of-convex programming and propose a sequential parametric convex approximation (SPCA)-based iterative algorithm to find a locally optimal solution. Furthermore, we also propose a zero-forcing (ZF)-based suboptimal solution. Simulation results demonstrate that the upper bound-based rank-one solution archives the performance almost the same as the upper bound that has high computational complexity. The low-complexity SPCA-based locally optimal solution performs close to the upper bound. The ZF-based suboptimal solution has the lowest computational complexity among the proposed solutions. When the eavesdropper's CSI is not available, we propose an artificial noise-aided secure relay beamforming scheme.

IEEE Transactions on Vehicular Technology•Jan 19, 2016•95 citations

Secure beamforming design of SWIPT relay network with multiple users and eavesdroppers

Lu He, Taoshen Li, Baber +4 more

Abstract This paper studies the secure beamforming design for simultaneous wireless information and power transfer (SWIPT) in a amplify-and-forward (AF) relay networks with multiple users and eavesdroppers. Each user node adopts the power splitting (PS) scheme to decode information and harvest energy simultaneously. Our objective is to minimize the total relay transmit power under the constraints of secure transmission rate and energy harvesting requirements by jointly optimizing the beamforming matrix, artificial noise covariance matrix and PS ratios. For this non-convex problem, we propose a two-stage optimization approach to convert the original problem into two sub-problems. The first subproblem uses semidefinite relaxation (SDR) technique to transform the original problem into a convex problem, and then finds the optimal solution of the second subproblem through k-dimensional exhaustive search algorithm. Furthermore, we also propose a low complexity suboptimal solution scheme based on particle swarm optimization (PSO) algorithm. Simulation results show that the proposed scheme saves transmitting power and achieves better performance than other schemes.

Journal of Physics Conference Series•Aug 1, 2020•2 citations

Robust Secure Beamforming for SWIPT-Aided Relay Systems With Full-Duplex Receiver and Imperfect CSI

Xinrui Li, Wei Wang, Miao Zhang +2 more

This paper investigates an energy-constrained relay-assisted secure communication system in the presence of a legitimate source-destination pair and a passive eavesdropper with imperfect channel state information (CSI). The energy-constrained relay exploits a power splitting (PS) protocol to simultaneously harvest energy and decode information from the received signal from the source, and then forwards the confidential signal to the full-duplex (FD) destination while it simultaneously transmits artificial noise (AN) to confuse the passive eavesdropper. This robust beamforming design is developed by maximizing the secrecy rate under the constraints of energy harvesting (EH) requirement at the relay and AN transmit power at the destination. Specifically, we formulate the joint relay beamforming and PS ratio as well as the AN power optimization as a non-convex quadratically-constrained problem. In order to circumvent this non-convexity issue, we decompose the original problem into three subproblems which can be determined by the proposed semidefinite relaxation (SDR) and successive convex optimization methods. Furthermore, we derive closed-form expressions for the optimal solutions of each subproblem. Finally, the original non-convex problem can be solved through a convergence guaranteed iterative algorithm. Simulation results are provided to demonstrate the effectiveness and superior performance of the proposed robust design compared with the benchmark schemes.

IEEE Transactions on Vehicular Technology•Dec 24, 2019•33 citations

Secure Beamforming for Simultaneous Wireless Information and Power Transfer in Wireless-Powered Full-Duplex Relay Networks

Taoshen Li, Peipei Chen, Zhe Wang +1 more

In this paper, we study secure beamforming for simultaneous wireless information and power transfer (SWIPT) in wireless-powered full-duplex (FD) relay networks. The relay assists transmission of confidential information, while simultaneously harvesting the energy with power switching scheme by the radio-frequency (RF) signals. We propose a joint amplify-and-forward beamforming (AB) and energy signal (AB-ES) with the receiver power splitting strategy (PS) scheme to maximize the secrecy rate under harvesting energy constraints. Since these constraints make the optimization problems become non-convex and hard to tackle. We propose a two-level optimization problem to solve this problem. The out part can be solved via the one-Dimensional search, and the inner part can be solved by semidefinite relaxation (SDR) technique. Simulation results show that the proposed scheme outperforms other schemes.

International Conference on Computer Science & Education (ICCSE)•Aug 1, 2019•3 citations

Secure Transmission in SWIPT-Powered Two-Way Untrusted Relay Networks

Jiazhen Zhang, Xiaofeng Tao, Huici Wu +1 more

In this paper, we investigate the secure transmission in two-way untrusted amplify-and-forward relay networks with simultaneous wireless information and power transfer (SWIPT). Two secure SWIPT relaying strategies, namely, secure power splitting (SPS) and secure time switching (STS), are studied with the objective of secrecy rate (SR) and secure energy efficiency (SEE) maximization. First, the high signal-to-noise ratio approximations of SR and SEE are established, based on which non-convex SPS-based and convex STS-based SR maximization problems are formulated to jointly optimize the source transmit power and resource division ratio. Suboptimal solutions are obtained by employing Dinkelbach's method and Newton's method, respectively. Furthermore, to guarantee both the energy efficiency and secure quality of service (QoS) performance, SEE maximization problems are formulated with the consideration of the energy harvesting activation constraint and the target SR requirement. The intractable non-convex SEE maximization problems are reformulated as parameter programming, transformed to Lagrange dual problems, and finally solved by two SEE resource allocation algorithms with low complexity. Numerical results verify the convergence and effectiveness of the proposed algorithms and provide new insights into relaying strategy design and secure relay placement.

IEEE Access•Jan 1, 2018•45 citations
For simultaneous wireless information and power transfer (SWIPT), secure communication is an important issue. In this correspondence, we study the secure relay beamforming (SRB) scheme for SWIPT in a nonregenerative multiantenna relay network. We propose a constrained concave convex procedure (CCCP)-based iterative algorithm that is able to achieve a local optimum, where the secrecy rate is maximized, and the relay transmit power and energy harvesting constraints are satisfied. Simulation results have shown that our proposed CCCP-based iterative algorithm achieves a larger secrecy rate and lower computational complexity than the convectional SRB schemes. Since the CCCP-based iterative algorithm is still complex, we propose a semidefinite programming (SDP)-based noniterative suboptimal algorithm and a closed-form suboptimal algorithm. It is shown that when the maximum transmit power of the relay to noise power ratio is high, the SDP-based noniterative suboptimal algorithm performs close to the CCCP-based iterative algorithm.
Simultaneous wireless information and power transfer (SWIPT) is able to prolong the lifetime of energy-constrained wireless networks. In this paper, we study the security issue of a nonregenerative multiple-input multiple-out (MIMO) relay system with SWIPT. When the full channel state information (CSI) of the eavesdropper is available, we aim to maximize the secrecy rate under the source and relay transmit power constraints and energy-harvesting (EH) constraints at the multiple EH receivers by jointly designing the source and relay beamforming matrices, which is a nonconvex optimization and is still an open problem. In order to enhance the secrecy rate effectively, we first transform the optimization into a difference of convex programming and propose a sequential parametric convex approximation-based iterative algorithm which is able to achieve a local optimum. To reduce the complexity, we also propose a singular value decomposition (SVD)-generalized SVD-based method to simplify the optimization into a joint source and relay power allocation problem. The alternating optimization is employed to find a suboptimal solution of the joint power allocation problem. When the CSI of the eavesdropper is unknown, we propose an artificial-noise (AN) aided joint source and relay beamforming scheme, which can maximize the AN power to jam the eavesdropper under the limited source and relay transmit power and satisfy the quality of service of the receiver. Simulation results have shown the effectiveness of our proposed schemes.
In this paper, we investigate the secure relay beamforming problem for simultaneous wireless information and power transfer (SWIPT) in an amplify-and-forward (AF) two-way relay network. We consider scenarios that the eavesdropper's channel state information (CSI) is and is not available. When the eavesdropper's CSI is available, our objective is to maximize the achievable secrecy sum rate under transmit power constraint and energy harvesting constraint. Since the optimization problem is nonconvex, we derive its performance upper bound, which requires 2-D search, where a semidefinite programming is solved in each step. We also propose an upper bound-based rank-one solution by employing the Gaussian randomization method. To reduce computational complexity, we transform the optimization problem into a difference-of-convex programming and propose a sequential parametric convex approximation (SPCA)-based iterative algorithm to find a locally optimal solution. Furthermore, we also propose a zero-forcing (ZF)-based suboptimal solution. Simulation results demonstrate that the upper bound-based rank-one solution archives the performance almost the same as the upper bound that has high computational complexity. The low-complexity SPCA-based locally optimal solution performs close to the upper bound. The ZF-based suboptimal solution has the lowest computational complexity among the proposed solutions. When the eavesdropper's CSI is not available, we propose an artificial noise-aided secure relay beamforming scheme.
Abstract This paper studies the secure beamforming design for simultaneous wireless information and power transfer (SWIPT) in a amplify-and-forward (AF) relay networks with multiple users and eavesdroppers. Each user node adopts the power splitting (PS) scheme to decode information and harvest energy simultaneously. Our objective is to minimize the total relay transmit power under the constraints of secure transmission rate and energy harvesting requirements by jointly optimizing the beamforming matrix, artificial noise covariance matrix and PS ratios. For this non-convex problem, we propose a two-stage optimization approach to convert the original problem into two sub-problems. The first subproblem uses semidefinite relaxation (SDR) technique to transform the original problem into a convex problem, and then finds the optimal solution of the second subproblem through k-dimensional exhaustive search algorithm. Furthermore, we also propose a low complexity suboptimal solution scheme based on particle swarm optimization (PSO) algorithm. Simulation results show that the proposed scheme saves transmitting power and achieves better performance than other schemes.
This paper investigates an energy-constrained relay-assisted secure communication system in the presence of a legitimate source-destination pair and a passive eavesdropper with imperfect channel state information (CSI). The energy-constrained relay exploits a power splitting (PS) protocol to simultaneously harvest energy and decode information from the received signal from the source, and then forwards the confidential signal to the full-duplex (FD) destination while it simultaneously transmits artificial noise (AN) to confuse the passive eavesdropper. This robust beamforming design is developed by maximizing the secrecy rate under the constraints of energy harvesting (EH) requirement at the relay and AN transmit power at the destination. Specifically, we formulate the joint relay beamforming and PS ratio as well as the AN power optimization as a non-convex quadratically-constrained problem. In order to circumvent this non-convexity issue, we decompose the original problem into three subproblems which can be determined by the proposed semidefinite relaxation (SDR) and successive convex optimization methods. Furthermore, we derive closed-form expressions for the optimal solutions of each subproblem. Finally, the original non-convex problem can be solved through a convergence guaranteed iterative algorithm. Simulation results are provided to demonstrate the effectiveness and superior performance of the proposed robust design compared with the benchmark schemes.
In this paper, we study secure beamforming for simultaneous wireless information and power transfer (SWIPT) in wireless-powered full-duplex (FD) relay networks. The relay assists transmission of confidential information, while simultaneously harvesting the energy with power switching scheme by the radio-frequency (RF) signals. We propose a joint amplify-and-forward beamforming (AB) and energy signal (AB-ES) with the receiver power splitting strategy (PS) scheme to maximize the secrecy rate under harvesting energy constraints. Since these constraints make the optimization problems become non-convex and hard to tackle. We propose a two-level optimization problem to solve this problem. The out part can be solved via the one-Dimensional search, and the inner part can be solved by semidefinite relaxation (SDR) technique. Simulation results show that the proposed scheme outperforms other schemes.
In this paper, we investigate the secure transmission in two-way untrusted amplify-and-forward relay networks with simultaneous wireless information and power transfer (SWIPT). Two secure SWIPT relaying strategies, namely, secure power splitting (SPS) and secure time switching (STS), are studied with the objective of secrecy rate (SR) and secure energy efficiency (SEE) maximization. First, the high signal-to-noise ratio approximations of SR and SEE are established, based on which non-convex SPS-based and convex STS-based SR maximization problems are formulated to jointly optimize the source transmit power and resource division ratio. Suboptimal solutions are obtained by employing Dinkelbach's method and Newton's method, respectively. Furthermore, to guarantee both the energy efficiency and secure quality of service (QoS) performance, SEE maximization problems are formulated with the consideration of the energy harvesting activation constraint and the target SR requirement. The intractable non-convex SEE maximization problems are reformulated as parameter programming, transformed to Lagrange dual problems, and finally solved by two SEE resource allocation algorithms with low complexity. Numerical results verify the convergence and effectiveness of the proposed algorithms and provide new insights into relaying strategy design and secure relay placement.