Distributed User Association and Resource Allocation Algorithms for Three Tier HetNets
In this article, we consider joint optimization of user association and resource allocation in three tier HetNets. We formulate the objective of minimizing the resources required to clear a given set of files, as a linear program. We show that the optimal user association is determined by a rate-bia...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on wireless communications 2020-12, Vol.19 (12), p.7913-7926 |
|---|---|
| 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 | 7926 |
|---|---|
| container_issue | 12 |
| container_start_page | 7913 |
| container_title | IEEE transactions on wireless communications |
| container_volume | 19 |
| creator | Gopalam, Swaroop Hanly, Stephen Vaughan Whiting, Philip |
| description | In this article, we consider joint optimization of user association and resource allocation in three tier HetNets. We formulate the objective of minimizing the resources required to clear a given set of files, as a linear program. We show that the optimal user association is determined by a rate-biasing rule, where a bias value is associated with each BS. We show that each rate-bias value crucially only takes values from a finite set which we characterize. We present a complete analytical solution along with new structural results. Using these results, we present efficient distributed algorithms for optimal control of three tier HetNets. The method involves a 1D search for a resource variable at the macro-level, and 2D search at the pico-level for a resource variable and a bias value. We apply our results to a variety of hierarchical network examples. |
| doi_str_mv | 10.1109/TWC.2020.3017519 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_2468759233</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9205657</ieee_id><sourcerecordid>2468759233</sourcerecordid><originalsourceid>FETCH-LOGICAL-c357t-e9edfe926591fb611b469a55b1bf529a13b75915c02d6f5d665721392bbe8d863</originalsourceid><addsrcrecordid>eNo9kM1LAzEQxYMoWKt3wUvA89Z8NNnNcakfFYqCbPUYNruzNmXb1CR78L83ZYunGWbeb-bxELqlZEYpUQ_V12LGCCMzTmguqDpDEypEkTE2L86PPZcZZbm8RFchbEkSSSEm6PPRhuitGSK0eB3A4zIE19g6WrfH9b7FHxDc4BvAZd-7ZpyX_bfzNm52AXfO42rjAXBlE72E-AYxXKOLru4D3JzqFK2fn6rFMlu9v7wuylXWcJHHDBS0HSgmhaKdkZSauVS1EIaaTjBVU27ytBINYa3sRCulyBnlihkDRVtIPkX3492Ddz8DhKi3yew-vdRsLosEM86TioyqxrsQPHT64O2u9r-aEn1MT6f09DE9fUovIXcjYgHgX64YEckC_wMycGrM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2468759233</pqid></control><display><type>article</type><title>Distributed User Association and Resource Allocation Algorithms for Three Tier HetNets</title><source>IEEE Electronic Library (IEL)</source><creator>Gopalam, Swaroop ; Hanly, Stephen Vaughan ; Whiting, Philip</creator><creatorcontrib>Gopalam, Swaroop ; Hanly, Stephen Vaughan ; Whiting, Philip</creatorcontrib><description>In this article, we consider joint optimization of user association and resource allocation in three tier HetNets. We formulate the objective of minimizing the resources required to clear a given set of files, as a linear program. We show that the optimal user association is determined by a rate-biasing rule, where a bias value is associated with each BS. We show that each rate-bias value crucially only takes values from a finite set which we characterize. We present a complete analytical solution along with new structural results. Using these results, we present efficient distributed algorithms for optimal control of three tier HetNets. The method involves a 1D search for a resource variable at the macro-level, and 2D search at the pico-level for a resource variable and a bias value. We apply our results to a variety of hierarchical network examples.</description><identifier>ISSN: 1536-1276</identifier><identifier>EISSN: 1558-2248</identifier><identifier>DOI: 10.1109/TWC.2020.3017519</identifier><identifier>CODEN: ITWCAX</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>5G mobile communication ; Algorithms ; Bias ; Cell Range Expansion (CRE) ; Complexity theory ; eICIC ; Exact solutions ; HetNets ; Interference ; interference management ; mm-wave ; multi-tier ; Optimal control ; Optimization ; Real-time systems ; Resource allocation ; Resource management ; small cells ; user association ; Wireless communication</subject><ispartof>IEEE transactions on wireless communications, 2020-12, Vol.19 (12), p.7913-7926</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c357t-e9edfe926591fb611b469a55b1bf529a13b75915c02d6f5d665721392bbe8d863</citedby><cites>FETCH-LOGICAL-c357t-e9edfe926591fb611b469a55b1bf529a13b75915c02d6f5d665721392bbe8d863</cites><orcidid>0000-0002-0524-9927 ; 0000-0002-7106-7523 ; 0000-0003-0345-2988</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9205657$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9205657$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Gopalam, Swaroop</creatorcontrib><creatorcontrib>Hanly, Stephen Vaughan</creatorcontrib><creatorcontrib>Whiting, Philip</creatorcontrib><title>Distributed User Association and Resource Allocation Algorithms for Three Tier HetNets</title><title>IEEE transactions on wireless communications</title><addtitle>TWC</addtitle><description>In this article, we consider joint optimization of user association and resource allocation in three tier HetNets. We formulate the objective of minimizing the resources required to clear a given set of files, as a linear program. We show that the optimal user association is determined by a rate-biasing rule, where a bias value is associated with each BS. We show that each rate-bias value crucially only takes values from a finite set which we characterize. We present a complete analytical solution along with new structural results. Using these results, we present efficient distributed algorithms for optimal control of three tier HetNets. The method involves a 1D search for a resource variable at the macro-level, and 2D search at the pico-level for a resource variable and a bias value. We apply our results to a variety of hierarchical network examples.</description><subject>5G mobile communication</subject><subject>Algorithms</subject><subject>Bias</subject><subject>Cell Range Expansion (CRE)</subject><subject>Complexity theory</subject><subject>eICIC</subject><subject>Exact solutions</subject><subject>HetNets</subject><subject>Interference</subject><subject>interference management</subject><subject>mm-wave</subject><subject>multi-tier</subject><subject>Optimal control</subject><subject>Optimization</subject><subject>Real-time systems</subject><subject>Resource allocation</subject><subject>Resource management</subject><subject>small cells</subject><subject>user association</subject><subject>Wireless communication</subject><issn>1536-1276</issn><issn>1558-2248</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kM1LAzEQxYMoWKt3wUvA89Z8NNnNcakfFYqCbPUYNruzNmXb1CR78L83ZYunGWbeb-bxELqlZEYpUQ_V12LGCCMzTmguqDpDEypEkTE2L86PPZcZZbm8RFchbEkSSSEm6PPRhuitGSK0eB3A4zIE19g6WrfH9b7FHxDc4BvAZd-7ZpyX_bfzNm52AXfO42rjAXBlE72E-AYxXKOLru4D3JzqFK2fn6rFMlu9v7wuylXWcJHHDBS0HSgmhaKdkZSauVS1EIaaTjBVU27ytBINYa3sRCulyBnlihkDRVtIPkX3492Ddz8DhKi3yew-vdRsLosEM86TioyqxrsQPHT64O2u9r-aEn1MT6f09DE9fUovIXcjYgHgX64YEckC_wMycGrM</recordid><startdate>202012</startdate><enddate>202012</enddate><creator>Gopalam, Swaroop</creator><creator>Hanly, Stephen Vaughan</creator><creator>Whiting, Philip</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>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-0524-9927</orcidid><orcidid>https://orcid.org/0000-0002-7106-7523</orcidid><orcidid>https://orcid.org/0000-0003-0345-2988</orcidid></search><sort><creationdate>202012</creationdate><title>Distributed User Association and Resource Allocation Algorithms for Three Tier HetNets</title><author>Gopalam, Swaroop ; Hanly, Stephen Vaughan ; Whiting, Philip</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c357t-e9edfe926591fb611b469a55b1bf529a13b75915c02d6f5d665721392bbe8d863</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>5G mobile communication</topic><topic>Algorithms</topic><topic>Bias</topic><topic>Cell Range Expansion (CRE)</topic><topic>Complexity theory</topic><topic>eICIC</topic><topic>Exact solutions</topic><topic>HetNets</topic><topic>Interference</topic><topic>interference management</topic><topic>mm-wave</topic><topic>multi-tier</topic><topic>Optimal control</topic><topic>Optimization</topic><topic>Real-time systems</topic><topic>Resource allocation</topic><topic>Resource management</topic><topic>small cells</topic><topic>user association</topic><topic>Wireless communication</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gopalam, Swaroop</creatorcontrib><creatorcontrib>Hanly, Stephen Vaughan</creatorcontrib><creatorcontrib>Whiting, Philip</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>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology 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><jtitle>IEEE transactions on wireless communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gopalam, Swaroop</au><au>Hanly, Stephen Vaughan</au><au>Whiting, Philip</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Distributed User Association and Resource Allocation Algorithms for Three Tier HetNets</atitle><jtitle>IEEE transactions on wireless communications</jtitle><stitle>TWC</stitle><date>2020-12</date><risdate>2020</risdate><volume>19</volume><issue>12</issue><spage>7913</spage><epage>7926</epage><pages>7913-7926</pages><issn>1536-1276</issn><eissn>1558-2248</eissn><coden>ITWCAX</coden><abstract>In this article, we consider joint optimization of user association and resource allocation in three tier HetNets. We formulate the objective of minimizing the resources required to clear a given set of files, as a linear program. We show that the optimal user association is determined by a rate-biasing rule, where a bias value is associated with each BS. We show that each rate-bias value crucially only takes values from a finite set which we characterize. We present a complete analytical solution along with new structural results. Using these results, we present efficient distributed algorithms for optimal control of three tier HetNets. The method involves a 1D search for a resource variable at the macro-level, and 2D search at the pico-level for a resource variable and a bias value. We apply our results to a variety of hierarchical network examples.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TWC.2020.3017519</doi><tpages>14</tpages><orcidid>https://orcid.org/0000-0002-0524-9927</orcidid><orcidid>https://orcid.org/0000-0002-7106-7523</orcidid><orcidid>https://orcid.org/0000-0003-0345-2988</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1536-1276 |
| ispartof | IEEE transactions on wireless communications, 2020-12, Vol.19 (12), p.7913-7926 |
| issn | 1536-1276 1558-2248 |
| language | eng |
| recordid | cdi_proquest_journals_2468759233 |
| source | IEEE Electronic Library (IEL) |
| subjects | 5G mobile communication Algorithms Bias Cell Range Expansion (CRE) Complexity theory eICIC Exact solutions HetNets Interference interference management mm-wave multi-tier Optimal control Optimization Real-time systems Resource allocation Resource management small cells user association Wireless communication |
| title | Distributed User Association and Resource Allocation Algorithms for Three Tier HetNets |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T00%3A18%3A52IST&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=Distributed%20User%20Association%20and%20Resource%20Allocation%20Algorithms%20for%20Three%20Tier%20HetNets&rft.jtitle=IEEE%20transactions%20on%20wireless%20communications&rft.au=Gopalam,%20Swaroop&rft.date=2020-12&rft.volume=19&rft.issue=12&rft.spage=7913&rft.epage=7926&rft.pages=7913-7926&rft.issn=1536-1276&rft.eissn=1558-2248&rft.coden=ITWCAX&rft_id=info:doi/10.1109/TWC.2020.3017519&rft_dat=%3Cproquest_RIE%3E2468759233%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=2468759233&rft_id=info:pmid/&rft_ieee_id=9205657&rfr_iscdi=true |