We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:


Current browse context:


Change to browse by:

References & Citations

DBLP - CS Bibliography


(what is this?)

Computer Science > Information Theory

Title: Secure Users Oriented Downlink MISO NOMA

Abstract: This paper proposes a secure users oriented multiple-input and single-output (MISO) non-orthogonal multiple access (NOMA) 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 (ZFBF) 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 (MSR) and sum secrecy rate (SSR) of all SUs, respectively, subject to the secrecy outage probability (SOP) 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 (MO)-based outer polyblock approximation algorithm are proposed to solve the max-min secrecy rate (MMSR) and max-sum secrecy rate (MSSR) problems, respectively. As for the upper bound case, an alternative optimization (AO)-based algorithm is proposed to solve the two non-convex problems. Finally, the superiority of the proposed cases to the conventional orthogonal multiple access (OMA) one is verified by numerical results.
Comments: 15 pages, 7 figures, accepted for publication on IEEE Journal of Selected Topics on Signal Processing
Subjects: Information Theory (cs.IT)
DOI: 10.1109/JSTSP.2019.2899778
Cite as: arXiv:1903.00205 [cs.IT]
  (or arXiv:1903.00205v1 [cs.IT] for this version)

Submission history

From: Hui-Ming Wang [view email]
[v1] Fri, 1 Mar 2019 08:44:57 GMT (287kb)

Link back to: arXiv, form interface, contact.