Graph-Theoretical Dynamic User Pairing for Downlink NOMA Systems
We propose a novel graph-theoretical dynamic user pairing strategy based on the user rate requirements in cellular networks employing non-orthogonal multiple access (NOMA). The proposed approach relies on first constructing a conflict graph corresponding to all possible user pairings and then reform...
Gespeichert in:
| Veröffentlicht in: | IEEE communications letters 2021-10, Vol.25 (10), p.3234-3238 |
|---|---|
| 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 | 3238 |
|---|---|
| container_issue | 10 |
| container_start_page | 3234 |
| container_title | IEEE communications letters |
| container_volume | 25 |
| creator | Kose, Alper Koca, Mutlu Anarim, Emin Medard, Muriel Gokcesu, Hakan |
| description | We propose a novel graph-theoretical dynamic user pairing strategy based on the user rate requirements in cellular networks employing non-orthogonal multiple access (NOMA). The proposed approach relies on first constructing a conflict graph corresponding to all possible user pairings and then reformulating the problem of finding the best user pairs as that of finding the maximum weighted independent set (MWIS) on the conflict graph. This formulation turns the originally NP-hard problem into one that can be solvable in polynomial time thanks to the claw-freeness property of the conflict graph. The proposed user pairing method satisfies the maximum number of user demands with optimal network sum-rate as shown theoretically and as validated by the simulation results. |
| doi_str_mv | 10.1109/LCOMM.2021.3102116 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_9504550</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9504550</ieee_id><sourcerecordid>2580102182</sourcerecordid><originalsourceid>FETCH-LOGICAL-c339t-365cdd2d724ec1c478ed77dbb9431401b725136fbb1577c7881e85f6f41566ee3</originalsourceid><addsrcrecordid>eNo9kF9PwjAUxRujiYh-AX1Z4vOwt13X7k0CiiYgJsJzs3V3UoQN2xGzb28R4su59-Gc--dHyC3QAQDNHqaj-Ww2YJTBgENQSM9ID4RQMQtyHnqqsljKTF2SK-_XlFLFBPTI48Tlu1W8WGHjsLUm30Tjrs631kRLjy56z62z9WdUNS4aNz_1xtZf0dt8Now-Ot_i1l-TiyrfeLw51T5ZPj8tRi_xdD55HQ2nseE8a2OeClOWrJQsQQMmkQpLKcuiyBIOCYVChnN4WhUFCCmNVApQiSqtEhBpisj75P44d-ea7z36Vq-bvavDSs2EooenFQsudnQZ13jvsNI7Z7e56zRQfSCl_0jpAyl9IhVCd8eQRcT_QCZoIgTlv3BxYvM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2580102182</pqid></control><display><type>article</type><title>Graph-Theoretical Dynamic User Pairing for Downlink NOMA Systems</title><source>IEEE Electronic Library (IEL)</source><creator>Kose, Alper ; Koca, Mutlu ; Anarim, Emin ; Medard, Muriel ; Gokcesu, Hakan</creator><creatorcontrib>Kose, Alper ; Koca, Mutlu ; Anarim, Emin ; Medard, Muriel ; Gokcesu, Hakan</creatorcontrib><description>We propose a novel graph-theoretical dynamic user pairing strategy based on the user rate requirements in cellular networks employing non-orthogonal multiple access (NOMA). The proposed approach relies on first constructing a conflict graph corresponding to all possible user pairings and then reformulating the problem of finding the best user pairs as that of finding the maximum weighted independent set (MWIS) on the conflict graph. This formulation turns the originally NP-hard problem into one that can be solvable in polynomial time thanks to the claw-freeness property of the conflict graph. The proposed user pairing method satisfies the maximum number of user demands with optimal network sum-rate as shown theoretically and as validated by the simulation results.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2021.3102116</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Benchmark testing ; Cellular communication ; Complexity theory ; conflict graph ; Downlink ; maximum weighted independent set ; NOMA ; Non-orthogonal multiple access ; Nonorthogonal multiple access ; Polynomials ; Resource management ; Signal to noise ratio ; Silicon carbide ; user pairing</subject><ispartof>IEEE communications letters, 2021-10, Vol.25 (10), p.3234-3238</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c339t-365cdd2d724ec1c478ed77dbb9431401b725136fbb1577c7881e85f6f41566ee3</citedby><cites>FETCH-LOGICAL-c339t-365cdd2d724ec1c478ed77dbb9431401b725136fbb1577c7881e85f6f41566ee3</cites><orcidid>0000-0002-1537-1205 ; 0000-0001-7572-3009 ; 0000-0002-3305-7674 ; 0000-0002-5113-0118 ; 0000-0003-4059-407X</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9504550$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9504550$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kose, Alper</creatorcontrib><creatorcontrib>Koca, Mutlu</creatorcontrib><creatorcontrib>Anarim, Emin</creatorcontrib><creatorcontrib>Medard, Muriel</creatorcontrib><creatorcontrib>Gokcesu, Hakan</creatorcontrib><title>Graph-Theoretical Dynamic User Pairing for Downlink NOMA Systems</title><title>IEEE communications letters</title><addtitle>LCOMM</addtitle><description>We propose a novel graph-theoretical dynamic user pairing strategy based on the user rate requirements in cellular networks employing non-orthogonal multiple access (NOMA). The proposed approach relies on first constructing a conflict graph corresponding to all possible user pairings and then reformulating the problem of finding the best user pairs as that of finding the maximum weighted independent set (MWIS) on the conflict graph. This formulation turns the originally NP-hard problem into one that can be solvable in polynomial time thanks to the claw-freeness property of the conflict graph. The proposed user pairing method satisfies the maximum number of user demands with optimal network sum-rate as shown theoretically and as validated by the simulation results.</description><subject>Benchmark testing</subject><subject>Cellular communication</subject><subject>Complexity theory</subject><subject>conflict graph</subject><subject>Downlink</subject><subject>maximum weighted independent set</subject><subject>NOMA</subject><subject>Non-orthogonal multiple access</subject><subject>Nonorthogonal multiple access</subject><subject>Polynomials</subject><subject>Resource management</subject><subject>Signal to noise ratio</subject><subject>Silicon carbide</subject><subject>user pairing</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kF9PwjAUxRujiYh-AX1Z4vOwt13X7k0CiiYgJsJzs3V3UoQN2xGzb28R4su59-Gc--dHyC3QAQDNHqaj-Ww2YJTBgENQSM9ID4RQMQtyHnqqsljKTF2SK-_XlFLFBPTI48Tlu1W8WGHjsLUm30Tjrs631kRLjy56z62z9WdUNS4aNz_1xtZf0dt8Now-Ot_i1l-TiyrfeLw51T5ZPj8tRi_xdD55HQ2nseE8a2OeClOWrJQsQQMmkQpLKcuiyBIOCYVChnN4WhUFCCmNVApQiSqtEhBpisj75P44d-ea7z36Vq-bvavDSs2EooenFQsudnQZ13jvsNI7Z7e56zRQfSCl_0jpAyl9IhVCd8eQRcT_QCZoIgTlv3BxYvM</recordid><startdate>20211001</startdate><enddate>20211001</enddate><creator>Kose, Alper</creator><creator>Koca, Mutlu</creator><creator>Anarim, Emin</creator><creator>Medard, Muriel</creator><creator>Gokcesu, Hakan</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-0002-1537-1205</orcidid><orcidid>https://orcid.org/0000-0001-7572-3009</orcidid><orcidid>https://orcid.org/0000-0002-3305-7674</orcidid><orcidid>https://orcid.org/0000-0002-5113-0118</orcidid><orcidid>https://orcid.org/0000-0003-4059-407X</orcidid></search><sort><creationdate>20211001</creationdate><title>Graph-Theoretical Dynamic User Pairing for Downlink NOMA Systems</title><author>Kose, Alper ; Koca, Mutlu ; Anarim, Emin ; Medard, Muriel ; Gokcesu, Hakan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c339t-365cdd2d724ec1c478ed77dbb9431401b725136fbb1577c7881e85f6f41566ee3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Benchmark testing</topic><topic>Cellular communication</topic><topic>Complexity theory</topic><topic>conflict graph</topic><topic>Downlink</topic><topic>maximum weighted independent set</topic><topic>NOMA</topic><topic>Non-orthogonal multiple access</topic><topic>Nonorthogonal multiple access</topic><topic>Polynomials</topic><topic>Resource management</topic><topic>Signal to noise ratio</topic><topic>Silicon carbide</topic><topic>user pairing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kose, Alper</creatorcontrib><creatorcontrib>Koca, Mutlu</creatorcontrib><creatorcontrib>Anarim, Emin</creatorcontrib><creatorcontrib>Medard, Muriel</creatorcontrib><creatorcontrib>Gokcesu, Hakan</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><jtitle>IEEE communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kose, Alper</au><au>Koca, Mutlu</au><au>Anarim, Emin</au><au>Medard, Muriel</au><au>Gokcesu, Hakan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Graph-Theoretical Dynamic User Pairing for Downlink NOMA Systems</atitle><jtitle>IEEE communications letters</jtitle><stitle>LCOMM</stitle><date>2021-10-01</date><risdate>2021</risdate><volume>25</volume><issue>10</issue><spage>3234</spage><epage>3238</epage><pages>3234-3238</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>We propose a novel graph-theoretical dynamic user pairing strategy based on the user rate requirements in cellular networks employing non-orthogonal multiple access (NOMA). The proposed approach relies on first constructing a conflict graph corresponding to all possible user pairings and then reformulating the problem of finding the best user pairs as that of finding the maximum weighted independent set (MWIS) on the conflict graph. This formulation turns the originally NP-hard problem into one that can be solvable in polynomial time thanks to the claw-freeness property of the conflict graph. The proposed user pairing method satisfies the maximum number of user demands with optimal network sum-rate as shown theoretically and as validated by the simulation results.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2021.3102116</doi><tpages>5</tpages><orcidid>https://orcid.org/0000-0002-1537-1205</orcidid><orcidid>https://orcid.org/0000-0001-7572-3009</orcidid><orcidid>https://orcid.org/0000-0002-3305-7674</orcidid><orcidid>https://orcid.org/0000-0002-5113-0118</orcidid><orcidid>https://orcid.org/0000-0003-4059-407X</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1089-7798 |
| ispartof | IEEE communications letters, 2021-10, Vol.25 (10), p.3234-3238 |
| issn | 1089-7798 1558-2558 |
| language | eng |
| recordid | cdi_ieee_primary_9504550 |
| source | IEEE Electronic Library (IEL) |
| subjects | Benchmark testing Cellular communication Complexity theory conflict graph Downlink maximum weighted independent set NOMA Non-orthogonal multiple access Nonorthogonal multiple access Polynomials Resource management Signal to noise ratio Silicon carbide user pairing |
| title | Graph-Theoretical Dynamic User Pairing for Downlink NOMA Systems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T19%3A15%3A51IST&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=Graph-Theoretical%20Dynamic%20User%20Pairing%20for%20Downlink%20NOMA%20Systems&rft.jtitle=IEEE%20communications%20letters&rft.au=Kose,%20Alper&rft.date=2021-10-01&rft.volume=25&rft.issue=10&rft.spage=3234&rft.epage=3238&rft.pages=3234-3238&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2021.3102116&rft_dat=%3Cproquest_RIE%3E2580102182%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=2580102182&rft_id=info:pmid/&rft_ieee_id=9504550&rfr_iscdi=true |