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 Journal of Distributed Sensor Networks

Robust security transmission design for multi-user peer-to-peer wireless relay networks

Yang Dong-mei, Hongjun Li, Baoquan Ren, Xudong Zhong

Published Jun 1, 2022• 0 citations
Publisher

Abstract

In this article, we studied the robust security transmission design for multi-user peer-to-peer relay networks, where all users demand secure communication and the eavesdropper is passive. Although the previous researches have designed the physical-layer security schemes under perfect channel state information, this study focuses on investigating the robust transmission design in the presence of a passive eavesdropper. Our goal is to maximize the artificial noise power to confuse the passive eavesdropper and subject to the worst-case signal-to-interference-noise-ratio constraints for all users under a bounded spherical region for the norm of the channel state information error vector from the relays to the destinations and the individual power constraints of all relay nodes. Mathematically, the original robust problem is difficult to solve due to its non-linearity and non-convexity. We propose to adopt S-Procedure and rank relaxation techniques to convert it to a semidefinite programming convex problem. The numerical results show the advantage of the proposed robust method.

DOI
10.1177/15501329221107582

Related papers

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

Robust Cooperative Relay Beamforming Design for Security

Xiangwu Gong, Feihong Dong, Hongjun Li +1 more

In this paper, we investigate a security transmission scheme at the physical layer for cooperative wireless relay networks in the presence of a passive eavesdropper.While the security scheme has been previously investigated with perfect channel state information(CSI) in the presence of a passive eavesdropper, this paper focuses on researching the robust cooperative relay beamforming mechanism for wireless relay networks which makes use of artificial noise (AN) to confuse the eavesdropper and increase its uncertainty about the source message.The transmit power used for AN is maximized to degrade the signal-to-interference-plus-noise-ratio (SINR) level at the eavesdropper, while satisfying the individual power constraint of each relay node and worst-case SINR constraint at the desired receiver under a bounded spherical region for the norm of the CSI error vector from the relays to the destination.Cooperative beamforming weight vector in the security scheme can be obtained by using S-Procedure and rank relaxation techniques.The benefit of the proposed scheme is showed in simulation results.

KSII Transactions on Internet and Information Systems•Nov 30, 2015•0 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

Secure communication design for multi‐user peer‐to‐peer wireless relay networks

Xiangwu Gong, Hang Long, Feihong Dong +1 more

In this study, physical layer security techniques are studied for multi‐user peer‐to‐peer relay networks using amplify‐and‐forward protocol in the presence of an eavesdropper. Two system designs are considered: the minimum achievable secrecy rate maximisation and the total transmit power minimisation. First, considering user fairness, the authors study the max–min achievable secrecy rate problem subject to a total transmit power constraint. Mathematically, the optimisation problem is non‐linear and non‐convex. They propose a polynomial time algorithm based on the bisection technique to solve it. Second, they study the total transmit power minimisation problem which aims at minimising the total transmit power at relays such that individual secrecy rate for each user is satisfied. The total power optimisation problem is also non‐convex, so they use the relaxation technique to transform it into a convex problem which can be efficiently solved by the gradient‐based algorithms. Numerical evaluation of the obtained secrecy rate and transmit power results shows that the proposed designs can significantly improve the performance of secure wireless communications.

IET Communications•Apr 15, 2016•4 citations

Robust joint beamforming and artificial noise design for secure AF relay networks

Chao Wang, Hui‐Ming Wang

This letter studies the secure cooperative transmission for an amplify-and-forward (AF) relay network in the presence of multiple multi-antenna eavesdroppers. Since the perfect channel state information (CSI) of the eavesdroppers are not available, we propose a robust joint distributed beamforming and artificial noise scheme to maximize the worst-case secrecy rate of the network, under the total power constraint of all the relay nodes. With the semidefinite relaxation (SDR) technique, the design can be solved by a one-dimension search which involves a sequence of semidefinite programming (SDP). Simulation results demonstrate the validity of the proposed strategy.

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

Secure MIMO Relaying Network: An Artificial Noise Aided Robust Design Approach

Jiaxin Yang, Qiang Li, Benoı̂t Champagne +2 more

Owing to the vulnerability of relay-assisted and device-to-device (D2D) communications, improving wireless security from a physical layer signal processing perspective is attracting increasing interest. Hence we address the problem of secure transmission in a relay-assisted network, where a pair of legitimate user equipments (UEs) communicate with the aid of a multiple-input multiple output (MIMO) relay in the presence of multiple eavesdroppers (eves). Assuming imperfect knowledge of the eves' channels, we jointly optimize the power of the source UE, the amplify-and-forward (AF) relaying matrix and the covariance of the artificial noise (AN) transmitted by the relay, in order to maximize the received signal-to-interference-plus-noise ratio (SINR) at the destination, while imposing a set of robust secrecy constraints. To tackle the resultant nonconvex optimization problem, a globally optimal solution based on a bi-level optimization framework is proposed, but with high complexity. Then a low-complexity sub-optimal method relying on a new penalized difference-of-convex (DC) algorithmic framework is proposed, which is specifically designed for non-convex semidefinite programs (SDPs). We show how this penalized DC framework can be invoked for solving our robust secure relaying problem with proven convergence. Our extensive simulation results show that both proposed solutions are capable of ensuring the secrecy of the relay-aided transmission and significantly improve the robustness towards the eves' channel uncertainties as compared to the non-robust counterparts. It is also demonstrated the penalized DC-based method advocated yields a performance close to the globally optimal solution.

arXiv:1606.07176•Jun 23, 2016•0 citations
In this article, we studied the robust security transmission design for multi-user peer-to-peer relay networks, where all users demand secure communication and the eavesdropper is passive. Although the previous researches have designed the physical-layer security schemes under perfect channel state information, this study focuses on investigating the robust transmission design in the presence of a passive eavesdropper. Our goal is to maximize the artificial noise power to confuse the passive eavesdropper and subject to the worst-case signal-to-interference-noise-ratio constraints for all users under a bounded spherical region for the norm of the channel state information error vector from the relays to the destinations and the individual power constraints of all relay nodes. Mathematically, the original robust problem is difficult to solve due to its non-linearity and non-convexity. We propose to adopt S-Procedure and rank relaxation techniques to convert it to a semidefinite programming convex problem. The numerical results show the advantage of the proposed robust method.
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 a security transmission scheme at the physical layer for cooperative wireless relay networks in the presence of a passive eavesdropper.While the security scheme has been previously investigated with perfect channel state information(CSI) in the presence of a passive eavesdropper, this paper focuses on researching the robust cooperative relay beamforming mechanism for wireless relay networks which makes use of artificial noise (AN) to confuse the eavesdropper and increase its uncertainty about the source message.The transmit power used for AN is maximized to degrade the signal-to-interference-plus-noise-ratio (SINR) level at the eavesdropper, while satisfying the individual power constraint of each relay node and worst-case SINR constraint at the desired receiver under a bounded spherical region for the norm of the CSI error vector from the relays to the destination.Cooperative beamforming weight vector in the security scheme can be obtained by using S-Procedure and rank relaxation techniques.The benefit of the proposed scheme is showed in simulation results.
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.
In this study, physical layer security techniques are studied for multi‐user peer‐to‐peer relay networks using amplify‐and‐forward protocol in the presence of an eavesdropper. Two system designs are considered: the minimum achievable secrecy rate maximisation and the total transmit power minimisation. First, considering user fairness, the authors study the max–min achievable secrecy rate problem subject to a total transmit power constraint. Mathematically, the optimisation problem is non‐linear and non‐convex. They propose a polynomial time algorithm based on the bisection technique to solve it. Second, they study the total transmit power minimisation problem which aims at minimising the total transmit power at relays such that individual secrecy rate for each user is satisfied. The total power optimisation problem is also non‐convex, so they use the relaxation technique to transform it into a convex problem which can be efficiently solved by the gradient‐based algorithms. Numerical evaluation of the obtained secrecy rate and transmit power results shows that the proposed designs can significantly improve the performance of secure wireless communications.
This letter studies the secure cooperative transmission for an amplify-and-forward (AF) relay network in the presence of multiple multi-antenna eavesdroppers. Since the perfect channel state information (CSI) of the eavesdroppers are not available, we propose a robust joint distributed beamforming and artificial noise scheme to maximize the worst-case secrecy rate of the network, under the total power constraint of all the relay nodes. With the semidefinite relaxation (SDR) technique, the design can be solved by a one-dimension search which involves a sequence of semidefinite programming (SDP). Simulation results demonstrate the validity of the proposed strategy.
Owing to the vulnerability of relay-assisted and device-to-device (D2D) communications, improving wireless security from a physical layer signal processing perspective is attracting increasing interest. Hence we address the problem of secure transmission in a relay-assisted network, where a pair of legitimate user equipments (UEs) communicate with the aid of a multiple-input multiple output (MIMO) relay in the presence of multiple eavesdroppers (eves). Assuming imperfect knowledge of the eves' channels, we jointly optimize the power of the source UE, the amplify-and-forward (AF) relaying matrix and the covariance of the artificial noise (AN) transmitted by the relay, in order to maximize the received signal-to-interference-plus-noise ratio (SINR) at the destination, while imposing a set of robust secrecy constraints. To tackle the resultant nonconvex optimization problem, a globally optimal solution based on a bi-level optimization framework is proposed, but with high complexity. Then a low-complexity sub-optimal method relying on a new penalized difference-of-convex (DC) algorithmic framework is proposed, which is specifically designed for non-convex semidefinite programs (SDPs). We show how this penalized DC framework can be invoked for solving our robust secure relaying problem with proven convergence. Our extensive simulation results show that both proposed solutions are capable of ensuring the secrecy of the relay-aided transmission and significantly improve the robustness towards the eves' channel uncertainties as compared to the non-robust counterparts. It is also demonstrated the penalized DC-based method advocated yields a performance close to the globally optimal solution.