This paper studies the design of cooperative beamforming (CB) and cooperative jamming (CJ) for the physical layer security of an amplify-and-forward (AF) relay network in the presence of multiple multi-antenna eavesdroppers. The secrecy rate maximization (SRM) problem of such a network is to maximize the difference of two concave functions, a problem which is non-convex and has no efficient solution. Based on the inner convex approximation (ICA) and semidefinite relaxation (SDR) techniques, we propose two novel low-complexity schemes to design CB and CJ for SRM in the AF network. In the first strategy, relay nodes adopt the CB only to secure transmission. Based on ICA, this design guarantees convergence to a Karush-Kuhn-Tucker (KKT) solution of the SDR of the original problem. In the second strategy, the optimal joint CB and CJ design is studied and the proposed joint design can guarantee convergence to a KKT solution of the original problem. Moreover, in the second strategy, we prove that SDR always has a rank-1 solution for the SRM problem. Simulation results show the superiority of the proposed schemes.
Chao WANG
Xi'an Jiaotong University
Hui-Ming WANG
Xi'an Jiaotong University,Southeast University
Weile ZHANG
Xi'an Jiaotong University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Chao WANG, Hui-Ming WANG, Weile ZHANG, "Low Complexity Cooperative Transmission Design and Optimization for Physical Layer Security of AF Relay Networks" in IEICE TRANSACTIONS on Communications,
vol. E97-B, no. 6, pp. 1113-1120, June 2014, doi: 10.1587/transcom.E97.B.1113.
Abstract: This paper studies the design of cooperative beamforming (CB) and cooperative jamming (CJ) for the physical layer security of an amplify-and-forward (AF) relay network in the presence of multiple multi-antenna eavesdroppers. The secrecy rate maximization (SRM) problem of such a network is to maximize the difference of two concave functions, a problem which is non-convex and has no efficient solution. Based on the inner convex approximation (ICA) and semidefinite relaxation (SDR) techniques, we propose two novel low-complexity schemes to design CB and CJ for SRM in the AF network. In the first strategy, relay nodes adopt the CB only to secure transmission. Based on ICA, this design guarantees convergence to a Karush-Kuhn-Tucker (KKT) solution of the SDR of the original problem. In the second strategy, the optimal joint CB and CJ design is studied and the proposed joint design can guarantee convergence to a KKT solution of the original problem. Moreover, in the second strategy, we prove that SDR always has a rank-1 solution for the SRM problem. Simulation results show the superiority of the proposed schemes.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E97.B.1113/_p
Copy
@ARTICLE{e97-b_6_1113,
author={Chao WANG, Hui-Ming WANG, Weile ZHANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Low Complexity Cooperative Transmission Design and Optimization for Physical Layer Security of AF Relay Networks},
year={2014},
volume={E97-B},
number={6},
pages={1113-1120},
abstract={This paper studies the design of cooperative beamforming (CB) and cooperative jamming (CJ) for the physical layer security of an amplify-and-forward (AF) relay network in the presence of multiple multi-antenna eavesdroppers. The secrecy rate maximization (SRM) problem of such a network is to maximize the difference of two concave functions, a problem which is non-convex and has no efficient solution. Based on the inner convex approximation (ICA) and semidefinite relaxation (SDR) techniques, we propose two novel low-complexity schemes to design CB and CJ for SRM in the AF network. In the first strategy, relay nodes adopt the CB only to secure transmission. Based on ICA, this design guarantees convergence to a Karush-Kuhn-Tucker (KKT) solution of the SDR of the original problem. In the second strategy, the optimal joint CB and CJ design is studied and the proposed joint design can guarantee convergence to a KKT solution of the original problem. Moreover, in the second strategy, we prove that SDR always has a rank-1 solution for the SRM problem. Simulation results show the superiority of the proposed schemes.},
keywords={},
doi={10.1587/transcom.E97.B.1113},
ISSN={1745-1345},
month={June},}
Copy
TY - JOUR
TI - Low Complexity Cooperative Transmission Design and Optimization for Physical Layer Security of AF Relay Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1113
EP - 1120
AU - Chao WANG
AU - Hui-Ming WANG
AU - Weile ZHANG
PY - 2014
DO - 10.1587/transcom.E97.B.1113
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E97-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2014
AB - This paper studies the design of cooperative beamforming (CB) and cooperative jamming (CJ) for the physical layer security of an amplify-and-forward (AF) relay network in the presence of multiple multi-antenna eavesdroppers. The secrecy rate maximization (SRM) problem of such a network is to maximize the difference of two concave functions, a problem which is non-convex and has no efficient solution. Based on the inner convex approximation (ICA) and semidefinite relaxation (SDR) techniques, we propose two novel low-complexity schemes to design CB and CJ for SRM in the AF network. In the first strategy, relay nodes adopt the CB only to secure transmission. Based on ICA, this design guarantees convergence to a Karush-Kuhn-Tucker (KKT) solution of the SDR of the original problem. In the second strategy, the optimal joint CB and CJ design is studied and the proposed joint design can guarantee convergence to a KKT solution of the original problem. Moreover, in the second strategy, we prove that SDR always has a rank-1 solution for the SRM problem. Simulation results show the superiority of the proposed schemes.
ER -