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

IET Communications

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

Xiangwu Gong, Hang Long, Feihong Dong, Hao Yin

Published Apr 15, 2016• 4 citations
Publisher

Abstract

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.

DOI
10.1049/iet-com.2015.0609

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 security transmission design for multi-user peer-to-peer wireless relay networks

Yang Dong-mei, Hongjun Li, Baoquan Ren +1 more

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.

International Journal of Distributed Sensor Networks•Jun 1, 2022•0 citations

Secure communications with untrusted relays: a multi‐pair two‐way relaying approach

Tantan Zhao, Guobing Li, Gangming Lv +1 more

Physical‐layer security is usually ensured by the injection of artificial noise (AN) at the legitimate source or destination when relays are cooperative but untrusted. In this work, in order to avoid the power‐consuming AN at the legitimate user pairs, the authors investigate multi‐pair two‐way relaying as a solution for secure transmission in wireless relay networks with untrusted relays. They formulate a generalised problem for the joint design of cooperative beamforming (CB) and AN at relays to maximise the secrecy sum‐rate in wireless networks with multi‐pair legal users, multiple untrusted relays as well as multiple non‐colluding eavesdroppers. Further, they reformulate, approximate and relax the original non‐convex problem into a sequence of convex sub‐problems based on semi‐definite relaxation (SDR) and Taylor series approximation. Particularly, for the reformulated problem they prove that the SDR is in fact tight, and hence propose an iterative algorithm for CB and AN design at the relays. In the simulations, they demonstrate the fast convergence and high achievable secrecy sum‐rate of the proposed algorithm. Also, they simulate and discuss the impact of the number of user pairs on the secrecy sum‐rate, and reveal the change of performance gain with the number of multiple user pairs.

IET Communications•Sep 13, 2018•4 citations

Non‐linear transceiver design for secure communications with artificial noise‐assisted MIMO relay

Lei Zhang, Yunlong Cai, Benoı̂t Champagne +1 more

This study investigates the problem of physical layer security for amplify‐and‐forward (AF) multiple‐input multiple‐output (MIMO) relay systems operating in the presence of a passive eavesdropper. Specifically, the authors consider the robust design of an artificial noise (AN)‐assisted non‐linear transceiver employing Tomlinson–Harashima precoding (THP), with imperfect knowledge of the legitimate channel states. The design problem can be reformulated as a two‐level optimisation, where the outer problem aims to optimise the source precoder as a function of the relay precoder, while the inner problem at the relay aims to jointly optimise the relay precoder as well as the power allocation between the AN and the information‐bearing signals. To solve the inner problem, the authors adopt a bisection method which attempts to maximise the AN power level, to confuse the eavesdropper, while satisfying the mean‐squared‐error requirement for the intended user. Some relaxation for the objective function is applied to transform the problem into a standard convex optimisation one. Regarding the outer problem, closed‐form solutions for the precoders can be derived by an iterative method based on the Karush–Kuhn–Tucker conditions. Simulation results illustrate the superior secrecy performance provided by the proposed non‐linear transceiver design with AN and THP.

IET Communications•Jan 12, 2017•4 citations

Joint Beamforming and Power Allocation for Secrecy in Peer-to-Peer Relay Networks

Chao Wang, Hui‐Ming Wang, Derrick Wing Kwan Ng +2 more

This paper investigates the physical-layer security of a multiuser peer-to-peer (MUP2P) relay network for amplify-and-forward (AF) protocol, where a secure user and other unclassified users coexist with a multi-antenna eavesdropper and the eavesdropper can wiretap the confidential information in both two cooperative phases. Our goal is to optimize the transmit power of the source and the beamforming weights of the relays jointly for secrecy rate maximization subject to the minimum signal-to-interference-noise-ratio (SINR) constraint at each user, and the individual and total power constraints. Mathematically, the optimization problem is non-linear and non-convex, which does not facilitate an efficient resource allocation algorithm design. As an alternative, a null space beamforming scheme is adopted at the relays for simplifying the joint optimization and eliminating the confidential information leakage in the second cooperative phase, where the relay beamforming vector lies in the null space of the equivalent channel of the relay to eavesdropper links. Although the null space beamforming scheme simplifies the design of resource allocation algorithm, the considered problem is still non-convex and obtaining the global optimum is very difficult, if not impossible. Employing a sequential parametric convex approximation (SPCA) method, we propose an iterative algorithm to obtain an efficient solution of the non-convex problem. Besides, the proposed joint design algorithm requires a feasible starting point, we also propose a low complexity feasible initial points searching algorithm. Simulations demonstrate the validity of the proposed strategy.

IEEE Transactions on Wireless Communications•Feb 13, 2015•88 citations

Secure Communication for Amplify-and-Forward Relay Networks With Finite Alphabet Input

Kuo Cao, Yueming Cai, Yongpeng Wu +1 more

This paper considers secure communication for amplify-and-forward (AF) relay networks with finite alphabet input. The joint optimization of power selection and beamforming design for improving the physical layer security of AF relay networks with single and multiple eavesdroppers is investigated. For the case with one eavesdropper, we transform the problem of multi-variable beamforming design into a single-variable optimization problem through semi-definite programming and solve it with one-dimensional optimization techniques. Moreover, the corresponding source power is obtained by utilizing the relation between the mutual information and minimum mean square error. Then, an iterative two-step algorithm is proposed to maximize the achievable secrecy rate. In the presence of multiple eavesdroppers, a zero-forcing beamforming scheme, where the confidential signal is nulled out in the direction of all eavesdroppers, is proposed to enhance the physical layer security. We decouple the source power and the beamforming vector by transforming the achievable secrecy rate into a single-variable function of the source power. Then, the suboptimal source power and the corresponding beamforming vector with low-complexity are derived. Numerical examples show that the proposed schemes significantly enhance the secrecy performance of the AF relay networks.

IEEE Transactions on Information Forensics and Security•Mar 21, 2018•12 citations
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.
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 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.
Physical‐layer security is usually ensured by the injection of artificial noise (AN) at the legitimate source or destination when relays are cooperative but untrusted. In this work, in order to avoid the power‐consuming AN at the legitimate user pairs, the authors investigate multi‐pair two‐way relaying as a solution for secure transmission in wireless relay networks with untrusted relays. They formulate a generalised problem for the joint design of cooperative beamforming (CB) and AN at relays to maximise the secrecy sum‐rate in wireless networks with multi‐pair legal users, multiple untrusted relays as well as multiple non‐colluding eavesdroppers. Further, they reformulate, approximate and relax the original non‐convex problem into a sequence of convex sub‐problems based on semi‐definite relaxation (SDR) and Taylor series approximation. Particularly, for the reformulated problem they prove that the SDR is in fact tight, and hence propose an iterative algorithm for CB and AN design at the relays. In the simulations, they demonstrate the fast convergence and high achievable secrecy sum‐rate of the proposed algorithm. Also, they simulate and discuss the impact of the number of user pairs on the secrecy sum‐rate, and reveal the change of performance gain with the number of multiple user pairs.
This study investigates the problem of physical layer security for amplify‐and‐forward (AF) multiple‐input multiple‐output (MIMO) relay systems operating in the presence of a passive eavesdropper. Specifically, the authors consider the robust design of an artificial noise (AN)‐assisted non‐linear transceiver employing Tomlinson–Harashima precoding (THP), with imperfect knowledge of the legitimate channel states. The design problem can be reformulated as a two‐level optimisation, where the outer problem aims to optimise the source precoder as a function of the relay precoder, while the inner problem at the relay aims to jointly optimise the relay precoder as well as the power allocation between the AN and the information‐bearing signals. To solve the inner problem, the authors adopt a bisection method which attempts to maximise the AN power level, to confuse the eavesdropper, while satisfying the mean‐squared‐error requirement for the intended user. Some relaxation for the objective function is applied to transform the problem into a standard convex optimisation one. Regarding the outer problem, closed‐form solutions for the precoders can be derived by an iterative method based on the Karush–Kuhn–Tucker conditions. Simulation results illustrate the superior secrecy performance provided by the proposed non‐linear transceiver design with AN and THP.
This paper investigates the physical-layer security of a multiuser peer-to-peer (MUP2P) relay network for amplify-and-forward (AF) protocol, where a secure user and other unclassified users coexist with a multi-antenna eavesdropper and the eavesdropper can wiretap the confidential information in both two cooperative phases. Our goal is to optimize the transmit power of the source and the beamforming weights of the relays jointly for secrecy rate maximization subject to the minimum signal-to-interference-noise-ratio (SINR) constraint at each user, and the individual and total power constraints. Mathematically, the optimization problem is non-linear and non-convex, which does not facilitate an efficient resource allocation algorithm design. As an alternative, a null space beamforming scheme is adopted at the relays for simplifying the joint optimization and eliminating the confidential information leakage in the second cooperative phase, where the relay beamforming vector lies in the null space of the equivalent channel of the relay to eavesdropper links. Although the null space beamforming scheme simplifies the design of resource allocation algorithm, the considered problem is still non-convex and obtaining the global optimum is very difficult, if not impossible. Employing a sequential parametric convex approximation (SPCA) method, we propose an iterative algorithm to obtain an efficient solution of the non-convex problem. Besides, the proposed joint design algorithm requires a feasible starting point, we also propose a low complexity feasible initial points searching algorithm. Simulations demonstrate the validity of the proposed strategy.
This paper considers secure communication for amplify-and-forward (AF) relay networks with finite alphabet input. The joint optimization of power selection and beamforming design for improving the physical layer security of AF relay networks with single and multiple eavesdroppers is investigated. For the case with one eavesdropper, we transform the problem of multi-variable beamforming design into a single-variable optimization problem through semi-definite programming and solve it with one-dimensional optimization techniques. Moreover, the corresponding source power is obtained by utilizing the relation between the mutual information and minimum mean square error. Then, an iterative two-step algorithm is proposed to maximize the achievable secrecy rate. In the presence of multiple eavesdroppers, a zero-forcing beamforming scheme, where the confidential signal is nulled out in the direction of all eavesdroppers, is proposed to enhance the physical layer security. We decouple the source power and the beamforming vector by transforming the achievable secrecy rate into a single-variable function of the source power. Then, the suboptimal source power and the corresponding beamforming vector with low-complexity are derived. Numerical examples show that the proposed schemes significantly enhance the secrecy performance of the AF relay networks.