Performances Evaluation of Different Algorithms for PCIs Self Conguration in LTE

Mariem Krichen,Dominique Barth

PRiSM University of Versailles 45 avenue des Etats-Unis, 78035 Versailles, France Email: mariem.krichen,dominique.barth@prism.uvsq.Fr

Olivier Marc e
Alcatel-Lucent Bell Labs France Centre de Villarceaux 91620 Nozay Cedex France. Email: Olivier.Marce@alcatel-lucent.com

AbstractNowadays, network operators are basically facing two problems: the fast number of subscribers growth and the network congestion. To solve these problems, network operators increase the number of cells, make cells smaller and reserve a subpart of frequencies to Femto cells to ofoad data trafc. As a consequence, networks manual planning demands a lot of efforts and its cost increases. Self-conguring and self-optimizing mechanisms would be vital to operators to reduce manual planning. This article focuses on the application of these mechanisms in LTE and more specically on the procedure of Automated conguration of Physical Cell Ids (PCIs). This procedure aims at avoiding conicts in PCIs allocation. In this article, we rst evaluate the performances of 3 relabeling algorithms applied on graphs representing real LTE Macro networks: Random Relabeling algorithm (RR), Smallest available Value algorithm (SV), Distance 3 neighbour label algorithm (D3). Then, we evaluate the performances of the best algorithm applied on graphs representing real LTE networks where Femto cells are connected to Macro cells. Here, we answer the following question: is the selected relabeling algorithm still efcient when we extend its application to Femto cells?

LTE Macro-Femto networks. Finally, we propose a manner to enhance the performances of the selected relabeling algorithm. This paper is organized as follows: section II introduces the context as well as the problem of automated conguration of Physical Cell Identity (PCI) and the conditions to be respected to that aim. Section III presents the problem model. Section IV denes three relabeling algorithms. Simulations results are given and interpreted in section V. Finally, section VI draws some conclusions and perspectives. b) Related works: The problem of graph coloring has been adressed by Andrew Lim et al in [4] where some algorithms are proposed to determine the chromatic number of a graph. In [5], several variants of graph colouring, such as precolouring extension, list colouring, multicolouring, minimum sum colouring are reviewed and their applications in scheduling are discussed. In [6], Ting Wu et al. have analyzed an allocation method of physical cell identier (PCI) in LTE network, and then proposed an automation PCI allocation system (ACPIAS) framework. In [1], M. Amirijoo et al propose to rely on handover measurements to determine any PCI conict. Once detected the conict is xed by randomly choosing a PCI from the set of locally non-conicting ones. Simulation results show that this algorithm converges to conict free situation, even with a smaller number of available PCIs (130 instead of 504). However, this shows that it is needed to have close to 100 measurements by cell to reach a conict free situation. In addition, there is up to 400 conicts to be solved for a 200 cells network. The simulation does not consider addition of new cells; it only generates measurements and conict detection from mobile terminals. In[2], T. Bandh et al. present a basic application of graph coloring to the PCI allocation problem. It rst recalls that the PCI allocation can be done by a greedy algorithm. It also considers the incremental network growth when new base stations are added to an existing network. For PCI conict xing, it proposes to choose by priority a PCI that is at distance 3 of the cell that a PCI must be allocated, still enforcing restriction on PCIs that are used on cells at distance 1 and 2. Simulation results show that conict free allocation can be achieved in most cases. However no information about number of conicts, or stabilization time is given. In [3], P. Lee et al propose a manner to reserve a subset of PCIs for Femto, in a dynamic manner. The macrocells are responsible

I. I NTRODUCTION Heavy demand on wireless access networks makes them more complex in term of number of parameters to ne tune, and it increases the time needed to setup and to optimize the performances. In addition, the need for higher bandwidth leads to the reduction of cell size and to the increase of their number. Therefore, in order to prevent the growth of installation and maintenance costs, it is critical for operators to have self-conguring and self-optimizing systems. This paper addresses the self-conguration of the physical cell identity (PCI) parameter for 3GPP Long Term Evolution (LTE) networks. The procedure of Automated PCIs self-conguration aims at fulfulling two conditions: collision free which means that two neighbour cells should not have the same PCI and confusion free which means that a cell should not have two neigbour cells with the same PCI[9]. This procedure could be translated into a well known problem in Graph Theory called the Square Graph Colouring. This problem is known to be a NP hard problem [8]. a) Our contribution: Our contribution consists on comparing different relabeling algorithms applied on graphs representing real LTE Macro networks, on selecting the best one and to extend its application to graphs reffering to real

978-1-4673-4523-1/12/$31.00 2012 IEEE

197

ICON 2012

to determine the type of split used. II. C ONTEXT As the paper focuses on PCIs self conguration of macro cells and femto cells, we will rst dene some terms. A. LTE LTE is the latest standard in the mobile network technology. LTE aims at increasing the spectral efciency and exibility, improving the coverage and adding capacity. LTE also supports seamless mobility with older network technology such as GSM and UMTS. LTE architecture is based on new enhanced base stations called Evolved NodeB (eN B ). Each eNB controls one or several cells. B. Femto cell The Femto cell is a small cellular base station characterized by low transmission power, usually used for limited access to a closed user group. Today, the Femto cell is an in-building solution which is gaining a signicant interest since it helps operators to solve localized coverage problems and to extend their network. C. PCI (Physical Cell Identity) There exist two parameters to identify a cell: the Physical Cell Id (PCI) and the Cell Global Id (CGI). The CGI is a parameter that denes uniquely a cell among the entire network. It allows a cell to identify its neighbours and thus to update its list of neighbours. This information is available to the UE only after synchronisation with the cell. As such this is not usable for the handover, the synchronisation being done after its execution. The PCI is an essential conguration parameter for a radio cell. Note that 504 unique PCIs are supported leading to a reuse of the PCI in different cells. The PCI allows the UE to access a LTE cell whether if it is in a phase of initial synchronisation or in a phase of identication of a new cell. Since the available number of unique PCIs is limited, a conguration scheme which properly congures this parameter in each cell is needed to ensure proper operation of the radio network. The Automated Conguration of PCI is one of SON (Self Optimizing Network) use cases dened by 3GPP TR 36.902. When a new eNodeB is brought into the eld, a PCI needs to be selected for each of its supported cells. The PCI assignment should full the following conditions:

Fig. 1.

Example of a LTE network with collision and confusions

III. P ROBLEM MODELING A. Problem description The problem of PCIs self-conguration is equivalent to the Square Graph Coloring Problem. To model this problem, we consider a graph G = (V, E ) representing a LTE network with V the set of nodes representing the LTE cells and E the set of edges such as if we consider two nodes u V , v V , [u, v ] E if and only if u and v are neighbours. Lets consider a labelling L : V {1...} of G, where is the size of the labelling and where each node u V has a label labelu L. If we consider e = [u, v ] E , we say that the two nodes u and v are in conict if they are in one of the following situations: Case 1: u and v are in a situation of collision. In this case labelu = labelv . Case 2: u and v are in a situation of confusion. In this case w V such as [u, w] E ;[v, w] E and labelu = labelv . We respectively denote by Collision(L) and Conf usion(L) the number of collisions and the number of confusions induced by L in G. Given a graph G and a size of labelling the purpose here, in a distributed context, is to determine a labelling L minimizing Collision(L) and Conf usion(L). Note that Collision(L) = 0 iff L is a proper colouring of G (two adjacent vertices do not share a common color), and that Conf usion(L) = 0 iff L is a proper colouring of G2 , the square of G (i.e., obtained by adding an edge between all pairs of nodes in G of distance 2). Given a graph G, we focus on distributed mechanisms to determine an efcient labelling L with varying from b(G) to 504, where b(G) is the cardinal of a coloration of G2 obtained from a classical heuristic [7]. This heuristic gives the minimum number of labels needed to the square graph colouring considering a global knowledge of the graph. The incentive for varying from b(G) to 504 is to nd from which the performances of the labelling L are quasi stable: this means that using > slightly reduces Collision(L) and Conf usion(L). In real conditions, the number of available labels can be reduced for operational reasons, like splitting the set of labels between operators at country boundaries using the same frequencies, or reserving a sub part of the labels to Femto cells. In this case, the 504 available labels will be divided into

Collision free: The PCI is unique in the area that the cell covers. Figure 1 gives an example of one collision between cells of CGIs 2 and 7 having the same P CI 9. Confusion-free: A cell should not have neighbouring cells with identical PCI. Figure 1 illustrates an example of two confusions since the cell of CGI 8 as well as the cell of CGI 3 are common neighbours of two different cells of CGIs2 and 7, having the same PCI which is 9.

198

labels devoted to Macro cells denoted by M (M = ) and labels devoted to Femto cells denoted by F (F = 504 M ). All the nodes of the graph G are labeled randomly using labels which corresponds to the installation of LTE cells and its PCIs conguration. We consider the following hypothesis: after a nite duration, a cell will discover its neighbours not colliding with it thanks to Automatic Neighbours Relation (ANR) procedure [10]. B. Graph, Nodes and Edges characteristics Now, we give characteristics of the graph, the nodes and the edges. 1) Graph characteristics: Each graph G is characterized by a couple of integers (SG , M DG ) where: SG represents the Graph Size. M DG represents the Graph Mean Degree. 2) Nodes characteristics: Each node u V is characterized by a couple (Idu , lu ) of integers where: Idu represents a unique indentier of the node referring to the CGI. lu represents the label of the node u referring to the PCI. lu {1...}. 3) Edges characteristics: Each edge from a graph G is characterized by a Type and a Probability of detection where the Type refers to the trac generated by mobile stations and Probability of detection corrresponds to the probability of HO success/failure while passing from one cell to another. Thus, each edge e = [u, v ] E from G is represented by a triple 2 (T ypee , CollisionG e , P r.Detecte ). a) Edges Types: The type of an edge corresponds to the trac generated by mobile stations while moving around the 2 cells representing the edge. The more mobile stations visit a cell, the more they produce trac on it and thus the higher the weight of the edge is. T ypee {0, 1, 2} and is dened as follows: T ypee = 0 means that e is a high weighted edge. T ypee = 1 means that e is an intermediate weighted edge. T ypee = 2 means that e is a low weighted edge. I Note that (HL +I ) = f rac1 and H = f rac2 where H, I and L refer respectively to the number of High weighted edges, the number of Intermediate weighted edges and the number of Low weighted edges. b) Edges conicts: We recall that by conicts, we mean collisions and/or confusions. Note that both of collisions and confusions in G are 2 interpreted as collisions in G2 . Lets consider CollisionG e {0, 1} dened as follows: G2 if Collisione = 0 then e is not a conicted edge. G2 if Collisione = 1 then u and v such as [u, v ] = e are in collision in G2 . This could correspond to either collision or confusion in G. From this point forward, we say that e is a conicted edge if 2 CollisionG e = 1.

c) Edges Probability of Detection: The probability of detection of an edge corresponds to the probability of HO failure or success while moving from one cell to another. P r.detecte is [0, 1] and depends on T ypee and 2 CollisionG e . G2 Case 1: If Collisione = 0 Case 1.1: If T ypee = 0 or T ypee = 1, then P r.detecte = 1 Case 1.2: If T ypee = 2, then P r.detecte = 0 G2 Case 2: If Collisione = 1. Case 2.1: If T ypee = 0 then P r.detecte = P1 Case 2.2: If T ypee = 1, then P r.detecte = P2 with P2 < P1 Case 2.3: If T ypee = 2, then P r.detecte = 0 IV. R ELABELING A LGORITHMS This section presents 3 different relabeling algorithms in a distributed context: each node will discover step by step its neighbours following the edges probability of detection. Lets denote by: GR = (VR , ER ) the real graph. t t GD = (VR , ED ) the covering sub-graph discovered at step t. t t G = (VR , ED ) the covering sub-graph not discovered D yet at step t. t At each step t, we select an edge et ED until all edges t are discovered (ED = ). Each node u VR belonging to the covering sub-graph GDt updates a list of detected neighbours (at distance 1 G and distance 2) in GDt denoted by ListN eighu Dt . As a consequence, each node u VR belonging to the covering subgraph GDt updates a list of permitted labels used for relabeling G process if necessary denoted by P ermitLabelu Dt . 2 Here, we will consider the G2 D t = (VR , ED t ) the square of GDt (i.e., obtained by adding an edge between all pairs of nodes in GDt of distance 2). In the following, we present 3 different algorithms for relabeling a node u GDt when a conict has been detected. 4) Random Relabeling (RR) Algorithm: This algorithm is actually the one dened by standards. In this algorithm, labelu takes a random value from G P ermitLabelu Dt 5) Smallest available Value (SV) Algorithm: In this algorithm, labelu takes the smallest value from G P ermitLabelu Dt . 6) Distance 3 neighbour label (D3) Algorithm: Since standards forbid only the distance 1 and distance 2 neighbours labels, the principle of this algorithm is to use one of the node distance 3 labels. The D3 algorithm supposes that at a step t, a node u updates its list of distance three neighbours (which are not part of distance 1 or distance 2 neighbours) denoted by ListN eighD3u and the list of labels used by the distance 3 neighbours denoted by LabelD3u .

199

When the node u needs to be relabeled. So: if ListN eighD3u = , then labelu will take a random G value from LabelD3u Dt if ListN eighD 3u = , then we apply RR algorithm. In our simulations, we will consider a random discovery approach for edges discovery. In this approach, at each step t, t an edge et ED is generated randomly.

V. S IMULATIONS The graphs have been build based on data collected by OpenBMap initiative [11] which collects and stores id of cells (cellular and Wi-Fi access points) detected by participating mobile phones. The nodes of the graph are the recorded cells, and a link is created between two nodes if one or more mobile phone(s) records contain the two nodes. As the data are traces from working networks, it provides an unvaluable input to build graphs that represents operational networks. To extrapolate graph representing LTE networks, the node corresponding to cellular networks (GSM or 3G) are considered as Macro cells, while the Wi-Fi nodes are considered as Femto cells. This is an acceptable extrapolation due to the fact that both for macro and femto, power and frequencies are similar in terms of degree of the graph to those that will be used in Europe for LTE. Then the neighbouring will be similar. Note that for LTE on Digital Dividend frequencies (700MHz) the neighbouring would be denser due to longer propagation. The degree distribution of the resulting graphs have been compared to existing LTE networks and appear similar (mean degree usually between 11 and 13). Note that we evaluate the mean performances over 10 different labelings of the graph. For each labeling, performances are evaluated for 10 different numbers of available labels = {1 , 2 , 3 , . . . , 10 } where: 1 = b(G), 10 = 504. (10 1 ) i = i 1 + ( ); i = {2, . . . , 9}. 9 Due to the restricted number of pages, we present results for some of the graphs only. The results are equivalent for the other graphs that we used. A. Relabeling algorithms evaluation for real LTE Macro networks Here, we evaluate the performances of the relabeling algorithms presented in Section IV. Then, we select the optimal relabeling algorithm. 1) Performances evaluation of the Relabeling Algorithms: In this section, we evaluate the performances of the relabeling algorithms presented in Section IV applied on graphs representing real LTE Macro networks. Here, we present the results for a graph G=(SG , M DG ) where: SG = 499 and M DG = 12. Note that: H = 2050, I = 512, L = 513, f rac1 = 0.2, f rac2 = 0.25, P1 = 0.8, P2 = 0.25 and b(G) = 33. The choice of f rac1 and f rac2 has been made such as I = L which is a very extreme choice. The incentive for that is to check whether if good performances could be reached even

Fig. 2. Initial conicts and remaining conicts using different relabeling algorithms.

when we have the same number of Low weighted edges and Intermediate weighted edges. Figure 2 shows the number of initial conicts in G after the graph labeling and the number of remaining conicts after the relabeling process using the 3 relabeling algorithms: RR algorithm, SV algorithm and D3 algorithm varying the number of available labels from b(G) to 504.
RC RR RC SV RC D3 RERRR RERSV RERD3 RC RR RC SV RC D3 RERRR RERSV RERD3 RER AND RC 33 94 94 247 0.71 0.71 0.22 293 4 5 17 0.88 0.84 0.57 85 15 26 71 0.88 0.79 0.44 345 3 3 11 0.9 0.89 0.66 137 6 14 36 0.92 0.8 0.52 397 2 4 7 0.92 0.83 0.69 189 7 8 25 0.87 0.85 0.53 449 2 3 7 0.91 0.86 0.68 241 5 6 20 0.87 0.85 0.54 504 1 3 8 0.95 0.85 0.64

TABLE I
PARAMETERS USING THE DIFFERENT RELABELING ALGORITHMS .

Figure 2 shows that the performances of the RR algorithm and the SV algorithm are good in terms of number of eliminated conicts after relabeling. However, the reduction of conicts is not important using the D3 relabeling algorithm. In order to choose one among the 3 relabeling algorithms, we will compare them based on parameters such as: the number of remaining conicts after relabeling (RC ), the relabeling efcieny rate (RER). Let us denote by Conf lictsI the number of initial conicts and Conf lictsR the number of remaining conicts after the relabeling process. The Relabeling Efciency Rate (RER) is dened as follows: RER =
(Conf lictsI Conf lictsR ) . Conf lictsI

200

Table I summarizes the RER and RC parameters for the different relabeling algorithms. Table I shows that when = 504, RERRR = 0.95, RERSV = 0.85 and RERD3 = 0.64. In mean, the RER of the D3 algorithm is by far the worst one. However, the RER of the SV algorithm and the RR algorithm are quite the same. In fact, in mean RERRR -RERSV =0.05. 2) The optimal relabeling algorithm selection: If we summarize, following the RER and the RC parameters, the SV algorithm and the RR algorithm have almost equivalent performances. However, the SV algorithm saves a little more labels than the RR algorithm. As a consequence, in the SV algorithm there are more nodes relabeled several times comparing to the RR algorithm. The D3 algorithm is by far the worst relabeling algorithm: many remaining conicts, many nodes relabeled several times, bad RER. For all these reasons, we will select the RR algorithm as the optimal one. If we just focus on the RR algorithm, we remark in Figure 2 that the number of remaining conicts decreases with the rise of . We notice that starting from a value of = where b(G) < < 504, the variation of the number of remaining conicts is almost nil. We say that the performances of the relabeling algorithm are in a quasi-stable phase. Since the performances of the RR algorithm are almost invariant starting from , we could thus reserve subpart of the labels to Femto cells. The 504 available labels could be split as follows: M = =397 and thus F = 107. In the following subsection we will consider graphs referring to networks where Femto cells are connected to Macro cells. We will check whether if the performances of the RR algorithm are still good in this case and whether if splitting the number of available labels into labels reserved to Femto network and labels reserved to Macro network will enhance the RR algorithm performances comparing to the case where no split is considered. 3) Application of the RR Algorithm to Macro-Femto networks: Here, we present the results for a graph representing a real LTE network with Macro cells and Femto cells. G=(SG , M DG ) where: SG = 632 and M DG = 25. First, we apply the RR algorithm in the same way as in the rst part. Figure 3 shows the number of initial conicts after the entire graph labeling, the number of remaining conicts after the relabeling process and the number of relabelings triggered. Table II shows the RER and RC parameters varying from b(G) (261) to 504.
RER RC RER RC RER AND RC 261 0.71 107 396 0.76 59 288 0.73 88 423 0.77 53 315 0.76 74 450 0.77 49 342 0.75 68 477 0.77 47 369 0.76 63 504 0.79 39
THE ENTIRE

Fig. 3. Number of initial conicts,number of remaining conicts and number of relabelings using RR algorithm in the entire graph

applied to the graph reffering to a LTE network with Macro cells and Femto cells are good. The RER parameter reaches a value of 0.79 when = 504. Now, we want to enhance the performances of the RR algorithm by spliting into M and F where M is the number of available labels for the graph referring to the Macro network and F is the number of available labels to the graph referring to the Femto network. The incentive for splitting into M and F is to avoid collisions between Macro network and Femto network since both could not have the same PCI allocation. We will rst study separately the graph representing the Macro network and the graph representing the Femto network. a) Application of the RR Algorithm to the Macro network: The graph G representing the Macro network has the following properties G = (SG , M DG ) where: SG = 90 and M DG = 16. Table III summarizes the RER and RC parameters. The RR algorithm eliminates all the conicts starting from = 448. So, when the mobile operator will switch on only its Macro network using the algorithm proposed by standards for the PCIs-self-conguration, the quality of service of the network will be excellent with no HO failures and less than the number of PCIs xed by standards (504) are used.
RER RC RER RC RER AND RC 48 0.69 19 298 0.91 1 98 0.9 3 348 0.88 1 148 0.95 1 398 0.88 1 198 0.93 1 448 1 0 248 0.9 1 504 1 0
IN THE

TABLE III
PARAMETERS USING THE RR NETWORK .

A LGORITHM

M ACRO

TABLE II
PARAMETERS USING THE GRAPH .

RR ALGORITHM IN

Figure 3 shows that the performances of the RR algorithm

b) Application of the RR Algorithm to the Femto network: The graph G representing the Femto network has the following properties G = (SG , M DG ) where: SG = 542 and M DG = 16. Table IV summarizes the RER and RC

201

parameters. The graph G is almost 6 times bigger than G and as dense as G . The performances of the RR algorithm applied on G are very good. When = 504, 93% of total conicts are removed. So, when the mobile operator will switch on only its Femto network using the algorithm proposed by standards for PCIsself-conguration, the quality of service of the network will be very good with few HO failures. The number of remaining conicts is almost invariant starting from = 284.
RER RC 64 0.9 13 119 0.91 6 174 0.9 5 229 0.92 3 284 0.96 1 339 0.92 2 394 0.9 2 449 0.94 1
IN THE

504 0.93 1 F EMTO

RER AND RC

TABLE IV
PARAMETERS USING THE RR NETWORK .

A LGORITHM

We also note that the performances of the RR algorithm applied on the Macro network and the Femto network separately are good. These performances get regressive if both networks are switched on at the same time. This results from the interFemto network-Macro network connections representing 36% of the whole network cells connections. Since standards have xed 504 PCIs for cells selfconguration, we will only focus on selecting the optimal split of = 504 into M and F over 10 random splits. The results given by simulations are the following: M = 98 and = 406 . With this split, 37 conicts are remaining F and RER is equal to 0.81. This method barely enhances the performances of the RR algorithm. Indeed, reserving a subset of labels to the Macro graph and another subset to the Femto graph reduces the chances of having collisions between both graphs in the phase of labeling but also in the relabeling process. However, the split does not lead to confusions avoidance while relabeling. This is due to missing information (existence of Low weighted edges) and to many connections between both graphs (inter-graphs edges represent 36% of total edges). In addition to that, splitting the number of available labels leads to a slight increase of the number of conicts on both of the Macro graph and the Femto graph since the number of available labels for each graph has been limited comparing to the case where no split is used. To summarize, the method through which PCIs are split into Macro network and Femto network slightly rises conicts in both networks, avoids inter-networks collisions but inter-networks confusions are unavoidable due to the existence of Low weighted edges and many connections between Macro network and Femto network. VI. C ONCLUSION AND PERSPECTIVES This paper adresses the problem of PCIs self conguration in LTE. This problem has been modeled as a Square Graph Colouring Problem and we focused on determining the most efcient distributed mechanism to solve it. We dened how to construct graph representing LTE networks based on publicly available real networks traces. We also dened the parameters

used to simulate how the neighbouring are detected depending on the trafc density. We evaluated the performances of 3 different relabeling algorithms: the RR algorithm, the SV algorithm and the D3 algorithm applied on graphs representing real LTE Macro networks using extreme values for f rac1 and f rac2 . Then, we selected the RR algorithm as the optimal one for PCIs self conguration which is actually the algorithm used by standards. The performances of the RR algorithm reach a quasi stable state starting from a number of available labels . We thus proposed to save the remaining available labels to Femto network. Mobile operators can trust the algorithm proposed by standards when it comes to PCIs self-conguration in LTE Macro cells. They also can think about the future by putting aside some PCIs for Femto LTE cells. The Femto cells will help them to ofoad data trac and to extend the LTE network. Then, we extended the application of the RR algorithm to graphs referring to real LTE Macro-Femto networks. We found that the performances of the RR algorithm are still good in this case. Finally, we proposed a manner to split the available labels into two subsets: one subset reserved for Macro network and one subset reserved to Femto network. This solution has barely enhanced the RR algorithm performances. In fact, this solution avoids collisions between the Macro network and the Femto network but does not avoid the inter-networks confusions. As a rst perspective, we will focus on determining a way to reduce the number of confusions between Macro network and Femto network in order to enhance the entire network Quality of Service. As a second perspective, we will consider a connective discovery approach where the discovered covering sub-graph at each step is connective starting from the graph center. ACKNOWLEDGMENT Part of this work has been funded by the Austrian government and the City of Vienna in the framework of the COMET competence program. The authors would like to thank all AWARE partners for helpful discussions. R EFERENCES
[1] M. Amirijoo et al. Neighbor Cell Relation List and Physical C ell Identity Self-Organisation in LTE, [2] T. Bandh, G. Carle, H. Sanneck. Graph Coloring Based Physical-Cell-ID Assignment for LTE Networks, IWCMC 2009 [3] P. Lee et al Dynamic Reservation Scheme of Physical Cell Identity for 3GPP LTE Femtocell Systems, JIPS vol 5, No 4 December 2009 [4] Andrew Lim, Xingwen Zhang, Yi Zhu. A Hybrid Method for the Graph Coloring and Its Related Problems, MIC, The Fifth Metaheuristics International Conference 2003 [5] Andrew Lim, Xingwen Zhang, Yi Zhu. Graph Colouring Problem And Their Applications In Scheduling, PERIODICA POLYTECHNICA SER. EL. ENG. VOL. 48, NO. 1, PP. 11-16 2004 [6] Ting Wu, LanLan Rui, Ao Xiong, ShaoYong Guo. An Automation PCI Allocation Method for eNodeB and Home eNodeB Cell,ISBN 978-14244-3708-5 6th International Conference on Networking and Mobile Computing (WiCOM) 2010 [7] Kubale, M. Graph Colorings, American Mathematical Society, ISBN 08218-3458-4. 2004 [8] Doruk Bozdag et al. A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers. In Proceedings Of HPCC-05, The 2005 International Conference ON High Performance Computing And Communications, Lecture Notes In Comput. Sci. 3726, 796-806. 2005

202

[9] 3GPP TR 36.902 V9.2.0. 2010-06. [10] Sujuan Feng, Eiko Seidel. Self-Organizing Networks (SON) in 3GPP Long Term Evolution. Nomor Research GmbH, Munich, Germany, 2008. [11] A free and open map of wireless communicating objects , www.openbmap.org. last visited on May 31st, 2012

203