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

China Communications

Relay beamforming design for physical layer secure communication via line search algorithm

Siqi Chen, Cong Sun

Published Dec 1, 2021• 1 citation
Publisher

Abstract

This paper considers a physical layer security model in wireless communications. Two legitimate users communicate through several relays with the presence of an eavesdropper. We jointly design the relay beamforming weights and minimize the total relay transmit power, while ensuring users' Quality of Services and preventing the information being eavesdropped at the same time. The problem is a robust optimization problem, because of the imperfect channel state information from users and relays to the eavesdropper. First the original problem is simplified, where the high order robust terms are omitted. Then we design an iterative algorithm based on line search, by solving two Quadratically Constrained Quadratic Programming subproblems and a one-dimensional subproblem. Simulation results indicate that the proposed algorithm outperforms the state of the arts.

DOI
10.23919/jcc.2021.12.017

Related papers

Robust secure transmission for wireless relay networks with direct links and bounded channel uncertainties

Nanmiao Wu, Shaodan Ma

This paper investigates the problem of joint design of cooperative beamforming and artificial noise to achieve robust secure transmission in an amplify and forward (AF) relay network in the presence of multiple eavesdroppers. Specifically, the joint design is targeting to minimize the total relay transmission power while guaranteeing the quality of service at the legitimate receiver and preventing the eavesdroppers from interception. Different from prior designs, direct links between the source and the legitimate receiver/eavesdroppers are considered and no perfect channel state information is assumed. Considering bounded channel uncertainties in all links, the worst cases of the total relay transmission power, quality of service (i.e., the received signal-to-noise ratio) and security are first identified. Then an iterative algorithm is proposed to jointly design the relay beamforming and artificial noises for robust secure transmission. It is demonstrated by computer simulations that the proposed robust secure design is effective and practical when compared with the prior designs.

IEEE/CIC International Conference on Communications in China (ICCC)•Jul 1, 2016•0 citations

Secure Communication for Two-Way Relay Networks with Imperfect CSI

Cong Sun, Ke Liu, Dahu Zheng +1 more

This paper considers a two-way relay network, where two source nodes exchange messages through several relays in the presence of an eavesdropper, and the channel state information (CSI) of the eavesdropper is imperfectly known. The amplify-and-forward relay protocol is used and the relay beamforming weights are designed. The model is built up to minimize the total relay transmit power while guaranteeing the quality of service at users and preventing the eavesdropper from decoding the signals. Due to the imperfect CSI, a semi-infinite programming problem is obtained. An algorithm is proposed to solve the problem, and the iterative points are updated through the linesearch technique, where the feasibility are preserved during iterations. The optimality property is analyzed. The obtained subproblems are quadratic constrained quadratic programming problems, either with less than $4$ constraints or with only one variable, which are solved optimally. Simulation results demonstrate the importance of the proposed model, and imply that the proposed algorithm is efficient and converges very fast, where more than 85% of the problems are solved optimally.

Entropy•Sep 29, 2017•8 citations

Robust Beamforming Design for Secrecy in Multiuser Peer-to-Peer Wireless Relay Networks

Xiangwu Gong, Hao Yin, Feihong Dong +2 more

In this paper, physical layer security is studied for multiuser peer-to-peer (MUP2P) relay networks using amplify-and-forward (AF) protocol, where a secure user and other unclassified users coexist with an eavesdropper. Though the beamforming design has been previously investigated with perfect channel state information (CSI) in the presence of an eavesdropper, this paper focuses on researching the robust relay beamforming mechanism for MUP2P relay networks. The worst-case secrecy rate is maximized, while subject to the worst-case signal-to-interference-noise ratio constraint at each user and the total power constraint at relays under a bounded spherical region for the norm of the CSI error vector from the relays to the destination. Mathematically, the optimization problem is nonlinear and nonconvex. We propose an iterative algorithm to obtain an efficient solution of the nonconvex problem by employing S-Procedure and rank relaxation techniques. The convergence of the proposed robust algorithm is proved and its complexity is analyzed. Simulations show that the proposed design can significantly improve the performance of secure wireless communications.

IEEE Systems Journal•Jul 26, 2016•9 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

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

Yunqin Hao, Tiejun Lv, Jie Jack Zeng +1 more

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.

International Conference on Communications•May 1, 2019•0 citations

Iterative algorithm for secrecy guarantee with null space beamforming in two-way relay networks

Yunchuan Yang, Hui Zhao, Cong Sun +1 more

In this paper, we investigate a two-way relay networks consisted of two sources, multiple cooperative relays, and an eavesdropper. To guarantee the secure communication, a null space beamforming strategy is applied, where the relay beamforming vector is design to lie in the null space of the equivalent channel from two sources to the eavesdropper. Aiming to minimize the total transmit power under individual secrecy rate constraint at two sources, an alternating iteration method is proposed to calculate the relay beamforming vector as well as sources' transmit power. For relay beamforming vector optimization subproblem, two different approaches, semi-definite programming (SDP) relaxation and sequential quadratic programming (SQP) method, are proposed. Subproblem with two sources' transmit power optimization is formulated as a single variable problem and solved by Newton method with line search effectively. Through the numerical simulations, we verify the effectiveness of proposed algorithm. Moreover, with computational complexity analysis, we show that the SQP method has lower complexity than SDP, and further verify it in terms of executing time.

IEEE Wireless Communications and Networking Conference•Apr 1, 2013•3 citations
This paper considers a physical layer security model in wireless communications. Two legitimate users communicate through several relays with the presence of an eavesdropper. We jointly design the relay beamforming weights and minimize the total relay transmit power, while ensuring users' Quality of Services and preventing the information being eavesdropped at the same time. The problem is a robust optimization problem, because of the imperfect channel state information from users and relays to the eavesdropper. First the original problem is simplified, where the high order robust terms are omitted. Then we design an iterative algorithm based on line search, by solving two Quadratically Constrained Quadratic Programming subproblems and a one-dimensional subproblem. Simulation results indicate that the proposed algorithm outperforms the state of the arts.
This paper investigates the problem of joint design of cooperative beamforming and artificial noise to achieve robust secure transmission in an amplify and forward (AF) relay network in the presence of multiple eavesdroppers. Specifically, the joint design is targeting to minimize the total relay transmission power while guaranteeing the quality of service at the legitimate receiver and preventing the eavesdroppers from interception. Different from prior designs, direct links between the source and the legitimate receiver/eavesdroppers are considered and no perfect channel state information is assumed. Considering bounded channel uncertainties in all links, the worst cases of the total relay transmission power, quality of service (i.e., the received signal-to-noise ratio) and security are first identified. Then an iterative algorithm is proposed to jointly design the relay beamforming and artificial noises for robust secure transmission. It is demonstrated by computer simulations that the proposed robust secure design is effective and practical when compared with the prior designs.
This paper considers a two-way relay network, where two source nodes exchange messages through several relays in the presence of an eavesdropper, and the channel state information (CSI) of the eavesdropper is imperfectly known. The amplify-and-forward relay protocol is used and the relay beamforming weights are designed. The model is built up to minimize the total relay transmit power while guaranteeing the quality of service at users and preventing the eavesdropper from decoding the signals. Due to the imperfect CSI, a semi-infinite programming problem is obtained. An algorithm is proposed to solve the problem, and the iterative points are updated through the linesearch technique, where the feasibility are preserved during iterations. The optimality property is analyzed. The obtained subproblems are quadratic constrained quadratic programming problems, either with less than 444 constraints or with only one variable, which are solved optimally. Simulation results demonstrate the importance of the proposed model, and imply that the proposed algorithm is efficient and converges very fast, where more than 85% of the problems are solved optimally.
In this paper, physical layer security is studied for multiuser peer-to-peer (MUP2P) relay networks using amplify-and-forward (AF) protocol, where a secure user and other unclassified users coexist with an eavesdropper. Though the beamforming design has been previously investigated with perfect channel state information (CSI) in the presence of an eavesdropper, this paper focuses on researching the robust relay beamforming mechanism for MUP2P relay networks. The worst-case secrecy rate is maximized, while subject to the worst-case signal-to-interference-noise ratio constraint at each user and the total power constraint at relays under a bounded spherical region for the norm of the CSI error vector from the relays to the destination. Mathematically, the optimization problem is nonlinear and nonconvex. We propose an iterative algorithm to obtain an efficient solution of the nonconvex problem by employing S-Procedure and rank relaxation techniques. The convergence of the proposed robust algorithm is proved and its complexity is analyzed. Simulations show that the proposed design can significantly improve the performance of secure wireless communications.
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.
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.
In this paper, we investigate a two-way relay networks consisted of two sources, multiple cooperative relays, and an eavesdropper. To guarantee the secure communication, a null space beamforming strategy is applied, where the relay beamforming vector is design to lie in the null space of the equivalent channel from two sources to the eavesdropper. Aiming to minimize the total transmit power under individual secrecy rate constraint at two sources, an alternating iteration method is proposed to calculate the relay beamforming vector as well as sources' transmit power. For relay beamforming vector optimization subproblem, two different approaches, semi-definite programming (SDP) relaxation and sequential quadratic programming (SQP) method, are proposed. Subproblem with two sources' transmit power optimization is formulated as a single variable problem and solved by Newton method with line search effectively. Through the numerical simulations, we verify the effectiveness of proposed algorithm. Moreover, with computational complexity analysis, we show that the SQP method has lower complexity than SDP, and further verify it in terms of executing time.