NOMA-Relevant Clustering and Resource Allocation for Proportional Fair Uplink Communications
This letter focuses on clustering and resource block (RB) allocation in multi-carrier uplink networks using power-domain non orthogonal multiple access (PD-NOMA). The optimization objective is time-based proportional fairness. PD-NOMA is applied per frame and RB only if the achieved individual data...
Gespeichert in:
| Veröffentlicht in: | IEEE wireless communications letters 2019-06, Vol.8 (3), p.873-876 |
|---|---|
| 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 | 876 |
|---|---|
| container_issue | 3 |
| container_start_page | 873 |
| container_title | IEEE wireless communications letters |
| container_volume | 8 |
| creator | Pischella, Mylene Le Ruyet, Didier |
| description | This letter focuses on clustering and resource block (RB) allocation in multi-carrier uplink networks using power-domain non orthogonal multiple access (PD-NOMA). The optimization objective is time-based proportional fairness. PD-NOMA is applied per frame and RB only if the achieved individual data rates are larger with PD-NOMA than with time division multiple access. The clustering algorithm recursively uses maximum weight matching to build clusters per RB. Given the clusters, RB allocation is then optimal. The proposed algorithm provides a good trade-off between reduced overall network latency and rate improvement compared to two reference algorithms. |
| doi_str_mv | 10.1109/LWC.2019.2897796 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_8634817</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8634817</ieee_id><sourcerecordid>2244346137</sourcerecordid><originalsourceid>FETCH-LOGICAL-c367t-a70a15f0d0fc9d9e3bf4c404beedbafbe6da4586e3cc014f67a9d516258e3fc93</originalsourceid><addsrcrecordid>eNo9kEtLw0AUhYMoWGr3gpsBVy5S55VJsgzBWiFaKRY3wjBJbjQ1zcSZpOC_d0Kkd3MffOfCOZ53TfCSEBzfZ-_pkmISL2kUh2EszrwZJYL6lPHg_DSz8NJbWLvHrgQmlEQz7-Nl85z4W2jgqNoepc1gezB1-4lUW6ItWD2YAlDSNLpQfa1bVGmDXo3utBlX1aCVqg3adU3dfqNUHw5DW0-ovfIuKtVYWPz3ubdbPbylaz_bPD6lSeYXTIS9r0KsSFDhEldFXMbA8ooXHPMcoMxVlYMoFQ8iAawoMOGVCFVcBs5TEAFzEjb37qa_X6qRnakPyvxKrWq5TjI53jDlXNCIHYljbye2M_pnANvLvbPofFhJHcW4ICx0FJ6owmhrDVSntwTLMXLpIpdj5PI_cie5mSQ1AJzwSDAekZD9AZcvfQU</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2244346137</pqid></control><display><type>article</type><title>NOMA-Relevant Clustering and Resource Allocation for Proportional Fair Uplink Communications</title><source>IEEE Electronic Library (IEL)</source><creator>Pischella, Mylene ; Le Ruyet, Didier</creator><creatorcontrib>Pischella, Mylene ; Le Ruyet, Didier</creatorcontrib><description>This letter focuses on clustering and resource block (RB) allocation in multi-carrier uplink networks using power-domain non orthogonal multiple access (PD-NOMA). The optimization objective is time-based proportional fairness. PD-NOMA is applied per frame and RB only if the achieved individual data rates are larger with PD-NOMA than with time division multiple access. The clustering algorithm recursively uses maximum weight matching to build clusters per RB. Given the clusters, RB allocation is then optimal. The proposed algorithm provides a good trade-off between reduced overall network latency and rate improvement compared to two reference algorithms.</description><identifier>ISSN: 2162-2337</identifier><identifier>EISSN: 2162-2345</identifier><identifier>DOI: 10.1109/LWC.2019.2897796</identifier><identifier>CODEN: IWCLAF</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>Algorithms ; Clustering ; Clustering algorithms ; Computer Science ; Information Theory ; Interference ; Network latency ; NOMA ; Nonorthogonal multiple access ; optimal matching ; Optimization ; proportional fairness ; Resource allocation ; Resource management ; Signal and Image Processing ; Time Division Multiple Access ; Uplink</subject><ispartof>IEEE wireless communications letters, 2019-06, Vol.8 (3), p.873-876</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c367t-a70a15f0d0fc9d9e3bf4c404beedbafbe6da4586e3cc014f67a9d516258e3fc93</citedby><cites>FETCH-LOGICAL-c367t-a70a15f0d0fc9d9e3bf4c404beedbafbe6da4586e3cc014f67a9d516258e3fc93</cites><orcidid>0000-0001-7148-9753 ; 0000-0002-9673-2075</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8634817$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>230,314,780,784,796,885,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8634817$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://cnam.hal.science/hal-02446283$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Pischella, Mylene</creatorcontrib><creatorcontrib>Le Ruyet, Didier</creatorcontrib><title>NOMA-Relevant Clustering and Resource Allocation for Proportional Fair Uplink Communications</title><title>IEEE wireless communications letters</title><addtitle>LWC</addtitle><description>This letter focuses on clustering and resource block (RB) allocation in multi-carrier uplink networks using power-domain non orthogonal multiple access (PD-NOMA). The optimization objective is time-based proportional fairness. PD-NOMA is applied per frame and RB only if the achieved individual data rates are larger with PD-NOMA than with time division multiple access. The clustering algorithm recursively uses maximum weight matching to build clusters per RB. Given the clusters, RB allocation is then optimal. The proposed algorithm provides a good trade-off between reduced overall network latency and rate improvement compared to two reference algorithms.</description><subject>Algorithms</subject><subject>Clustering</subject><subject>Clustering algorithms</subject><subject>Computer Science</subject><subject>Information Theory</subject><subject>Interference</subject><subject>Network latency</subject><subject>NOMA</subject><subject>Nonorthogonal multiple access</subject><subject>optimal matching</subject><subject>Optimization</subject><subject>proportional fairness</subject><subject>Resource allocation</subject><subject>Resource management</subject><subject>Signal and Image Processing</subject><subject>Time Division Multiple Access</subject><subject>Uplink</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>eNo9kEtLw0AUhYMoWGr3gpsBVy5S55VJsgzBWiFaKRY3wjBJbjQ1zcSZpOC_d0Kkd3MffOfCOZ53TfCSEBzfZ-_pkmISL2kUh2EszrwZJYL6lPHg_DSz8NJbWLvHrgQmlEQz7-Nl85z4W2jgqNoepc1gezB1-4lUW6ItWD2YAlDSNLpQfa1bVGmDXo3utBlX1aCVqg3adU3dfqNUHw5DW0-ovfIuKtVYWPz3ubdbPbylaz_bPD6lSeYXTIS9r0KsSFDhEldFXMbA8ooXHPMcoMxVlYMoFQ8iAawoMOGVCFVcBs5TEAFzEjb37qa_X6qRnakPyvxKrWq5TjI53jDlXNCIHYljbye2M_pnANvLvbPofFhJHcW4ICx0FJ6owmhrDVSntwTLMXLpIpdj5PI_cie5mSQ1AJzwSDAekZD9AZcvfQU</recordid><startdate>20190601</startdate><enddate>20190601</enddate><creator>Pischella, Mylene</creator><creator>Le Ruyet, Didier</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><general>IEEE comsoc</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>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0001-7148-9753</orcidid><orcidid>https://orcid.org/0000-0002-9673-2075</orcidid></search><sort><creationdate>20190601</creationdate><title>NOMA-Relevant Clustering and Resource Allocation for Proportional Fair Uplink Communications</title><author>Pischella, Mylene ; Le Ruyet, Didier</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c367t-a70a15f0d0fc9d9e3bf4c404beedbafbe6da4586e3cc014f67a9d516258e3fc93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Clustering</topic><topic>Clustering algorithms</topic><topic>Computer Science</topic><topic>Information Theory</topic><topic>Interference</topic><topic>Network latency</topic><topic>NOMA</topic><topic>Nonorthogonal multiple access</topic><topic>optimal matching</topic><topic>Optimization</topic><topic>proportional fairness</topic><topic>Resource allocation</topic><topic>Resource management</topic><topic>Signal and Image Processing</topic><topic>Time Division Multiple Access</topic><topic>Uplink</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Pischella, Mylene</creatorcontrib><creatorcontrib>Le Ruyet, Didier</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>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><jtitle>IEEE wireless communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Pischella, Mylene</au><au>Le Ruyet, Didier</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>NOMA-Relevant Clustering and Resource Allocation for Proportional Fair Uplink Communications</atitle><jtitle>IEEE wireless communications letters</jtitle><stitle>LWC</stitle><date>2019-06-01</date><risdate>2019</risdate><volume>8</volume><issue>3</issue><spage>873</spage><epage>876</epage><pages>873-876</pages><issn>2162-2337</issn><eissn>2162-2345</eissn><coden>IWCLAF</coden><abstract>This letter focuses on clustering and resource block (RB) allocation in multi-carrier uplink networks using power-domain non orthogonal multiple access (PD-NOMA). The optimization objective is time-based proportional fairness. PD-NOMA is applied per frame and RB only if the achieved individual data rates are larger with PD-NOMA than with time division multiple access. The clustering algorithm recursively uses maximum weight matching to build clusters per RB. Given the clusters, RB allocation is then optimal. The proposed algorithm provides a good trade-off between reduced overall network latency and rate improvement compared to two reference algorithms.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/LWC.2019.2897796</doi><tpages>4</tpages><orcidid>https://orcid.org/0000-0001-7148-9753</orcidid><orcidid>https://orcid.org/0000-0002-9673-2075</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2162-2337 |
| ispartof | IEEE wireless communications letters, 2019-06, Vol.8 (3), p.873-876 |
| issn | 2162-2337 2162-2345 |
| language | eng |
| recordid | cdi_ieee_primary_8634817 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Clustering Clustering algorithms Computer Science Information Theory Interference Network latency NOMA Nonorthogonal multiple access optimal matching Optimization proportional fairness Resource allocation Resource management Signal and Image Processing Time Division Multiple Access Uplink |
| title | NOMA-Relevant Clustering and Resource Allocation for Proportional Fair Uplink Communications |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T11%3A59%3A23IST&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=NOMA-Relevant%20Clustering%20and%20Resource%20Allocation%20for%20Proportional%20Fair%20Uplink%20Communications&rft.jtitle=IEEE%20wireless%20communications%20letters&rft.au=Pischella,%20Mylene&rft.date=2019-06-01&rft.volume=8&rft.issue=3&rft.spage=873&rft.epage=876&rft.pages=873-876&rft.issn=2162-2337&rft.eissn=2162-2345&rft.coden=IWCLAF&rft_id=info:doi/10.1109/LWC.2019.2897796&rft_dat=%3Cproquest_RIE%3E2244346137%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=2244346137&rft_id=info:pmid/&rft_ieee_id=8634817&rfr_iscdi=true |