Professional Documents
Culture Documents
Neighbor Cell Relation List and Measured Cell Identity Management in LTE
Neighbor Cell Relation List and Measured Cell Identity Management in LTE
AbstractRadio network management simplification concerns to time and frequency reference. These identifying signatures are
some extent the removal, not the simplification, of tasks. In this not unique (there are 504 different MCIs in LTE). In addition,
paper we present an approach for automatic network we propose to broadcast a globally unique cell identifier (GID),
management in 3G Long Term Evolution (LTE), namely, which can be detected and reported by the user equipments
methods for automatic configuration of locally-unique physical (mobiles). Detecting the GID will be more difficult and time
cell identities and neighbor cell relation lists. We show that these consuming, which in turn implies restrictive use. Since
issues can be removed from the list of planning tasks and handover is distributed to the eNodeB, it benefits from
completely replaced by autonomous algorithms. These managing a neighbor cell relation (NCR) list of plausible
algorithms make use of mobile measurements to detect local cell handover candidates with connectivity information (e.g. IP
identity conflicts, resolve them, and to update the neighbor cell
address), as well as a mapping between the MCI and the
relation lists in the cells. The performance of the approach is
determined using simulations of realistically deployed macro
globally unique cell identifier, GID. This enables the mobile to
networks. The simulations illustrate the ability of the algorithms identify cells in measurement reports only by the MCI. Fig. 1
to resolve local cell identity conflicts. In particular, the illustrates the concept of neighbors and cell identities. For
algorithms are capable of both accommodating new cells and further reading about LTE we refer to [1].
handling a worst case scenario where all cells are initiated with In parallel with the LTE specification and development, the
the same local cell identities and where neighbor cell relation lists Next Generation Mobile Network (NGMN) association of
are empty. The contributions in this paper are meant to aid
operators brings forward requirements on management
operators by allowing them to replace time consuming and costly
tasks with automatic mechanisms, thus, reducing operational
simplicity and cost efficiency. NGMN has summarized such
expenditure. requirements on Self-Organizing Networks (SON) in a number
of operator use cases [3]. The vision is that centralized and
Index Terms - Self-organization, Neighbor Cell Relation, decentralized algorithms automate tasks that currently require
Meausurement Cell Identity, Autonomic Communication, LTE, significant planning efforts. One use case considers handling of
WCDMA. neighbor cell relations (NCR) lists, which is identified as a
parameter that benefit from self-organization.
I. INTRODUCTION
The emergence of 3G networks has enabled high capacity
communication for mobile consumers around the world. In NCR 1: 2, 3 Handover area
2006 the number of users around the world accessing 3G NCR 4: -
networks passed 2 billion and the number of new subscribers is NCR 2: 1
still rising [1]. The need for even higher data rates, new 4
1 Service
services, and improved services has driven the standardization
and development of the 3G Long Term Evolution (LTE). The area
2
LTE concept consists of an evolved radio access network (E-
UTRAN), and an evolved packet core (EPC). The Third
Generation Partnership Program (3GPP), has listed a set of 3
Unknown
requirement that the LTE concept should fulfill, including handover area
NCR 3: 1
downlink and uplink peak data rates of 100 Mbits/s and 50
Mbits/s, respectively [2].
Figure 1. Cell 1 has a complete knowledge of its neighbors. Cell 2 only
LTE is based on a rather flat architecture compared to 2G knows about Cell 1 and not Cell 3. This may be due to prediction errors as a
and 3G systems. Each cell is served by an eNodeB (base result of inaccuracies in the signal propagation model and map data used in a
station), and handovers between cells are handled mainly by manual planning step. Cell 4 is newly installed and is thus not aware of or
by any neighbors.
signaling directly between the eNodeBs, and not via any radio
network controller node like in 2G and 3G. The cell broadcasts
In 2G and 3G systems NCR lists have been populated using
an identifying signature, a fingerprint (Measured Cell
cell planning tools by means of coverage predictions before the
Identity, MCI), which the mobiles use to identify cells, and as
153
approximated service areas overlap. Antenna and wave group. MCI grouping can e.g. be used to ensure that there are
propagation models are used to estimate the service areas. The no conflicts between macro and micro cells.
accuracy of the models used highly affects the validity of the
generated NCR lists and, as such, generated NCR lists may be A. NCR Management and MCI Conflict Detection using
erroneous since antenna and propagation models may be Handover Measurements
inaccurate due to, e.g., unknown terrain data. In contrast to [14]
The mobiles continuously measure the RSRP from the
and [15], we have taken an approach relying on mobiles to
serving cell and candidate cells (cells in the vicinity of the
monitor and report neighbors. This eliminates the need of
mobile that might be considered as handover candidates).
antenna and propagations models and provides accurate
A measurement report is typically triggered when the RSRP
information provided by the mobiles. Further, a method for
from a candidate cell is within a threshold D dB from the
resolving MCI conflicts is proposed.
serving cell RSRP. The measurement report may contain
In mobile ad-hoc networks (MANETs) two or more nodes information about more than one handover candidate in the
may have the same MAC address [16]. This causes conflicts mobiles surroundings.
resulting in neighboring nodes to erroneously pick up each
The measurement report contains information about the
others frames. The MAC address needs therefore to be locally
MCI and the corresponding RSRP of the candidate cell. The
unique in order to ensure correct delivery of the packets. The
serving cell may order the mobile to read the GID (transmitted
authors suggest a solution where a unique identifier (GID in
on the broadcast channel from each cell) of a cell with a certain
this paper) is included in the intended nodes frame, which is
MCI and report that back to the serving cell.
then broadcasted. A receiving node then checks to see whether
the unique identifier matches its own. If this is the case, then This could be done for example if the MCI is associated
the frame is accepted, otherwise it is discarded. The same with a cell with handover failures in the past or if a central
concept may be applied to LTE. However, this requires node such as the Operation Support System (OSS) has
additional bits to be transmitted over the radio link, which is a requested it. Another approach would be to query GID every
rather inefficient procedure and a more elaborate approach is time before a handover is made; this however leads to an
required. increased amount of signaling, possibly slowing down the
handover process. In any case, the GID of a neighboring cell
III. APPROACH can be obtained with help from a mobile station upon request
As mentioned earlier, radio networks of today evolve over from the serving cell. In case the serving cell decides to set up
time which results in a need for automated management of a relation to the neighboring cell it contacts the central
NCRs and MCIs. With an extensive use of mobile-assisted configuration server in the network and obtains the IP address
measurements, which is already part of the handover (and possibly other connectivity related information such as
procedure, automated updates of NCR lists and detection and encryption and authentication keys). When a new measurement
resolution of MCI conflicts are made possible. For detection of report and a subsequent GID report are received from a mobile
situations where two cells with overlapping coverage use the it is handled according to the following schematic algorithm:
same MCI an additional mechanism is needed. In the following Check if the MCI of the candidate cell is already known in the
sections, methods and procedures for NCR management, MCI serving cell (i.e. does the serving cell have a neighbor with the
conflict detection and MCI conflict resolution are described, same MCI in the NCR list).
giving an efficient and flexible alternative to centralized 1. Yes: Does the GID of the candidate cell match the
planning. It is described as a distributed algorithm that executes GID of the existing neighbor with the same MCI?
in eNodeB, but it could also be implemented in a centralized
operation and management node. In addition to the already Yes: Initiate handover decision procedure.
introduced concepts NCR and MCI the following notation will
No: Resolve the MCI conflict.
also be used in the forthcoming sections:
2. No: Consider the candidate cell as a NCR list
PLMN Identity: The identity of the Public Land Mobile candidate. Obtain connectivity information for the
Network. Note that a cell may have multiple PLMN candidate cell and signal to the candidate cell, directly
identities. or through the core network, about a mutual addition
CIPL: Unique Cell Identity for a cell within a PLMN [17]. to the NCR lists of the two cells. Does the candidate
cell confirm the NCR list addition?
In combination, PLMN and CIPL yield the globally unique cell
identifier (GID). We will assume that whenever a new cell is Yes: Add the candidate cell to the NCR list, and
introduced into the system it contacts a configuration server in store relevant information about the cell. Initiate a
the network. The configuration server provides the new cell handover decision procedure.
with the GID identity and an IP address, and other initial No: The candidate cell has detected an MCI conflict
parameter values. Optionally, the configuration server may also in the NCR list addition procedure. The candidate
provide the cell with an initial MCI. In order to minimize MCI cell resolves the MCI conflict and confirms the
conflicts and to allow for MCI grouping the initial MCI may be NCR list addition once the MCI conflict is resolved.
selected as MCIinitial = CIPL mod A + B where A is the MCI Handover may be initiated simultaneously through
group size and B is the first MCI in the corresponding MCI the core network, using the GID as identifier.
154
Selected Non-Selected
Neighbor
Detecting cell Conflicting Conflicting
6 cell(s)
Cell Cell
5
Select cell
NCR: 5, 6, 17 Select cell to
tochange
change
MCI
17 MCI
15 MCI_CHANGE
(Conflicting cell)
A MCI_CHANGE_INITIATED
NCR_MCI_REQUEST
Serving cell
(Detecting cell)
NCR_MCI_REQUEST
17
NCR_MCI_LIST
B
NCR_MCI_LIST
Candidate cell
(Conflicting cell)
Randomize
Randomize
Figure 2. MCI conflict detection based on handover measurements. The C new
new
and
and vacant
mobile reports a new candidate cell with a MCI already present in the NCR vacant
MCIMCI
list of the serving cell. The serving cell is the detecting cell.
MCI_CHANGE_NOTIF
MCI_CHANGE_NOTIF
6
D MCI_CHANGE_NOTIF_CONFIRM
MCI_CHANGE_NOTIF_CONFIRM
5
NCR: 5, 6, 17
17
Figure 4. MCI conflict resolution process. Signaling between the detecting
15 cell, the conflicting cells and neighbor(s) to the selected conflicting cell.
(Conflicting cell)
Candidate cell
A comparison between the three different criteria is made
(Detecting cell) in Section IV. In the following sections, the cell chosen to
17
change its MCI is referred to as the selected conflicting cell.
The cell not selected is referred to as the non-selected
conflicting cell. The subsequent resolution procedure is
Serving cell
(Conflicting cell) illustrated by Fig. 4 and can be divided into four steps:
A. The detecting cell orders the selected conflicting
cell to change its MCI.
Figure 3. MCI conflict detection based on handover measurements. The
serving cell aims to add the candidate cell to its NCR, but the candidate cell B. The selected conflicting cell gathers list of
reacts to the proposed addition of a mutual cell relation due to an MCI conflict
conflicting MCIs from its neighbors to determine
between the serving cell and a cell already in the candidate cells NCR list.
The candidate cell is the detecting cell. the set of locally conflicting MCIs. The selected
conflicting cell now knows all the MCIs that are
The two types of MCI conflicts that can be detected already occupied among its neighbors and
through handover measurements are illustrated in Fig. 2 and neighbors neighbors
Fig. 3, where detecting cell and conflicting cells are defined. C. The selected cell randomizes a new MCI from the
When an MCI conflict is detected an MCI conflict resolution non-conflicting MCIs.
procedure is started. The procedure is illustrated in Fig. 4. The
cell detecting an MCI conflict decides which of the conflicting D. The selected conflicting cell informs its neighbors
cells that should change MCI. The decision is based on one of about the MCI change, and when the change will
the following criteria: become effective.
1. The conflicting cell with the lowest GID will The selected conflicting cell may reject the MCI change
change the MCI. request, if an MCI change has already been initiated by another
detecting cell.
2. The conflicting cell with the shortest NCR list will
change the MCI.
B. MCI Detection and Resolution using Transmission Gaps
3. The conflicting cell that most recently changed Another type of MCI conflict is when the candidate cell has
MCI will change the MCI. the same MCI as the serving cell, see Fig. 5. In that case, the
mobile may not be able to report the weaker cell to the serving
cell because the weaker cell is directly interfered by the serving
cell on the same signature sequence. To intuitively explain why
155
this is the case we may consider two different scenarios. In the
first scenario only the serving cell is transmitting a signature
6
sequence. The mobile searches for this signature sequence by
cross-correlating the received signal with the same signature 5
sequence. In case the received signal contains the NCR: 5, 6, 15
corresponding signature sequence then the cross correlation
output will contain a distinct peak. The location of the peak 15
156
mobiles need to be informed about the MCI reconfiguration.
This might be considered as a minor issue, but the serving cell
signaling to served mobiles described above applies also for
this purpose.
A. Scenarios
1) Mjrdevi Scenario Figure 7. Aerial view of the fictitious deployment in Mjrdevi Linkping.
The first scenario is selected for illustrative purposes. It is a The outer walls of the building are marked with grey (red) lines. The inner
fictitious network in Mjrdevi (Linkping, Sweden), see Fig. 7. walls (facing the in-between building area) are marked with dark (blue) lines.
A supposedly good and adequate macro deployment with 30 Fig. 8 and Fig.9 will concentrate on coverage within the area marked by the
black square.
cells (Fig. 8) is evolved with the addition of five micro cells to
better cover areas between houses (Fig. 9). These micro cells -70
initially have empty NCR lists, are not listed in any neighbor
cell lists of the macro cells, and are initiated with conflicting -80
MCIs. This is to mimic the situation that may arise when no Macro Cell
effort whatsoever is made to configure the introduced micro -90
157
the mobiles that are in positions where they would trigger and NCR lists of other cells are removed. Its MCI is set to be the
send handover measurements of the RSRP. The distributed same as one random cell in its prior NCR list in order to
NCR list and MCI management algorithm is then implemented enforce a conflict.
to act upon the handover measurements from the mobiles, to
add NCR list entries, and to detect and resolve MCI conflicts.
Unless otherwise stated, the lowest GID strategy is adopted
when selecting which of the conflicting cell that is requested to 30
50
becomes available. Further MCI conflicts are resolved and the
network reaches steady state. 40
MCIs to the cells. Note that in Fig. 12 we have made the 380
problem more challenging by decreasing the total number of
available MCIs to 130. Even so, the accumulated collisions 360
Accumulated Collisions
simpler and smaller Mjrdevi scenario (see Section IV.C). The 280
reason is that the inter-dependencies in this relatively dense
network provide more informative measurements and updated 260
158
Then measurements are generated upon which the steady state, where there are no MCI conflicts and the NCR is
algorithm operates, and the accumulated MCI collisions are complete. Having developed and successfully shown the
recorded. This procedure is repeated 50 times, and the average performance of this approach, we believe that the results will
convergence over the 50 different initial states is presented in have a significant positive impact on the operator OPEX.
Fig. 13. It can be concluded that the three strategies perform
In our future work we intend to develop additional
roughly equal, and that the differences are minor, especially
when considering how many collisions in total that the techniques for improving the performance of wireless access
networks. These include automatic optimization of radio
strategies causes. The strategy, which selects the cell which
most recently has changed MCI, results in a slightly better parameters, such as cell power and HO-related parameters.
convergence rate. However, note that we are also interested in
the strategy that requires the least signaling effort. A good REFERENCES
choice is to use the lowest GID criterion since the GID is [1] E. Dahlman, S. Parkvall, J. Skld, and P. Beming, 3G Evolution
already known by the detecting cell. HSPA and LTE for Mobile Broadband, Elsevier, 2007.
[2] 3GPP TR 25.913 , Technical Specification Group Radio Access
We observe that the results of the major city scenario are in Network; Requirements for Evolved UTRA (E-UTRA) and Evolved
line with the Mjrdevi case, i.e., we have shown that the MCI UTRAN (E-UTRAN), Release 7.
conflicts are resolved and that the network reaches an [3] NGMN, Operator Use Cases related to Self Organising Networks, ver.
equilibrium state where no further conflicts are detected. The 1.53, 2007-04-16.
approach is insensitive to the number of MCIs available and, [4] IBM Autonomic Computing, http://www.research.ibm.com/autonomic/
as such, the MCI management algorithm ensures locally unique [5] C. Prehofer and C. Bettstetter, Self-Organization in Communication
MCIs even if the total number of MCIs is significantly lower Networks: Principles and Design Paradigms, IEEE Communications
Magazine, July 2005.
350 [6] S. Dobson et al., A Survey of Autonomic Communications, ACM
Transactions of Autonomous and Adaptive Systems, Vol. 1. No. 2,
December 2006.
300
Lowest CIPL [7] R.M. Joyce, T. Griparis, G. R. Conroy, B. D. Graves, I. J. Osborne, A
Accumulated MCI Collisions
Shortest NCR Novel Code Planning Approach for a WCDMA Network, IEEE
250 Conference on 3G Mobile Communication Technologies, 2003.
Recent MCI change
[8] S. Kourtis, Code Planning Strategy for UMTS-FDD Networks,
200 Vehicular Technology Conference, 2000.
[9] H. Olofsson, S. Magnusson, M. Almgren, A Concept for Dynamic
150
Neighbor Cell List Planning in a Cellular System, IEEE Personal,
Indoor and Mobile Radio Communications, Taipei, Taiwan, 1996.
100
[10] S. Magnusson and H. Olofsson, Dynamic Neighbor Cell List Planning
in a Micro Cellular Network, IEEE International Conference on
50 Universal Personal Communications, San Diego, CA, USA, 1997.
[11] P. Gusts, P. Magnusson, J. Oom and N. Storm, Real-Time
0 Performance Monitoring and Optimization of Cellular Systems,
2 4 6 8 10 12 14 16
Measurements/cell
Ericsson Review, No. 1, 2002.
[12] 3GPP TS 25.133, Requirements for Support of Radio Resource
Management (FDD).
Figure 13. Comparison of different strategies for selecting which of the
conflicting cells that has to change MCI. The difference between the strategies [13] D. Soldani and I. Ore, Self-Optimizing Neighbor Cell Lists for UTRA
is quite small, even though changing the conflicting cell that most recently has FDD Networks Using Detected Set Reporting, IEEE Vehicular
changed MCI corresponds to a somewhat faster convergence. Technology Conference, 2007.
[14] J. Baliosian and R. Stadler, Decentralized Configuration of
than the current specification (as specified by 3GPP). This is an Neighboring Cells for Radio Access Networks, 1st IEEE Workshop on
Autonomic Wireless Access (in conjuction with IEEE WoWMoM),
important aspect since denser networks are expected as the 2007.
deployments evolve and with the inclusion of micro cells, pico
[15] F. Parodi, M. Kylvj, G. Alford, J. Li, and J. Pradas, An Automatic
cells and Home eNodeBs. Further, we have shown that there is Procedure for Neighbor Cell List Definition in Cellular Networks, 1st
no major difference, in terms of number of generated MCI IEEE Workshop on Autonomic Wireless Access (in conjuction with
conflicts, when employing a particular strategy for selecting IEEE WoWMoM), 2007.
which cell to change its MCI. [16] K.-W. Chin, D. Lowe, and W.H.O Lau, Routing in MANETs with
Address Conflicts, International Conference on Mobile and Ubiquitous
Systems: Networking and Services, 2005.
V. CONCLUSION [17] 3GPP TS 36.300 v8.0.0, Evolved Universal Terrestrial Radio Access
We have developed and proposed a set of algorithms for (E-UTRA) and Evolved Universal Terrestrial Radio Access (E-
automating the operation of the 3G Evolution radio network UTRAN); Overall description; Stage 2
LTE. These algorithms aim at solving MCI conflicts and [18] TEMS Cellplanner Universal, http://www.ericsson.com/solutions/tems/
generating and updating NCR lists using mobile-assisted [19] J. Laiho, A. Wacker, T. Novosad, editors, Radio Network Planning and
Optimization for UMTS, John Wiley & Sons, 1st edition, 2002.
measurements. The algorithms are fully automated and run
continuously, thus, they require no operator intervention. The
performance evaluation shows that the network converges to a
159