4.6 Article

Optimization for Maximizing Sum Secrecy Rate in SWIPT-Enabled NOMA Systems

Journal

IEEE ACCESS
Volume 6, Issue -, Pages 43440-43449

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2018.2859935

Keywords

Non-orthogonal multiple access (NOMA); physical layer security; simultaneous wireless information and power transfer (SWIPT)

Funding

  1. National Natural Science Foundation of China [61601186]
  2. Natural Science Foundation of Guangdong Province [2017A030313383]
  3. Guangzhou Science Technology and Innovation Commission [201707010159]

Ask authors/readers for more resources

In this paper, we study secrecy simultaneous wireless information and power transfer (SWIPT) in downlink non-orthogonal multiple access (NOMA) systems comprising a base station (BS), multiple information receivers (IRs), and multiple energy receivers (ERs) that have potential to wiretap the IRs. The goal of this paper is to maximize the sum secrecy rate (SSR) of the system subject to the individual IR's minimum data rate requirement and the individual ER's minimum harvested energy requirement. The corresponding problem involves resource allocation via max-min function, which is non-convex and dificult to solve directly. In order to tackle this, we first transform the original non-convex problem to a sequence of convex sub-problems which can be solved simultaneously. Hence, a closed-form solution of the optimal power allocation policy is derived based on the Karush-Kuhn-Tucker conditions. Numerical results validate the theoretical findings and demonstrate that the significant performance gain over the orthogonal multiple access scheme in terms of SSR can be achieved by the proposed algorithm in a SWIPT-enabled NOMA system.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available