An Optimal Resource Allocation Method for Multi-User Multi-Relay DF Cognitive Radio Networks
This letter investigates the resource optimization problem for the multi-user multi-relay decode-forward (DF) cognitive radio networks. The novel optimization metric, namely the bandwidth-power product (BPP), is applied to achieve the optimal spectrum sharing. The formulated problem is found to be a...
Gespeichert in:
| Veröffentlicht in: | IEEE communications letters 2016-06, Vol.20 (6), p.1164-1167 |
|---|---|
| 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 | 1167 |
|---|---|
| container_issue | 6 |
| container_start_page | 1164 |
| container_title | IEEE communications letters |
| container_volume | 20 |
| creator | Chen, Bo Lei, Ming Zhao, Minjian |
| description | This letter investigates the resource optimization problem for the multi-user multi-relay decode-forward (DF) cognitive radio networks. The novel optimization metric, namely the bandwidth-power product (BPP), is applied to achieve the optimal spectrum sharing. The formulated problem is found to be a mixed-integer programming problem. Hence, a suboptimal and tractable algorithm with low complexity called the joint optimal relay matching and greedy resource allocation (JRMRA) algorithm is proposed. The optimal relay selection is first regulated by solving the equivalent maximum weighted bipartite matching (MWBM) problem with the Hungarian method in terms of statistic expectation. Then applying the greedy-based clustering method, the resource allocation is performed to minimize the overall BPP. Simulation results show that the JRMRA algorithm achieves the acceptable performance with great reduction of computational complexity and validate the superiority of the proposed scheme compared to conventional spectrum sharing scheme using the water-filling method. |
| doi_str_mv | 10.1109/LCOMM.2016.2531699 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_1795932477</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7412689</ieee_id><sourcerecordid>4086964681</sourcerecordid><originalsourceid>FETCH-LOGICAL-c328t-74c5bf6779508fab3fa2f0308a44d2606bf7831a279ba2e75d8bba764d011e523</originalsourceid><addsrcrecordid>eNpdkMtOwzAQRSMEEqXwA7CxxIZNih_xa1kVCkgNlSq6Q7KcZAIpIS5xAurf49LCgs3MLO6duXOi6JzgESFYX88m8zQdUUzEiHJGhNYH0YBwrmIaymGYsdKxlFodRyferzDGinIyiJ7HDZqvu-rd1mgB3vVtDmhc1y63XeUalEL36gpUuhalfd1V8dLD77iA2m7QzRRN3EtTddUnoIUtKoceofty7Zs_jY5KW3s42_dhtJzePk3u49n87mEynsU5o6qLZZLzrBQhHceqtBkrLS0xw8omSUEFFlkpFSOWSp1ZCpIXKsusFEmBCQFO2TC62u1dt-6jB9-Z98rnUNe2Add7Q8KviRZYiiC9_CddhZ-bkM6QcF8zmkgZVHSnylvnfQulWbcBUbsxBJstcPMD3GyBmz3wYLrYmSoA-DPIhFChNPsGHlF7Tg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1795932477</pqid></control><display><type>article</type><title>An Optimal Resource Allocation Method for Multi-User Multi-Relay DF Cognitive Radio Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Chen, Bo ; Lei, Ming ; Zhao, Minjian</creator><creatorcontrib>Chen, Bo ; Lei, Ming ; Zhao, Minjian</creatorcontrib><description>This letter investigates the resource optimization problem for the multi-user multi-relay decode-forward (DF) cognitive radio networks. The novel optimization metric, namely the bandwidth-power product (BPP), is applied to achieve the optimal spectrum sharing. The formulated problem is found to be a mixed-integer programming problem. Hence, a suboptimal and tractable algorithm with low complexity called the joint optimal relay matching and greedy resource allocation (JRMRA) algorithm is proposed. The optimal relay selection is first regulated by solving the equivalent maximum weighted bipartite matching (MWBM) problem with the Hungarian method in terms of statistic expectation. Then applying the greedy-based clustering method, the resource allocation is performed to minimize the overall BPP. Simulation results show that the JRMRA algorithm achieves the acceptable performance with great reduction of computational complexity and validate the superiority of the proposed scheme compared to conventional spectrum sharing scheme using the water-filling method.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2016.2531699</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Bandwidth-Power Product ; Clustering methods ; Cognitive Radio ; Complexity ; Computational complexity ; Decode-Forward ; Matching ; Measurement ; Multi-user Multi-relay ; Networks ; Optimal Spectrum Sharing ; Optimization ; Relay ; Relays ; Resource allocation ; Resource management</subject><ispartof>IEEE communications letters, 2016-06, Vol.20 (6), p.1164-1167</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c328t-74c5bf6779508fab3fa2f0308a44d2606bf7831a279ba2e75d8bba764d011e523</citedby><cites>FETCH-LOGICAL-c328t-74c5bf6779508fab3fa2f0308a44d2606bf7831a279ba2e75d8bba764d011e523</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7412689$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7412689$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Chen, Bo</creatorcontrib><creatorcontrib>Lei, Ming</creatorcontrib><creatorcontrib>Zhao, Minjian</creatorcontrib><title>An Optimal Resource Allocation Method for Multi-User Multi-Relay DF Cognitive Radio Networks</title><title>IEEE communications letters</title><addtitle>COML</addtitle><description>This letter investigates the resource optimization problem for the multi-user multi-relay decode-forward (DF) cognitive radio networks. The novel optimization metric, namely the bandwidth-power product (BPP), is applied to achieve the optimal spectrum sharing. The formulated problem is found to be a mixed-integer programming problem. Hence, a suboptimal and tractable algorithm with low complexity called the joint optimal relay matching and greedy resource allocation (JRMRA) algorithm is proposed. The optimal relay selection is first regulated by solving the equivalent maximum weighted bipartite matching (MWBM) problem with the Hungarian method in terms of statistic expectation. Then applying the greedy-based clustering method, the resource allocation is performed to minimize the overall BPP. Simulation results show that the JRMRA algorithm achieves the acceptable performance with great reduction of computational complexity and validate the superiority of the proposed scheme compared to conventional spectrum sharing scheme using the water-filling method.</description><subject>Algorithms</subject><subject>Bandwidth-Power Product</subject><subject>Clustering methods</subject><subject>Cognitive Radio</subject><subject>Complexity</subject><subject>Computational complexity</subject><subject>Decode-Forward</subject><subject>Matching</subject><subject>Measurement</subject><subject>Multi-user Multi-relay</subject><subject>Networks</subject><subject>Optimal Spectrum Sharing</subject><subject>Optimization</subject><subject>Relay</subject><subject>Relays</subject><subject>Resource allocation</subject><subject>Resource management</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkMtOwzAQRSMEEqXwA7CxxIZNih_xa1kVCkgNlSq6Q7KcZAIpIS5xAurf49LCgs3MLO6duXOi6JzgESFYX88m8zQdUUzEiHJGhNYH0YBwrmIaymGYsdKxlFodRyferzDGinIyiJ7HDZqvu-rd1mgB3vVtDmhc1y63XeUalEL36gpUuhalfd1V8dLD77iA2m7QzRRN3EtTddUnoIUtKoceofty7Zs_jY5KW3s42_dhtJzePk3u49n87mEynsU5o6qLZZLzrBQhHceqtBkrLS0xw8omSUEFFlkpFSOWSp1ZCpIXKsusFEmBCQFO2TC62u1dt-6jB9-Z98rnUNe2Add7Q8KviRZYiiC9_CddhZ-bkM6QcF8zmkgZVHSnylvnfQulWbcBUbsxBJstcPMD3GyBmz3wYLrYmSoA-DPIhFChNPsGHlF7Tg</recordid><startdate>201606</startdate><enddate>201606</enddate><creator>Chen, Bo</creator><creator>Lei, Ming</creator><creator>Zhao, Minjian</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><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>201606</creationdate><title>An Optimal Resource Allocation Method for Multi-User Multi-Relay DF Cognitive Radio Networks</title><author>Chen, Bo ; Lei, Ming ; Zhao, Minjian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c328t-74c5bf6779508fab3fa2f0308a44d2606bf7831a279ba2e75d8bba764d011e523</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Bandwidth-Power Product</topic><topic>Clustering methods</topic><topic>Cognitive Radio</topic><topic>Complexity</topic><topic>Computational complexity</topic><topic>Decode-Forward</topic><topic>Matching</topic><topic>Measurement</topic><topic>Multi-user Multi-relay</topic><topic>Networks</topic><topic>Optimal Spectrum Sharing</topic><topic>Optimization</topic><topic>Relay</topic><topic>Relays</topic><topic>Resource allocation</topic><topic>Resource management</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chen, Bo</creatorcontrib><creatorcontrib>Lei, Ming</creatorcontrib><creatorcontrib>Zhao, Minjian</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><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chen, Bo</au><au>Lei, Ming</au><au>Zhao, Minjian</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Optimal Resource Allocation Method for Multi-User Multi-Relay DF Cognitive Radio Networks</atitle><jtitle>IEEE communications letters</jtitle><stitle>COML</stitle><date>2016-06</date><risdate>2016</risdate><volume>20</volume><issue>6</issue><spage>1164</spage><epage>1167</epage><pages>1164-1167</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>This letter investigates the resource optimization problem for the multi-user multi-relay decode-forward (DF) cognitive radio networks. The novel optimization metric, namely the bandwidth-power product (BPP), is applied to achieve the optimal spectrum sharing. The formulated problem is found to be a mixed-integer programming problem. Hence, a suboptimal and tractable algorithm with low complexity called the joint optimal relay matching and greedy resource allocation (JRMRA) algorithm is proposed. The optimal relay selection is first regulated by solving the equivalent maximum weighted bipartite matching (MWBM) problem with the Hungarian method in terms of statistic expectation. Then applying the greedy-based clustering method, the resource allocation is performed to minimize the overall BPP. Simulation results show that the JRMRA algorithm achieves the acceptable performance with great reduction of computational complexity and validate the superiority of the proposed scheme compared to conventional spectrum sharing scheme using the water-filling method.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2016.2531699</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1089-7798 |
| ispartof | IEEE communications letters, 2016-06, Vol.20 (6), p.1164-1167 |
| issn | 1089-7798 1558-2558 |
| language | eng |
| recordid | cdi_proquest_journals_1795932477 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Bandwidth-Power Product Clustering methods Cognitive Radio Complexity Computational complexity Decode-Forward Matching Measurement Multi-user Multi-relay Networks Optimal Spectrum Sharing Optimization Relay Relays Resource allocation Resource management |
| title | An Optimal Resource Allocation Method for Multi-User Multi-Relay DF 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-27T17%3A05%3A35IST&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=An%20Optimal%20Resource%20Allocation%20Method%20for%20Multi-User%20Multi-Relay%20DF%20Cognitive%20Radio%20Networks&rft.jtitle=IEEE%20communications%20letters&rft.au=Chen,%20Bo&rft.date=2016-06&rft.volume=20&rft.issue=6&rft.spage=1164&rft.epage=1167&rft.pages=1164-1167&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2016.2531699&rft_dat=%3Cproquest_RIE%3E4086964681%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=1795932477&rft_id=info:pmid/&rft_ieee_id=7412689&rfr_iscdi=true |