File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/JSAC.2020.3000837
- Scopus: eid_2-s2.0-85086737694
- WOS: WOS:000564252400018
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Angle Aware User Cooperation for Secure Massive MIMO in Rician Fading Channel
Title | Angle Aware User Cooperation for Secure Massive MIMO in Rician Fading Channel |
---|---|
Authors | |
Keywords | Security Rician channels Massive MIMO Convex functions Antennas |
Issue Date | 2020 |
Publisher | Institute of Electrical and Electronics Engineers. 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, 2020, v. 38 n. 9, p. 2182-2196 How to Cite? |
Abstract | Massive multiple-input multiple-output communications can achieve high-level security by concentrating radio frequency signals towards the legitimate users. However, this system is vulnerable in a Rician fading environment if the eavesdropper positions itself such that its channel is highly “similar” to the channel of a legitimate user. To address this problem, this paper proposes an angle aware user cooperation (AAUC) scheme, which avoids direct transmission to the attacked user and relies on other users for cooperative relaying. The proposed scheme only requires the eavesdropper's angle information, and adopts an angular secrecy model to represent the average secrecy rate of the attacked system. With this angular model, the AAUC problem turns out to be nonconvex, and a successive convex optimization algorithm, which converges to a Karush-Kuhn-Tucker solution, is proposed. Furthermore, a closed-form solution and a Bregman first-order method are derived for the cases of large-scale antennas and large-scale users, respectively. Extension to the intelligent reflecting surfaces based scheme is also discussed. Simulation results demonstrate the effectiveness of the proposed successive convex optimization based AAUC scheme, and also validate the low-complexity nature of the proposed large-scale optimization algorithms. |
Persistent Identifier | http://hdl.handle.net/10722/296362 |
ISSN | 2023 Impact Factor: 13.8 2023 SCImago Journal Rankings: 8.707 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wang, S | - |
dc.contributor.author | Wen, M | - |
dc.contributor.author | Xia, M | - |
dc.contributor.author | Wang, R | - |
dc.contributor.author | Hao, Q | - |
dc.contributor.author | Wu, YC | - |
dc.date.accessioned | 2021-02-22T04:54:13Z | - |
dc.date.available | 2021-02-22T04:54:13Z | - |
dc.date.issued | 2020 | - |
dc.identifier.citation | IEEE Journal on Selected Areas in Communications, 2020, v. 38 n. 9, p. 2182-2196 | - |
dc.identifier.issn | 0733-8716 | - |
dc.identifier.uri | http://hdl.handle.net/10722/296362 | - |
dc.description.abstract | Massive multiple-input multiple-output communications can achieve high-level security by concentrating radio frequency signals towards the legitimate users. However, this system is vulnerable in a Rician fading environment if the eavesdropper positions itself such that its channel is highly “similar” to the channel of a legitimate user. To address this problem, this paper proposes an angle aware user cooperation (AAUC) scheme, which avoids direct transmission to the attacked user and relies on other users for cooperative relaying. The proposed scheme only requires the eavesdropper's angle information, and adopts an angular secrecy model to represent the average secrecy rate of the attacked system. With this angular model, the AAUC problem turns out to be nonconvex, and a successive convex optimization algorithm, which converges to a Karush-Kuhn-Tucker solution, is proposed. Furthermore, a closed-form solution and a Bregman first-order method are derived for the cases of large-scale antennas and large-scale users, respectively. Extension to the intelligent reflecting surfaces based scheme is also discussed. Simulation results demonstrate the effectiveness of the proposed successive convex optimization based AAUC scheme, and also validate the low-complexity nature of the proposed large-scale optimization algorithms. | - |
dc.language | eng | - |
dc.publisher | Institute of Electrical and Electronics Engineers. 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 © Institute of Electrical and Electronics Engineers. | - |
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.subject | Security | - |
dc.subject | Rician channels | - |
dc.subject | Massive MIMO | - |
dc.subject | Convex functions | - |
dc.subject | Antennas | - |
dc.title | Angle Aware User Cooperation for Secure Massive MIMO in Rician Fading Channel | - |
dc.type | Article | - |
dc.identifier.email | Wen, M: mwwen@hku.hk | - |
dc.identifier.email | Wu, YC: ycwu@eee.hku.hk | - |
dc.identifier.authority | Wu, YC=rp00195 | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/JSAC.2020.3000837 | - |
dc.identifier.scopus | eid_2-s2.0-85086737694 | - |
dc.identifier.hkuros | 321338 | - |
dc.identifier.volume | 38 | - |
dc.identifier.issue | 9 | - |
dc.identifier.spage | 2182 | - |
dc.identifier.epage | 2196 | - |
dc.identifier.isi | WOS:000564252400018 | - |
dc.publisher.place | United States | - |