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

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

Quanzhong Li, Jiayin Qin

Published Nov 29, 2016• 23 citations
Publisher

Abstract

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.

DOI
10.1109/tvt.2016.2633380

Related papers

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 Relay Beamforming for Simultaneous Wireless Information and Power Transfer in Nonregenerative Relay Networks

Quanzhong Li, Qi Zhang, Jiayin Qin

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.

IEEE Transactions on Vehicular Technology•Jan 31, 2014•110 citations

Joint Source-Relay Precoding and Power Allocation for Secure Amplify-and-Forward MIMO Relay Networks

Hui‐Ming Wang, Feng Liu, Xiang‐Gen Xia

In this paper, we investigate the security issue of a two-hop amplify-and-forward multiple-input multiple-output wireless relay network in the existence of a multiantenna eavesdropper. The optimal scheme to achieve the secrecy capacity involves a nonconvex optimization and is still an open problem. Aiming to find an efficient way to enhance the secrecy rate with a tractable complexity, we propose a suboptimal joint source and relay linear precoding and power allocation scheme. In the scheme, the source node adopts a generalized singular value decomposition (SVD)-based precoding to transmit the signal in the first phase, and the relay node forwards the received signal based on the SVD precoding in the null-space of the wiretap channel in the second phase. Power allocations in both phases are optimized to maximize the secrecy rate by an alternating iterative optimization algorithm. Each iteration involves two subproblems. One has a water-filling solution and the other has a closed-form solution or a water-filling-like solution as well, both of which are computationally very efficient. The iteration converges fast and we prove that it guarantees to find a stationary optimum. Furthermore, we show that when the eavesdropper has equal or more antennas than the source does, the secrecy rate is a quasi-concave function of the source power so that allocating all the source power is generally not optimal. Numerical evaluation results are provided to show the effectiveness of the iterative algorithm and the proposed secrecy scheme.

IEEE Transactions on Information Forensics and Security•May 30, 2014•56 citations

Robust Secure Beamforming for Multi-Receiver Multi-Eavesdropper MIMO SWIPT Systems

Yao Yu, Shumei Liu, Weina Yuan +3 more

In this paper, we consider a multiuser multiple-input multiple-output (MIMO) downlink communication system with simultaneous wireless information and power transfer (SWIPT). In particular, we focus on a realistic and efficient multi-receiver multi-eavesdropper MIMO SWIPT system, in which the channel state information (CSI) of each legitimate receiver and energy receiver (i.e., potential eavesdropper) is partially known to the transmitter. Based on this, we propose a robust artificial noise (AN)-aided secure transmission scheme for the system, where the channel uncertainties are modeled by the worst-case model. In the proposed scheme, we aim to maximize the worst-case achievable secrecy rate under the transmit power constraint and the energy harvesting (EH) constraint, by jointly optimizing the transmit precoding matrix and the AN covariance matrix. We utilize the S-Procedure and Taylor series approximation to transform the non-convex problem. Then, we apply the interior point method to tackle the transformed convex problem, obtaining the approximate optimal matrices and the corresponding maximum worst-case secrecy rate. Simulation results show that our proposed scheme achieves significant performance improvements in terms of convergence and the worst-case achievable secrecy rate.

Globecom•Dec 1, 2020•4 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

Joint GSVD-SVD precoding and power allocation for security of AF MIMO relay networks

Hui‐Ming Wang, Feng Liu, Pengcheng Mu

In this paper, we investigate the security issue of a two-hop amplify-and-forward MIMO wireless relay networks in the existence of a multi-antenna eavesdropper. The optimal scheme to achieve the secrecy capacity involves a non-convex optimization and is still an open problem. Aiming to find an efficient way to enhance the secrecy rate, we propose a suboptimal joint source and relay linear precoding scheme. In the scheme, the source node adopt a generalized singular value decomposition (GSVD) based precoding to transmit the signal in the first phase, and the relay node forwards the received signal based on SVD in the null-space of the wiretap channel in the second phase. Power allocations in both phases are optimized to maximize the secrecy rate. An alternating iterative optimization algorithm is proposed to solve the problem. The algorithm is computationally efficient and guarantees to converge to a local optimum. Numerical evaluation results are provided to show the effectiveness of the iterative algorithm and the proposed secrecy scheme.

International Conference on Communications•Jun 1, 2014•6 citations
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.
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.
In this paper, we investigate the security issue of a two-hop amplify-and-forward multiple-input multiple-output wireless relay network in the existence of a multiantenna eavesdropper. The optimal scheme to achieve the secrecy capacity involves a nonconvex optimization and is still an open problem. Aiming to find an efficient way to enhance the secrecy rate with a tractable complexity, we propose a suboptimal joint source and relay linear precoding and power allocation scheme. In the scheme, the source node adopts a generalized singular value decomposition (SVD)-based precoding to transmit the signal in the first phase, and the relay node forwards the received signal based on the SVD precoding in the null-space of the wiretap channel in the second phase. Power allocations in both phases are optimized to maximize the secrecy rate by an alternating iterative optimization algorithm. Each iteration involves two subproblems. One has a water-filling solution and the other has a closed-form solution or a water-filling-like solution as well, both of which are computationally very efficient. The iteration converges fast and we prove that it guarantees to find a stationary optimum. Furthermore, we show that when the eavesdropper has equal or more antennas than the source does, the secrecy rate is a quasi-concave function of the source power so that allocating all the source power is generally not optimal. Numerical evaluation results are provided to show the effectiveness of the iterative algorithm and the proposed secrecy scheme.
In this paper, we consider a multiuser multiple-input multiple-output (MIMO) downlink communication system with simultaneous wireless information and power transfer (SWIPT). In particular, we focus on a realistic and efficient multi-receiver multi-eavesdropper MIMO SWIPT system, in which the channel state information (CSI) of each legitimate receiver and energy receiver (i.e., potential eavesdropper) is partially known to the transmitter. Based on this, we propose a robust artificial noise (AN)-aided secure transmission scheme for the system, where the channel uncertainties are modeled by the worst-case model. In the proposed scheme, we aim to maximize the worst-case achievable secrecy rate under the transmit power constraint and the energy harvesting (EH) constraint, by jointly optimizing the transmit precoding matrix and the AN covariance matrix. We utilize the S-Procedure and Taylor series approximation to transform the non-convex problem. Then, we apply the interior point method to tackle the transformed convex problem, obtaining the approximate optimal matrices and the corresponding maximum worst-case secrecy rate. Simulation results show that our proposed scheme achieves significant performance improvements in terms of convergence and the worst-case achievable secrecy rate.
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 investigate the security issue of a two-hop amplify-and-forward MIMO wireless relay networks in the existence of a multi-antenna eavesdropper. The optimal scheme to achieve the secrecy capacity involves a non-convex optimization and is still an open problem. Aiming to find an efficient way to enhance the secrecy rate, we propose a suboptimal joint source and relay linear precoding scheme. In the scheme, the source node adopt a generalized singular value decomposition (GSVD) based precoding to transmit the signal in the first phase, and the relay node forwards the received signal based on SVD in the null-space of the wiretap channel in the second phase. Power allocations in both phases are optimized to maximize the secrecy rate. An alternating iterative optimization algorithm is proposed to solve the problem. The algorithm is computationally efficient and guarantees to converge to a local optimum. Numerical evaluation results are provided to show the effectiveness of the iterative algorithm and the proposed secrecy scheme.