Secure Users Oriented Downlink MISO NOMA

Hui Ming Wang, Xu Zhang, Qian Yang, Theodoros Tsiftsis

Research output: Contribution to journalArticle

Abstract

This paper proposes a secure users-oriented multiple-input and single-output non-orthogonal multiple access downlink transmission scheme, where multiple legitimate users are categorized as quality of service (QoS)-required users (QU) and the security-required users (SU) overheard by a passive eavesdropper. The basic idea is to exploit zero-forcing beamforming to cancel interference among SUs, and then several QUs are efficiently scheduled based on the obtained beamforming vectors to divide the legitimate users into several user clusters, in such a way that the QUs could share the concurrent transmissions and help to interfere with the eavesdropper to enhance SU secrecy. The goal is to maximize the achievable minimum secrecy rate and sum secrecy rate of all SUs, respectively, subject to the secrecy outage probability constraint of each SU and the QoS constraint of each QU. To provide a comprehensive investigation, we consider two extreme cases that the eavesdropper has perfect multiuser detection ability (lower bound of secrecy) or does not have multiuser detection ability (upper bound of secrecy). In the lower bound case, the Dinkelbach algorithm and the monotonic optimization-based outer polyblock approximation algorithm are proposed to solve the max-min secrecy rate and max-sum secrecy rate problems, respectively. As for the upper bound case, an alternative optimization-based algorithm is proposed to solve the two non-convex problems. Finally, the superiority of the proposed cases to the conventional orthogonal multiple access one is verified by numerical results.

Original languageEnglish
Article number8642811
Pages (from-to)671-684
Number of pages14
JournalIEEE Journal on Selected Topics in Signal Processing
Volume13
Issue number3
DOIs
Publication statusPublished - Jun 1 2019

Fingerprint

Quality of service
Multiuser detection
Beamforming
Approximation algorithms
Outages

Keywords

  • Convex optimization
  • non-orthogonal multiple access
  • physical layer security
  • power allocation

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Secure Users Oriented Downlink MISO NOMA. / Wang, Hui Ming; Zhang, Xu; Yang, Qian; Tsiftsis, Theodoros.

In: IEEE Journal on Selected Topics in Signal Processing, Vol. 13, No. 3, 8642811, 01.06.2019, p. 671-684.

Research output: Contribution to journalArticle

Wang, HM, Zhang, X, Yang, Q & Tsiftsis, T 2019, 'Secure Users Oriented Downlink MISO NOMA', IEEE Journal on Selected Topics in Signal Processing, vol. 13, no. 3, 8642811, pp. 671-684. https://doi.org/10.1109/JSTSP.2019.2899778
Wang, Hui Ming ; Zhang, Xu ; Yang, Qian ; Tsiftsis, Theodoros. / Secure Users Oriented Downlink MISO NOMA. In: IEEE Journal on Selected Topics in Signal Processing. 2019 ; Vol. 13, No. 3. pp. 671-684.
@article{13d2d1cc0cf248ed8ec40c64266339df,
title = "Secure Users Oriented Downlink MISO NOMA",
abstract = "This paper proposes a secure users-oriented multiple-input and single-output non-orthogonal multiple access downlink transmission scheme, where multiple legitimate users are categorized as quality of service (QoS)-required users (QU) and the security-required users (SU) overheard by a passive eavesdropper. The basic idea is to exploit zero-forcing beamforming to cancel interference among SUs, and then several QUs are efficiently scheduled based on the obtained beamforming vectors to divide the legitimate users into several user clusters, in such a way that the QUs could share the concurrent transmissions and help to interfere with the eavesdropper to enhance SU secrecy. The goal is to maximize the achievable minimum secrecy rate and sum secrecy rate of all SUs, respectively, subject to the secrecy outage probability constraint of each SU and the QoS constraint of each QU. To provide a comprehensive investigation, we consider two extreme cases that the eavesdropper has perfect multiuser detection ability (lower bound of secrecy) or does not have multiuser detection ability (upper bound of secrecy). In the lower bound case, the Dinkelbach algorithm and the monotonic optimization-based outer polyblock approximation algorithm are proposed to solve the max-min secrecy rate and max-sum secrecy rate problems, respectively. As for the upper bound case, an alternative optimization-based algorithm is proposed to solve the two non-convex problems. Finally, the superiority of the proposed cases to the conventional orthogonal multiple access one is verified by numerical results.",
keywords = "Convex optimization, non-orthogonal multiple access, physical layer security, power allocation",
author = "Wang, {Hui Ming} and Xu Zhang and Qian Yang and Theodoros Tsiftsis",
year = "2019",
month = "6",
day = "1",
doi = "10.1109/JSTSP.2019.2899778",
language = "English",
volume = "13",
pages = "671--684",
journal = "IEEE Journal on Selected Topics in Signal Processing",
issn = "1932-4553",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Secure Users Oriented Downlink MISO NOMA

AU - Wang, Hui Ming

AU - Zhang, Xu

AU - Yang, Qian

AU - Tsiftsis, Theodoros

PY - 2019/6/1

Y1 - 2019/6/1

N2 - This paper proposes a secure users-oriented multiple-input and single-output non-orthogonal multiple access downlink transmission scheme, where multiple legitimate users are categorized as quality of service (QoS)-required users (QU) and the security-required users (SU) overheard by a passive eavesdropper. The basic idea is to exploit zero-forcing beamforming to cancel interference among SUs, and then several QUs are efficiently scheduled based on the obtained beamforming vectors to divide the legitimate users into several user clusters, in such a way that the QUs could share the concurrent transmissions and help to interfere with the eavesdropper to enhance SU secrecy. The goal is to maximize the achievable minimum secrecy rate and sum secrecy rate of all SUs, respectively, subject to the secrecy outage probability constraint of each SU and the QoS constraint of each QU. To provide a comprehensive investigation, we consider two extreme cases that the eavesdropper has perfect multiuser detection ability (lower bound of secrecy) or does not have multiuser detection ability (upper bound of secrecy). In the lower bound case, the Dinkelbach algorithm and the monotonic optimization-based outer polyblock approximation algorithm are proposed to solve the max-min secrecy rate and max-sum secrecy rate problems, respectively. As for the upper bound case, an alternative optimization-based algorithm is proposed to solve the two non-convex problems. Finally, the superiority of the proposed cases to the conventional orthogonal multiple access one is verified by numerical results.

AB - This paper proposes a secure users-oriented multiple-input and single-output non-orthogonal multiple access downlink transmission scheme, where multiple legitimate users are categorized as quality of service (QoS)-required users (QU) and the security-required users (SU) overheard by a passive eavesdropper. The basic idea is to exploit zero-forcing beamforming to cancel interference among SUs, and then several QUs are efficiently scheduled based on the obtained beamforming vectors to divide the legitimate users into several user clusters, in such a way that the QUs could share the concurrent transmissions and help to interfere with the eavesdropper to enhance SU secrecy. The goal is to maximize the achievable minimum secrecy rate and sum secrecy rate of all SUs, respectively, subject to the secrecy outage probability constraint of each SU and the QoS constraint of each QU. To provide a comprehensive investigation, we consider two extreme cases that the eavesdropper has perfect multiuser detection ability (lower bound of secrecy) or does not have multiuser detection ability (upper bound of secrecy). In the lower bound case, the Dinkelbach algorithm and the monotonic optimization-based outer polyblock approximation algorithm are proposed to solve the max-min secrecy rate and max-sum secrecy rate problems, respectively. As for the upper bound case, an alternative optimization-based algorithm is proposed to solve the two non-convex problems. Finally, the superiority of the proposed cases to the conventional orthogonal multiple access one is verified by numerical results.

KW - Convex optimization

KW - non-orthogonal multiple access

KW - physical layer security

KW - power allocation

UR - http://www.scopus.com/inward/record.url?scp=85066854583&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85066854583&partnerID=8YFLogxK

U2 - 10.1109/JSTSP.2019.2899778

DO - 10.1109/JSTSP.2019.2899778

M3 - Article

VL - 13

SP - 671

EP - 684

JO - IEEE Journal on Selected Topics in Signal Processing

JF - IEEE Journal on Selected Topics in Signal Processing

SN - 1932-4553

IS - 3

M1 - 8642811

ER -