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, 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.
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.
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, 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.
This paper considers a two-way relay network, where two legitimate users exchange messages through several cooperative relays in the presence of an eavesdropper, and the Channel State Information (CSI) of the eavesdropper is imperfectly known. The Amplify-and-Forward (AF) relay protocol is used. We design the relay beamforming weights to minimize the total relay transmit power, while requiring the Signal-to-Noise-Ratio (SNRs) of the legitimate users to be higher than the given thresholds and the achievable rate of the eavesdropper to be upper-bounded. Due to the imperfect CSI, a robust optimization problem is summarized. A novel iterative algorithm is proposed, where the line search technique is applied, and the feasibility is preserved during iterations. In each iteration, two Quadratically-Constrained Quadratic Programming (QCQP) subproblems and a one-dimensional subproblem are optimally solved. The optimality property of the robust optimization problem is analyzed. Simulation results show that the proposed algorithm performs very close to the non-robust model with perfect CSI, in terms of the obtained relay transmit power; it~achieves higher secrecy rate compared to the existing work. Numerically, the proposed algorithm converges very quickly, and more than 85% of the problems are solved optimally.
In this paper, collaborative use of relays to form a beamforming system and provide physical-layer security is investigated. In particular, decode-and-forward (DF) and amplify-and-forward (AF) relay beamforming designs under total and individual relay power constraints are studied with the goal of maximizing the secrecy rates when perfect channel state information (CSI) is available. In the DF scheme, the total power constraint leads to a closed-form solution, and in this case, the optimal beamforming structure is identified in the low and high signal-to-noise ratio (SNR) regimes. The beamforming design under individual relay power constraints is formulated as an optimization problem which is shown to be easily solved using two different approaches, namely semidefinite programming and second-order cone programming. A simplified and suboptimal technique which reduces the computation complexity under individual power constraints is also presented. In the AF scheme, not having analytical solutions for the optimal beamforming design under both total and individual power constraints, an iterative algorithm is proposed to numerically obtain the optimal beamforming structure and maximize the secrecy rates. Finally, robust beamforming designs in the presence of imperfect CSI are investigated for DF-based relay beamforming, and optimization frameworks are provided
We address a robust beamforming design and power allocation problem for a multi-pair one-way relay network, where the single-antenna users of each pair implement communication via a decode-and-forward multi-antenna relay. In this network, a secure user and other unclassified users coexist with a multi-antenna eavesdropper, and only the imperfect eavesdropper's channel state information (ECSI) is available. We aim to maximize the worst-case secrecy rate of the secure user while guaranteeing the quality of service of the unclassified users with a total power constraint. Motivated by this challenge, we explore the beamforming design and power allocation among the sources and the relay with the channel matrix error. Unfortunately, the proposed design constitutes a non-convex problem, which involves an infinite number of constraints because of the imperfect ECSI. To this end, we propose an efficient algorithm by using the techniques of semidefinite relaxation, successive convex approximation and S-procedure techniques. Following a similar optimization framework, we further investigate the scheme with the channel covariance matrix error. Simulation results validate the effectiveness of the proposed algorithm.