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:0910.4132

Collaborative Relay Beamforming for Secrecy

Junwei Zhang, M. Cenk Gursoy

Published Oct 21, 2009• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.0910.4132

Related papers

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

Collaborative Relay Beamforming for Secrecy

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, 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

arXiv:1006.4386•Jun 22, 2010•6 citations

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•90 citations

Decode-and-forward relay beamforming for secrecy with imperfect CSI and multiple eavesdroppers

Sanjay Vishwakarma, A. Chockalingam

In this paper, we evaluate secrecy rates in cooperative relay beamforming in the presence of imperfect channel state information (CSI) and multiple eavesdroppers. A source-destination pair aided by k out of M relays, 1 ≤ k ≤ M, using decode-and-forward relay beamforming is considered. We compute the worst case secrecy rate with imperfect CSI in the presence of multiple eavesdroppers, where the number of eavesdroppers can be more than the number of relays. We solve the optimization problem for all possible relay combinations to find the secrecy rate and optimum source and relay weights subject to a total power constraint. We relax the rank-1 constraint on the complex semi-definite relay weight matrix and use S-procedure to reformulate the optimization problem that can be solved using convex semi-definite programming.

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)•Jun 1, 2012•11 citations

Joint Cooperative Beamforming and Jamming to Secure AF Relay Systems With Individual Power Constraint and No Eavesdropper's CSI

Hui‐Ming Wang, Miao Luo, Xiang‐Gen Xia +1 more

Cooperative beamforming and jamming are two efficient schemes to improve the physical-layer security of a wireless relay system in the presence of passive eavesdroppers. However, in most works these two techniques are adopted separately. In this letter, we propose a joint cooperative beamforming and jamming scheme to enhance the security of a cooperative relay network, where a part of intermediate nodes adopt distributed beamforming while others jam the eavesdropper, simultaneously. Since the instantaneous channel state information (CSI) of the eavesdropper may not be known, we propose a cooperative artificial noise transmission based secrecy strategy, subjected to the individual power constraint of each node. The beamformer weights and power allocation can be obtained by solving a second-order convex cone programming (SOCP) together with a linear programming problem. Simulations show the joint scheme greatly improves the security.

IEEE Signal Processing Letters•Nov 14, 2012•192 citations

Cooperative Secure Beamforming for AF Relay Networks With Multiple Eavesdroppers

Ye Yang, Qiang Li, Wing‐Kin Ma +2 more

This letter studies cooperative secure beamforming for amplify-and-forward (AF) relay networks in the presence of multiple eavesdroppers. Under both total and individual relay power constraints, we propose two schemes, namely secrecy rate maximization (SRM) beamforming and null-space beamforming. In the first scheme, our design problem is based on SRM. Using a suboptimal, but convex, technique-semidefinite relaxation (SDR), we show that this problem can be handled by performing a one-dimensional search which involves solving a sequence of semidefinite programs (SDPs). To reduce the complexity, in the second scheme, we instead maximize the information rate at the destination while completely eliminating the information leakage to all eavesdroppers. We prove that this problem can be exactly solved by SDR with one SDP only. Simulation results demonstrate the performance gains of the two proposed designs.

IEEE Signal Processing Letters•Nov 20, 2012•174 citations
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.
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, we evaluate secrecy rates in cooperative relay beamforming in the presence of imperfect channel state information (CSI) and multiple eavesdroppers. A source-destination pair aided by k out of M relays, 1 ≤ k ≤ M, using decode-and-forward relay beamforming is considered. We compute the worst case secrecy rate with imperfect CSI in the presence of multiple eavesdroppers, where the number of eavesdroppers can be more than the number of relays. We solve the optimization problem for all possible relay combinations to find the secrecy rate and optimum source and relay weights subject to a total power constraint. We relax the rank-1 constraint on the complex semi-definite relay weight matrix and use S-procedure to reformulate the optimization problem that can be solved using convex semi-definite programming.
Cooperative beamforming and jamming are two efficient schemes to improve the physical-layer security of a wireless relay system in the presence of passive eavesdroppers. However, in most works these two techniques are adopted separately. In this letter, we propose a joint cooperative beamforming and jamming scheme to enhance the security of a cooperative relay network, where a part of intermediate nodes adopt distributed beamforming while others jam the eavesdropper, simultaneously. Since the instantaneous channel state information (CSI) of the eavesdropper may not be known, we propose a cooperative artificial noise transmission based secrecy strategy, subjected to the individual power constraint of each node. The beamformer weights and power allocation can be obtained by solving a second-order convex cone programming (SOCP) together with a linear programming problem. Simulations show the joint scheme greatly improves the security.
This letter studies cooperative secure beamforming for amplify-and-forward (AF) relay networks in the presence of multiple eavesdroppers. Under both total and individual relay power constraints, we propose two schemes, namely secrecy rate maximization (SRM) beamforming and null-space beamforming. In the first scheme, our design problem is based on SRM. Using a suboptimal, but convex, technique-semidefinite relaxation (SDR), we show that this problem can be handled by performing a one-dimensional search which involves solving a sequence of semidefinite programs (SDPs). To reduce the complexity, in the second scheme, we instead maximize the information rate at the destination while completely eliminating the information leakage to all eavesdroppers. We prove that this problem can be exactly solved by SDR with one SDP only. Simulation results demonstrate the performance gains of the two proposed designs.