Chance-Constrained Optimization of OFDMA Cognitive Radio Uplinks
A resource allocation task for the uplink of OFDMA-based cognitive radio (CR) systems is considered. The weighted sum-rate is maximized over subcarrier assignment as well as over power loading per CR user, while protecting primary user (PU) systems. However, due to the lack of explicit support from...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on wireless communications 2013-03, Vol.12 (3), p.1098-1107 |
|---|---|
| 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 | 1107 |
|---|---|
| container_issue | 3 |
| container_start_page | 1098 |
| container_title | IEEE transactions on wireless communications |
| container_volume | 12 |
| creator | Soltani, N. Y. Seung-Jun Kim Giannakis, G. B. |
| description | A resource allocation task for the uplink of OFDMA-based cognitive radio (CR) systems is considered. The weighted sum-rate is maximized over subcarrier assignment as well as over power loading per CR user, while protecting primary user (PU) systems. However, due to the lack of explicit support from PU systems, the channels from CR users to the PU may not be accurately acquired. Thus, the PU interference constraint is posed as a chance constraint, for which conservative convex approximation is employed for tractability. In particular, to mitigate the combinatorial complexity incurred for optimal subcarrier assignment, a separable structure is pursued, and the dual decomposition method is adopted to obtain near-optimal solutions. Numerical tests verify that the proposed algorithms yield higher weighted sum-rate at lower computational complexity than a benchmark algorithm. |
| doi_str_mv | 10.1109/TWC.2013.011713.120155 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_6416888</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6416888</ieee_id><sourcerecordid>2939669611</sourcerecordid><originalsourceid>FETCH-LOGICAL-c399t-cc509e04c37858b5791b6cfac6410834dff0ed079bacbdf2df6d3f2c7416a6243</originalsourceid><addsrcrecordid>eNpdkN9LwzAQgIsoOKd_gSAFEXzpzO-kb47qVJgMZMPHkKaJZnbNbDpB_3pTOnzw5e5CvjvuviS5gGACIchvlq_FBAGIJwBCHhOMD0oPklGMIkOIiMO-xiyDiLPj5CSENQCQM0pHyW3xrhptssI3oWuVa0yVLrad27gf1TnfpN6mi9nd8zQt_FvjOvdl0hdVOZ-utrVrPsJpcmRVHczZPo-T1ex-WTxm88XDUzGdZxrneZdpTUFuANGYCypKynNYMm2VZgQCgUllLTAV4HmpdFlZVFlWYYs0J5AphggeJ9fD3G3rP3cmdHLjgjZ1rRrjd0FCTHLCAQQoopf_0LXftU3cLlKIMMoBoJFiA6VbH0JrrNy2bqPabwmB7MXKKFb2YuUgVg5iY-PVfrwKWtW2jQJd-OtGHMWLRL_G-cA5Y8zfd7yXCSHwL0mif9M</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1324657005</pqid></control><display><type>article</type><title>Chance-Constrained Optimization of OFDMA Cognitive Radio Uplinks</title><source>IEEE Electronic Library (IEL)</source><creator>Soltani, N. Y. ; Seung-Jun Kim ; Giannakis, G. B.</creator><creatorcontrib>Soltani, N. Y. ; Seung-Jun Kim ; Giannakis, G. B.</creatorcontrib><description>A resource allocation task for the uplink of OFDMA-based cognitive radio (CR) systems is considered. The weighted sum-rate is maximized over subcarrier assignment as well as over power loading per CR user, while protecting primary user (PU) systems. However, due to the lack of explicit support from PU systems, the channels from CR users to the PU may not be accurately acquired. Thus, the PU interference constraint is posed as a chance constraint, for which conservative convex approximation is employed for tractability. In particular, to mitigate the combinatorial complexity incurred for optimal subcarrier assignment, a separable structure is pursued, and the dual decomposition method is adopted to obtain near-optimal solutions. Numerical tests verify that the proposed algorithms yield higher weighted sum-rate at lower computational complexity than a benchmark algorithm.</description><identifier>ISSN: 1536-1276</identifier><identifier>EISSN: 1558-2248</identifier><identifier>DOI: 10.1109/TWC.2013.011713.120155</identifier><identifier>CODEN: ITWCAX</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithms ; Applied sciences ; Approximation methods ; chance-constrained programming ; Channel estimation ; channel uncertainty ; Cognitive radio ; Cognitive radios ; Combinatorial analysis ; Complexity ; Exact sciences and technology ; Information, signal and communications theory ; Interference constraints ; Mathematical models ; Multiplexing ; Optimization ; orthogonal frequency-division multiple access ; Plutonium ; Radiocommunication specific techniques ; Radiocommunications ; resource allocation ; Signal and communications theory ; Subcarriers ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Transmission and modulation (techniques and equipments) ; Uncertainty ; Uplink</subject><ispartof>IEEE transactions on wireless communications, 2013-03, Vol.12 (3), p.1098-1107</ispartof><rights>2014 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Mar 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c399t-cc509e04c37858b5791b6cfac6410834dff0ed079bacbdf2df6d3f2c7416a6243</citedby><cites>FETCH-LOGICAL-c399t-cc509e04c37858b5791b6cfac6410834dff0ed079bacbdf2df6d3f2c7416a6243</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6416888$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6416888$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=27210882$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Soltani, N. Y.</creatorcontrib><creatorcontrib>Seung-Jun Kim</creatorcontrib><creatorcontrib>Giannakis, G. B.</creatorcontrib><title>Chance-Constrained Optimization of OFDMA Cognitive Radio Uplinks</title><title>IEEE transactions on wireless communications</title><addtitle>TWC</addtitle><description>A resource allocation task for the uplink of OFDMA-based cognitive radio (CR) systems is considered. The weighted sum-rate is maximized over subcarrier assignment as well as over power loading per CR user, while protecting primary user (PU) systems. However, due to the lack of explicit support from PU systems, the channels from CR users to the PU may not be accurately acquired. Thus, the PU interference constraint is posed as a chance constraint, for which conservative convex approximation is employed for tractability. In particular, to mitigate the combinatorial complexity incurred for optimal subcarrier assignment, a separable structure is pursued, and the dual decomposition method is adopted to obtain near-optimal solutions. Numerical tests verify that the proposed algorithms yield higher weighted sum-rate at lower computational complexity than a benchmark algorithm.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Approximation methods</subject><subject>chance-constrained programming</subject><subject>Channel estimation</subject><subject>channel uncertainty</subject><subject>Cognitive radio</subject><subject>Cognitive radios</subject><subject>Combinatorial analysis</subject><subject>Complexity</subject><subject>Exact sciences and technology</subject><subject>Information, signal and communications theory</subject><subject>Interference constraints</subject><subject>Mathematical models</subject><subject>Multiplexing</subject><subject>Optimization</subject><subject>orthogonal frequency-division multiple access</subject><subject>Plutonium</subject><subject>Radiocommunication specific techniques</subject><subject>Radiocommunications</subject><subject>resource allocation</subject><subject>Signal and communications theory</subject><subject>Subcarriers</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Transmission and modulation (techniques and equipments)</subject><subject>Uncertainty</subject><subject>Uplink</subject><issn>1536-1276</issn><issn>1558-2248</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkN9LwzAQgIsoOKd_gSAFEXzpzO-kb47qVJgMZMPHkKaJZnbNbDpB_3pTOnzw5e5CvjvuviS5gGACIchvlq_FBAGIJwBCHhOMD0oPklGMIkOIiMO-xiyDiLPj5CSENQCQM0pHyW3xrhptssI3oWuVa0yVLrad27gf1TnfpN6mi9nd8zQt_FvjOvdl0hdVOZ-utrVrPsJpcmRVHczZPo-T1ex-WTxm88XDUzGdZxrneZdpTUFuANGYCypKynNYMm2VZgQCgUllLTAV4HmpdFlZVFlWYYs0J5AphggeJ9fD3G3rP3cmdHLjgjZ1rRrjd0FCTHLCAQQoopf_0LXftU3cLlKIMMoBoJFiA6VbH0JrrNy2bqPabwmB7MXKKFb2YuUgVg5iY-PVfrwKWtW2jQJd-OtGHMWLRL_G-cA5Y8zfd7yXCSHwL0mif9M</recordid><startdate>20130301</startdate><enddate>20130301</enddate><creator>Soltani, N. Y.</creator><creator>Seung-Jun Kim</creator><creator>Giannakis, G. B.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20130301</creationdate><title>Chance-Constrained Optimization of OFDMA Cognitive Radio Uplinks</title><author>Soltani, N. Y. ; Seung-Jun Kim ; Giannakis, G. B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c399t-cc509e04c37858b5791b6cfac6410834dff0ed079bacbdf2df6d3f2c7416a6243</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Approximation methods</topic><topic>chance-constrained programming</topic><topic>Channel estimation</topic><topic>channel uncertainty</topic><topic>Cognitive radio</topic><topic>Cognitive radios</topic><topic>Combinatorial analysis</topic><topic>Complexity</topic><topic>Exact sciences and technology</topic><topic>Information, signal and communications theory</topic><topic>Interference constraints</topic><topic>Mathematical models</topic><topic>Multiplexing</topic><topic>Optimization</topic><topic>orthogonal frequency-division multiple access</topic><topic>Plutonium</topic><topic>Radiocommunication specific techniques</topic><topic>Radiocommunications</topic><topic>resource allocation</topic><topic>Signal and communications theory</topic><topic>Subcarriers</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Transmission and modulation (techniques and equipments)</topic><topic>Uncertainty</topic><topic>Uplink</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Soltani, N. Y.</creatorcontrib><creatorcontrib>Seung-Jun Kim</creatorcontrib><creatorcontrib>Giannakis, G. B.</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>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications 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><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on wireless communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Soltani, N. Y.</au><au>Seung-Jun Kim</au><au>Giannakis, G. B.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Chance-Constrained Optimization of OFDMA Cognitive Radio Uplinks</atitle><jtitle>IEEE transactions on wireless communications</jtitle><stitle>TWC</stitle><date>2013-03-01</date><risdate>2013</risdate><volume>12</volume><issue>3</issue><spage>1098</spage><epage>1107</epage><pages>1098-1107</pages><issn>1536-1276</issn><eissn>1558-2248</eissn><coden>ITWCAX</coden><abstract>A resource allocation task for the uplink of OFDMA-based cognitive radio (CR) systems is considered. The weighted sum-rate is maximized over subcarrier assignment as well as over power loading per CR user, while protecting primary user (PU) systems. However, due to the lack of explicit support from PU systems, the channels from CR users to the PU may not be accurately acquired. Thus, the PU interference constraint is posed as a chance constraint, for which conservative convex approximation is employed for tractability. In particular, to mitigate the combinatorial complexity incurred for optimal subcarrier assignment, a separable structure is pursued, and the dual decomposition method is adopted to obtain near-optimal solutions. Numerical tests verify that the proposed algorithms yield higher weighted sum-rate at lower computational complexity than a benchmark algorithm.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TWC.2013.011713.120155</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1536-1276 |
| ispartof | IEEE transactions on wireless communications, 2013-03, Vol.12 (3), p.1098-1107 |
| issn | 1536-1276 1558-2248 |
| language | eng |
| recordid | cdi_ieee_primary_6416888 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Applied sciences Approximation methods chance-constrained programming Channel estimation channel uncertainty Cognitive radio Cognitive radios Combinatorial analysis Complexity Exact sciences and technology Information, signal and communications theory Interference constraints Mathematical models Multiplexing Optimization orthogonal frequency-division multiple access Plutonium Radiocommunication specific techniques Radiocommunications resource allocation Signal and communications theory Subcarriers Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) Uncertainty Uplink |
| title | Chance-Constrained Optimization of OFDMA Cognitive Radio Uplinks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T16%3A10%3A41IST&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=Chance-Constrained%20Optimization%20of%20OFDMA%20Cognitive%20Radio%20Uplinks&rft.jtitle=IEEE%20transactions%20on%20wireless%20communications&rft.au=Soltani,%20N.%20Y.&rft.date=2013-03-01&rft.volume=12&rft.issue=3&rft.spage=1098&rft.epage=1107&rft.pages=1098-1107&rft.issn=1536-1276&rft.eissn=1558-2248&rft.coden=ITWCAX&rft_id=info:doi/10.1109/TWC.2013.011713.120155&rft_dat=%3Cproquest_RIE%3E2939669611%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=1324657005&rft_id=info:pmid/&rft_ieee_id=6416888&rfr_iscdi=true |