Conference PaperPDF Available

SONS3: A Network Data Driven Simulation Framework for Mobility Robustness Optimization

Authors:
  • Magister Solutions Ltd.
  • Magister Solutions Ltd.
  • Magister Solutions
  • Elisa Corporation
SONS3: A Network Data Driven Simulation
Framework for Mobility Robustness Optimization
Frans Laakso, Jani Puttonen, Janne Kurjenniemi,
Biying Wang, Di Zhang
Magister Solutions Ltd.
Jyväskylä, Finland
Email: {firstname.lastname@magister.fi}
Furqan Ahmed, Jarno Niemelä
Elisa Corporation
Helsinki, Finland
Email: {firstname.lastname@elisa.fi}
AbstractSelf-Organizing Networks (SON) aim at automation
of network parameters to make the planning, configuration,
management, optimization and healing of mobile radio access
networks simpler and faster, and thus also more cost efficient.
SON use case in this article is Mobility Robustness Optimization
(MRO), which targets automatic detection and correction of
handover (HO) parameterization. To this end we present novel
simulation framework called Self-Organizing Simulator 3 (SonS3)
that makes use of real network data to enable an accurate
performance analysis of mobility related SON use cases. In
addition, we present an MRO algorithm which adapts dynamically
the Cell Individual Offset (CIO), and a performance analysis
within a realistic urban scenario. The proposed MRO algorithm
leads to an overall reduction of more than 30% in mobility
problems without causing a significant increase in the number of
HOs.
KeywordsSelf-organizing network, SON, mobility robustness
optimization, MRO, ns-3, Network Simulator, performance.
I. INTRODUCTION
While wireless networks are evolving, they are also
becoming increasingly complex. The deployments involve
several overlapping frequency and technology layers, and
different kinds of hybrid macro / indoor scenarios. The
technologies involve configuring large number of parameters,
which can be difficult to optimize individually, let alone jointly.
Self-Organizing Network (SON) is an automation technology
designed to make the planning, configuration, management,
optimization and healing of mobile radio access networks
simpler and faster. SON has been specified already in 3rd
Generation Partnership Project (3GPP) Releases 8 and 9.
However, there have been updates to it in the following
releases. In addition, upcoming 5G will bring its own
challenges with variety of use cases with possibly conflicting
targets [1].
SON solutions can be divided into three categories: Self-
Configuration, Self-Optimization and Self-Healing. Self-
configuration stands for dynamic plug-and-play configuration
of newly deployed evolved Node Bs (eNBs). Self-healing
consists of a set of features for automatic detection and removal
of failures and automatic adjustment of parameters. Self-
optimization consists of optimization of coverage, capacity,
handovers (HO) and interference. Its primary use cases include
Mobility Robustness Optimization (MRO), Mobility Load
Balancing (MLB), Energy Efficiency (EE), Coverage and
Capacity Optimization (CCO), and Random Access Channel
optimization (RACH Optimization) [2]. In this article we focus
on MRO, which targets automatic detection and correction of
errors in the mobility configuration.
MRO has been studied to reduce both radio link failures
(RLFs) and unnecessary handovers due to improper handover
parameter settings. Generally, Hysteresis (Hys) and Time-To-
Trigger (TTT) are the two main MRO -tunable parameters
which govern HO performance. Most studies have focused on
optimizing these parameters to achieve a specific system gain.
A fuzzy logic-based Hys adjusting scheme was proposed in [3]
to reduce radio link failures (RLFs) in extremely dense small
cell networks. To promote Quality of Experience (QoE) in
high-speed railways, an adaptive TTT handover mechanism
was shown in [4]. The authors in [5] proposed a joint Hys and
TTT optimization scheme to enhance network energy
efficiency in heterogeneous network. However, as Hys and
TTT parameters apply to cell level, this approach is not taking
cell pair specific (CPS) handover optimization into account. [6]
introduced a CPS-based algorithm for the optimization of inter-
radio access technologies (RATs) handover parameters of LTE
and 3G systems. By conditionally adjusting CPS parameters,
[7] improved the performance of inter-cell interference
migration and [8] overcome the unbalanced load issues.
There exist several open source simulators focusing on LTE
technology, e.g., the LTE module of Network Simulator 3 (ns-
3) [9], Vienna LTE simulators [10] and LTE-SIM [11].
However, typical SON use cases have somewhat different
requirements when compared to these LTE system simulators.
For example, with SON the simulation time must be in the order
of several hours or even days. Simulation run time in a full-
blown system simulator may be several hours per simulated
minute. Thus, a new module for ns-3 called SonS3 (Self-
Organizing Network Simulator 3) has been developed to
support the SON use cases. The simulator framework has a
streamlined focus on mobility and handovers, and it has been
developed in co-operation with Finnish network operator Elisa.
In this article, to optimize MRO performance, we focus on
three issues, 1) present a dedicated system simulator for SON
research activities, 2) propose a dynamic CPS MRO algorithm
for optimizing Cell Individual Offset (CIO), and 3) present
MRO performance analysis in realistic urban scenario.
978-1-5386-6358-5/18/$31.00 ©2018 IEEE
II. MOBILITY ROBUSTNESS OPTIMIZATION
MRO is a solution for automatic detection and correction of
errors in the mobility configuration. The target is to minimize
mobility problems, such as HO failures, ping-pong HOs and
RLFs, by optimizing the HO related parameters, e.g., Hys, TTT
or CIO. Specifically, MRO intends to minimize the number of
HOs while keeping the amount of failures at acceptable level.
A. MRO classification
3GPP MRO focus is on RLFs due to too late, too early HOs,
or HOs to wrong cell. [2] Note, coverage (COV) problems are
out of the scope of MRO.
Too late handover (TLH): RLF occurs in the source
cell before a HO is initiated OR during handover
procedure, and the UE attempts to reestablish its radio
link to another cell.
Too early handover (TEH): RLF occurs in the target
cell shortly after a HO has been completed or during the
HO process, and the UE attempts to re-establish its radio
link back to the source cell.
Handover to wrong cell (HWC): RLF occurs in the
target cell after a handover has been completed or during
the HO process, and the UE attempts to re-establish its
radio link to a cell which is not the source cell nor the
target cell.
In addition to RLF related MRO problems, there are also
less severe mobility problems, which do not involve RLFs.
Ping-pong handover: HO occurs back-and-forth
between source and target cells within a short period of
time.
Short stay handover: HO occurs to from a source cell
to the target cell, followed by to a third cell within a
short period of time.
However, we do not consider the ping-pong nor the short
stay HOs in this study. The MRO classification rules are
presented in more detail in TABLE I, where the A, B and C
stand for different eNBs involved in the HO procedure. The
time interval related to the HO completed in the past is
parameterized, but in the context of this paper a value of 3
seconds is used.
B. MRO algorithm
CIO has been shown to have a noticeable effect on the HO
performance in MRO [7][8]. In this article, the objective is to
study CIO based MRO algorithm (MRO A) and test its
performance by means of simulations.
The mobility problems are collected by the SON/MRO
module per cell pair, and the problems are classified to be too
late HOs (TLH), too early HOs (TEH) or HOs to wrong cell
(HWC), according to TABLE I. At the end of each MRO
optimization cycle, the amount of too slow (ntlh) and too fast
HOs (nteh + nhwc) are summed up with MRO problem specific
weight (wtle, wteh, whwc) per cell pair. This comparison is
illustrated in (1).
           (1)
If there are sufficient number of samples per cell pair to
make a reliable optimization decision (ntlh,cp + nteh,cp + nhwc,cp),
and there is enough difference in the weighed sums of the too
fast and too slow problems, the algorithm may trigger the HO
parameter optimization. The selected limit for the imbalance
between too fast and too slow event types is two thirds (0.67)
either way.
If there are more too slow HOs, the algorithm decreases the
cell specific offset (Ocn) value by a step-up value. On the other
hand, if there are more too fast HOs, the algorithm is increasing
the cell specific offset with a step-down value. The cell specific
offset is a part of the A3 event, which is assumed to be used in
the HO procedure. The A3 entering condition is presented in
(2): [5]
OffOcsOfsMsHysOcnOfnMn
(2)
where
Mn is the measurement result of the neighboring cell
Ofn is the frequency specific offset of the frequency of
the neighbor cell
TABLE I. MRO PROBLEM CLASSIFICATION TABLE
HO completed in the
near past
HO in process
Cell at the time of
RLF
Reconnect to cell
after RLF
MRO problem
source cell
MRO problem target
cell
Irrelevant
-
A
A
A
A
-
-
A
B
A
B
B to A
-
A
B
B
A
B to A
-
A
C
B
A
B to A
A to B
A|B
C
B
A
Irrelevant
A to B
A|B
A
A
B
-
A to B
A|B
B
A
B
B to A
A to B|C
A|B|C
B
B
A
-
A to B
A|B
C
A
B
B to A
A to C
A|C
C
B
A
Ocn is the cell specific offset of the neighbor cell
Ms is the measurement result of the serving cell, which
is not considered
Ofs is the frequency specific offset of the serving
frequency
Ocs is the cell specific offset of the serving cell
Hys is the hysteresis parameter for this event
Off is the offset parameter for this event
Thus, the algorithm aims to do local optimization per cell
pair be either advancing or delaying the HO based on the
classified MRO events.
III. SONS3 SYSTEM SIMULATOR
As mentioned before, there exist several open source
simulators, which could have been used as a baseline for SON
R&D studies [9] [10] [11]. However, as these simulators are not
dedicated SON simulators, a new module for ns-3 called Self-
Organizing Network Simulator 3 (SonS3) has been developed
to support the SON use cases.
The main idea is that the simulator is kept as simple as
possible, but still as realistic as possible to support the SON use
cases. In practice this means that the simulator focuses on a
couple of essential features:
Realistic mobility models the users are moving within
defined paths, e.g., roads, sidewalks or railways.
Base station (BS) positions/orientations and matching
geographical propagation data from, e.g., a network
planning tool.
Physical layer measurements e.g. Reference Symbol
Received Power (RSRP) and Channel Quality Indicator
(CQI).
PHY layer measurement filtering, i.e,. L1 sliding window
and L3 filtering.
RRC mobility events (esp. A3), and handover model at the
BS side
Radio Link Failure model based on filtered wideband CQI
MRO problem classification and MRO algorithm
However, the features, which are not in the focus, are either
simplified or omitted entirely. Such feature is, for example, the
LTE data plane (e.g. user traffic, scheduling). Omitting these
features improves the simulator performance drastically, since
the simulator can be run with a longer simulation resolution,
e.g., 10 or 50 ms.
IV. RESULTS
In this paper, we present a performance comparison in a
realistic urban scenario. A small city of Järvenpää in Finland,
was selected for the study with real BS orientations and
locations, propagation data from a network planning tool (see
Fig.1) and road and railroad grid from Open Street Maps (OSM)
(see Fig.2). The simulations have been run with the parameters
presented in TABLE II. UE velocity is road type specific: UEs
at railroads and highways move at 100 kmph (black lines), UEs
at intermediate roads move at 50 kmph (blue lines), and UEs in
residential area move at 20 kmph (magenta lines).
TABLE II. SIMULATION PARAMETERS
Parameter
Value
Simulation duration
24 hours
Number of cells
83
Number of active UEs
100
UE velocities
20, 50, 100 kmph
Load
50%
RSRP measurement bandwidth
6 RBs
RSRP measurement interval
50 ms
L1 filter samples
4
L3 filter coefficient
4
A3 hysteresis
3 dB
A3 time-to-trigger
200 ms
RLF Qout
-8 dB
RLF Qin
-6 dB
MRO optimization cycle
2 h
MRO required imbalance
2/3
MRO step-up / step-down
1 dB
MRO event type weights
1
MRO classification timer
3 s
Fig.1 and Fig.2 and present the RLF locations and related
MRO problem classifications on top of both the propagation
environment and waypoint street grid without MRO in active
use. MRO problem are colored as follows: red dots indicate
TLH, green dots indicate TEH, blue dots indicate HWC and
magenta dots indicate COV problems. As seen in the figures,
the red dots are clearly dominating, thus most of the problems
are caused due to too late HOs. In addition, most of the MRO
problems occur on the railroads and highways, where the UE
velocity is 100 kmph. As the velocity increases, the probability
of a UE experiencing a too late HO increases. Esp. the western
railroad seems to be problematic, since it goes through the city
center, where there are smaller cells resulting in a bit higher
interference and more frequent handovers.
The number of classified MRO events is presented with and
without MRO algorithm in Fig.3. It can be seen, that the total
amount of MRO problems (i.e. RLFs) is decreased about 25%
with the usage of the MRO algorithm. The most dominant
reason for RLFs is still the too late HO, but there is also a slight
relative increase in other types of MRO problems. Here, the
MRO algorithm speeds up the handover process which may at
the same time increase the too fast type of MRO problems.
MRO algorithm is run in periodical fashion, e.g., within this
study the MRO algorithm is run once per 2 hours resulting in a
total of 12 MRO iterations within a 24-hour simulation. Next,
we present the amount of MRO problems per iteration without
and with MRO in Fig.4, Fig.5, respectively. The MRO
problems decrease from a level of ~525 per iteration to about
~350 MRO problems per iteration. Thus, MRO algorithm
decreases the amount of MRO problems about 33%.
MRO algorithm tends to increase also the number of HOs.
This may be undesirable from the operator perspective, but, in
this case, the change is also a result of reduced RLFs. Thus, the
MRO problems have transformed into successful HOs. The
number of successful HOs per iteration are shown in Fig.6. The
number of successful HOs has increased about 6% when MRO
is enabled, which is in this case a quite moderate increase.
Fig.1. MRO problems on top of a Rx power map.
Fig.2. MRO problems on top of mobility waypoint grid.
Fig.3. Number of classified MRO problems.
The MRO algorithm works by changing dynamically the
cell pair specific offset, which affects directly the A3 events.
The default CIO is set to be 0 dB, which may be dynamically
changed, if the MRO optimization criteria are met, i.e., there
are statistically enough samples and significant difference in
too late and too fast samples, per cell pair.
Fig.4. Number of classified MRO problems per iteration without MRO.
Fig.5. Number of classified MRO problems per iteration with MRO.
Fig.6. Number of successful HOs per iteration.
In these simulations, we used a minimum number of 20
samples per cell pair, and a required an imbalance of 2/3s, either
way. These are quite moderate parameters, which should trigger
MRO case only in quite clear misconfigurations. The cell
individual offset per iteration have been presented in Fig.7.
Only the cell pairs where at least one MRO adaptation has been
done are shown. The CIO always starts at 0 dB, and it is
changed maximum once per MRO iteration (2 hours), and 1 dB
at a time.
It can be seen, that all CIO changes are towards faster HO
parameterization, which quite evident since most of the
problems are too late HOs. Only 10 cell pairs are modified
during the simulation run. This may be a result of quite
moderate parameterization for MRO algorithm, which causes
adaptation only in quite extreme cases. The changes occur
within the railroad and highway lines where the UEs are
moving with high velocity.
One important aspect in the simulation framework is the
visualization of the selected use case and related simulation
results. SonS3 supports an in-house developed visualization
tool called Network Event File (NEF) player. It enables
building of visual and configurable demonstrations for different
use cases and detailed inspection simulation run-time statistics.
A snapshot of MRO demonstration via NEF player is presented
in Fig.8.
Fig.7. Cell individual offset per iteration.
V. CONCLUSIONS
This article presented a dedicated simulator for Self-
Organizing Networks (SON) Mobility Robustness
Optimization (MRO) purposes, baseline MRO algorithm and
simulation-based performance analysis in realistic urban
scenario. The results indicate that 1) the developed simulator is
capable to handle simulation times of several hours to even
days, and 2) there is a clear gain for the MRO algorithm, even
though the algorithm targets optimization of a single parameter
at cell-pair level. The objective is to continue the work towards
more performant MRO algorithms and extending the simulator
framework capabilities in regard of other SON use cases. In
addition, even though the scope for this work has been in 3GPP
LTE networks, SON capabilities are assumed to be even more
important with the introduction of more capable, but also
complex networks, such as 5G / New Radio (NR). As such, one
of the goals has been to aim to ensure that the developed
simulator is relatively straightforward to be modified for the
future use cases.
Fig.8. NEF player visualization.
ACKNOWLEDGEMENTS
The authors would like to acknowledge Dr. Henrik
Martikainen from Magister Solutions Ltd. for valuable
comments and feedback.
REFERENCES
[1] 3GPP TR 36.902, Self-configuring and Self-optimizing Network (SON)
Use Cases and Solutions, Release 9, v9.3.1, 2011.
[2] S. Hämäläinen, H. Sanneck, C. Sartori, ”LTE Self-Organizing Networks
(SON)”, John Wiley & Sons Ltd., 2012.
[3] Silva, Ketyllen C., Zdenek Becvar, and Carlos RL Francês. "Adaptive
Hysteresis Margin Based on Fuzzy Logic for Handover in Mobile
Networks with Dense Small Cells." IEEE Access (2018).
[4] Cho, Hanbyeog, et al. "Handover based on Maximum Cell Residence
Time and Adaptive TTT for LTE-R High-Speed Railways." KSII
Transactions on Internet & Information Systems 11.8 (2017).
[5] Zhang, Baoling, Weijie Qi, and Jie Zhang. "An Energy Efficiency and
Ping-pong Handover Ratio Optimization in Two-tier Heterogeneous
Networks." Computing and Communication Workshop and Conference
(CCWC), 2018 IEEE 8th Annual. IEEE, 2018.
[6] Awada, Ahmad, et al. "A SON-based Algorithm for the Optimization of
Inter-RAT Handover Parameters." IEEE Transactions on Vehicular
Technology 62.5 (2013): 1906-1923.
[7] Tuncel, Nur Oyku, and Mutlu Koca. "Joint Mobility Load Balancing and
Inter-Cell Interference Coordination for Self-Organizing OFDMA
Networks." Vehicular Technology Conference (VTC Spring), 2015 IEEE
81st. IEEE, 2015.
[8] Hasan, Md Mehedi, Sungoh Kwon, and Jee-Hyeon Na. "Adaptive
Mobility Load Balancing Algorithm for LTE Small-Cell Networks."
IEEE Transactions on Wireless Communications (2018).
[9] Ns-3, Network Simulator 3, https://www.nsnam.org/
[10] Vienna Simulators, https://www.nt.tuwien.ac.at/research/mobile-
communications/vccs/.
[11] LTE-Sim, LTE Simulator,
https://telematics.poliba.it/index.php?option=com_content&view=article
&id=28&Itemid=203&lang=en
[12] 3GPP, TS 36.331, Evolved Universal Terrestrial Radio Access (E-UTRA)
Radio Resource Control (RRC), Protocol specification, Release 9,
v.9.18.0, 2014
... The idea is to exploit the experience gained from the analysis of data of the network based on user equipment (UE) measurements, to learn where handovers have occurred and decide whether to allow them or not. Finally, the work in [7] considers real network data to reduce mobility problems without causing significant increase in the number of handovers. However, the proposed approach does not apply any learning algorithm for analysis. ...
Conference Paper
Full-text available
We propose an unsupervised learning based anomaly detection framework for identifying cells experiencing performance degradation due to mobility problems, in LTE networks. Handover failure rate is used as a performance metric, whereas the mobility problems considered include too-early and too-late handovers. In order to enable unsupervised learning, the framework leverages existing datasets in commercial LTE networks (e.g. performance management counters, configuration management data, geographical locations, and inventory data etc). To this end, the first step is data pre-processing, followed by feature extraction based on principal component analysis and clustering. For implementation, we use real data from an operational commercial LTE network. Results show that clustering is highly effective in understanding and identifying mobility related anomalous behaviour, and provides actionable insights for automation and self-optimization, paving the way for efficient mobility robustness optimization, which is an important self-optimization use-case for contemporary 4G/5G networks.
... Parameter optimization to improve handover success rates has been widely investigated [4]- [10]. Kitagawa et al. [11] proposed adjusting the handover margin (HOM) according to handover failure rates across different User Equipment (UE) velocities. ...
Article
Optimizing the performance of a real-world wireless network is extremely challenging because of the difficulty to predict the network performance as a function of network parameters, and the prohibitively large problem size. The conventional network optimization approach relies on drive tests, trial-and-error and engineering experience, which is labor-intensive, error-prone and far from optimal. In this article, we introduce a new wireless network simulator, named simulated reality of communication networks (SRCON), that relies on a variety of white-box and machine-learning models to accurately reproduce the stochastic behavior (e.g., traffic arrival, user association, and signal propagation) of real-world 4G/5G mobile networks. We describe the key challenges, including the gigantic problem size, network coupling, stochasticity and many others, to develop SRCON. We also illustrate how SRCON can be used to optimize mobile network performance effectively. Notable performance gains were achieved after applying SRCON-enabled optimization to “conventionally-optimized” commercial wireless networks.
Book
This book is a collection of the most recent approaches that combine metaheuristics and machine learning. Some of the methods considered in this book are evolutionary, swarm, machine learning, and deep learning. The chapters were classified based on the content; then, the sections are thematic. Different applications and implementations are included; in this sense, the book provides theory and practical content with novel machine learning and metaheuristic algorithms. The chapters were compiled using a scientific perspective. Accordingly, the book is primarily intended for undergraduate and postgraduate students of Science, Engineering, and Computational Mathematics and is useful in courses on Artificial Intelligence, Advanced Machine Learning, among others. Likewise, the book is useful for research from the evolutionary computation, artificial intelligence, and image processing communities.
Chapter
Full-text available
This chapter discusses combinatorial optimization techniques for enabling intelligent automation in mobile networks. A number of discrete optimization problems pertinent to mobile network automation can be solved effectively using artificial intelligence based combinatorial optimization approaches such as heuristics and metaheuristics. Relevant use-cases include both initial parameter assignment during network roll-out, and continuous optimization of configuration management parameters during network operation and maintenance. We discuss mobile network automation use-cases and motivation for using different heuristics and metaheuristics in designing network optimization algorithms. To this end, we review important metaheuristics from a network optimization perspective, and discuss their applications in different mobile network automation use-cases. As a case study, we discuss greedy heuristics for physical cell identifier (PCI) assignment problem, which is an important use-case relevant to both 4G and 5G networks. The performance of algorithms is compared using a network model based on data from a real LTE mobile network. Results show that greedy heuristics constitute a viable approach for PCI assignment in highly dense networks. We conclude that heuristics and metaheuristics based combinatorial optimization algorithms are highly effective in meeting emerging challenges related to network optimization, thereby enabling intelligent automation in mobile networks.
Chapter
Presently, there are several problems with the artificial vision of the autonomous cars, one of these is the detection of objects in adverse conditions, a typical example of this problem is rain where visibility is limited or non-existent, in the same way, autonomous driving under sand or snow storms or in mist conditions, just to mention a few. The core of this chapter deals with the problem in mist conditions by improving image segmentation. These types of images represent a challenge that requires the application of efficient and robust computer techniques that enhance; the segmentation, contrast and can be clearly interpreted. This work proposes the use of metaheuristic algorithms (MA) combined with threshold technique such as minimum cross entropy (MCE) to applied to images under mist conditions. The results of the work are analyzed under statistical tests and to guarantee proper segmentation several state-of-the-art metrics were used.
Article
Full-text available
To satisfy requirements on future mobile network, a large number of small cells should be deployed. In such scenario, mobility management becomes a critical issue in order to ensure seamless connectivity with a reasonable overhead. In this paper, we propose a fuzzy logic-based scheme exploiting a user velocity and a radio channel quality to adapt a hysteresis margin for handover decision in a self-optimizing manner. The objective of the proposed algorithm is to reduce a number of redundant handovers and a handover failure ratio while allowing the users to exploit benefits of the dense small cell deployment. Simulation results show that our proposed algorithm efficiently suppresses ping pong effect and keeps it at a negligible level (below 1%) in all investigated scenarios. Moreover, the handover failure ratio and the total number of handovers are notably reduced with respect to existing algorithms, especially in scenario with high amount of small cells. In addition, the proposed scheme keeps the time spent by the users connected to the small cells at a similar level as the competitive algorithms. Thus, the benefits of the dense small cell deployment for the users are preserved.
Article
Full-text available
Small cells were introduced to support high data-rate services and for dense deployment. Owing to user equipment (UE) mobility and small-cell coverage, the load across a small-cell network recurrently becomes unbalanced. Such unbalanced loads result in performance degradation in throughput and handover success, and can even cause radio link failure. In this paper, we propose a mobility load balancing algorithm for small-cell networks by adapting network load status and considering load estimation. To that end, the proposed algorithm adjusts handover parameters depending on the overloaded cells and adjacent cells. Resource usage depends on signal qualities and traffic demands of connected UEs in Long Term Evolution (LTE). Hence, we define a resource block-utilization ratio as a measurement of cell load, and employ an adaptive threshold to determine overloaded cells, according to the network load situation. Moreover, to avoid performance oscillation, the impact of moving loads on the network is considered. Through system-level simulations, the performance of the proposed algorithm is evaluated in various environments. Simulation results show that the proposed algorithm provides a more balanced load across networks (i.e. smaller standard deviation across the cells) and higher network throughput than previous algorithms.
Article
Full-text available
We consider the joint load imbalance and inter-cell interference (ICI) problems and propose a novel mobility load balancing (MLB) algorithm that is compatible with the well-known ICI coordination (ICIC) approaches relying on fractional frequency reuse (FFR). The algorithm is simulated both under the FFR as well as reuse-1 and - 3 frequency planing schemes. In addition, the simulations are performed with commonly used schedulers which show that the proposed MLB+ICIC algorithm provide significant improvements in the degree of load balance, cell-edge spectral efficiency and the number of unsatisfied users.
Article
With the development of high-speed railway technologies, train velocities can now reach speeds up to 350 km/h, and higher in the future. In high-speed railway systems (HSRs), loss of communication can result in serious accidents, especially when the train is controlled through wireless communications. For to this reason, operators of Long Term Evolution for Railway (LTE-R) communication systems install eNodeBs (eNBs) with high density to achieve highly reliable communications. However, densely located eNBs can result in unnecessary frequent handovers (HOs) resulting in instability because, during every HO process, there is a period of time in which the communication link is disconnected. To solve this problem, in this paper, an HO scheme based on the maximum cell residence time (CRT) and adaptive time to trigger (aTTT), which are collectively called CaT, is proposed to reduce unnecessary HOs (using CRT estimations) and decrease HO failures by improving the handover command transmission point (HCTP) in LTE-R HSR communications.
Article
First, the deployment of the Long-Term Evolution (LTE) system will be concentrated on areas with high user traffic overlaying with the legacy second-generation (2G) or third-generation (3G) mobile system. Consequently, the limited LTE coverage will result in many inter-radio access technology (RAT) handovers from LTE to 3G systems and vice versa. Trouble-free operation of inter-RAT handovers requires the optimization of the handover parameters of each cell in both RATs. The current network planning and optimization methods provide a fixed network-wide setting for all the handover parameters of the cells. Cells that later show considerable mobility problems in operation mode are manually optimized with the aid of drive tests and expert knowledge. This manual optimization of the handover parameters requires permanent human intervention and increases the operational expenditure (OPEX) of the mobile operators. Moreover, the interoperability of several RATs increases further the parameter space of the handover parameters, which makes the manual optimization difficult and almost impracticable. To reduce OPEX and to achieve a better network performance, we propose in this paper a self-optimizing algorithm where each cell in a RAT updates its handover parameters in an autonomous and automated manner depending on its traffic and mobility conditions. The proposed algorithm uses a feedback controller to update the handover parameters as a means to providing a steady improvement in the network performance. In the context of control theory, the feedback controller consists of a proportional control block, which regulates the change in the magnitude of each handover parameter, and a gain scheduler, which modifies the parameters of the proportional control block depending on the mobility conditions in each cell. To benchmark the design of the proposed algorithm, we apply two general and nonself-optimization algorithms: Taguchi's method and simulated annealing to optimize the han- over parameters. Simulation results show that the proposed self-optimizing algorithm reaches a stable optimized operation point with cell-specific handover parameter settings, which considerably reduce the number of mobility failure events in the network, compared with three fixed settings for the handover parameters. Moreover, it is presented that the proposed self-optimizing algorithm outperforms Taguchi's method and simulated annealing when applied to a mobility robustness optimization (MRO) problem.
LTE Self-Organizing Networks (SON)
  • S Hämäläinen
  • H Sanneck
  • C Sartori
S. Hämäläinen, H. Sanneck, C. Sartori, "LTE Self-Organizing Networks (SON)", John Wiley & Sons Ltd., 2012.
Adaptive Mobility Load Balancing Algorithm for LTE Small-Cell Networks
  • Sungoh Md Mehedi Hasan
  • Jee-Hyeon Kwon
  • Na