Home > Research > Publications & Outputs > Robust Transmit Designs for Secrecy Rate Constr...

Electronic data

  • Robust Transmit Designs for Secrecy Rate Constrained MISO NOMA System

    Rights statement: ©2018 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

    Accepted author manuscript, 97 KB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

Robust Transmit Designs for Secrecy Rate Constrained MISO NOMA System

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paper

Published
Publication date20/12/2018
Host publication29th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications
PublisherIEEE
Number of pages5
ISBN (Electronic)9781538660096
Original languageEnglish
Event29th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications - Bologna, Italy
Duration: 9/09/201812/09/2018
http://pimrc2018.ieee-pimrc.org/

Conference

Conference29th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications
Abbreviated titlePIMRC
CountryItaly
CityBologna
Period9/09/1812/09/18
Internet address

Conference

Conference29th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications
Abbreviated titlePIMRC
CountryItaly
CityBologna
Period9/09/1812/09/18
Internet address

Abstract

This paper studies the secure transmission for downlink multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) system in which imperfect channel state information (CSI) of the eavesdropper links is considered. We propose the novel robust beamforming strategies for the direct transmission NOMA (DT NOMA) and cooperative jamming NOMA (CJ NOMA) with a helper. We formulate our problem as the worst-case sum power minimization subject to secrecy rate constraint. The semidefinite relaxation (SDR) method is firstly applied to relax the quadratic terms and rank-one optimality is proved. Then an iterative algorithm based on successive convex approximation (SCA) is proposed to transform the nonconvex problem into convex approximations. Simulation results show that both the proposed NOMA schemes outperform the orthogonal multiple scheme, and CJ NOMA scheme can achieve much better system performance gain than DT NOMA scheme.

Bibliographic note

©2018 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.