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...
Gespeichert in:
Veröffentlicht in: | International journal of network management 2013-05, Vol.23 (3), p.172-185 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 1055-7148 1099-1190 |
DOI: | 10.1002/nem.1824 |