IRS-Assisted Physical Layer Security in MIMO-NOMA Networks
In this letter, we propose deploying the intelligent reflecting surface (IRS) to enhance the physical layer security in non-orthogonal multiple access (NOMA). The secrecy sum-rate of IRS-assisted multiple-input multiple-output (MIMO) NOMA is maximized in the presence of an eavesdropper. Because of t...
Gespeichert in:
| Veröffentlicht in: | IEEE communications letters 2023-03, Vol.27 (3), p.1-1 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1 |
|---|---|
| container_issue | 3 |
| container_start_page | 1 |
| container_title | IEEE communications letters |
| container_volume | 27 |
| creator | Qi, Yue Vaezi, Mojtaba |
| description | In this letter, we propose deploying the intelligent reflecting surface (IRS) to enhance the physical layer security in non-orthogonal multiple access (NOMA). The secrecy sum-rate of IRS-assisted multiple-input multiple-output (MIMO) NOMA is maximized in the presence of an eavesdropper. Because of the discrete unit-modulus constraint and the nonconvex property, the secrecy sum-rate maximization problem is hard to solve. We reformulate the original problem into an equivalent parameterized optimization using rotation matrices and apply the particle swarm algorithm for global optimization. Simulation results verify that the performance of the proposed algorithm is close to the secrecy capacity of the channel, realized by exhaustive search, and outperforms other methods like alternating optimization and zero-forcing in terms of complexity and achievable rates. |
| doi_str_mv | 10.1109/LCOMM.2023.3235722 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_2785447343</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>10013699</ieee_id><sourcerecordid>2785447343</sourcerecordid><originalsourceid>FETCH-LOGICAL-c296t-1713e5497ad16115d150e9d01194f5830fc1573b7e8ddad40ed3005ee7c6a0fa3</originalsourceid><addsrcrecordid>eNpNkMtOwzAQRS0EEqXwA4hFJNYpM3Ycx-yqikelpEEU1paJJyKlNMVOhfL3BNoFm7mzuGdGOoxdIkwQQd_ks7IoJhy4mAgupOL8iI1Qyizmwzgedsh0rJTOTtlZCCsAyLjEEbudPy_jaQhN6MhFT-99aCq7jnLbk4-WVO180_VRs4mKeVHGi7KYRgvqvlv_Ec7ZSW3XgS4OOWav93cvs8c4Lx_ms2keV1ynXYwKBclEK-swRZQOJZB2gKiTWmYC6gqlEm-KMuesS4CcAJBEqkot1FaM2fX-7ta3XzsKnVm1O78ZXhquMpkkSiRiaPF9q_JtCJ5qs_XNp_W9QTC_jsyfI_PryBwcDdDVHmqI6B8AKFKtxQ9OK2Bv</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2785447343</pqid></control><display><type>article</type><title>IRS-Assisted Physical Layer Security in MIMO-NOMA Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Qi, Yue ; Vaezi, Mojtaba</creator><creatorcontrib>Qi, Yue ; Vaezi, Mojtaba</creatorcontrib><description>In this letter, we propose deploying the intelligent reflecting surface (IRS) to enhance the physical layer security in non-orthogonal multiple access (NOMA). The secrecy sum-rate of IRS-assisted multiple-input multiple-output (MIMO) NOMA is maximized in the presence of an eavesdropper. Because of the discrete unit-modulus constraint and the nonconvex property, the secrecy sum-rate maximization problem is hard to solve. We reformulate the original problem into an equivalent parameterized optimization using rotation matrices and apply the particle swarm algorithm for global optimization. Simulation results verify that the performance of the proposed algorithm is close to the secrecy capacity of the channel, realized by exhaustive search, and outperforms other methods like alternating optimization and zero-forcing in terms of complexity and achievable rates.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2023.3235722</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Complexity theory ; Covariance matrices ; Encoding ; Global optimization ; IRS ; MIMO-NOMA ; NOMA ; Nonorthogonal multiple access ; Optimization ; Particle swarm optimization ; physical layer security ; Secrecy aspects ; Security ; sum-rate</subject><ispartof>IEEE communications letters, 2023-03, Vol.27 (3), p.1-1</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c296t-1713e5497ad16115d150e9d01194f5830fc1573b7e8ddad40ed3005ee7c6a0fa3</citedby><cites>FETCH-LOGICAL-c296t-1713e5497ad16115d150e9d01194f5830fc1573b7e8ddad40ed3005ee7c6a0fa3</cites><orcidid>0000-0001-9571-4724 ; 0000-0003-3357-4660</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/10013699$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27923,27924,54757</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/10013699$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Qi, Yue</creatorcontrib><creatorcontrib>Vaezi, Mojtaba</creatorcontrib><title>IRS-Assisted Physical Layer Security in MIMO-NOMA Networks</title><title>IEEE communications letters</title><addtitle>LCOMM</addtitle><description>In this letter, we propose deploying the intelligent reflecting surface (IRS) to enhance the physical layer security in non-orthogonal multiple access (NOMA). The secrecy sum-rate of IRS-assisted multiple-input multiple-output (MIMO) NOMA is maximized in the presence of an eavesdropper. Because of the discrete unit-modulus constraint and the nonconvex property, the secrecy sum-rate maximization problem is hard to solve. We reformulate the original problem into an equivalent parameterized optimization using rotation matrices and apply the particle swarm algorithm for global optimization. Simulation results verify that the performance of the proposed algorithm is close to the secrecy capacity of the channel, realized by exhaustive search, and outperforms other methods like alternating optimization and zero-forcing in terms of complexity and achievable rates.</description><subject>Algorithms</subject><subject>Complexity theory</subject><subject>Covariance matrices</subject><subject>Encoding</subject><subject>Global optimization</subject><subject>IRS</subject><subject>MIMO-NOMA</subject><subject>NOMA</subject><subject>Nonorthogonal multiple access</subject><subject>Optimization</subject><subject>Particle swarm optimization</subject><subject>physical layer security</subject><subject>Secrecy aspects</subject><subject>Security</subject><subject>sum-rate</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpNkMtOwzAQRS0EEqXwA4hFJNYpM3Ycx-yqikelpEEU1paJJyKlNMVOhfL3BNoFm7mzuGdGOoxdIkwQQd_ks7IoJhy4mAgupOL8iI1Qyizmwzgedsh0rJTOTtlZCCsAyLjEEbudPy_jaQhN6MhFT-99aCq7jnLbk4-WVO180_VRs4mKeVHGi7KYRgvqvlv_Ec7ZSW3XgS4OOWav93cvs8c4Lx_ms2keV1ynXYwKBclEK-swRZQOJZB2gKiTWmYC6gqlEm-KMuesS4CcAJBEqkot1FaM2fX-7ta3XzsKnVm1O78ZXhquMpkkSiRiaPF9q_JtCJ5qs_XNp_W9QTC_jsyfI_PryBwcDdDVHmqI6B8AKFKtxQ9OK2Bv</recordid><startdate>20230301</startdate><enddate>20230301</enddate><creator>Qi, Yue</creator><creator>Vaezi, Mojtaba</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0001-9571-4724</orcidid><orcidid>https://orcid.org/0000-0003-3357-4660</orcidid></search><sort><creationdate>20230301</creationdate><title>IRS-Assisted Physical Layer Security in MIMO-NOMA Networks</title><author>Qi, Yue ; Vaezi, Mojtaba</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c296t-1713e5497ad16115d150e9d01194f5830fc1573b7e8ddad40ed3005ee7c6a0fa3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Complexity theory</topic><topic>Covariance matrices</topic><topic>Encoding</topic><topic>Global optimization</topic><topic>IRS</topic><topic>MIMO-NOMA</topic><topic>NOMA</topic><topic>Nonorthogonal multiple access</topic><topic>Optimization</topic><topic>Particle swarm optimization</topic><topic>physical layer security</topic><topic>Secrecy aspects</topic><topic>Security</topic><topic>sum-rate</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Qi, Yue</creatorcontrib><creatorcontrib>Vaezi, Mojtaba</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Qi, Yue</au><au>Vaezi, Mojtaba</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>IRS-Assisted Physical Layer Security in MIMO-NOMA Networks</atitle><jtitle>IEEE communications letters</jtitle><stitle>LCOMM</stitle><date>2023-03-01</date><risdate>2023</risdate><volume>27</volume><issue>3</issue><spage>1</spage><epage>1</epage><pages>1-1</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>In this letter, we propose deploying the intelligent reflecting surface (IRS) to enhance the physical layer security in non-orthogonal multiple access (NOMA). The secrecy sum-rate of IRS-assisted multiple-input multiple-output (MIMO) NOMA is maximized in the presence of an eavesdropper. Because of the discrete unit-modulus constraint and the nonconvex property, the secrecy sum-rate maximization problem is hard to solve. We reformulate the original problem into an equivalent parameterized optimization using rotation matrices and apply the particle swarm algorithm for global optimization. Simulation results verify that the performance of the proposed algorithm is close to the secrecy capacity of the channel, realized by exhaustive search, and outperforms other methods like alternating optimization and zero-forcing in terms of complexity and achievable rates.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2023.3235722</doi><tpages>1</tpages><orcidid>https://orcid.org/0000-0001-9571-4724</orcidid><orcidid>https://orcid.org/0000-0003-3357-4660</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1089-7798 |
| ispartof | IEEE communications letters, 2023-03, Vol.27 (3), p.1-1 |
| issn | 1089-7798 1558-2558 |
| language | eng |
| recordid | cdi_proquest_journals_2785447343 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Complexity theory Covariance matrices Encoding Global optimization IRS MIMO-NOMA NOMA Nonorthogonal multiple access Optimization Particle swarm optimization physical layer security Secrecy aspects Security sum-rate |
| title | IRS-Assisted Physical Layer Security in MIMO-NOMA Networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T15%3A55%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=IRS-Assisted%20Physical%20Layer%20Security%20in%20MIMO-NOMA%20Networks&rft.jtitle=IEEE%20communications%20letters&rft.au=Qi,%20Yue&rft.date=2023-03-01&rft.volume=27&rft.issue=3&rft.spage=1&rft.epage=1&rft.pages=1-1&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2023.3235722&rft_dat=%3Cproquest_RIE%3E2785447343%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2785447343&rft_id=info:pmid/&rft_ieee_id=10013699&rfr_iscdi=true |