Secrecy sum rate optimization of distributed two-way relay systems

Huiming Wang; Rui Huang; Tongxing Zheng

doi:10.16337/j.1004-9037.2015.03.002

Secrecy sum rate optimization of distributed two-way relay systems

Faculty of Electronic and Information Engineering

Xi'an Jiaotong University

Research output: Contribution to journal › Article › peer-review

Abstract

The secure transmission of distributed two-way relay systems is studied. To maximize the secrecy sum rate subject to the aggregate power constraint, an artificial-noise-aided beamforming (ANBF) scheme is proposed. The major difficulty in the ANBF scheme is a non-convex optimization problem. Therefore, a sequential parametric convex approximation (SPCA) algorithm is proposed, together with a Newton iteration method, to optimize the beamforming vector, artificial noise covariance matrix as well as the transmission power in an alternating iterative way. The ANBF scheme is proved to be a generalization of the existing beamforming (BF) scheme without AN and the null-space beamforming (NSBF) scheme, and the system design is more universal. Simulation results and performance analysis verify the efficiency of the proposed ANBF scheme, and reveal that it achieves the highest secrecy sum rate.

Original language	English
Pages (from-to)	486-495
Number of pages	10
Journal	Shuju Caiji Yu Chuli/Journal of Data Acquisition and Processing
Volume	30
Issue number	3
DOIs	https://doi.org/10.16337/j.1004-9037.2015.03.002
State	Published - 1 May 2015

Keywords

Artificial-noise
Beamforming
Convex approximation
Secrecy sum rate
Two-way relay

Access to Document

10.16337/j.1004-9037.2015.03.002

Cite this

@article{efa0c9b39ade4147a08b2351ac8eed34,

title = "Secrecy sum rate optimization of distributed two-way relay systems",

abstract = "The secure transmission of distributed two-way relay systems is studied. To maximize the secrecy sum rate subject to the aggregate power constraint, an artificial-noise-aided beamforming (ANBF) scheme is proposed. The major difficulty in the ANBF scheme is a non-convex optimization problem. Therefore, a sequential parametric convex approximation (SPCA) algorithm is proposed, together with a Newton iteration method, to optimize the beamforming vector, artificial noise covariance matrix as well as the transmission power in an alternating iterative way. The ANBF scheme is proved to be a generalization of the existing beamforming (BF) scheme without AN and the null-space beamforming (NSBF) scheme, and the system design is more universal. Simulation results and performance analysis verify the efficiency of the proposed ANBF scheme, and reveal that it achieves the highest secrecy sum rate.",

keywords = "Artificial-noise, Beamforming, Convex approximation, Secrecy sum rate, Two-way relay",

author = "Huiming Wang and Rui Huang and Tongxing Zheng",

year = "2015",

month = may,

day = "1",

doi = "10.16337/j.1004-9037.2015.03.002",

language = "英语",

volume = "30",

pages = "486--495",

journal = "Shuju Caiji Yu Chuli/Journal of Data Acquisition and Processing",

issn = "1004-9037",

publisher = "Nanjing University of Aeronautics an Astronautics",

number = "3",

}

TY - JOUR

T1 - Secrecy sum rate optimization of distributed two-way relay systems

AU - Wang, Huiming

AU - Huang, Rui

AU - Zheng, Tongxing

PY - 2015/5/1

Y1 - 2015/5/1

N2 - The secure transmission of distributed two-way relay systems is studied. To maximize the secrecy sum rate subject to the aggregate power constraint, an artificial-noise-aided beamforming (ANBF) scheme is proposed. The major difficulty in the ANBF scheme is a non-convex optimization problem. Therefore, a sequential parametric convex approximation (SPCA) algorithm is proposed, together with a Newton iteration method, to optimize the beamforming vector, artificial noise covariance matrix as well as the transmission power in an alternating iterative way. The ANBF scheme is proved to be a generalization of the existing beamforming (BF) scheme without AN and the null-space beamforming (NSBF) scheme, and the system design is more universal. Simulation results and performance analysis verify the efficiency of the proposed ANBF scheme, and reveal that it achieves the highest secrecy sum rate.

AB - The secure transmission of distributed two-way relay systems is studied. To maximize the secrecy sum rate subject to the aggregate power constraint, an artificial-noise-aided beamforming (ANBF) scheme is proposed. The major difficulty in the ANBF scheme is a non-convex optimization problem. Therefore, a sequential parametric convex approximation (SPCA) algorithm is proposed, together with a Newton iteration method, to optimize the beamforming vector, artificial noise covariance matrix as well as the transmission power in an alternating iterative way. The ANBF scheme is proved to be a generalization of the existing beamforming (BF) scheme without AN and the null-space beamforming (NSBF) scheme, and the system design is more universal. Simulation results and performance analysis verify the efficiency of the proposed ANBF scheme, and reveal that it achieves the highest secrecy sum rate.

KW - Artificial-noise

KW - Beamforming

KW - Convex approximation

KW - Secrecy sum rate

KW - Two-way relay

UR - https://www.scopus.com/pages/publications/84941615873

U2 - 10.16337/j.1004-9037.2015.03.002

DO - 10.16337/j.1004-9037.2015.03.002

M3 - 文章

AN - SCOPUS:84941615873

SN - 1004-9037

VL - 30

SP - 486

EP - 495

JO - Shuju Caiji Yu Chuli/Journal of Data Acquisition and Processing

JF - Shuju Caiji Yu Chuli/Journal of Data Acquisition and Processing

IS - 3

ER -

Secrecy sum rate optimization of distributed two-way relay systems

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this