A utility-based load-balancing scheme with guarantee of users' rate for LTE self-organization networks

SUMMARY Mobility load balance is becoming increasingly crucial in the design of self‐organization networks for LTE (long‐term evolution), especially under dynamic scenarios. In this paper, we study the problem of load balance with guarantee of users' rate and formulate a general optimization mo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of network management 2013-05, Vol.23 (3), p.172-185
Hauptverfasser: Yang, Ying, Dong, WenXiang, Chen, XiaoHui, Wang, Weidong
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 185
container_issue 3
container_start_page 172
container_title International journal of network management
container_volume 23
creator Yang, Ying
Dong, WenXiang
Chen, XiaoHui
Wang, Weidong
description SUMMARY Mobility load balance is becoming increasingly crucial in the design of self‐organization networks for LTE (long‐term evolution), especially under dynamic scenarios. In this paper, we study the problem of load balance with guarantee of users' rate and formulate a general optimization model, where the weighted sum of the first‐order and second‐order statistics of load distribution (load variance and total load level) are considered directly. We prove the convexity of the model and derive the optimal user‐station association scheme in different weights. Based on analysis of the optimization model, a dynamic admission and handover scheme is proposed. Mobile users with rate requirement select a base station based on the load utility in a distributed way and handover to the selected station (if handover is triggered). Furthermore, a simulation platform with seven cells is developed to evaluate the dynamic admission and handover scheme. It is demonstrated that our proposed scheme outperforms the conventional counterpart. Copyright © 2013 John Wiley & Sons, Ltd. We study the problem of load balance with guarantee of users' rate and formulate a general optimization model, where weighted sum of the first order and the second order statistic of load distribution is considered directly. We prove the convexity of the model and derive the optimal user‐station association scheme in different weight. An dynamic admission and handover scheme (DAHS) is proposed based on the optimal association scheme and numerical results demonstrate that our proposed scheme outperforms the conventional counterpart.
doi_str_mv 10.1002/nem.1824
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1651416890</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1651416890</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3364-85f3e9b8cf9fdca0e3565c4aacb7bed3bdadbb28399e0258a2ca6bdf85246b213</originalsourceid><addsrcrecordid>eNp10M1O3DAUBeCoKlIpVOojeAebDHYcJ_YS0eFHDLABurSunevBJRNT29EwPD0ZgUBddHXP4tOR7imKn4zOGKXV0YCrGZNV_aXYZVSpkjFFv26zEGXLavmt-J7SHzpRptrdwh2TMfve501pIGFH-gDdFHsYrB-WJNkHXCFZ-_xAliNEGDIiCY6MCWM6IBEyEhciWdzOScLelSEuYfAvkH0YyIB5HeJj2i92HPQJf7zfveLudH57cl4ubs4uTo4XpeW8qUspHEdlpHXKdRYoctEIWwNY0xrsuOmgM6aSXCmklZBQWWhM56So6sZUjO8Vh2-9TzH8HTFlvfLJYj-9g2FMmjWC1ayRin5SG0NKEZ1-in4FcaMZ1dsp9TSl3k450fKNrn2Pm_86fT2_-tf7lPH5w0N81E3LW6F_X59p-Uuo9p5fas5fAeKIhbA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1651416890</pqid></control><display><type>article</type><title>A utility-based load-balancing scheme with guarantee of users' rate for LTE self-organization networks</title><source>Access via Wiley Online Library</source><creator>Yang, Ying ; Dong, WenXiang ; Chen, XiaoHui ; Wang, Weidong</creator><creatorcontrib>Yang, Ying ; Dong, WenXiang ; Chen, XiaoHui ; Wang, Weidong</creatorcontrib><description>SUMMARY Mobility load balance is becoming increasingly crucial in the design of self‐organization networks for LTE (long‐term evolution), especially under dynamic scenarios. In this paper, we study the problem of load balance with guarantee of users' rate and formulate a general optimization model, where the weighted sum of the first‐order and second‐order statistics of load distribution (load variance and total load level) are considered directly. We prove the convexity of the model and derive the optimal user‐station association scheme in different weights. Based on analysis of the optimization model, a dynamic admission and handover scheme is proposed. Mobile users with rate requirement select a base station based on the load utility in a distributed way and handover to the selected station (if handover is triggered). Furthermore, a simulation platform with seven cells is developed to evaluate the dynamic admission and handover scheme. It is demonstrated that our proposed scheme outperforms the conventional counterpart. Copyright © 2013 John Wiley &amp; Sons, Ltd. We study the problem of load balance with guarantee of users' rate and formulate a general optimization model, where weighted sum of the first order and the second order statistic of load distribution is considered directly. We prove the convexity of the model and derive the optimal user‐station association scheme in different weight. An dynamic admission and handover scheme (DAHS) is proposed based on the optimal association scheme and numerical results demonstrate that our proposed scheme outperforms the conventional counterpart.</description><identifier>ISSN: 1055-7148</identifier><identifier>EISSN: 1099-1190</identifier><identifier>DOI: 10.1002/nem.1824</identifier><language>eng</language><publisher>Blackwell Publishing Ltd</publisher><subject>Dynamic tests ; Dynamics ; Load balancing (computing) ; Mathematical models ; Networks ; Optimization ; Stations ; Statistics</subject><ispartof>International journal of network management, 2013-05, Vol.23 (3), p.172-185</ispartof><rights>Copyright © 2013 John Wiley &amp; Sons, Ltd.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3364-85f3e9b8cf9fdca0e3565c4aacb7bed3bdadbb28399e0258a2ca6bdf85246b213</citedby><cites>FETCH-LOGICAL-c3364-85f3e9b8cf9fdca0e3565c4aacb7bed3bdadbb28399e0258a2ca6bdf85246b213</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fnem.1824$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fnem.1824$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,780,784,1417,27924,27925,45574,45575</link.rule.ids></links><search><creatorcontrib>Yang, Ying</creatorcontrib><creatorcontrib>Dong, WenXiang</creatorcontrib><creatorcontrib>Chen, XiaoHui</creatorcontrib><creatorcontrib>Wang, Weidong</creatorcontrib><title>A utility-based load-balancing scheme with guarantee of users' rate for LTE self-organization networks</title><title>International journal of network management</title><addtitle>Int. J. Network Mgmt</addtitle><description>SUMMARY Mobility load balance is becoming increasingly crucial in the design of self‐organization networks for LTE (long‐term evolution), especially under dynamic scenarios. In this paper, we study the problem of load balance with guarantee of users' rate and formulate a general optimization model, where the weighted sum of the first‐order and second‐order statistics of load distribution (load variance and total load level) are considered directly. We prove the convexity of the model and derive the optimal user‐station association scheme in different weights. Based on analysis of the optimization model, a dynamic admission and handover scheme is proposed. Mobile users with rate requirement select a base station based on the load utility in a distributed way and handover to the selected station (if handover is triggered). Furthermore, a simulation platform with seven cells is developed to evaluate the dynamic admission and handover scheme. It is demonstrated that our proposed scheme outperforms the conventional counterpart. Copyright © 2013 John Wiley &amp; Sons, Ltd. We study the problem of load balance with guarantee of users' rate and formulate a general optimization model, where weighted sum of the first order and the second order statistic of load distribution is considered directly. We prove the convexity of the model and derive the optimal user‐station association scheme in different weight. An dynamic admission and handover scheme (DAHS) is proposed based on the optimal association scheme and numerical results demonstrate that our proposed scheme outperforms the conventional counterpart.</description><subject>Dynamic tests</subject><subject>Dynamics</subject><subject>Load balancing (computing)</subject><subject>Mathematical models</subject><subject>Networks</subject><subject>Optimization</subject><subject>Stations</subject><subject>Statistics</subject><issn>1055-7148</issn><issn>1099-1190</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNp10M1O3DAUBeCoKlIpVOojeAebDHYcJ_YS0eFHDLABurSunevBJRNT29EwPD0ZgUBddHXP4tOR7imKn4zOGKXV0YCrGZNV_aXYZVSpkjFFv26zEGXLavmt-J7SHzpRptrdwh2TMfve501pIGFH-gDdFHsYrB-WJNkHXCFZ-_xAliNEGDIiCY6MCWM6IBEyEhciWdzOScLelSEuYfAvkH0YyIB5HeJj2i92HPQJf7zfveLudH57cl4ubs4uTo4XpeW8qUspHEdlpHXKdRYoctEIWwNY0xrsuOmgM6aSXCmklZBQWWhM56So6sZUjO8Vh2-9TzH8HTFlvfLJYj-9g2FMmjWC1ayRin5SG0NKEZ1-in4FcaMZ1dsp9TSl3k450fKNrn2Pm_86fT2_-tf7lPH5w0N81E3LW6F_X59p-Uuo9p5fas5fAeKIhbA</recordid><startdate>201305</startdate><enddate>201305</enddate><creator>Yang, Ying</creator><creator>Dong, WenXiang</creator><creator>Chen, XiaoHui</creator><creator>Wang, Weidong</creator><general>Blackwell Publishing Ltd</general><scope>BSCLL</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></search><sort><creationdate>201305</creationdate><title>A utility-based load-balancing scheme with guarantee of users' rate for LTE self-organization networks</title><author>Yang, Ying ; Dong, WenXiang ; Chen, XiaoHui ; Wang, Weidong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3364-85f3e9b8cf9fdca0e3565c4aacb7bed3bdadbb28399e0258a2ca6bdf85246b213</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Dynamic tests</topic><topic>Dynamics</topic><topic>Load balancing (computing)</topic><topic>Mathematical models</topic><topic>Networks</topic><topic>Optimization</topic><topic>Stations</topic><topic>Statistics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yang, Ying</creatorcontrib><creatorcontrib>Dong, WenXiang</creatorcontrib><creatorcontrib>Chen, XiaoHui</creatorcontrib><creatorcontrib>Wang, Weidong</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; 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>International journal of network management</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yang, Ying</au><au>Dong, WenXiang</au><au>Chen, XiaoHui</au><au>Wang, Weidong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A utility-based load-balancing scheme with guarantee of users' rate for LTE self-organization networks</atitle><jtitle>International journal of network management</jtitle><addtitle>Int. J. Network Mgmt</addtitle><date>2013-05</date><risdate>2013</risdate><volume>23</volume><issue>3</issue><spage>172</spage><epage>185</epage><pages>172-185</pages><issn>1055-7148</issn><eissn>1099-1190</eissn><abstract>SUMMARY Mobility load balance is becoming increasingly crucial in the design of self‐organization networks for LTE (long‐term evolution), especially under dynamic scenarios. In this paper, we study the problem of load balance with guarantee of users' rate and formulate a general optimization model, where the weighted sum of the first‐order and second‐order statistics of load distribution (load variance and total load level) are considered directly. We prove the convexity of the model and derive the optimal user‐station association scheme in different weights. Based on analysis of the optimization model, a dynamic admission and handover scheme is proposed. Mobile users with rate requirement select a base station based on the load utility in a distributed way and handover to the selected station (if handover is triggered). Furthermore, a simulation platform with seven cells is developed to evaluate the dynamic admission and handover scheme. It is demonstrated that our proposed scheme outperforms the conventional counterpart. Copyright © 2013 John Wiley &amp; Sons, Ltd. We study the problem of load balance with guarantee of users' rate and formulate a general optimization model, where weighted sum of the first order and the second order statistic of load distribution is considered directly. We prove the convexity of the model and derive the optimal user‐station association scheme in different weight. An dynamic admission and handover scheme (DAHS) is proposed based on the optimal association scheme and numerical results demonstrate that our proposed scheme outperforms the conventional counterpart.</abstract><pub>Blackwell Publishing Ltd</pub><doi>10.1002/nem.1824</doi><tpages>14</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1055-7148
ispartof International journal of network management, 2013-05, Vol.23 (3), p.172-185
issn 1055-7148
1099-1190
language eng
recordid cdi_proquest_miscellaneous_1651416890
source Access via Wiley Online Library
subjects Dynamic tests
Dynamics
Load balancing (computing)
Mathematical models
Networks
Optimization
Stations
Statistics
title A utility-based load-balancing scheme with guarantee of users' rate for LTE self-organization networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T01%3A07%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20utility-based%20load-balancing%20scheme%20with%20guarantee%20of%20users'%20rate%20for%20LTE%20self-organization%20networks&rft.jtitle=International%20journal%20of%20network%20management&rft.au=Yang,%20Ying&rft.date=2013-05&rft.volume=23&rft.issue=3&rft.spage=172&rft.epage=185&rft.pages=172-185&rft.issn=1055-7148&rft.eissn=1099-1190&rft_id=info:doi/10.1002/nem.1824&rft_dat=%3Cproquest_cross%3E1651416890%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1651416890&rft_id=info:pmid/&rfr_iscdi=true