Hard Handover Algorithm for Self Optimization in 3GPP LTE System 


Vol. 35,  No. 3, pp. 217-224, Mar.  2010


PDF
  Abstract

In this paper, we propose a hard handover algorithm for a base station's self-optimization, one of the automatic operational technologies for the 3GPP LTE systems. The proposed algorithm simultaneously considers a mixed target sell selection method for optimal selection and a multiple parameter based active hysteresis method with the received signal strength from adjacent cells and the cell load information of the candidate target cells from information exchanges between eNBs through X2 interface. The active hysteresis method chooses optimal handover hysteresis value considering the costs of the various environmental parameters effect to handover performance. The algorithm works on the optimal target cell and the hysteresis value selections for a base station's automatic operational optimization of the LTE system with the gathered informaton effects to the handover performance. The simulation results show distinguished handover performances in terms of the most important performance indexes of handover, handover failure rate and load balancing.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

D. W. Lee, K. Hyun, D. Kim, "Hard Handover Algorithm for Self Optimization in 3GPP LTE System," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 3, pp. 217-224, 2010. DOI: .

[ACM Style]

Doo Won Lee, Kwangmin Hyun, and Dong-hoi Kim. 2010. Hard Handover Algorithm for Self Optimization in 3GPP LTE System. The Journal of Korean Institute of Communications and Information Sciences, 35, 3, (2010), 217-224. DOI: .

[KICS Style]

Doo Won Lee, Kwangmin Hyun, Dong-hoi Kim, "Hard Handover Algorithm for Self Optimization in 3GPP LTE System," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 3, pp. 217-224, 3. 2010.