Joint Channel and Power Allocation Based on Generalized Nash Bargaining Solution in Device-to-Device Communication
In this paper, a new generalized Nash bargaining framework is proposed for joint channel and power allocation in device-to-device (D2D) communication underlying cellular networks. In the considered system, cellular users (CUs) must jointly determine to share radio resources with D2D users (DUs) and...
Gespeichert in:
| Veröffentlicht in: | IEEE access 2019, Vol.7, p.172571-172583 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 172583 |
|---|---|
| container_issue | |
| container_start_page | 172571 |
| container_title | IEEE access |
| container_volume | 7 |
| creator | Wang, Gang Liu, Tanhui Zhao, Chenguang |
| description | In this paper, a new generalized Nash bargaining framework is proposed for joint channel and power allocation in device-to-device (D2D) communication underlying cellular networks. In the considered system, cellular users (CUs) must jointly determine to share radio resources with D2D users (DUs) and to charge the DUs accordingly. The proposed framework aims to maximize the overall throughput of the communication system by guaranteeing the minimum rate of each CU and proportional fairness and efficient power allocation among the CUs and DUs. To make this NP-hard problem more tractable, it is decomposed into two sub-problems: channel assignment and power allocation. First, an optimal channel assignment strategy is derived using a max-weighted max-flow algorithm. Then, the optimal power allocation strategy for both DUs and CUs is analyzed using the Lagrangian multiplier method. Numerical results are presented to show the throughput performance characteristics of different resource allocation solutions. Comparisons between the proposed and traditional policies show the significant effect of fairness on the transmission performance. |
| doi_str_mv | 10.1109/ACCESS.2019.2956749 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_8918091</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8918091</ieee_id><doaj_id>oai_doaj_org_article_d67ada56eda948c9a5554cca49fb90ae</doaj_id><sourcerecordid>2455616609</sourcerecordid><originalsourceid>FETCH-LOGICAL-c408t-64759418a370698080ef87a7b62b1a987b53bf384bb214d03ba2a61373a7c8b43</originalsourceid><addsrcrecordid>eNpNUU1v1DAUjBBIVKW_oBdLnLPY8fdxCaUUVYC0cLaenZetV1m7OFkQ_HrcpqrwxfPGM_MsTdNcMrphjNp3276_2u02HWV201mptLAvmrOOKdtyydXL__Dr5mKeD7QeUympz5ryOce0kP4OUsKJQBrIt_wbC9lOUw6wxJzIe5hxIBVcY8ICU_xbxy8w39WXsoeYYtqTXZ5Oj-qYyAf8FQO2S25XRPp8PJ5SXPPeNK9GmGa8eLrPmx8fr773n9rbr9c3_fa2DYKapVVCSyuYAa6psoYaiqPRoL3qPANrtJfcj9wI7zsmBso9dKAY1xx0MF7w8-ZmzR0yHNx9iUcof1yG6B6JXPYOyhLDhG5QGgaQCgewwgQLUkoRAgg7eksBa9bbNeu-5J8nnBd3yKeS6vddJ6RUTClqq4qvqlDyPBccn7cy6h66cmtX7qEr99RVdV2uroiIzw5jmaGW8X95z4_L</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2455616609</pqid></control><display><type>article</type><title>Joint Channel and Power Allocation Based on Generalized Nash Bargaining Solution in Device-to-Device Communication</title><source>IEEE Open Access Journals</source><source>DOAJ Directory of Open Access Journals</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Wang, Gang ; Liu, Tanhui ; Zhao, Chenguang</creator><creatorcontrib>Wang, Gang ; Liu, Tanhui ; Zhao, Chenguang</creatorcontrib><description>In this paper, a new generalized Nash bargaining framework is proposed for joint channel and power allocation in device-to-device (D2D) communication underlying cellular networks. In the considered system, cellular users (CUs) must jointly determine to share radio resources with D2D users (DUs) and to charge the DUs accordingly. The proposed framework aims to maximize the overall throughput of the communication system by guaranteeing the minimum rate of each CU and proportional fairness and efficient power allocation among the CUs and DUs. To make this NP-hard problem more tractable, it is decomposed into two sub-problems: channel assignment and power allocation. First, an optimal channel assignment strategy is derived using a max-weighted max-flow algorithm. Then, the optimal power allocation strategy for both DUs and CUs is analyzed using the Lagrangian multiplier method. Numerical results are presented to show the throughput performance characteristics of different resource allocation solutions. Comparisons between the proposed and traditional policies show the significant effect of fairness on the transmission performance.</description><identifier>ISSN: 2169-3536</identifier><identifier>EISSN: 2169-3536</identifier><identifier>DOI: 10.1109/ACCESS.2019.2956749</identifier><identifier>CODEN: IAECCG</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>Algorithms ; Cellular communication ; Cellular networks ; Channel allocation ; channel assignment ; Communication ; Communications systems ; Copper ; D2D communication ; Device-to-device communication ; generalized Nash bargaining solution ; Interference ; NIST ; power allocation ; Power management ; Resource allocation ; Resource management</subject><ispartof>IEEE access, 2019, Vol.7, p.172571-172583</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c408t-64759418a370698080ef87a7b62b1a987b53bf384bb214d03ba2a61373a7c8b43</citedby><cites>FETCH-LOGICAL-c408t-64759418a370698080ef87a7b62b1a987b53bf384bb214d03ba2a61373a7c8b43</cites><orcidid>0000-0002-0185-2542 ; 0000-0002-7336-3625 ; 0000-0001-6326-7114</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8918091$$EHTML$$P50$$Gieee$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,864,2102,4024,27633,27923,27924,27925,54933</link.rule.ids></links><search><creatorcontrib>Wang, Gang</creatorcontrib><creatorcontrib>Liu, Tanhui</creatorcontrib><creatorcontrib>Zhao, Chenguang</creatorcontrib><title>Joint Channel and Power Allocation Based on Generalized Nash Bargaining Solution in Device-to-Device Communication</title><title>IEEE access</title><addtitle>Access</addtitle><description>In this paper, a new generalized Nash bargaining framework is proposed for joint channel and power allocation in device-to-device (D2D) communication underlying cellular networks. In the considered system, cellular users (CUs) must jointly determine to share radio resources with D2D users (DUs) and to charge the DUs accordingly. The proposed framework aims to maximize the overall throughput of the communication system by guaranteeing the minimum rate of each CU and proportional fairness and efficient power allocation among the CUs and DUs. To make this NP-hard problem more tractable, it is decomposed into two sub-problems: channel assignment and power allocation. First, an optimal channel assignment strategy is derived using a max-weighted max-flow algorithm. Then, the optimal power allocation strategy for both DUs and CUs is analyzed using the Lagrangian multiplier method. Numerical results are presented to show the throughput performance characteristics of different resource allocation solutions. Comparisons between the proposed and traditional policies show the significant effect of fairness on the transmission performance.</description><subject>Algorithms</subject><subject>Cellular communication</subject><subject>Cellular networks</subject><subject>Channel allocation</subject><subject>channel assignment</subject><subject>Communication</subject><subject>Communications systems</subject><subject>Copper</subject><subject>D2D communication</subject><subject>Device-to-device communication</subject><subject>generalized Nash bargaining solution</subject><subject>Interference</subject><subject>NIST</subject><subject>power allocation</subject><subject>Power management</subject><subject>Resource allocation</subject><subject>Resource management</subject><issn>2169-3536</issn><issn>2169-3536</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>ESBDL</sourceid><sourceid>RIE</sourceid><sourceid>DOA</sourceid><recordid>eNpNUU1v1DAUjBBIVKW_oBdLnLPY8fdxCaUUVYC0cLaenZetV1m7OFkQ_HrcpqrwxfPGM_MsTdNcMrphjNp3276_2u02HWV201mptLAvmrOOKdtyydXL__Dr5mKeD7QeUympz5ryOce0kP4OUsKJQBrIt_wbC9lOUw6wxJzIe5hxIBVcY8ICU_xbxy8w39WXsoeYYtqTXZ5Oj-qYyAf8FQO2S25XRPp8PJ5SXPPeNK9GmGa8eLrPmx8fr773n9rbr9c3_fa2DYKapVVCSyuYAa6psoYaiqPRoL3qPANrtJfcj9wI7zsmBso9dKAY1xx0MF7w8-ZmzR0yHNx9iUcof1yG6B6JXPYOyhLDhG5QGgaQCgewwgQLUkoRAgg7eksBa9bbNeu-5J8nnBd3yKeS6vddJ6RUTClqq4qvqlDyPBccn7cy6h66cmtX7qEr99RVdV2uroiIzw5jmaGW8X95z4_L</recordid><startdate>2019</startdate><enddate>2019</enddate><creator>Wang, Gang</creator><creator>Liu, Tanhui</creator><creator>Zhao, Chenguang</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>ESBDL</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7SR</scope><scope>8BQ</scope><scope>8FD</scope><scope>JG9</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0002-0185-2542</orcidid><orcidid>https://orcid.org/0000-0002-7336-3625</orcidid><orcidid>https://orcid.org/0000-0001-6326-7114</orcidid></search><sort><creationdate>2019</creationdate><title>Joint Channel and Power Allocation Based on Generalized Nash Bargaining Solution in Device-to-Device Communication</title><author>Wang, Gang ; Liu, Tanhui ; Zhao, Chenguang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c408t-64759418a370698080ef87a7b62b1a987b53bf384bb214d03ba2a61373a7c8b43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Cellular communication</topic><topic>Cellular networks</topic><topic>Channel allocation</topic><topic>channel assignment</topic><topic>Communication</topic><topic>Communications systems</topic><topic>Copper</topic><topic>D2D communication</topic><topic>Device-to-device communication</topic><topic>generalized Nash bargaining solution</topic><topic>Interference</topic><topic>NIST</topic><topic>power allocation</topic><topic>Power management</topic><topic>Resource allocation</topic><topic>Resource management</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Gang</creatorcontrib><creatorcontrib>Liu, Tanhui</creatorcontrib><creatorcontrib>Zhao, Chenguang</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005–Present</collection><collection>IEEE Open Access Journals</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>Electronics & Communications Abstracts</collection><collection>Engineered Materials Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>Materials 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>DOAJ Directory of Open Access Journals</collection><jtitle>IEEE access</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Gang</au><au>Liu, Tanhui</au><au>Zhao, Chenguang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Joint Channel and Power Allocation Based on Generalized Nash Bargaining Solution in Device-to-Device Communication</atitle><jtitle>IEEE access</jtitle><stitle>Access</stitle><date>2019</date><risdate>2019</risdate><volume>7</volume><spage>172571</spage><epage>172583</epage><pages>172571-172583</pages><issn>2169-3536</issn><eissn>2169-3536</eissn><coden>IAECCG</coden><abstract>In this paper, a new generalized Nash bargaining framework is proposed for joint channel and power allocation in device-to-device (D2D) communication underlying cellular networks. In the considered system, cellular users (CUs) must jointly determine to share radio resources with D2D users (DUs) and to charge the DUs accordingly. The proposed framework aims to maximize the overall throughput of the communication system by guaranteeing the minimum rate of each CU and proportional fairness and efficient power allocation among the CUs and DUs. To make this NP-hard problem more tractable, it is decomposed into two sub-problems: channel assignment and power allocation. First, an optimal channel assignment strategy is derived using a max-weighted max-flow algorithm. Then, the optimal power allocation strategy for both DUs and CUs is analyzed using the Lagrangian multiplier method. Numerical results are presented to show the throughput performance characteristics of different resource allocation solutions. Comparisons between the proposed and traditional policies show the significant effect of fairness on the transmission performance.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/ACCESS.2019.2956749</doi><tpages>13</tpages><orcidid>https://orcid.org/0000-0002-0185-2542</orcidid><orcidid>https://orcid.org/0000-0002-7336-3625</orcidid><orcidid>https://orcid.org/0000-0001-6326-7114</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 2169-3536 |
| ispartof | IEEE access, 2019, Vol.7, p.172571-172583 |
| issn | 2169-3536 2169-3536 |
| language | eng |
| recordid | cdi_ieee_primary_8918091 |
| source | IEEE Open Access Journals; DOAJ Directory of Open Access Journals; EZB-FREE-00999 freely available EZB journals |
| subjects | Algorithms Cellular communication Cellular networks Channel allocation channel assignment Communication Communications systems Copper D2D communication Device-to-device communication generalized Nash bargaining solution Interference NIST power allocation Power management Resource allocation Resource management |
| title | Joint Channel and Power Allocation Based on Generalized Nash Bargaining Solution in Device-to-Device Communication |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T18%3A43%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Joint%20Channel%20and%20Power%20Allocation%20Based%20on%20Generalized%20Nash%20Bargaining%20Solution%20in%20Device-to-Device%20Communication&rft.jtitle=IEEE%20access&rft.au=Wang,%20Gang&rft.date=2019&rft.volume=7&rft.spage=172571&rft.epage=172583&rft.pages=172571-172583&rft.issn=2169-3536&rft.eissn=2169-3536&rft.coden=IAECCG&rft_id=info:doi/10.1109/ACCESS.2019.2956749&rft_dat=%3Cproquest_ieee_%3E2455616609%3C/proquest_ieee_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2455616609&rft_id=info:pmid/&rft_ieee_id=8918091&rft_doaj_id=oai_doaj_org_article_d67ada56eda948c9a5554cca49fb90ae&rfr_iscdi=true |