Two-Dimensional Power Allocation for OTFS-Based High-Mobility Cognitive Radio Networks
This paper addresses the problem of delay-Doppler (DD) domain power allocation for orthogonal time frequency space (OTFS)-based cognitive radio (CR) systems with the high-mobility secondary user (SU) reusing the spectrum of the low-mobility primary user (PU). A fundamental challenge for such an OTFS...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on network science and engineering 2024-05, Vol.11 (3), p.2822-2836 |
---|---|
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 | 2836 |
---|---|
container_issue | 3 |
container_start_page | 2822 |
container_title | IEEE transactions on network science and engineering |
container_volume | 11 |
creator | Zou, Tingting Xu, Wenjun Wang, Fengyu Ding, Zhiguo Pan, Miao Bie, Zhisong |
description | This paper addresses the problem of delay-Doppler (DD) domain power allocation for orthogonal time frequency space (OTFS)-based cognitive radio (CR) systems with the high-mobility secondary user (SU) reusing the spectrum of the low-mobility primary user (PU). A fundamental challenge for such an OTFS-CR network is to maximize the SU's achievable rate while ensuring the quality of service (QoS) of the PU. For this goal, we first derive the explicit expressions of the signal-to-interference-plus-noise ratio (SINR) of the SU of the DD domain. Two cases of the interference introduced by the PU received at the SU are considered: the cases without and with successive interference cancellation (SIC). For the first case, we have proven that the maximal SU's achievable rate can be obtained through equal power allocation. For the second case, the optimization problem is more intractable. Utilizing the Karush-Kuhn-Tucker (KKT) conditions of the optimization problem, an asymptotic-optimal DD domain power allocation scheme has been proposed. Numerical simulations show the priority of the proposed algorithms, where the performance gain is significant compared with other classical allocation algorithms. |
doi_str_mv | 10.1109/TNSE.2024.3350127 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_10381874</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>10381874</ieee_id><sourcerecordid>3049489148</sourcerecordid><originalsourceid>FETCH-LOGICAL-c294t-dfbb0ad424dc93137fe0712567bed910e38b8767e0c12a59d9a439e0a4f508d93</originalsourceid><addsrcrecordid>eNpNkM1OAjEURhujiUR5ABMXTVwX-zd0ukQEMUEwMhp3TWfaweJAsR0kvL0zgYWr--XmfDe5B4AbgnuEYHmfzRajHsWU9xhLMKHiDHQoYxwxKj_P20wF4n0pLkE3xhXGDZP2GWMd8JHtPXp0a7uJzm90BV_93gY4qCpf6LpZwdIHOM_GC_SgozVw4pZf6MXnrnL1AQ79cuNq92vhmzbOw5mt9z58x2twUeoq2u5pXoH38SgbTtB0_vQ8HExRQSWvkSnzHGvDKTeFZISJ0mJBaNIXuTWSYMvSPBV9YXFBqE6kkZozabHmZYJTI9kVuDve3Qb_s7OxViu_C80fUTHMJU8l4WlDkSNVBB9jsKXaBrfW4aAIVq1B1RpUrUF1Mth0bo8dZ639x7OUpIKzP_oXa_0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3049489148</pqid></control><display><type>article</type><title>Two-Dimensional Power Allocation for OTFS-Based High-Mobility Cognitive Radio Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Zou, Tingting ; Xu, Wenjun ; Wang, Fengyu ; Ding, Zhiguo ; Pan, Miao ; Bie, Zhisong</creator><creatorcontrib>Zou, Tingting ; Xu, Wenjun ; Wang, Fengyu ; Ding, Zhiguo ; Pan, Miao ; Bie, Zhisong</creatorcontrib><description>This paper addresses the problem of delay-Doppler (DD) domain power allocation for orthogonal time frequency space (OTFS)-based cognitive radio (CR) systems with the high-mobility secondary user (SU) reusing the spectrum of the low-mobility primary user (PU). A fundamental challenge for such an OTFS-CR network is to maximize the SU's achievable rate while ensuring the quality of service (QoS) of the PU. For this goal, we first derive the explicit expressions of the signal-to-interference-plus-noise ratio (SINR) of the SU of the DD domain. Two cases of the interference introduced by the PU received at the SU are considered: the cases without and with successive interference cancellation (SIC). For the first case, we have proven that the maximal SU's achievable rate can be obtained through equal power allocation. For the second case, the optimization problem is more intractable. Utilizing the Karush-Kuhn-Tucker (KKT) conditions of the optimization problem, an asymptotic-optimal DD domain power allocation scheme has been proposed. Numerical simulations show the priority of the proposed algorithms, where the performance gain is significant compared with other classical allocation algorithms.</description><identifier>ISSN: 2327-4697</identifier><identifier>EISSN: 2334-329X</identifier><identifier>DOI: 10.1109/TNSE.2024.3350127</identifier><identifier>CODEN: ITNSD5</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>Achievable rate ; Algorithms ; Cognitive radio ; high-mobility ; Interference ; Kuhn-Tucker method ; Modulation ; Optimization ; orthogonal time frequency space (OTFS) ; Quality ; Resource management ; Signal to noise ratio ; successive interference cancellation ; Symbols ; Time-frequency analysis</subject><ispartof>IEEE transactions on network science and engineering, 2024-05, Vol.11 (3), p.2822-2836</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c294t-dfbb0ad424dc93137fe0712567bed910e38b8767e0c12a59d9a439e0a4f508d93</citedby><cites>FETCH-LOGICAL-c294t-dfbb0ad424dc93137fe0712567bed910e38b8767e0c12a59d9a439e0a4f508d93</cites><orcidid>0000-0003-2138-4413 ; 0000-0002-1116-1489 ; 0000-0002-5485-9414 ; 0000-0002-2899-6685 ; 0000-0001-8767-4742 ; 0000-0001-5280-384X</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/10381874$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54737</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/10381874$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Zou, Tingting</creatorcontrib><creatorcontrib>Xu, Wenjun</creatorcontrib><creatorcontrib>Wang, Fengyu</creatorcontrib><creatorcontrib>Ding, Zhiguo</creatorcontrib><creatorcontrib>Pan, Miao</creatorcontrib><creatorcontrib>Bie, Zhisong</creatorcontrib><title>Two-Dimensional Power Allocation for OTFS-Based High-Mobility Cognitive Radio Networks</title><title>IEEE transactions on network science and engineering</title><addtitle>TNSE</addtitle><description>This paper addresses the problem of delay-Doppler (DD) domain power allocation for orthogonal time frequency space (OTFS)-based cognitive radio (CR) systems with the high-mobility secondary user (SU) reusing the spectrum of the low-mobility primary user (PU). A fundamental challenge for such an OTFS-CR network is to maximize the SU's achievable rate while ensuring the quality of service (QoS) of the PU. For this goal, we first derive the explicit expressions of the signal-to-interference-plus-noise ratio (SINR) of the SU of the DD domain. Two cases of the interference introduced by the PU received at the SU are considered: the cases without and with successive interference cancellation (SIC). For the first case, we have proven that the maximal SU's achievable rate can be obtained through equal power allocation. For the second case, the optimization problem is more intractable. Utilizing the Karush-Kuhn-Tucker (KKT) conditions of the optimization problem, an asymptotic-optimal DD domain power allocation scheme has been proposed. Numerical simulations show the priority of the proposed algorithms, where the performance gain is significant compared with other classical allocation algorithms.</description><subject>Achievable rate</subject><subject>Algorithms</subject><subject>Cognitive radio</subject><subject>high-mobility</subject><subject>Interference</subject><subject>Kuhn-Tucker method</subject><subject>Modulation</subject><subject>Optimization</subject><subject>orthogonal time frequency space (OTFS)</subject><subject>Quality</subject><subject>Resource management</subject><subject>Signal to noise ratio</subject><subject>successive interference cancellation</subject><subject>Symbols</subject><subject>Time-frequency analysis</subject><issn>2327-4697</issn><issn>2334-329X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpNkM1OAjEURhujiUR5ABMXTVwX-zd0ukQEMUEwMhp3TWfaweJAsR0kvL0zgYWr--XmfDe5B4AbgnuEYHmfzRajHsWU9xhLMKHiDHQoYxwxKj_P20wF4n0pLkE3xhXGDZP2GWMd8JHtPXp0a7uJzm90BV_93gY4qCpf6LpZwdIHOM_GC_SgozVw4pZf6MXnrnL1AQ79cuNq92vhmzbOw5mt9z58x2twUeoq2u5pXoH38SgbTtB0_vQ8HExRQSWvkSnzHGvDKTeFZISJ0mJBaNIXuTWSYMvSPBV9YXFBqE6kkZozabHmZYJTI9kVuDve3Qb_s7OxViu_C80fUTHMJU8l4WlDkSNVBB9jsKXaBrfW4aAIVq1B1RpUrUF1Mth0bo8dZ639x7OUpIKzP_oXa_0</recordid><startdate>20240501</startdate><enddate>20240501</enddate><creator>Zou, Tingting</creator><creator>Xu, Wenjun</creator><creator>Wang, Fengyu</creator><creator>Ding, Zhiguo</creator><creator>Pan, Miao</creator><creator>Bie, Zhisong</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>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0003-2138-4413</orcidid><orcidid>https://orcid.org/0000-0002-1116-1489</orcidid><orcidid>https://orcid.org/0000-0002-5485-9414</orcidid><orcidid>https://orcid.org/0000-0002-2899-6685</orcidid><orcidid>https://orcid.org/0000-0001-8767-4742</orcidid><orcidid>https://orcid.org/0000-0001-5280-384X</orcidid></search><sort><creationdate>20240501</creationdate><title>Two-Dimensional Power Allocation for OTFS-Based High-Mobility Cognitive Radio Networks</title><author>Zou, Tingting ; Xu, Wenjun ; Wang, Fengyu ; Ding, Zhiguo ; Pan, Miao ; Bie, Zhisong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c294t-dfbb0ad424dc93137fe0712567bed910e38b8767e0c12a59d9a439e0a4f508d93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Achievable rate</topic><topic>Algorithms</topic><topic>Cognitive radio</topic><topic>high-mobility</topic><topic>Interference</topic><topic>Kuhn-Tucker method</topic><topic>Modulation</topic><topic>Optimization</topic><topic>orthogonal time frequency space (OTFS)</topic><topic>Quality</topic><topic>Resource management</topic><topic>Signal to noise ratio</topic><topic>successive interference cancellation</topic><topic>Symbols</topic><topic>Time-frequency analysis</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zou, Tingting</creatorcontrib><creatorcontrib>Xu, Wenjun</creatorcontrib><creatorcontrib>Wang, Fengyu</creatorcontrib><creatorcontrib>Ding, Zhiguo</creatorcontrib><creatorcontrib>Pan, Miao</creatorcontrib><creatorcontrib>Bie, Zhisong</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>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on network science and engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Zou, Tingting</au><au>Xu, Wenjun</au><au>Wang, Fengyu</au><au>Ding, Zhiguo</au><au>Pan, Miao</au><au>Bie, Zhisong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Two-Dimensional Power Allocation for OTFS-Based High-Mobility Cognitive Radio Networks</atitle><jtitle>IEEE transactions on network science and engineering</jtitle><stitle>TNSE</stitle><date>2024-05-01</date><risdate>2024</risdate><volume>11</volume><issue>3</issue><spage>2822</spage><epage>2836</epage><pages>2822-2836</pages><issn>2327-4697</issn><eissn>2334-329X</eissn><coden>ITNSD5</coden><abstract>This paper addresses the problem of delay-Doppler (DD) domain power allocation for orthogonal time frequency space (OTFS)-based cognitive radio (CR) systems with the high-mobility secondary user (SU) reusing the spectrum of the low-mobility primary user (PU). A fundamental challenge for such an OTFS-CR network is to maximize the SU's achievable rate while ensuring the quality of service (QoS) of the PU. For this goal, we first derive the explicit expressions of the signal-to-interference-plus-noise ratio (SINR) of the SU of the DD domain. Two cases of the interference introduced by the PU received at the SU are considered: the cases without and with successive interference cancellation (SIC). For the first case, we have proven that the maximal SU's achievable rate can be obtained through equal power allocation. For the second case, the optimization problem is more intractable. Utilizing the Karush-Kuhn-Tucker (KKT) conditions of the optimization problem, an asymptotic-optimal DD domain power allocation scheme has been proposed. Numerical simulations show the priority of the proposed algorithms, where the performance gain is significant compared with other classical allocation algorithms.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/TNSE.2024.3350127</doi><tpages>15</tpages><orcidid>https://orcid.org/0000-0003-2138-4413</orcidid><orcidid>https://orcid.org/0000-0002-1116-1489</orcidid><orcidid>https://orcid.org/0000-0002-5485-9414</orcidid><orcidid>https://orcid.org/0000-0002-2899-6685</orcidid><orcidid>https://orcid.org/0000-0001-8767-4742</orcidid><orcidid>https://orcid.org/0000-0001-5280-384X</orcidid></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 2327-4697 |
ispartof | IEEE transactions on network science and engineering, 2024-05, Vol.11 (3), p.2822-2836 |
issn | 2327-4697 2334-329X |
language | eng |
recordid | cdi_ieee_primary_10381874 |
source | IEEE Electronic Library (IEL) |
subjects | Achievable rate Algorithms Cognitive radio high-mobility Interference Kuhn-Tucker method Modulation Optimization orthogonal time frequency space (OTFS) Quality Resource management Signal to noise ratio successive interference cancellation Symbols Time-frequency analysis |
title | Two-Dimensional Power Allocation for OTFS-Based High-Mobility Cognitive Radio 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-21T19%3A03%3A38IST&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=Two-Dimensional%20Power%20Allocation%20for%20OTFS-Based%20High-Mobility%20Cognitive%20Radio%20Networks&rft.jtitle=IEEE%20transactions%20on%20network%20science%20and%20engineering&rft.au=Zou,%20Tingting&rft.date=2024-05-01&rft.volume=11&rft.issue=3&rft.spage=2822&rft.epage=2836&rft.pages=2822-2836&rft.issn=2327-4697&rft.eissn=2334-329X&rft.coden=ITNSD5&rft_id=info:doi/10.1109/TNSE.2024.3350127&rft_dat=%3Cproquest_RIE%3E3049489148%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=3049489148&rft_id=info:pmid/&rft_ieee_id=10381874&rfr_iscdi=true |