On Secure NOMA-Aided Semi-Grant-Free Systems
Semi-grant-free (SGF) transmission scheme enables grant-free (GF) users to utilize resource blocks allocated for grant-based (GB) users while maintaining the quality of service of GB users. This work investigates the secrecy performance of non-orthogonal multiple access (NOMA)-aided SGF systems. Fir...
Gespeichert in:
| 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 | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Lei, Hongjiang Yang, Fangtao Liu, Hongwu Ansari, Imran Shafique Kim, Kyeong Jin Tsiftsis, Theodoros A |
| description | Semi-grant-free (SGF) transmission scheme enables grant-free (GF) users to
utilize resource blocks allocated for grant-based (GB) users while maintaining
the quality of service of GB users. This work investigates the secrecy
performance of non-orthogonal multiple access (NOMA)-aided SGF systems. First,
analytical expressions for the exact and asymptotic secrecy outage probability
(SOP) of NOMA-aided SGF systems with a single GF user are derived. Then, the
SGF systems with multiple GF users and the best-user scheduling scheme is
considered. Analytical expressions for the exact and asymptotic SOP are derived
by utilizing order statistics theory. Monte Carlo simulation results are
provided and compared with two benchmark schemes. The effects of system
parameters on the SOP of the considered system are demonstrated and the
accuracy of the developed analytical results is verified. The results indicate
that both the outage target rate for GB and the secure target rate for GF are
the main factors of the secrecy performance of SGF systems. |
| doi_str_mv | 10.48550/arxiv.2204.08135 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2204_08135</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2204_08135</sourcerecordid><originalsourceid>FETCH-LOGICAL-a675-1201beae3f0518a1bc517834dd72b0e3b51bccd9bbc5b82131b49f75a1ad09a93</originalsourceid><addsrcrecordid>eNotjssKwjAQRbNxIeoHuLIfYGomaWy6LMUXqF3ovkyaKRSsSFpF_976WF04Fw6HsSmIMDJaiwX6Z_0IpRRRKAwoPWTz_BqcqLx7Co75IeVp7cj1pKn5xuO142tPFJxebUdNO2aDCi8tTf47Yuf16pxt-T7f7LJ0z3EZaw5SgCUkVQkNBsGWGmKjIudiaQUpq3tUusT2hzUSFNgoqWKNgE4kmKgRm_2039zi5usG_av4ZBffbPUGIpI7QA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On Secure NOMA-Aided Semi-Grant-Free Systems</title><source>arXiv.org</source><creator>Lei, Hongjiang ; Yang, Fangtao ; Liu, Hongwu ; Ansari, Imran Shafique ; Kim, Kyeong Jin ; Tsiftsis, Theodoros A</creator><creatorcontrib>Lei, Hongjiang ; Yang, Fangtao ; Liu, Hongwu ; Ansari, Imran Shafique ; Kim, Kyeong Jin ; Tsiftsis, Theodoros A</creatorcontrib><description>Semi-grant-free (SGF) transmission scheme enables grant-free (GF) users to
utilize resource blocks allocated for grant-based (GB) users while maintaining
the quality of service of GB users. This work investigates the secrecy
performance of non-orthogonal multiple access (NOMA)-aided SGF systems. First,
analytical expressions for the exact and asymptotic secrecy outage probability
(SOP) of NOMA-aided SGF systems with a single GF user are derived. Then, the
SGF systems with multiple GF users and the best-user scheduling scheme is
considered. Analytical expressions for the exact and asymptotic SOP are derived
by utilizing order statistics theory. Monte Carlo simulation results are
provided and compared with two benchmark schemes. The effects of system
parameters on the SOP of the considered system are demonstrated and the
accuracy of the developed analytical results is verified. The results indicate
that both the outage target rate for GB and the secure target rate for GF are
the main factors of the secrecy performance of SGF systems.</description><identifier>DOI: 10.48550/arxiv.2204.08135</identifier><language>eng</language><subject>Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2022-04</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,778,883</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2204.08135$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2204.08135$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Lei, Hongjiang</creatorcontrib><creatorcontrib>Yang, Fangtao</creatorcontrib><creatorcontrib>Liu, Hongwu</creatorcontrib><creatorcontrib>Ansari, Imran Shafique</creatorcontrib><creatorcontrib>Kim, Kyeong Jin</creatorcontrib><creatorcontrib>Tsiftsis, Theodoros A</creatorcontrib><title>On Secure NOMA-Aided Semi-Grant-Free Systems</title><description>Semi-grant-free (SGF) transmission scheme enables grant-free (GF) users to
utilize resource blocks allocated for grant-based (GB) users while maintaining
the quality of service of GB users. This work investigates the secrecy
performance of non-orthogonal multiple access (NOMA)-aided SGF systems. First,
analytical expressions for the exact and asymptotic secrecy outage probability
(SOP) of NOMA-aided SGF systems with a single GF user are derived. Then, the
SGF systems with multiple GF users and the best-user scheduling scheme is
considered. Analytical expressions for the exact and asymptotic SOP are derived
by utilizing order statistics theory. Monte Carlo simulation results are
provided and compared with two benchmark schemes. The effects of system
parameters on the SOP of the considered system are demonstrated and the
accuracy of the developed analytical results is verified. The results indicate
that both the outage target rate for GB and the secure target rate for GF are
the main factors of the secrecy performance of SGF systems.</description><subject>Computer Science - Information Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotjssKwjAQRbNxIeoHuLIfYGomaWy6LMUXqF3ovkyaKRSsSFpF_976WF04Fw6HsSmIMDJaiwX6Z_0IpRRRKAwoPWTz_BqcqLx7Co75IeVp7cj1pKn5xuO142tPFJxebUdNO2aDCi8tTf47Yuf16pxt-T7f7LJ0z3EZaw5SgCUkVQkNBsGWGmKjIudiaQUpq3tUusT2hzUSFNgoqWKNgE4kmKgRm_2039zi5usG_av4ZBffbPUGIpI7QA</recordid><startdate>20220417</startdate><enddate>20220417</enddate><creator>Lei, Hongjiang</creator><creator>Yang, Fangtao</creator><creator>Liu, Hongwu</creator><creator>Ansari, Imran Shafique</creator><creator>Kim, Kyeong Jin</creator><creator>Tsiftsis, Theodoros A</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20220417</creationdate><title>On Secure NOMA-Aided Semi-Grant-Free Systems</title><author>Lei, Hongjiang ; Yang, Fangtao ; Liu, Hongwu ; Ansari, Imran Shafique ; Kim, Kyeong Jin ; Tsiftsis, Theodoros A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a675-1201beae3f0518a1bc517834dd72b0e3b51bccd9bbc5b82131b49f75a1ad09a93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Information Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Lei, Hongjiang</creatorcontrib><creatorcontrib>Yang, Fangtao</creatorcontrib><creatorcontrib>Liu, Hongwu</creatorcontrib><creatorcontrib>Ansari, Imran Shafique</creatorcontrib><creatorcontrib>Kim, Kyeong Jin</creatorcontrib><creatorcontrib>Tsiftsis, Theodoros A</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lei, Hongjiang</au><au>Yang, Fangtao</au><au>Liu, Hongwu</au><au>Ansari, Imran Shafique</au><au>Kim, Kyeong Jin</au><au>Tsiftsis, Theodoros A</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On Secure NOMA-Aided Semi-Grant-Free Systems</atitle><date>2022-04-17</date><risdate>2022</risdate><abstract>Semi-grant-free (SGF) transmission scheme enables grant-free (GF) users to
utilize resource blocks allocated for grant-based (GB) users while maintaining
the quality of service of GB users. This work investigates the secrecy
performance of non-orthogonal multiple access (NOMA)-aided SGF systems. First,
analytical expressions for the exact and asymptotic secrecy outage probability
(SOP) of NOMA-aided SGF systems with a single GF user are derived. Then, the
SGF systems with multiple GF users and the best-user scheduling scheme is
considered. Analytical expressions for the exact and asymptotic SOP are derived
by utilizing order statistics theory. Monte Carlo simulation results are
provided and compared with two benchmark schemes. The effects of system
parameters on the SOP of the considered system are demonstrated and the
accuracy of the developed analytical results is verified. The results indicate
that both the outage target rate for GB and the secure target rate for GF are
the main factors of the secrecy performance of SGF systems.</abstract><doi>10.48550/arxiv.2204.08135</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2204.08135 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2204_08135 |
| source | arXiv.org |
| subjects | Computer Science - Information Theory Mathematics - Information Theory |
| title | On Secure NOMA-Aided Semi-Grant-Free Systems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T08%3A09%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20Secure%20NOMA-Aided%20Semi-Grant-Free%20Systems&rft.au=Lei,%20Hongjiang&rft.date=2022-04-17&rft_id=info:doi/10.48550/arxiv.2204.08135&rft_dat=%3Carxiv_GOX%3E2204_08135%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |