Robust secrecy beamforming for full-duplex two-way relay networks under imperfect channel state information

  • Si Li
  • Qiang Li
  • Shihai Shao
Research Paper


Consider a two-way amplify-and-forward (AF) relay network where two legitimate nodes communicate through a relay in the presence of an eavesdropper. Assuming full duplexity at the legitimate nodes and the relay, a robust artificial noise (AN)-aided AF scheme is proposed to maximize the worst-case sum secrecy rate under imperfect channel state information (CSI) of the eavesdropper. This robust sum secrecy rate maximization (SSRM) problem is formulated as a max-min semi-infinite problem and is tackled by the semidefinite relaxation (SDR) method. In particular, we first convert the max-min semi-infinite problem into a maximization problem with a finite number of constraints. Then, an efficient two-block alternating difference-of-concave (DC) programming approach is proposed to iteratively solve the SDR problem, with one of the blocks computed in closed form. In addition, a specific robust rank-one solution construction procedure is presented to extract a feasible solution for the original robust SSRM problem from the SDR solution. The efficacy of the proposed method is demonstrated by numerical simulations.


physical-layer security full-duplex relay difference-of-concave program semidefinite relaxation MIMO 



This work was supported by National Natural Science Foundation of China (Grant Nos. 61401073, 61531009).


  1. 1.
    Zheng G, Krikidis I, Li J, et al. Improving physical layer secrecy using full-duplex jamming receivers. IEEE Trans Sig Process, 2013, 61: 4962–4974MathSciNetCrossRefGoogle Scholar
  2. 2.
    Sun Y, Ng D W K, Zhu J, et al. Multi-objective optimization for robust power efficient and secure full-duplex wireless communication systems. IEEE Trans Wirel Commun, 2016, 15: 5511–5526CrossRefGoogle Scholar
  3. 3.
    Parsaeefard S, Le-Ngoc T. Improving wireless secrecy rate via full-duplex relay-assisted protocols. IEEE Trans Inf Foren Sec, 2015, 10: 2095–2107CrossRefGoogle Scholar
  4. 4.
    Chen G, Gong Y, Xiao P, et al. Physical layer network security in the full-duplex relay system. IEEE Trans Inf Foren Sec, 2015, 10: 574–583CrossRefGoogle Scholar
  5. 5.
    Lee J. Full-duplex relay for enhancing physical layer security in multi-hop relaying systems. IEEE Commun Lett, 2015, 19: 525–528MathSciNetCrossRefGoogle Scholar
  6. 6.
    Li Q, Han D. Sum secrecy rate maximization for full-duplex two-way relay networks. In: Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing, Shanghai, 2016. 3641–3645Google Scholar
  7. 7.
    Gong S Q, Xing C W, Fei Z S, et al. Cooperative beamforming design for physical-layer security of multi-hop MIMO communications. Sci China Inf Sci, 2016, 59: 062304CrossRefGoogle Scholar
  8. 8.
    Zhao R, Lin H X, He Y C, et al. Impacts of outdated CSI for secure cooperative systems with opportunistic relay selection. Sci China Inf Sci, 2017, 60: 069303CrossRefGoogle Scholar
  9. 9.
    Liang Y, Poor H V, Shamai S. Information theoretic Ssecurity. Found Trends Commun Inf Theory, 2008, 5: 355–580CrossRefzbMATHGoogle Scholar
  10. 10.
    Li C, Yang L, Zhu W-P. Minimum mean squared error design of single-antenna two-way distributed relays based on full or partial channel state information. IET Commun, 2011, 5: 728–735MathSciNetCrossRefGoogle Scholar
  11. 11.
    Li C, Yang L, Zhu W-P. A two-way MIMO relaying scheme with partial channel state information. Wirel Pers Commun, 2013, 72: 1949–1968CrossRefGoogle Scholar
  12. 12.
    Tekin E, Yener A. The general Gaussian multiple access and two-way wire-tap channels: Achievable rates and cooperative jamming. IEEE Trans Inf Theory, 2008, 54: 2735–2751CrossRefzbMATHGoogle Scholar
  13. 13.
    Boyd S, Vandenberghe L. Convex Optimization. Cambridge: Cambridge University Press, 2004CrossRefzbMATHGoogle Scholar
  14. 14.
    Wright S. Primal-Dual Interior-Point Methods. Philadelphia: SIAM, 1997CrossRefzbMATHGoogle Scholar
  15. 15.
    VanAntwerp J, Braat R. A tutorial on linear and bilinear matrix inequalities. J Process Contr, 2000, 10: 363–385CrossRefGoogle Scholar

Copyright information

© Science China Press and Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  1. 1.National Key Laboratory of Science and Technology on CommunicationsUniversity of Electronic Science and Technology of ChinaChengduChina
  2. 2.School of Communication and Information EngineeringUniversity of Electronic Science and Technology of ChinaChengduChina

Personalised recommendations