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 International Conference on Signal Processing, Communications and Computing (ICSPCC)

Secure Precoding Scheme for Full-Duplex MIMO Untrusted Relay Network with Energy Harvesting

Ye Fan, Xuewen Liao, Rugui Yao, Xiaoya Zuo, Zhengyu Zhu

Published Aug 21, 2020• 1 citation
Publisher

Abstract

In this paper, we propose a novel secure precoding scheme for the full-duplex multiple-input multiple-output (MIMO) untrusted relay network. To ensure security, the source uses a fraction of power to send artificial noise and the destination collaboratively transmits jamming signal with the harvested energy to the relay. Aiming at improving the power efficiency and keeping security simultaneously, we jointly maximize the achievable secrecy rate by optimizing the precoders of the information signal, jamming signal, artificial noise, amplification matrix, and power splitting ratio subject to the power constraints. Furthermore, to make the optimization problem solvable, we propose an iterative algorithm and deal with the non-convex constraints through concave convex procedure (CCCP). Simulation results show that the proposed precoding scheme has significantly improved the secrecy performance and power efficiency compared with the typical direct link (DL) scheme and non-cooperative jamming (No-CJ) scheme.

DOI
10.1109/icspcc50002.2020.9259497

Related papers

Artificial Noise Aided Secure Precoding for MIMO Untrusted Two-Way Relay Systems With Perfect and Imperfect Channel State Information

Quanzhong Li, Liang Yang

Physical-layer secure is an important issue for untrusted relay systems. In this paper, we investigate secure precoding design for non-regenerative multiple-input multiple-output untrusted two-way relay systems, where artificial noise (AN) is applied at the source and the relay is untrusted. We aim to maximize the secrecy sum rate by jointly designing the source's signal and AN precoders and the relay's precoder, under the sources and relay transmit power constraints. We consider two scenarios that perfect and imperfect channel state information of all the channels is available. For the former, we convert the secure precoding problem to a difference of convex programming and develop a constrained concave convex procedure based iterative algorithm which can obtain a local optimal solution. We also provide asymptotic analysis on the maximum secrecy sum rate when the relay transmit power approaches infinity, and propose alternating optimization method to compute asymptotic optimal precoders. For the latter, we model the channel uncertainties by using worst-case criterion and propose the weighted minimum mean square error based method to solve the robust secure precoding problem. Numerical simulations are presented to show the effectiveness of our proposed schemes.

IEEE Transactions on Information Forensics and Security•Apr 11, 2018•79 citations

Secrecy-enhancing design for two-way energy harvesting cooperative networks with full-duplex relay jamming

Siyang Xu, Xin Song, Yiming Gao +3 more

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.

China Communications•May 1, 2021•5 citations

Robust AN-Aided Secure Precoding for an AF MIMO Untrusted Relay System

Quanzhong Li, Liang Yang, Qi Zhang +1 more

Robust artificial noise (AN) aided secure precoding for an amplify-and-forward multiple-input multiple-output untrusted relay system is studied, where the relay is untrusted and willing to help forwarding multiple data streams from the source to destination. We consider that the available channel state information is imperfect and modeled by the worst case model. Our objective is to maximize the worst case secrecy rate under the robust transmit power constraints at the source and relay, by jointly designing the signal and AN precoding matrices at the source and the precoding matrix at the relay. The robust secure precoding problem is nonconvex and hard to solve. To overcome this difficulty, we propose the weighted minimum mean square error based method, where the signdefiniteness lemma is used to eliminate the channel uncertainties and an effective iterative optimization algorithm is developed. Simulation results are provided to demonstrate the effectiveness of the proposed scheme.

IEEE Transactions on Vehicular Technology•Sep 4, 2017•20 citations

Secure Energy Efficiency Maximization for Untrusted Wireless-Powered Full-Duplex Relay Networks Under Nonlinear Energy Harvesting

Siyang Xu, Xin Song

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.

IEEE Systems Journal•Jan 24, 2022•7 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

Destination-Aided Cooperative Jamming for Dual-Hop Amplify-and-Forward MIMO Untrusted Relay Systems

Jun Xiong, Longwang Cheng, Dongtang Ma +1 more

In this paper, we consider a dual-hop amplify-and-forward (AF) multiple-input-multiple-output (MIMO) relay network, where the source, relay, and destination are each equipped with multiple antennas. The relay is untrusted if it is willing to forward the signal to the destination and, at the same time, acts as a potential eavesdropper to interpret the message from the source. Since there exists no direct link between the source and the destination, a positive secrecy rate cannot be obtained. Addressing this issue, we propose a joint destination-aided cooperative jamming and precoding at both the source and the relay scheme: joint source, relay, and destination precoding (JP). We target at maximizing the secrecy rate by jointly designing the source, relay, and destination precoding matrices and propose an alternating iterative optimization algorithm to tackle the nonconvex problem. Then, a comprehensive study on the asymptotic performance is conducted in a high signal-to-noise ratio (SNR) regime. In particular, we present simple closed-form expressions for the two key performance parameters in the asymptotic secrecy rate, i.e., the high-SNR slope and the high-SNR power offset. Finally, numerical results are conducted to demonstrate the validity of the proposed secure scheme and its performance analysis.

IEEE Transactions on Vehicular Technology•Oct 13, 2015•74 citations
In this paper, we propose a novel secure precoding scheme for the full-duplex multiple-input multiple-output (MIMO) untrusted relay network. To ensure security, the source uses a fraction of power to send artificial noise and the destination collaboratively transmits jamming signal with the harvested energy to the relay. Aiming at improving the power efficiency and keeping security simultaneously, we jointly maximize the achievable secrecy rate by optimizing the precoders of the information signal, jamming signal, artificial noise, amplification matrix, and power splitting ratio subject to the power constraints. Furthermore, to make the optimization problem solvable, we propose an iterative algorithm and deal with the non-convex constraints through concave convex procedure (CCCP). Simulation results show that the proposed precoding scheme has significantly improved the secrecy performance and power efficiency compared with the typical direct link (DL) scheme and non-cooperative jamming (No-CJ) scheme.
Physical-layer secure is an important issue for untrusted relay systems. In this paper, we investigate secure precoding design for non-regenerative multiple-input multiple-output untrusted two-way relay systems, where artificial noise (AN) is applied at the source and the relay is untrusted. We aim to maximize the secrecy sum rate by jointly designing the source's signal and AN precoders and the relay's precoder, under the sources and relay transmit power constraints. We consider two scenarios that perfect and imperfect channel state information of all the channels is available. For the former, we convert the secure precoding problem to a difference of convex programming and develop a constrained concave convex procedure based iterative algorithm which can obtain a local optimal solution. We also provide asymptotic analysis on the maximum secrecy sum rate when the relay transmit power approaches infinity, and propose alternating optimization method to compute asymptotic optimal precoders. For the latter, we model the channel uncertainties by using worst-case criterion and propose the weighted minimum mean square error based method to solve the robust secure precoding problem. Numerical simulations are presented to show the effectiveness of our proposed schemes.
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.
Robust artificial noise (AN) aided secure precoding for an amplify-and-forward multiple-input multiple-output untrusted relay system is studied, where the relay is untrusted and willing to help forwarding multiple data streams from the source to destination. We consider that the available channel state information is imperfect and modeled by the worst case model. Our objective is to maximize the worst case secrecy rate under the robust transmit power constraints at the source and relay, by jointly designing the signal and AN precoding matrices at the source and the precoding matrix at the relay. The robust secure precoding problem is nonconvex and hard to solve. To overcome this difficulty, we propose the weighted minimum mean square error based method, where the signdefiniteness lemma is used to eliminate the channel uncertainties and an effective iterative optimization algorithm is developed. Simulation results are provided to demonstrate the effectiveness of the proposed scheme.
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.
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 consider a dual-hop amplify-and-forward (AF) multiple-input-multiple-output (MIMO) relay network, where the source, relay, and destination are each equipped with multiple antennas. The relay is untrusted if it is willing to forward the signal to the destination and, at the same time, acts as a potential eavesdropper to interpret the message from the source. Since there exists no direct link between the source and the destination, a positive secrecy rate cannot be obtained. Addressing this issue, we propose a joint destination-aided cooperative jamming and precoding at both the source and the relay scheme: joint source, relay, and destination precoding (JP). We target at maximizing the secrecy rate by jointly designing the source, relay, and destination precoding matrices and propose an alternating iterative optimization algorithm to tackle the nonconvex problem. Then, a comprehensive study on the asymptotic performance is conducted in a high signal-to-noise ratio (SNR) regime. In particular, we present simple closed-form expressions for the two key performance parameters in the asymptotic secrecy rate, i.e., the high-SNR slope and the high-SNR power offset. Finally, numerical results are conducted to demonstrate the validity of the proposed secure scheme and its performance analysis.