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

International Conference on Communications

PNC-Aided Robust Secure Beamforming Design for Two-Way Relay Networks with Artificial Noise

Yunqin Hao, Tiejun Lv, Jie Jack Zeng, Pingmu Huang

Published May 1, 2019• 0 citations
Publisher

Abstract

In this paper, we study a two-way relay network (TWRN), in which eavesdroppers' channel state information is imperfect, and all the eavesdroppers collude to form joint receive beamforming for enhanced receptions. To ensure the robustness of the TWRN, we design the transmit beamforming and establish two secure beamforming design formulations, which combines the physical layer network coding with artificial noise technique at the relay. One secure beamforming design formulation is to minimize the total transmit power in the TWRN, and the other one is to guarantee a maximum secrecy sum rate (SSR) in the worst-case. With the help of approximation techniques, the former optimization problem is converted into a convex problem, whose semidefinite relaxation solution is rank-one. However, due to the maximum available power limit of the system, the power optimization problem may be infeasible. To overcome this problem, the SSR optimization formulation is presented, and the optimization problem is decoupled into two subproblems that can be transformed into the convex forms. Finally, it is verified by the numerical results that the proposed schemes are effective.

DOI
10.1109/icc.2019.8761317

Related papers

AN-aided robust secure beamforming design in MIMO two-way relay systems with PNC

Yunqin Hao, Tiejun Lv, Hui Gao

This paper investigates the artificial noise (AN)-aided robust secure beamforming design for multiple-input multiple-output (MIMO) two-way relaying (TWR) systems based on physical layer network coding (PNC). In terms of signal-to-interference-and-noise ratio (SINR), we propose two robust beamforming designs to optimize worst-case secrecy sum rate in the presence of an eavesdropper, where the eavesdropper's channel state information (ECSI) is imperfect. In low SINR regime, we give a robust joint beamforming design. Since the optimization problem is non-convex, we use a zero-forcing (ZF) constraint on AN beamforming, and after approximating the objective function, the non-convex problem is formulated into a semidefinite programming (SDP). On the other hand, in high SINR regime, we provide a quality-of-service (QoS)-based robust beamforming design, in which the optimal solution can be efficiently obtained by employing an iterative algorithm based on Taylor expansion and semidefinite relaxation (SDR) techniques. Numerical results show the efficiency of the proposed schemes.

IEEE Wireless Communications and Networking Conference•Apr 1, 2018•4 citations

Robust AN-aided Secure Beamforming for Full-Duplex Relay System with Multiple Eavesdroppers

Jiaxing Cui, Zhengmin Kong, Jing Song +2 more

In this paper, we investigate the physical layer security of a full-duplex decode-and-forward relay-aided system in the worst case, where all channel state informations are realistic imperfect. For the sake of confidentiality of signals transmitted from source to destination, a robust artificial noise (AN)-aided beamforming scheme is proposed. Explicitly, our objective function is that of maximizing the worst-case secrecy rate under the transmit power constraints, by jointly optimizing the beamforming matrix and AN at the source and the relay. To overcome the non-convexity of the robust AN-aided secure beamforming problem, we transform it into multi-block convex problems, where the semi-infinite linear matrix inequality is applied to eliminate the channel uncertainties. As a benefit, our proposed robust AN -aided secure beamforming scheme obtains substantial secrecy performance gains, which verifies the efficiency of the proposed scheme.

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)•Oct 1, 2021•0 citations

Joint cooperative beamforming and artificial noise design for secure AF relay networks with energy-harvesting eavesdroppers

Hehao Niu, Bangning Zhang, Daoxing Guo +2 more

In this paper, we investigate physical layer security for simultaneous wireless information and power transfer in amplify-and-forward relay networks. We propose a joint robust cooperative beamforming and artificial noise scheme for secure communication and efficient wireless energy transfer. Specifically, by treating the energy receiver as a potential eavesdropper and assuming that only imperfect channel state information can be obtained, we formulate an optimization problem to maximize the worst-case secrecy rate between the source and the legitimate information receiver under both the power constraint at the relays and the wireless power harvest constraint at the energy receiver. Since such a problem is non-convex and hard to tackle, we propose a two-level optimization approach which involves a one-dimensional search and semidefinite relaxation. Simulation results show that the proposed robust scheme achieves better worst-case secrecy rate performance than other schemes.

Frontiers of Information Technology & Electronic Engineering•Jun 1, 2017•3 citations

Secure Beamforming with Artificial Noise for Two-way Relay Networks

Dandan Li, Ke Xiong, Guanyao Du +1 more

This paper studies the problem of secure information exchange between two sources via multiple relays in the presence of an eavesdropper.To this end, we propose a relay beamforming scheme, i.e., relay beamforming with artificial noise (RBwA), where the relay beamforming vector and the artificial noise vector are jointly designed to maintain the received signal-to-interference-ratio (SINR) at the two sources over a predefined Quality of Service (QoS) threshold while limiting the received SINR at the eavesdropper under a predefined secure threshold.For comparsion, the relay beamforming without artificial noise (RBoA) is also considered.We formulate two optimization problems for the two schemes, where our goal is to seek the optimal beamforming vector to minimize the total power consumed by relay nodes such that the secrecy of the information exchange between the two sources can be protected.Since both optimization problems are nonconvex, we solve them by semidefinite program (SDP) relaxation theory.Simulation results show that, via beamforming design, physical layer secrecy of two-way relay networks can be greatly improved and our proposed RBwA outperforms the RBoA in terms of both low power consumption and low infeasibility rate.

KSII Transactions on Internet and Information Systems•Jun 26, 2013•3 citations

Robust joint beamforming and artificial noise design for amplify-and-forward multi-antenna relay systems

Lijian Zhang, Liang Jin, Wenyu Luo +2 more

In this paper, we address physical layer security for amplify-and-forward (AF) multi-antenna relay systems in the presence of multiple eavesdroppers. A robust joint design of cooperative beamforming (CB) and artificial noise (AN) is proposed with imperfect channel state information (CSI) of both the destination and the eavesdroppers. We aim to maximize the worst-case secrecy rate subject to the sum power and the per-antenna power constraints at the relay. Such joint design problem is non-convex. By utilizing the semidefinite relaxation (SDR) technique, S-procedure and the successive convex approximation (SCA) algorithm, the original non-convex optimization problem is recast into a series of semidefinite programs (SDPs) which can be efficiently solved using interior-methods. Simulation results are presented to verify the effectiveness of the proposed design.

IEEE International Conference on Acoustics Speech and Signal Processing•Apr 1, 2015•4 citations

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
In this paper, we study a two-way relay network (TWRN), in which eavesdroppers' channel state information is imperfect, and all the eavesdroppers collude to form joint receive beamforming for enhanced receptions. To ensure the robustness of the TWRN, we design the transmit beamforming and establish two secure beamforming design formulations, which combines the physical layer network coding with artificial noise technique at the relay. One secure beamforming design formulation is to minimize the total transmit power in the TWRN, and the other one is to guarantee a maximum secrecy sum rate (SSR) in the worst-case. With the help of approximation techniques, the former optimization problem is converted into a convex problem, whose semidefinite relaxation solution is rank-one. However, due to the maximum available power limit of the system, the power optimization problem may be infeasible. To overcome this problem, the SSR optimization formulation is presented, and the optimization problem is decoupled into two subproblems that can be transformed into the convex forms. Finally, it is verified by the numerical results that the proposed schemes are effective.
This paper investigates the artificial noise (AN)-aided robust secure beamforming design for multiple-input multiple-output (MIMO) two-way relaying (TWR) systems based on physical layer network coding (PNC). In terms of signal-to-interference-and-noise ratio (SINR), we propose two robust beamforming designs to optimize worst-case secrecy sum rate in the presence of an eavesdropper, where the eavesdropper's channel state information (ECSI) is imperfect. In low SINR regime, we give a robust joint beamforming design. Since the optimization problem is non-convex, we use a zero-forcing (ZF) constraint on AN beamforming, and after approximating the objective function, the non-convex problem is formulated into a semidefinite programming (SDP). On the other hand, in high SINR regime, we provide a quality-of-service (QoS)-based robust beamforming design, in which the optimal solution can be efficiently obtained by employing an iterative algorithm based on Taylor expansion and semidefinite relaxation (SDR) techniques. Numerical results show the efficiency of the proposed schemes.
In this paper, we investigate the physical layer security of a full-duplex decode-and-forward relay-aided system in the worst case, where all channel state informations are realistic imperfect. For the sake of confidentiality of signals transmitted from source to destination, a robust artificial noise (AN)-aided beamforming scheme is proposed. Explicitly, our objective function is that of maximizing the worst-case secrecy rate under the transmit power constraints, by jointly optimizing the beamforming matrix and AN at the source and the relay. To overcome the non-convexity of the robust AN-aided secure beamforming problem, we transform it into multi-block convex problems, where the semi-infinite linear matrix inequality is applied to eliminate the channel uncertainties. As a benefit, our proposed robust AN -aided secure beamforming scheme obtains substantial secrecy performance gains, which verifies the efficiency of the proposed scheme.
In this paper, we investigate physical layer security for simultaneous wireless information and power transfer in amplify-and-forward relay networks. We propose a joint robust cooperative beamforming and artificial noise scheme for secure communication and efficient wireless energy transfer. Specifically, by treating the energy receiver as a potential eavesdropper and assuming that only imperfect channel state information can be obtained, we formulate an optimization problem to maximize the worst-case secrecy rate between the source and the legitimate information receiver under both the power constraint at the relays and the wireless power harvest constraint at the energy receiver. Since such a problem is non-convex and hard to tackle, we propose a two-level optimization approach which involves a one-dimensional search and semidefinite relaxation. Simulation results show that the proposed robust scheme achieves better worst-case secrecy rate performance than other schemes.
This paper studies the problem of secure information exchange between two sources via multiple relays in the presence of an eavesdropper.To this end, we propose a relay beamforming scheme, i.e., relay beamforming with artificial noise (RBwA), where the relay beamforming vector and the artificial noise vector are jointly designed to maintain the received signal-to-interference-ratio (SINR) at the two sources over a predefined Quality of Service (QoS) threshold while limiting the received SINR at the eavesdropper under a predefined secure threshold.For comparsion, the relay beamforming without artificial noise (RBoA) is also considered.We formulate two optimization problems for the two schemes, where our goal is to seek the optimal beamforming vector to minimize the total power consumed by relay nodes such that the secrecy of the information exchange between the two sources can be protected.Since both optimization problems are nonconvex, we solve them by semidefinite program (SDP) relaxation theory.Simulation results show that, via beamforming design, physical layer secrecy of two-way relay networks can be greatly improved and our proposed RBwA outperforms the RBoA in terms of both low power consumption and low infeasibility rate.
In this paper, we address physical layer security for amplify-and-forward (AF) multi-antenna relay systems in the presence of multiple eavesdroppers. A robust joint design of cooperative beamforming (CB) and artificial noise (AN) is proposed with imperfect channel state information (CSI) of both the destination and the eavesdroppers. We aim to maximize the worst-case secrecy rate subject to the sum power and the per-antenna power constraints at the relay. Such joint design problem is non-convex. By utilizing the semidefinite relaxation (SDR) technique, S-procedure and the successive convex approximation (SCA) algorithm, the original non-convex optimization problem is recast into a series of semidefinite programs (SDPs) which can be efficiently solved using interior-methods. Simulation results are presented to verify the effectiveness of the proposed design.
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.