Sum Secrecy Rate Maximization for Full-Duplex Two-Way Relay Networks Using Alamouti-Based Rank-Two Beamforming

被引:47
作者
Li, Qiang [1 ]
Ma, Wing-Kin [2 ]
Han, Dong [3 ]
机构
[1] Univ Elect Sci & Technol China, Sch Commun & Informat Engn, Chengdu 611731, Peoples R China
[2] Chinese Univ Hong Kong, Dept Elect Engn, Shatin, Hong Kong, Peoples R China
[3] Univ Texas Dallas, Dept Elect Engn, Richardson, TX 75080 USA
基金
中国国家自然科学基金;
关键词
Full-duplex relay; minorization-maximization; physical-layer security; semidefinite relaxation; WIRELESS INFORMATION; WIRETAP CHANNELS; POWER TRANSFER; SECURITY;
D O I
10.1109/JSTSP.2016.2603970
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Consider a two-way communication scenario where two single-antenna nodes, operating under full-duplex mode, exchange information to one another through the aid of a (full-duplex) multiantenna relay, and there is another single-antenna node who intends to eavesdrop. The relay employs artificial noise (AN) to interfere the eavesdropper's channel, and amplify-forward Alamouti-based rank-two beamforming to establish the two-way communication links of the legitimate nodes. Our problem is to optimize the rank-two beamformer and AN covariance for sum secrecy rate maximization (SSRM). This SSRM problem is nonconvex, and we develop an efficient solution approach using semidefinite relaxation (SDR) and minorization-maximization (MM). We prove that SDR is tight for the SSRM problem and, thus, introduces no loss. Also, we consider an inexact MM method where an approximate but computationally cheap MM solution update is used in place of the exact update in conventional MM. We show that this inexact MM method guarantees convergence to a stationary solution to the SSRM problem. The effectiveness of our proposed approach is further demonstrated by an energy-harvesting scenario extension, and by extensive simulation results.
引用
收藏
页码:1359 / 1374
页数:16
相关论文
共 29 条
  • [1] A simple transmit diversity technique for wireless communications
    Alamouti, SM
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1998, 16 (08) : 1451 - 1458
  • [2] [Anonymous], 2014, Introductory Lectures on Convex Optimization: A Basic Course
  • [3] Bertsekas DP., 1999, NONLINEAR PROGRAMMIN
  • [4] Physical Layer Network Security in the Full-Duplex Relay System
    Chen, Gaojie
    Gong, Yu
    Xiao, Pei
    Chambers, Jonathon A.
    [J]. IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2015, 10 (03) : 574 - 583
  • [5] Robust Secure Beamforming in MISO Full-Duplex Two-Way Secure Communications
    Feng, Renhai
    Li, Quanzhong
    Zhang, Qi
    Qin, Jiayin
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2016, 65 (01) : 408 - +
  • [6] Grant M., 2014, CVX: MATLAB software for disciplined convex programming, version 2.0 beta
  • [7] Rank-Constrained Separable Semidefinite Programming With Applications to Optimal Beamforming
    Huang, Yongwei
    Palomar, Daniel P.
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2010, 58 (02) : 664 - 678
  • [8] A tutorial on MM algorithms
    Hunter, DR
    Lange, K
    [J]. AMERICAN STATISTICIAN, 2004, 58 (01) : 30 - 37
  • [9] Optimal Resource Allocation in Full-Duplex Wireless-Powered Communication Network
    Ju, Hyungsik
    Zhang, Rui
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2014, 62 (10) : 3528 - 3540
  • [10] Full-Duplex Wireless-Powered Communication Network With Energy Causality
    Kang, Xin
    Ho, Chin Keong
    Sun, Sumei
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2015, 14 (10) : 5539 - 5551