File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/JSAC.2020.3018805
- WOS: WOS:000631201600008
Supplementary
-
Citations:
- Web of Science: 0
- Appears in Collections:
Article: Massive Access in Secure NOMA under Imperfect CSI: Security Guaranteed Sum-rate Maximization with First-order Algorithm
Title | Massive Access in Secure NOMA under Imperfect CSI: Security Guaranteed Sum-rate Maximization with First-order Algorithm |
---|---|
Authors | |
Issue Date | 2021 |
Publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=49 |
Citation | IEEE Journal on Selected Areas in Communications , 2021, v. 39, p. 998-1014 How to Cite? |
Abstract | Non-orthogonal multiple access (NOMA) is a promising solution for secure transmission under massive access. However, in addition to the uncertain channel state information (CSI) of the eavesdroppers due to their passive nature, the CSI of the legitimate users may also be imperfect at the base station due to the limited feedback. Under both channel uncertainties, the optimal power allocation and transmission rate design for a secure NOMA scheme is currently not known due to the difficulty of handling the probabilistic constraints. This article fills this gap by proposing novel transformation of the probabilistic constraints and variable decoupling so that the security guaranteed sum-rate maximization problem can be solved by alternatively executing branch-and-bound method and difference of convex programming. To scale the solution to a truly massive access scenario, a first-order algorithm with very low complexity is further proposed. Simulation results show that the proposed first-order algorithm achieves identical performance to the conventional method but saves at least two orders of magnitude in computation time. Moreover, the resultant transmission scheme significantly improves the security guaranteed sum-rate compared to the orthogonal multiple access transmission and NOMA ignoring CSI uncertainty. |
Persistent Identifier | http://hdl.handle.net/10722/320831 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | LI, Z | - |
dc.contributor.author | Xia, M | - |
dc.contributor.author | Wen, M | - |
dc.contributor.author | Wu, YC | - |
dc.date.accessioned | 2022-11-01T04:42:04Z | - |
dc.date.available | 2022-11-01T04:42:04Z | - |
dc.date.issued | 2021 | - |
dc.identifier.citation | IEEE Journal on Selected Areas in Communications , 2021, v. 39, p. 998-1014 | - |
dc.identifier.uri | http://hdl.handle.net/10722/320831 | - |
dc.description.abstract | Non-orthogonal multiple access (NOMA) is a promising solution for secure transmission under massive access. However, in addition to the uncertain channel state information (CSI) of the eavesdroppers due to their passive nature, the CSI of the legitimate users may also be imperfect at the base station due to the limited feedback. Under both channel uncertainties, the optimal power allocation and transmission rate design for a secure NOMA scheme is currently not known due to the difficulty of handling the probabilistic constraints. This article fills this gap by proposing novel transformation of the probabilistic constraints and variable decoupling so that the security guaranteed sum-rate maximization problem can be solved by alternatively executing branch-and-bound method and difference of convex programming. To scale the solution to a truly massive access scenario, a first-order algorithm with very low complexity is further proposed. Simulation results show that the proposed first-order algorithm achieves identical performance to the conventional method but saves at least two orders of magnitude in computation time. Moreover, the resultant transmission scheme significantly improves the security guaranteed sum-rate compared to the orthogonal multiple access transmission and NOMA ignoring CSI uncertainty. | - |
dc.language | eng | - |
dc.publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=49 | - |
dc.relation.ispartof | IEEE Journal on Selected Areas in Communications | - |
dc.rights | IEEE Journal on Selected Areas in Communications . Copyright © IEEE. | - |
dc.rights | ©20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | - |
dc.title | Massive Access in Secure NOMA under Imperfect CSI: Security Guaranteed Sum-rate Maximization with First-order Algorithm | - |
dc.type | Article | - |
dc.identifier.email | Wu, YC: ycwu@eee.hku.hk | - |
dc.identifier.authority | Wu, YC=rp00195 | - |
dc.identifier.doi | 10.1109/JSAC.2020.3018805 | - |
dc.identifier.hkuros | 341142 | - |
dc.identifier.volume | 39 | - |
dc.identifier.spage | 998 | - |
dc.identifier.epage | 1014 | - |
dc.identifier.isi | WOS:000631201600008 | - |