Resource Allocation for D2D Communication With Multiple D2D Pairs Reusing Multiple Channels

In this letter, the goal is to maximize sum capacity of device-to-device (D2D) communication through a reuse of each radio channel by multiple D2D pairs while each D2D pair can access multiple channels. Since existing approaches cannot be easily extended to enable reuse of multiple channels by multi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE wireless communications letters 2019-08, Vol.8 (4), p.1008-1011
Hauptverfasser: Mach, Pavel, Becvar, Zdenek, Najla, Mehyar
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 1011
container_issue 4
container_start_page 1008
container_title IEEE wireless communications letters
container_volume 8
creator Mach, Pavel
Becvar, Zdenek
Najla, Mehyar
description In this letter, the goal is to maximize sum capacity of device-to-device (D2D) communication through a reuse of each radio channel by multiple D2D pairs while each D2D pair can access multiple channels. Since existing approaches cannot be easily extended to enable reuse of multiple channels by multiple D2D pairs in scenario with a high interference among the D2D pairs, we propose a novel resource allocation consisting of two phases. In an initial phase, all available channels are assigned by the Hungarian algorithm so that each channel is occupied by just one D2D pair. In a reuse phase, multiple D2D pairs are sequentially added to the individual channels according to their priority expressed by channel quality and received interference from already added D2D pairs. The proposal significantly outperforms existing solutions and reaches close to theoretical upper bound capacity despite a very low complexity of the proposed algorithm.
doi_str_mv 10.1109/LWC.2019.2903798
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_2278394757</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8662689</ieee_id><sourcerecordid>2278394757</sourcerecordid><originalsourceid>FETCH-LOGICAL-c291t-24b0856de8e20f202f80fc97df16b7cd5f162d4457e97444dc9a1faf22eb5f373</originalsourceid><addsrcrecordid>eNpFUE1Lw0AQXUTBUnsXvAQ8p-5ONvtxLKlfEFGK0oOHJU1m7ZY0qbvJwX9vakudyxvmvTfDPEKuGZ0yRvVdvsymQJmegqaJ1OqMjIAJiCHh6fmpT-QlmYSwoUMJyoCpEflcYGh7X2I0q-u2LDrXNpFtfTSHeZS1223fuON06bp19NLXndvV-Me_Fc6HaIF9cM3XP5Wti6bBOlyRC1vUASdHHJOPh_v37CnOXx-fs1kel6BZFwNfUZWKChUCtUDBKmpLLSvLxEqWVTogVJynErXknFelLpgtLACuUpvIZExuD3t3vv3uMXRmM7zUDCcNgFSJ5jLdq-hBVfo2BI_W7LzbFv7HMGr2KZohRbNP0RxTHCw3B4tDxJNcCQFC6eQXvaZs7w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2278394757</pqid></control><display><type>article</type><title>Resource Allocation for D2D Communication With Multiple D2D Pairs Reusing Multiple Channels</title><source>IEEE Electronic Library (IEL)</source><creator>Mach, Pavel ; Becvar, Zdenek ; Najla, Mehyar</creator><creatorcontrib>Mach, Pavel ; Becvar, Zdenek ; Najla, Mehyar</creatorcontrib><description>In this letter, the goal is to maximize sum capacity of device-to-device (D2D) communication through a reuse of each radio channel by multiple D2D pairs while each D2D pair can access multiple channels. Since existing approaches cannot be easily extended to enable reuse of multiple channels by multiple D2D pairs in scenario with a high interference among the D2D pairs, we propose a novel resource allocation consisting of two phases. In an initial phase, all available channels are assigned by the Hungarian algorithm so that each channel is occupied by just one D2D pair. In a reuse phase, multiple D2D pairs are sequentially added to the individual channels according to their priority expressed by channel quality and received interference from already added D2D pairs. The proposal significantly outperforms existing solutions and reaches close to theoretical upper bound capacity despite a very low complexity of the proposed algorithm.</description><identifier>ISSN: 2162-2337</identifier><identifier>EISSN: 2162-2345</identifier><identifier>DOI: 10.1109/LWC.2019.2903798</identifier><identifier>CODEN: IWCLAF</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>Algorithms ; Artificial neural networks ; capacity ; Channel allocation ; Channels ; Complexity theory ; Device-to-device ; Device-to-device communication ; Interference ; multiple channels reuse ; Resource allocation ; Resource management ; Reuse ; Upper bound ; Upper bounds</subject><ispartof>IEEE wireless communications letters, 2019-08, Vol.8 (4), p.1008-1011</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c291t-24b0856de8e20f202f80fc97df16b7cd5f162d4457e97444dc9a1faf22eb5f373</citedby><cites>FETCH-LOGICAL-c291t-24b0856de8e20f202f80fc97df16b7cd5f162d4457e97444dc9a1faf22eb5f373</cites><orcidid>0000-0003-2961-6389 ; 0000-0001-5155-8192</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8662689$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8662689$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Mach, Pavel</creatorcontrib><creatorcontrib>Becvar, Zdenek</creatorcontrib><creatorcontrib>Najla, Mehyar</creatorcontrib><title>Resource Allocation for D2D Communication With Multiple D2D Pairs Reusing Multiple Channels</title><title>IEEE wireless communications letters</title><addtitle>LWC</addtitle><description>In this letter, the goal is to maximize sum capacity of device-to-device (D2D) communication through a reuse of each radio channel by multiple D2D pairs while each D2D pair can access multiple channels. Since existing approaches cannot be easily extended to enable reuse of multiple channels by multiple D2D pairs in scenario with a high interference among the D2D pairs, we propose a novel resource allocation consisting of two phases. In an initial phase, all available channels are assigned by the Hungarian algorithm so that each channel is occupied by just one D2D pair. In a reuse phase, multiple D2D pairs are sequentially added to the individual channels according to their priority expressed by channel quality and received interference from already added D2D pairs. The proposal significantly outperforms existing solutions and reaches close to theoretical upper bound capacity despite a very low complexity of the proposed algorithm.</description><subject>Algorithms</subject><subject>Artificial neural networks</subject><subject>capacity</subject><subject>Channel allocation</subject><subject>Channels</subject><subject>Complexity theory</subject><subject>Device-to-device</subject><subject>Device-to-device communication</subject><subject>Interference</subject><subject>multiple channels reuse</subject><subject>Resource allocation</subject><subject>Resource management</subject><subject>Reuse</subject><subject>Upper bound</subject><subject>Upper bounds</subject><issn>2162-2337</issn><issn>2162-2345</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpFUE1Lw0AQXUTBUnsXvAQ8p-5ONvtxLKlfEFGK0oOHJU1m7ZY0qbvJwX9vakudyxvmvTfDPEKuGZ0yRvVdvsymQJmegqaJ1OqMjIAJiCHh6fmpT-QlmYSwoUMJyoCpEflcYGh7X2I0q-u2LDrXNpFtfTSHeZS1223fuON06bp19NLXndvV-Me_Fc6HaIF9cM3XP5Wti6bBOlyRC1vUASdHHJOPh_v37CnOXx-fs1kel6BZFwNfUZWKChUCtUDBKmpLLSvLxEqWVTogVJynErXknFelLpgtLACuUpvIZExuD3t3vv3uMXRmM7zUDCcNgFSJ5jLdq-hBVfo2BI_W7LzbFv7HMGr2KZohRbNP0RxTHCw3B4tDxJNcCQFC6eQXvaZs7w</recordid><startdate>20190801</startdate><enddate>20190801</enddate><creator>Mach, Pavel</creator><creator>Becvar, Zdenek</creator><creator>Najla, Mehyar</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><orcidid>https://orcid.org/0000-0003-2961-6389</orcidid><orcidid>https://orcid.org/0000-0001-5155-8192</orcidid></search><sort><creationdate>20190801</creationdate><title>Resource Allocation for D2D Communication With Multiple D2D Pairs Reusing Multiple Channels</title><author>Mach, Pavel ; Becvar, Zdenek ; Najla, Mehyar</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c291t-24b0856de8e20f202f80fc97df16b7cd5f162d4457e97444dc9a1faf22eb5f373</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Artificial neural networks</topic><topic>capacity</topic><topic>Channel allocation</topic><topic>Channels</topic><topic>Complexity theory</topic><topic>Device-to-device</topic><topic>Device-to-device communication</topic><topic>Interference</topic><topic>multiple channels reuse</topic><topic>Resource allocation</topic><topic>Resource management</topic><topic>Reuse</topic><topic>Upper bound</topic><topic>Upper bounds</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mach, Pavel</creatorcontrib><creatorcontrib>Becvar, Zdenek</creatorcontrib><creatorcontrib>Najla, Mehyar</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 &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE wireless communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Mach, Pavel</au><au>Becvar, Zdenek</au><au>Najla, Mehyar</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Resource Allocation for D2D Communication With Multiple D2D Pairs Reusing Multiple Channels</atitle><jtitle>IEEE wireless communications letters</jtitle><stitle>LWC</stitle><date>2019-08-01</date><risdate>2019</risdate><volume>8</volume><issue>4</issue><spage>1008</spage><epage>1011</epage><pages>1008-1011</pages><issn>2162-2337</issn><eissn>2162-2345</eissn><coden>IWCLAF</coden><abstract>In this letter, the goal is to maximize sum capacity of device-to-device (D2D) communication through a reuse of each radio channel by multiple D2D pairs while each D2D pair can access multiple channels. Since existing approaches cannot be easily extended to enable reuse of multiple channels by multiple D2D pairs in scenario with a high interference among the D2D pairs, we propose a novel resource allocation consisting of two phases. In an initial phase, all available channels are assigned by the Hungarian algorithm so that each channel is occupied by just one D2D pair. In a reuse phase, multiple D2D pairs are sequentially added to the individual channels according to their priority expressed by channel quality and received interference from already added D2D pairs. The proposal significantly outperforms existing solutions and reaches close to theoretical upper bound capacity despite a very low complexity of the proposed algorithm.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/LWC.2019.2903798</doi><tpages>4</tpages><orcidid>https://orcid.org/0000-0003-2961-6389</orcidid><orcidid>https://orcid.org/0000-0001-5155-8192</orcidid></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 2162-2337
ispartof IEEE wireless communications letters, 2019-08, Vol.8 (4), p.1008-1011
issn 2162-2337
2162-2345
language eng
recordid cdi_proquest_journals_2278394757
source IEEE Electronic Library (IEL)
subjects Algorithms
Artificial neural networks
capacity
Channel allocation
Channels
Complexity theory
Device-to-device
Device-to-device communication
Interference
multiple channels reuse
Resource allocation
Resource management
Reuse
Upper bound
Upper bounds
title Resource Allocation for D2D Communication With Multiple D2D Pairs Reusing Multiple Channels
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T04%3A24%3A09IST&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=Resource%20Allocation%20for%20D2D%20Communication%20With%20Multiple%20D2D%20Pairs%20Reusing%20Multiple%20Channels&rft.jtitle=IEEE%20wireless%20communications%20letters&rft.au=Mach,%20Pavel&rft.date=2019-08-01&rft.volume=8&rft.issue=4&rft.spage=1008&rft.epage=1011&rft.pages=1008-1011&rft.issn=2162-2337&rft.eissn=2162-2345&rft.coden=IWCLAF&rft_id=info:doi/10.1109/LWC.2019.2903798&rft_dat=%3Cproquest_RIE%3E2278394757%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=2278394757&rft_id=info:pmid/&rft_ieee_id=8662689&rfr_iscdi=true