Automatic Distributing Schemes of Physical Cell Identity for Self-Organizing Networks

Abstract

This paper presents and puts forward an optimal automatic distributing of physical cell identity (ADPCI) scheme for the self-organizing network (SON). Considering the high number and the layered structure of the evolved node B (eNodeB, eNB) in the initial rollout phase, the assigning of PCI for cells would be quite complex. The PCI self-distributing problem is mapped to the well-known minimum spanning tree (MST) problem in order to optimize the PCI reuse distance and decrease the multiplexing interference. The correlation property of PCI is analyzed and taken into consideration in the assigning phase. Moreover, a suboptimal algorithm (SADPCI) is presented as it performs approximately to ADPCI but the computational complexity is lower. To demonstrate the proposal validity, performances of ADPCI and SADPCI are evaluated. Simulation results illustrate that these schemes can achieve significantly higher performance even under the condition of severe PCI deficiency.

1. Introduction

There is a strong momentum for self-organizing features in wireless communication networks, self-configuration and self-optimization are identified as two mechanisms to facilitate operation and manage the long term evolution (LTE) network [1, 2]. In parallel, the self-distribution of PCI is included in the self-configuration use cases defined by the Next Generation Mobile Networks (NGMN) Alliance [3].

The objective of this use case is to assign a PCI to each cell so that mobile terminals can identify neighboring cells without ambiguity. PCI indicates the primary and secondary synchronization signals which help user equipment (UE) to acquire frequency and time synchronization during the cell search phase. However, considering the high number and layered structure of eNodeBs, finite number of IDs need to be reused across the network. Therefore, PCI allocation must to be planned carefully to avoid multiplexing interference and conflict. Methods for managing other radio resources [4, 5] can also be applied in PCI allocation.

Some proposals are discussed in [6–10]. One suggests that eNB scans its own radio environment, especially in terms of reception of the down-link transmission band of neighboring radio cells to acquire PCI information. The scanning method helps eNB to identify unavailable PCI and thus avoid collision to a certain degree. However, in order to perform a confusion free selection of PCI, the PCI assigning information of neighbors' neighbors have to be measured, but the measurement result depends on the signal quality which cannot be guaranteed. Another method has performed a distributed solution that relies on the use of a temporary PCI. The new eNB chooses a random PCI from a predefined set provided by operation administration and Maintenance (OAM) and starts to operate. The automatic neighbor relationship (ANR) function is utilized to acquire neighbors' PCI information supported by UEs. The method performs more effectively to address both collision and confusion requirements than the previous method. However, it relies on the proper location of UEs to identify each of all the neighbors; furthermore, PCI reconfiguration causes UE dropping and brings too much overhead to the system. A centralized approach [9] has mapped the PCI assignment problem to the well-known and well-understood problem of graph coloring. The coloring algorithm is used and simply extended in the approach, and it provides an efficient initial assignment even for complex networks. The scheme has analyzed the properties of the colored graph that is used for extending the network with new cells, and the results show that only minimal interruptions have occurred while still retaining the properties of a colored graph. Another centralized approach (HCPCI) [10] has introduced a hyper graph coloring PCI assigning scheme. The neighbor's relationship degree N is regarded to be the reuse distance; only when $N \geq 7$ , PCI are PCI could be reused.

This paper proposes an automatic distributing PCI scheme. At first, the correlations between different PCIs are analyzed and the interinfluence IDs are classified into different groups. The PCI distributing problem is mapped to the well-known MST problem and the reuse distance is taken into account in order to decrease the multiplexing interference throughout the entire network. A suboptimal scheme is proposed as a second solution which has a good performance approximated to ADPCI but with much lower computational complexity.

The remainder of this paper is organized as follows. Section 2 contains a detailed description of scenarios and the framework of PCI management, the distributing principles as well. Section 3 analyzes the correlation property of IDs and represents the proposed schemes of ADPCI and SADPCI. The performance evaluation is presented in Section 4, followed by a conclusion in Section 5.

2. PCI Assigning Framework and Principles

2.1. PCI Distributing Scenario and Framework

Two typical scenarios are defined in the SON description specification [6]. In a macrocell deployment, a large number of eNBs are deployed and requiring PCI configuration during the initial network establishment. However, the number of PCIs is limited and insufficient to guarantee that each cell gets an individual PCI. Thus, PCI has to be reused in the network which brings the multiplexing interference inevitably. Another scenario is the assignment for individual eNB during the network growth.

To minimize the human interventions and decrease the planning, deployment, optimization, and maintenance activities, the newly deployed eNBs are configured by automatic installation procedures by OAM to get basic parameters and download necessary software for operation. The support for PCI assignment is translated into concrete functionalities, interfaces, and procedures as shown in Figure 1.

Figure 1

The framework of PCI self-configuration.

(i)

Centralized SON function: according to centralized SON function, the newly deployed eNBs obtains relevant PCI allocating information, including antenna location, cell identity, cell radius, down tilt, and height of antenna. The geographic coordinates can be obtained with the help of the global position system (GPS) and other information is acquired during the base station establishment phase. The information of eNBs are classified and provided to upper layer OAM through Itf-N (interface-north).

(ii)

Data processing/configuration interface: this module has the responsibility to process the data obtained from the network, like cell type, cell state, and the neighbor relations are classified and transmitted to the database. When the PCI allocating decision is made, it indicates eNBs to update the results.

(iii)

Policy management base: this module indicates the PCI self-configuring policy. Operators can provide specific groups of IDs which meet specific requirements for example to ensure uniqueness in border regions. The policy can be created, edited, and modified by the operators or through the PCI allocation feedback information.

(iv)

PCI algorithm execution: based on the information from database, PCI algorithm analyzes the allocating policy and executes for PCI distribution.

(v)

PCI resources management bases: PCI usage status is stored in resource bases, including PCI reuse frequency, the PCI number for macro cell, and heterogeneous nodes.

(vi)

Database: mainly contains related information that obtained from lower layer or indicated from other modules. It provides indispensible information for the algorithm, for example, cell state information, cell type information, and neighbor list.

2.2. Allocation Issues and Principles

Despite the existence of 504 different IDs, the actual available identities are limited to a smaller number. IDs are grouped into 168 groups and three sequential PCIs are generally corresponding to three sectors in an eNodeB. Furthermore, IDs are divided into subsets for macro-, micro-, and femtocells in order to simplify the new eNB introduction in one layer without impacting on other layers. The available PCI number for macro cell is not as redundant as expected, therefore PCI reuse is inevitable. The optimization of PCI assigning relies on the location and basic orientation of eNBs and the reuse distance should be taken into account. The objective of ADPCI is to optimize the reuse distance and minimize interference to achieve global optimum.

In addition, each cell identity corresponds to a unique combination of an primary synchronization signal (PSS) sequence and an secondary synchronization signal (SSS) sequence, each of which comprises of a sequence of length 62 symbols and perforce a great correlation property. However, a number of SSS sequences are high correlated to others, which affects UE to recognize the target cell. The cross-correlation properties are analyzed in the next section. On the other hand, the automatic configuration is specified to meet the requirements of collision and confusion free [6]. The former means two neighbor cells cannot use identical ID; the latter one implies that one cell cannot have any two neighbor cells that assigned with identical ID, thus allowing for ID reuse by 3rd degree neighbors, as shown in Figure 2.

Figure 2

Cell identity collision and confusion.

Based on the above factors, the principles of PCI assigning mainly include the following. (i)

To satisfy the collision free and confusion free, identical ID reuse is allowed by 3rd degree neighbors.

(ii)

SSS sequences with high cross-correlation should be widely separated.

(iii)

The reuse distance should be regarded to be as far as possible.

3. PCI Self-Distributing Algorithm

3.1. Synchronization Signals Sequences Correlation Analysis

In this section, the property of synchronization code is analyzed and the result will be provided. Highly correlated IDs are grouped together based on the results, and will be distributed separately. As described in [11], each ID can be expressed by the following equation:

\begin{matrix} N_{ID}^{cell} = {3 N}_{ID}^{(1)} + {3 N}_{ID}^{(2)}, \end{matrix}

(1)

where

N_{ID}^{(1)}

is indicated by SSS sequences in the range of 0–167, it represents the ID groups.

N_{ID}^{(2)}

is indicated by PSS sequences in the range of 0–2, defining the actual cell identity within a group. The SSS sequences are specially designed. It is based on M-sequences, which can be created by cycling through every possible state of a shift register. Two codes are two different cyclic shifts of a single length-31 M-sequence and alternated between slot 0 and slot 10 in each radio frame, which enables the UE to determine the 10 ms radio frame timing from a single observation of a SSS in the synchronization procedure. The code is one-to-one mapped to the physical layer identity within the group corresponding to the target eNodeB. Details of the scrambling operations are given in [11].

Based on the understanding of SSS sequences, all SSS sequences are generated and the correlations between any two of codes are estimated. Figure 3 illustrates the cross-correlation of sequence $i n d e x = 84$ in frequency domain. The blue and red stems represent the cross-correlation value in slot 0 and slot 10, respectively. The results show that most of the sequences have good properties (less than 0.2), but a few pairs are highly correlated (near 0.5). All the SSS sequences in one slot are correlated reciprocally, but not between different slots. However, both slots in a frame should be considered due to the synchronization process for cell search. As shown in the simulation result, the sequence $i n d e x = 84$ are highly correlated with sequences ${25,55,84,112,139}$ in slot 0 and ${27,56,111,137,162}$ in slot 10, respectively. Let $C R s e t (n)$ be the combination of sets that contains both slots for ID $i n d e x = n$ , thus $C R s e t (84) = {25,27,55,56,84,111,112,137,139,162}$ . Identities from the same $C R s e t (n)$ are considered to be separated. The result of PCI with high correlation values are grouped in both slots, shown in Table 1.

Table 1

Groups of SSS sequences with high correlation.

Slot 0							Slot 10
0	30	59	87	114	140	165	0
1	31	60	88	115	141	166	1	30
2	32	61	89	116	142	167	2	31	59
3	33	62	90	117	143		3	32	60	87
4	34	63	91	118	144		4	33	61	88	114
5	35	64	92	119	145		5	34	62	89	115	140
6	36	65	93	120	146		6	35	63	90	116	141	165
7	37	66	94	121	147		7	36	64	91	117	142	166
8	38	67	95	122	148		8	37	65	92	118	143	167
9	39	68	96	123	149		9	38	66	93	119	144
10	40	69	97	124	150		10	39	67	94	120	145
11	41	70	98	125	151		11	40	68	95	121	146
12	42	71	99	126	152		12	41	69	96	122	147
13	43	72	100	127	153		13	42	70	97	123	148
14	44	73	101	128	154		14	43	71	98	124	149
15	45	74	102	129	155		15	44	72	99	125	150
16	46	75	103	130	156		16	45	73	100	126	151
17	47	76	104	131	157		17	46	74	101	127	152
18	48	77	105	132	158		18	47	75	102	128	153
19	49	78	106	133	159		19	48	76	103	129	154
20	50	79	107	134	160		20	49	77	104	130	155
21	51	80	108	135	161		21	50	78	105	131	156
22	52	81	109	136	162		22	51	79	106	132	157
23	53	82	110	137	163		23	52	80	107	133	158
24	54	83	111	138	164		24	53	81	108	134	159
25	55	84	112	139			25	54	82	109	135	160
26	56	85	113				26	55	83	110	136	161
27	57	86					27	56	84	111	137	162
28	58						28	57	85	112	138	163
29							29	58	86	113	139	164

Figure 3

Cross-correlation of a pair of SSS sequences.

3.2. Optimal PCI Self-Distributing Algorithm

The procedure of ADPCI is illustrated step by step in Figure 4 and cell identities sets are defined to facilitate the description of the algorithm in Table 2. The algorithm consists of three stages. In Stage I, the assigning order of eNBs will be given according to the well-known minimum spanning tree (MST) algorithm. In Stages II and III, PCI distributing and reuse methods are discussed in detail.

Table 2

PCI sets for ADPCI algorithm.

Name	Meaning
$P s e t A$	A set of all PCI range from 0 to N
$P s e t U$	A set of all used PCI
$C R s e t (n)$	A Set of IDs that combine both sets where $i n d e x = n$ affiliated to in slot 0 and 10
$P s e t K$	PCI set corresponding to the ordered list K
$P s e t L$	eNB set corresponding to the ordered list L
$P s e t N$	PCI set of direct neighbor
$P s e t N N$	PCI set of neighbor of direct neighbors

Figure 4

The Flow chart of the proposed ADPCI.

In the first stage, the network deployment is mapped into an abstract graph to reflect the actual network environment based on the location of nodes. The network deployment is mapped into a fully connected and undirected graph $G = (V, E)$ , where vertices represent the network nodes, and edges represent the connection between vertices. Moreover, each edge is weighted with signal transmission propagation loss value. Specifically, the created graph $G = (V, E)$ is defined as follows. (i)

Define a set of vertexes $V = {v_{i}}$ , where the element $v_{i}$ represents the ith eNB.

(ii)

Define a set of edges $E = {e_{i, j}}$ , where $e_{i, j}$ is the edge between $v_{i}, v_{j}$ .

(iii)

Define an $m \times m$ matrix of weight values W:

\begin{matrix} W = (\begin{pmatrix} w_{11} & \dots & w_{1 m} \\ ⋮ & ⋱ & ⋮ \\ w_{m 1} & \dots & w_{m m} \end{pmatrix}), \end{matrix}

(2)

where $w_{i, j}$ is the weight value of edge $e_{i, j}$ . The weight values can be defined by different principles to meet the specific requirements. Here we use different experiment transmission models to calculate the path loss values based on the practical network environment, $w_{i, j}$ is defined as calculated linear propagation loss value. The calculation is based on different experiment transmission models.

The MST algorithm (see the Appendix) is applied and extended to search the minimum propagation loss values. Figure 5 shows the procedure of adding edges with minimum weights and the growth of the MST. Independent trees are connected by edge with minimum weight till a spanning tree is formed. The algorithm result returns the assigning order of eNBs, allowing assignment to avoid reuse interference by using different identities.

Figure 5

MST searching procedure.

In Stage II, PCIs are assigned to eNBs one by one following the order. Suppose that there are N IDs for the macro-eNBs, thus the top N eNBs in the MST result can acquire ID without causing reuse interference; as long as the high correlated IDs are separated.

Let m be the neighbors' identities of the ith eNB. Different PCIs are randomly picked from the unused set $P s e t A ∖ P s e t U ∖ ⋃_{m}^{} C R s e t (m)$ and added to the used set once they have been used. In this way, the highly correlated PCIs from neighbor cells are excluded from the assigning sets to guarantee an interference-free assignment.

However, when all unused PCIs have been assigned, PCI reuse is inevitable, which leads to the third state. It is more accurate to estimate the reuse effect before actually using it. Let $k_{i} (n)$ be the reuse impact factor (RIF) for the ith eNB, it can be calculated and expressed by cumulative propagation loss values as follows:

\begin{matrix} k_{i} (n) = \sum_{j = 1}^{d} w_{i, j}, \end{matrix}

(3)

where

w_{i, j}

is the linear propagation loss value from interfered

eN B_{j}

to reference

{eNB}_{i}

. The parameter d is the number of eNB that assigned with identical value

i n d e x = n

at the current state. In this way, the RIFs of all IDs can be expressed, a column list K is composed as follows:

\begin{matrix} K = (\begin{pmatrix} k_{i} (1) \\ k_{i} (2) \\ ⋮ \\ k_{i} (N) \end{pmatrix}), \end{matrix}

(4)

where

k_{i} (n)

with different PCI indexes are calculated and included in the list, the length of K equals to the number of available PCI for macro cell. The RIF quantifies the interferences of each PCI and helps to select the optimal PCI, shown in Figure 6. Next we sort elements in list K in descending order. The set

P s e t K

is the PCI set corresponding to the ordered list K. The results return an ordered list of elements from high to low. The higher

k_{i} (n)

, the less serious

{eNB}_{i}

can be interfered. The return result may contain IDs used by neighbors and highly correlated resources, which need to be fixed to avoid collision confusion. The main steps are presented as follows:

(i)

If $P s e t K_{i} ∖ {P s e t N_{i} \cup P s e t {N N}_{i}} ∖ ⋃_{m}^{} C R s e t (m)$ is not empty, pick the first element from it and assign it to the eNB.

(ii)

If $P s e t K_{i} ∖ {P s e t N_{i} \cup P s e t {N N}_{i}} ∖ ⋃_{m}^{} C R s e t (m) = \emptyset$ , use the first element from set as $P s e t K_{i} ∖ {P s e t N_{i} \cup P s e t {N N}_{i}}$ suboptimal solution.

(iii)

Otherwise, pick the first element from set $P s e t K_{i}$ and assign it to ${eNB}_{i}$ .

Figure 6

Calculation of RIFs ( $k_{i} (1)$ and $k_{i} (2)$ ) for different IDs.

The calculation of RIF helps eNB to evaluate the potential multiplexing interference and to make the best decision of assigning at current state. Meanwhile, removal of neighbors' PCIs can be done to avoid collision and confusion.

3.3. Suboptimal Algorithm for PCI Self-Distributing

The ADPCI provides an optimal algorithm for self-distributing, however, the high-performance causes high computational complexity. In this section, a suboptimal solution with relatively low computational complexity is given.

Define a concept of use frequency factor (UFF) for each PCI as it indicates the identity reuse times, let $U = {u_{1} u_{2} \dots u_{N}}$ be the set that contains all UFFs for every PCI. In each looping, the PCI corresponding to $\min_{} U$ is preselected, then estimate the reuse interference for every eNBs. The RIF of PCI $i n d e x = n$ for every unassigned eNBs can be calculated by (3), and a list L is defined as follows:

\begin{matrix} L = (\begin{pmatrix} k_{1} (n) \\ k_{2} (n) \\ ⋮ \\ k_{i} (n) \end{pmatrix}), \end{matrix}

(5)

where

k_{i} (n)

is the RIF value of

{eNB}_{i}

assigning with PCI

i n d e x = n

. In this case, the ID

i n d e x = n

is the constraints and the eNBs i is the variable. Sort list L in descending order; the elements from the head of the list have a higher cumulative propagation loss value and trend to be influenced by multiplexing interferences less than that in the tail. The result may also need to exclude IDs used by neighbors and the highly correlated IDs. The set

P s e t L

is the eNB set corresponding to the ordered list L. The main steps for selecting the appropriate eNB are presented as follows.

(1)

Select a PCI $i n d e x = n$ with minimum UFF when there is unused identity.

Pick an eNB if it satisfies ${P s e t N_{i} \cup P s e t {N N}_{i}} \cap C R s e t (n) = \emptyset$ and assigned with ID $i n d e x = n$ . Otherwise, pick other eNBs.

If there is no eNB that can satisfy ${P s e t N_{i} \cup P s e t {N N}_{i}} \cap C R s e t (n) = \emptyset$ , randomly pick an eNB to be assigned with ID $i n d e x = n$ .

(2)

Select a PCI $i n d e x = n$ with minimum UFF when all $u_{n} > 0$ , calculate the RIF for every unassigned eNBs by (3) and sort list L in descending order.

Pick the first element from top to bottom of the set $P s e t L$ that satisfies the PCI n and its highly correlated IDs are not in this ${eNB}_{i}$ 's neighbor list, ${P s e t N_{i} \cup P s e t {N N}_{i}} \cap C R s e t (n) = \emptyset$

If no eNB can meet the requirement above, pick the suboptimal selection that satisfies ${P s e t N_{i} \cup P s e t {N N}_{i}} \cap {n} = \emptyset$ .

Otherwise, pick the first element from set $P s e t L$ for assignment.

The major difference between SADPCI and ADPCI is that PCI is preselected before estimating the interfering influence for different eNBs. The calculation for eNBs' assigning order is unnecessary and the high computation of searching MST could be omitted; moreover, during the PCI reuse phase, the calculation for all PCI resources' RIF needs high computational complexity; however, only a few numbers of RIF for individual PCI has to be calculated in SADPCI.

4. Evaluation and Analysis

In this section, the proposed ADPCI and SADPCI are evaluated and analyzed through the performance of users' carrier to interference ratio (CIR). We consider the simulations using a densely deployed scenario where a macrodeployment with 50 eNBs and 1000 users involved, and these eNBs and UEs are randomly distributed in the area. In order to illustrate the influence of transmission propagation models, two different signal transmission models are used to reflect the environmental changes that impacted the result of PCI distribution. The propagation loss calculation is based on the COST231 Hata urban propagation model [12]:

\begin{array}{l} P_{L, urban} (d) dB \\ = 46.3 + 33.9 \log_{10} (f_{c}) - 13.82 \log_{10} (h_{t}) - a (h_{r}) \\ + (44.9 - 6.55 \log_{10} (h_{t})) \log_{10} (d) + C_{M}, \end{array}

(6)

where

a (h_{r})

is a correction factor for the receiver height based on the size of the coverage area;

C_{M}

is 0 dB for medium-sized cities and suburbs and is 3 dB for metropolitan areas; the carrier frequency

f_{c}

is 2 GHz; the height of transmitter

h_{t}

and receiver

h_{r}

are set to 50 m. Another model is the dual-slope model, a special case of the piecewise linear model [13]:

\begin{matrix} P_{r} (d) dB = {\begin{cases} P_{t} + K - 10 γ_{1} \log_{10} (\frac{d}{d_{0}}) \\ d_{0} \leq d \leq d_{c}, \\ P_{t} + K - 10 γ_{1} \log_{10} (\frac{d_{c}}{d_{0}}) - 10 γ_{2} \log_{10} (\frac{d}{d_{c}}) \\ d > d_{c}, \end{cases} \end{matrix}

(7)

where

P_{t}

is the transmit power; K is a constant path-loss factor;

γ_{1}

is the path-loss exponent above some reference distance

d_{0}

and up to some critical distance

d_{c}

, after which power falls off with path-loss exponent

γ_{2}

Furthermore, the available identity number N has been reduced to only 6 in order to make the solution more compelling. To compare with this extreme situation, 30 IDs are used in simulation as well. The system parameters in simulation are presented in Table 3.

Table 3

Simulation parameters.

Parameters	Assumption
Cellular layout	Randomly distributed, 50 eNBs
User layout	Randomly distributed, 100 users/eNB
Cell radius	288 m
BS Transmit Power	46 dBm
Carrier frequency	2 GHz
Number of PCI	6 OR 30
Macro propagation models	Model #1 Piecewise Linear
Macro propagation models	or Model #2 COST231 Hata

To demonstrate the proposal superiority, different schemes are used in simulation for comparison. A randomly distributing scheme (RDPCI) has been introduced to assign eNB randomly; it represents the worst situation of assignment without any optimization. Besides, a hypergraph coloring PCI assigning scheme (HCPCI) uses the neighbor's relationship degree N to indicate the degree of neighbors' relationship, which is regarded to be the reuse distance. ENBs with $N \leq 7$ are too close to reuse PCI, only when $N \geq 7$ , PCI are allow to be reuse. The R-PCIS offers the lower bound of assigning property while the HCPCIS reduces reuse interference more effectively.

Figure 7 shows the performance comparisons among the four schemes when the number of PCI N varies from 6 to 30. The simulation results show that there are huge performance gaps between ADPCI and RDPCI. The gaps are becoming larger when the number of PCIs are richer, for example, the average CIR ( $CDF = 0.5$ ) between ADPCI and RDPCI varies from 4 dB to 9 dB when PCI number changes from 6 to 30. Because of the PCI deficiency, the multiplexing interference increased inevitably with the densely distribution of PCI. The proposed ADPCI always performs better than the other schemes for achieving higher users' CIR due to the optimized reuse distance in PCI configuration; the curve of SADPCI is close to ADPCI and the performance is approximate to ADPCI. The mainly gaps between ADPCI and SADPCI is the gain of applying MST algorithm because the reuse interference can be avoided by unused PCI. With the unused PCIs increase from 6 to 30, the gap is becoming larger as the MST effect is more significantly.

Figure 7

Users' CIR distribution when PCI number changes.

Figure 8 shows the CDF curves of CIR where different propagation loss models are used. The choice of models should be based on the practical environment; the selection also affects the calculation of weight, thus influences the algorithm results. Although varied models have shown mixed results where the COST231 Hata urban propagation model performs a sharper slope of CIR curve and Broken-Line model has a smooth one, the performance of different schemes are obvious. However, the results suggest that the performances of ADPCI and SADPCI over the others schemes are similar to that of previous simulation.

Figure 8

Users' CIR distribution when different models are applied.

5. Conclusions

The ADPCI is presented to improve the performance of PCI management by greedy search to achieve the global optimum. The mechanism benefits from two aspects: utilizing the grouped PCI resources to avoid multiplex interference; decreasing reuse interference through estimating the reuse influence of different IDs. The SADPCI has a similar property as ADPCI but needs less computational complexity. The performance of the ADPCI and SADPCI are evaluated and compared to traditional scheme in initial rollout macro scenario. As the results shown, the proposed ADPCI achieves higher users' CIR than the other schemes in condition of applying different PCI numbers and different signal transmission models.

Footnotes

Appendix

Acknowledgments

This work was supported by the State Major Science and Technology Special Projects (Grant no. 2011ZX03003-002-01), the Fok Ying Tong Education Foundation Application Research Projects (Grant no. 122005), and the Program for New Century Excellent Talents in University.

References

Peng

Wang

Technologies and standards for TD-SCDMA evolutions to IMT-advanced

IEEE Communications Magazine 2009 47 12 50 58

2-s2.0-72949083589

10.1109/MCOM.2009.5350368

Peng

Liu

Wei

Wang

Chen

H. H.

Hierarchical cooperative relay based heterogeneous networks

IEEE Wireless Communications 2011 18 3 48 56

2-s2.0-79959603351

10.1109/MWC.2011.5876500

Akhavan

Next Generation Mobile Networks—Beyond HSPA EVDO—Whitepaper Tech

2006

NGMN Ltd

http://www.ngmn.org/

Zhou

Wang

Sawahashi

Downlink transmission of broadband OFCDM systems—part I: hybrid detection

IEEE Transactions on Communications 2005 53 4 718 729

2-s2.0-19644362263

10.1109/TCOMM.2005.844962

Zhu

Wang

Chunk-based resource allocation in OFDMA systems—part I: chunk allocation

IEEE Transactions on Communications 2009 57 9 2734 2744

2-s2.0-70350423577

10.1109/TCOMM.2009.09.080067

3GPP TR 36.902, V9.3.1

Self-configuring and self-optimizing network (SON) use cases and solutions

December 2011

R3-080376

SON Use Case: Cell Physical ID Automated Configuration

3GPP RAN3 \#59, 2008

R3-080812

Configuration of Physical Cell Identity Use Case

3GPP RAN3 #59bis, 2008

Bandh

Carle

Sanneck

Graph coloring based physical-cell-ID assignment for LTE networks

Proceedings of the ACM International Wireless Communications and Mobile Computing Conference (IWCMC '09)

April 2009

ACM

116 120

2-s2.0-70450285291

10.1145/1582379.1582406

10.

Zhou

X. W.

Model of hypergraph colouring for self-configuration in LTE networks

Proceedings of the 4th International Conference on Information Management, Innovation Management and Industrial Engineering (ICIII '11)

2011

393 396

2-s2.0-84863082892

10.1109/ICIII.2011.100

11.

3GPP TR 36.211, V10.2.0

Physical Channels and Modulation

June 2011

12.

European Cooperative in the Field of Science and Technical Research EURO-COST231

Urban transmission loss models for mobile radio in the 900 and 1800 MHz bands

rev. 2, The Hague, September 1991

13.

McCune

Feher

Closed-form propagation model combining one or more propagation constant segments

Proceedings of the 47th IEEE Vehicular Technology Conference

May 1997

1108 1112

2-s2.0-0030645357

Slot 0							Slot 10
0	30	59	87	114	140	165	0
1	31	60	88	115	141	166	1	30
2	32	61	89	116	142	167	2	31	59
3	33	62	90	117	143		3	32	60	87
4	34	63	91	118	144		4	33	61	88	114
5	35	64	92	119	145		5	34	62	89	115	140
6	36	65	93	120	146		6	35	63	90	116	141	165
7	37	66	94	121	147		7	36	64	91	117	142	166
8	38	67	95	122	148		8	37	65	92	118	143	167
9	39	68	96	123	149		9	38	66	93	119	144
10	40	69	97	124	150		10	39	67	94	120	145
11	41	70	98	125	151		11	40	68	95	121	146
12	42	71	99	126	152		12	41	69	96	122	147
13	43	72	100	127	153		13	42	70	97	123	148
14	44	73	101	128	154		14	43	71	98	124	149
15	45	74	102	129	155		15	44	72	99	125	150
16	46	75	103	130	156		16	45	73	100	126	151
17	47	76	104	131	157		17	46	74	101	127	152
18	48	77	105	132	158		18	47	75	102	128	153
19	49	78	106	133	159		19	48	76	103	129	154
20	50	79	107	134	160		20	49	77	104	130	155
21	51	80	108	135	161		21	50	78	105	131	156
22	52	81	109	136	162		22	51	79	106	132	157
23	53	82	110	137	163		23	52	80	107	133	158
24	54	83	111	138	164		24	53	81	108	134	159
25	55	84	112	139			25	54	82	109	135	160
26	56	85	113				26	55	83	110	136	161
27	57	86					27	56	84	111	137	162
28	58						28	57	85	112	138	163
29							29	58	86	113	139	164

Slot 0							Slot 10
0	30	59	87	114	140	165	0
1	31	60	88	115	141	166	1	30
2	32	61	89	116	142	167	2	31	59
3	33	62	90	117	143		3	32	60	87
4	34	63	91	118	144		4	33	61	88	114
5	35	64	92	119	145		5	34	62	89	115	140
6	36	65	93	120	146		6	35	63	90	116	141	165
7	37	66	94	121	147		7	36	64	91	117	142	166
8	38	67	95	122	148		8	37	65	92	118	143	167
9	39	68	96	123	149		9	38	66	93	119	144
10	40	69	97	124	150		10	39	67	94	120	145
11	41	70	98	125	151		11	40	68	95	121	146
12	42	71	99	126	152		12	41	69	96	122	147
13	43	72	100	127	153		13	42	70	97	123	148
14	44	73	101	128	154		14	43	71	98	124	149
15	45	74	102	129	155		15	44	72	99	125	150
16	46	75	103	130	156		16	45	73	100	126	151
17	47	76	104	131	157		17	46	74	101	127	152
18	48	77	105	132	158		18	47	75	102	128	153
19	49	78	106	133	159		19	48	76	103	129	154
20	50	79	107	134	160		20	49	77	104	130	155
21	51	80	108	135	161		21	50	78	105	131	156
22	52	81	109	136	162		22	51	79	106	132	157
23	53	82	110	137	163		23	52	80	107	133	158
24	54	83	111	138	164		24	53	81	108	134	159
25	55	84	112	139			25	54	82	109	135	160
26	56	85	113				26	55	83	110	136	161
27	57	86					27	56	84	111	137	162
28	58						28	57	85	112	138	163
29							29	58	86	113	139	164

Slot 0							Slot 10
0	30	59	87	114	140	165	0
1	31	60	88	115	141	166	1	30
2	32	61	89	116	142	167	2	31	59
3	33	62	90	117	143		3	32	60	87
4	34	63	91	118	144		4	33	61	88	114
5	35	64	92	119	145		5	34	62	89	115	140
6	36	65	93	120	146		6	35	63	90	116	141	165
7	37	66	94	121	147		7	36	64	91	117	142	166
8	38	67	95	122	148		8	37	65	92	118	143	167
9	39	68	96	123	149		9	38	66	93	119	144
10	40	69	97	124	150		10	39	67	94	120	145
11	41	70	98	125	151		11	40	68	95	121	146
12	42	71	99	126	152		12	41	69	96	122	147
13	43	72	100	127	153		13	42	70	97	123	148
14	44	73	101	128	154		14	43	71	98	124	149
15	45	74	102	129	155		15	44	72	99	125	150
16	46	75	103	130	156		16	45	73	100	126	151
17	47	76	104	131	157		17	46	74	101	127	152
18	48	77	105	132	158		18	47	75	102	128	153
19	49	78	106	133	159		19	48	76	103	129	154
20	50	79	107	134	160		20	49	77	104	130	155
21	51	80	108	135	161		21	50	78	105	131	156
22	52	81	109	136	162		22	51	79	106	132	157
23	53	82	110	137	163		23	52	80	107	133	158
24	54	83	111	138	164		24	53	81	108	134	159
25	55	84	112	139			25	54	82	109	135	160
26	56	85	113				26	55	83	110	136	161
27	57	86					27	56	84	111	137	162
28	58						28	57	85	112	138	163
29							29	58	86	113	139	164