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

arXiv:1006.4386

Collaborative Relay Beamforming for Secrecy

Junwei Zhang, M. Cenk Gursoy

Published Jun 22, 2010• 5 citations
arXivHTMLPDF

Abstract

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

DOI
10.48550/arxiv.1006.4386

Related papers

Relay beamforming strategies for physical-layer security

Junwei Zhang, M. Cenk Gursoy

In this paper, collaborative use of relays to form a beamforming system and provide physical-layer security is investigated. In particular, 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 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. Robust beamforming designs in the presence of imperfect CSI are investigated for decode-and-forward (DF) based relay beamforming, and optimization frameworks are provided.

arXiv:1004.0899•Conference on Information Sciences and Systems•Mar 1, 2010•89 citations

Collaborative Relay Beamforming for Secrecy

Junwei Zhang, M. Cenk Gursoy

In this paper, collaborative use of relays to form a beamforming system with the aid of perfect channel state information (CSI) and to provide physical-layer security is investigated. In particular, a decode-and-forward-based relay beamforming design subject to total and individual relay power constraints is studied with the goal of maximizing the secrecy rate. It is shown that the total power constraint leads to a closed-form solution. The 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. Furthermore, a simplified and suboptimal technique which reduces the computation complexity under individual power constraints is presented.

arXiv:0910.4132•Oct 21, 2009•0 citations

Collaborative Relay Beamforming for Secrecy

Jinhang Zhang, M. Cenk Gursoy

In this paper, collaborative use of relays to form a beamforming system with the aid of perfect channel state information (CSI) and to provide physical-layer security is investigated. In particular, a decode-and-forward-based relay beamforming design subject to total and individual relay power constraints is studied with the goal of maximizing the secrecy rate. The total power constraint leads to a closed-form solution. The design under individual relay power constraints is formulated as an optimization problem which is shown to be easily solved using two different approaches, namely semideflnite programming and second-order cone programming. Furthermore, a simplified and suboptimal technique which reduces the computation complexity under individual power constraints is presented.

International Conference on Communications•May 1, 2010•108 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

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

Worst case SINR guarantees for secrecy using relay beamforming with imperfect CSI

Agepati Sujana, Sanjay Vishwakarma, A. Chockalingam

In this paper, we study beamforming techniques for secrecy with worst case signal-to-interference-plus-noise ratio (SINR) guarantees in cooperative communications with imperfect channel state information (CSI). The worst case SINRs are the minimum SINR at the intended destination and the maximum SINR at the eavesdroppers. We consider a norm bounded CSI error model. With the available imperfect channel estimates, we design beamformers such that the minimum SINR receivable by the intended destination is above a certain threshold, while the maximum value of SINRs receivable at the eavesdroppers are below another lower threshold. We consider amplify-and-forward (AF) and decode-and-forward (DF) relaying schemes. The relays do the worst case transmit beamforming and injection of artificial noise (AN). We jointly optimize the beamformers and the AN for the AF and DF schemes subject to the worst case SINR constraints at the destination and the eavesdroppers. We solve the corresponding optimization problems as semi-definite programming (SDP) problems by rank relaxation and S-procedure. Numerical results show that AN injection at the relays significantly reduces the average total transmit power required to meet the worst case SINR constraints, and improves the solution feasibility of the optimization problems.

IEEE Wireless Communications and Networking Conference•Apr 1, 2014•4 citations
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
In this paper, collaborative use of relays to form a beamforming system and provide physical-layer security is investigated. In particular, 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 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. Robust beamforming designs in the presence of imperfect CSI are investigated for decode-and-forward (DF) based relay beamforming, and optimization frameworks are provided.
In this paper, collaborative use of relays to form a beamforming system with the aid of perfect channel state information (CSI) and to provide physical-layer security is investigated. In particular, a decode-and-forward-based relay beamforming design subject to total and individual relay power constraints is studied with the goal of maximizing the secrecy rate. It is shown that the total power constraint leads to a closed-form solution. The 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. Furthermore, a simplified and suboptimal technique which reduces the computation complexity under individual power constraints is presented.
In this paper, collaborative use of relays to form a beamforming system with the aid of perfect channel state information (CSI) and to provide physical-layer security is investigated. In particular, a decode-and-forward-based relay beamforming design subject to total and individual relay power constraints is studied with the goal of maximizing the secrecy rate. The total power constraint leads to a closed-form solution. The design under individual relay power constraints is formulated as an optimization problem which is shown to be easily solved using two different approaches, namely semideflnite programming and second-order cone programming. Furthermore, a simplified and suboptimal technique which reduces the computation complexity under individual power constraints is presented.
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.
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 study beamforming techniques for secrecy with worst case signal-to-interference-plus-noise ratio (SINR) guarantees in cooperative communications with imperfect channel state information (CSI). The worst case SINRs are the minimum SINR at the intended destination and the maximum SINR at the eavesdroppers. We consider a norm bounded CSI error model. With the available imperfect channel estimates, we design beamformers such that the minimum SINR receivable by the intended destination is above a certain threshold, while the maximum value of SINRs receivable at the eavesdroppers are below another lower threshold. We consider amplify-and-forward (AF) and decode-and-forward (DF) relaying schemes. The relays do the worst case transmit beamforming and injection of artificial noise (AN). We jointly optimize the beamformers and the AN for the AF and DF schemes subject to the worst case SINR constraints at the destination and the eavesdroppers. We solve the corresponding optimization problems as semi-definite programming (SDP) problems by rank relaxation and S-procedure. Numerical results show that AN injection at the relays significantly reduces the average total transmit power required to meet the worst case SINR constraints, and improves the solution feasibility of the optimization problems.