# Stochastic Geometry Analysis and Additional Small Cell Deployment for HetNets Affected by Hot Spots

Authors: Nan E; Xiaoli Chu
Journal: Mobile Information Systems
 (2016)

---

## Abstract

Hot spots (HSs) of mobile users that were not expected in the original network planning may occur after a heterogeneous network (HetNet) has been deployed and affect the network performance. In this case, deploying additional small cells on top of the existing HetNet without changing the existing network infrastructure is considered as a solution. In this paper, we first provide a stochastic geometry analysis for a HetNet affected by a large HS and for the additional small cells that need to be deployed based on the spatial bivariate Poisson point process. The optimal numbers of additional small cells required in the HS and non-HS areas are obtained by minimizing the difference between the numbers of macrocell users after and before the HS occurs based on the analytical results. We then propose an algorithm to maximize the average user throughput by jointly optimizing the locations of additional small cells and user associations of all cells. Simulation results show that the proposed algorithm can maintain the average user throughput above a threshold with excellent fairness among all users even for a very high density of HS users.


---

## Body

## 1. Introduction

Small cell deployment in heterogeneous networks (HetNets) has been considered as an efficient solution to the rapid growth of mobile data demand under limited radio resources. It is anticipated that deploying low-power small cells will increase the area spectral efficiency [1]. In a HetNet, some small cells are deployed by the users, with their locations uncontrollable by the operators. Moreover, once a HetNet has been deployed, persistent hot spots (HSs) of user equipment (UE) that were not expected in the original network planning may occur, causing extra traffic demand. As the mobile traffic demand goes beyond the network capacity, the quality of service (QoS) of UE in the HetNet will be affected. In this case, deploying additional small cells on top of the existing HetNet by the operators would become necessary.Considering cost effectiveness for network operators, it is desirable to optimize the number and locations of additional small cells to be deployed without changing the existing HetNet infrastructure. This relies on a thorough analysis of the HetNet. Stochastic geometry and the theory of random geometric graphs have been used in the analysis and design of wireless networks [2]. The internodal distances were modeled using a spatial bivariate Poisson point process (PPP) in [3]. However, the existence of significant HSs in HetNets has not been specifically considered in stochastic geometry based analysis of mobile networks.In this paper, we analyse a HetNet before and after an unexpected HS occurs and additional small cells that would be required to mitigate the HS effect under a spatial bivariate PPP model. We model the spatial distributions of different network nodes (e.g., existing small cells, additional small cells to be deployed, HS UE, and non-HS UE) into five possible events. By minimizing the difference between the amounts of macrocell UE after and before the HS occurs based on the analytical results, the optimal numbers of additional small cells required for the HS and non-HS areas are obtained. We then propose an algorithm to maximize the average UE throughput in a HetNet affected by unexpected HS by jointly optimizing the locations of additional small cells on top of the existing HetNet and the user associations of all cells. The relationship between HS UE intensity and additional small cell intensities in HS and non-HS areas is analysed. The simulation results show that our proposed algorithm can effectively maintain the average UE throughput requirement with excellent fairness among all UE even for a very high intensity of HS UE.The rest of the paper is organized as follows. In Section2, the system model is presented. The analysis based on the spatial bivariate PPP and the analytical results are provided in Section 3. The optimization of additional small cell deployment and the algorithm to solve it are provided in Section 4. Simulation results and performance evaluation are presented in Section 5. Conclusions are drawn in Section 6.


## 2. Related Work

Using the stochastic geometry analysis, the authors of [3] studied the distribution of the distances between an arbitrary point and its dissimilar neighboring points as a spatial bivariate Poisson point process. In this paper we will extend the model of [3] into five events for our stochastic geometry analysis in Section 3.As for small cell deployment in HetNets, the femtocell deployment with an arbitrary topology was optimized by maximizing the number of users supported with QoS constraints in [4]. In [5], the deployment locations of macro base stations (BSs), pico-BSs, and relays are optimized by selecting a subset of candidate sites. In [6], the locations of small cells are sequentially determined by maximizing the weighted sum of the received signal strength and load, but without considering the user associations. The small cell deployment strategy in [7] considering the movement of UE is proposed.Although HS mitigation has been studied for wireless sensor networks [8], most existing works on small cell deployment strategies have focused on optimizing the deployment of small cells on top of a conventional macrocell network or the deployment of a whole new HetNet from scratch [4–6]. In [9], the dynamic placement of small cells for hot spots is optimized by minimizing the data delivery cost and by minimizing macrocell utilization, respectively, where the locations of additional small cells are chosen from the set of known candidate sites. As a result, the maximum number of additional small cells is limited by the number of candidate locations.


## 3. System Model

We consider a two-tier HetNet that contains macrocells and small cells. In each macrocell coverage area, the location of the macro-BS is constant, while the small cell BSs and UE are considered as random points [10]. Based on the spatial bivariate PPP [3], we define five events for the problem of deploying additional small cells on top of an existing HetNet as presented in Table 1. Event A represents non-HS UE (which is not jointly distributed with event C, which will be explained later), with the spatial intensity α. Event B denotes the HS UE (which is not jointly distributed with event E, which will be explained later) in the HS area with the spacial intensity β. Since the HS area overlaps with the macrocell coverage, non-HS UE may also occur in the HS area. Event C represents the existing small cells. We assume that each existing small cell serves at least one non-HS UE and that each existing small cell BS is jointly distributed with a non-HS UE. Hence, event C is considered as an existing small cell and a non-HS UE jointly occurring at a random point y. Event D denotes additional small cells that will be deployed in non-HS areas, with intensity μ. Event E denotes additional small cells deployed in the HS area with intensity ρ, each serving at least one HS UE. Thus, each event E node is jointly distributed with a HS UE.Table 1
Events.
Event
Type
Intensity
Given
A
Non-HS UE
α
Yes
B
HS UE
β
Yes
C
Existing small cells
ν
Yes
D
Additional small cells outside HS
μ
No
E
Additional small cells in HS
ρ
NoAfter a significant HS occurs and additional small cells are deployed, the overall spatial intensity of small cells in non-HS areas isν
+
μ and that of small cells in the HS area is ν
+
ρ [11].For event C, denotef
1
(
x
U
-
y
) and g
1
(
x
S
-
y
) as the probability density functions (PDFs) of a UE at x
U and an existing small cell at x
S when event C occurs at y, respectively. Zero-mean isotopic Gaussian distributions with standard deviations σ
f
1 and σ
g
1 are chosen for f
1
(
X
) and g
1
(
X
), respectively [3].Before the HS occurs, the probability of event C occurring at any point in the macrocell coverage area is calculated as [3](1)
P
r
C
=
h
1
x
U
,
x
S
≜
∫
y
∈
R
M
f
1
x
U
-
y
g
1
x
S
-
y
d
y
=
h
1
x
U
-
x
S
,
0
=
h
1
X
1
,
0
=
1
2
π
σ
1
2
e
-
X
1
2
/
2
σ
1
2
,where R
M is the macrocell coverage area, X
1
=
x
U
-
x
S, and σ
1
2
=
σ
f
1
2
+
σ
g
1
2, which is a correlation factor that is determined by the distance of a non-HS UE to its jointly distributed existing small cell BS for event C.Similarly, for event D, denotef
2
(
x
H
S
U
-
y
) and g
2
(
x
N
S
-
y
) as the PDFs for a HS UE occurring at x
H
S
U and an additional small cell BS deployed at x
N
S in the HS area, respectively. f
2
(
X
) and g
2
(
X
) are zero-mean isotopic Gaussian distributions with standard deviations σ
f
2 and σ
g
2, respectively. The probability of a joint event between a HS UE at x
H
S
U and an additional small cell BS at x
N
S occurring in the HS area is given by [3](2)
h
2
x
H
S
U
,
x
N
S
≜
∫
y
∈
R
H
f
2
x
H
S
U
-
y
g
2
x
N
S
-
y
d
y
=
h
2
X
2
,
0
=
1
2
π
σ
2
2
e
-
X
2
2
/
2
σ
2
2
,where R
H is the HS area, X
2
=
x
H
S
U
-
x
N
S, and σ
2
2
=
σ
f
2
2
+
σ
g
2
2.


### 3.1. The Network without HS

By using the given intensities of event A and event C andh
1
(
x
U
,
x
S
) in (1), we can calculate the expected amount of non-HS UE in the coverage of an existing small cell BS at x
S, x
S
∈
R
M, as follows:(3)
χ
A
C
r
S
=
∫
x
U
∈
C
S
α
+
h
1
x
U
,
x
S
d
x
U
=
α
π
r
S
2
+
1
-
e
-
r
S
2
/
2
σ
1
2
,where C
S is the coverage area of a small cell and r
S is the coverage radius of a small cell.The expected number of existing small cells in the macrocell coverage area is given by(4)
χ
C
r
M
=
∫
x
S
∈
R
M
ν
d
x
S
=
ν
π
r
M
2
,where r
M is macrocell coverage radius.The expected total amount of non-HS UE in the macrocell coverage area before HS occurs is given by(5)
E
N
U
=
∫
x
U
∈
R
M
α
d
x
U
+
∫
x
U
∈
R
M
ν
h
1
x
U
,
x
S
d
x
U
=
α
π
r
M
2
+
1
-
e
-
r
M
2
/
2
σ
1
2
ν
π
r
M
2
.


### 3.2. The Network with HS

After a HS with UE intensityβ occurs in the coverage of a macrocell, by using h
2
(
x
H
S
U
,
x
N
S
) in (2), the expected amount of UE (including HS UE and non-HS UE) in an additional small cell coverage which is in the HS area can be written as(6)
χ
A
B
E
r
S
=
∫
x
H
S
U
∈
C
S
β
+
h
2
x
H
S
U
,
x
N
S
d
x
H
S
U
+
∫
x
U
∈
C
S
α
d
x
U
=
α
+
β
π
r
S
2
+
1
-
e
-
r
S
2
/
2
σ
2
2
,where σ
2 is defined in (2).The expected amount of UE (including HS UE and non-HS UE) in an existing small cell coverage that overlaps with the HS area is given by(7)
χ
A
B
r
S
=
χ
A
C
r
S
+
∫
x
H
S
U
∈
C
S
β
d
x
H
S
U
=
α
+
β
π
r
S
2
+
1
-
e
-
r
S
2
/
2
σ
1
2
,where C
h is the area of the small cell coverage in the HS area. For simplicity, we assume that the existing small cell is completely in the HS area in (7).The expected amount of non-HS UE served by additional small cells in non-HS areas is given by(8)
χ
A
D
r
S
=
∫
x
U
∈
C
S
α
d
x
U
=
α
π
r
S
2
.The expected number of existing small cells in non-HS areas is(9)
χ
C
′
=
∫
x
S
∈
R
n
H
ν
d
x
S
=
ν
π
r
M
2
-
r
H
S
2
,where R
n
H is the non-HS area in the macrocell coverage.The expected number of additional small cells in the HS area is given by(10)
χ
E
r
H
S
=
∫
x
N
S
∈
R
H
′
ν
d
x
N
S
=
ρ
π
r
H
S
2
-
ν
π
2
r
H
S
2
r
S
2
,where r
H
S is the radius of the HS area, which is assumed to be a disc area, and R
H
′ is the HS area excluding the coverage area of existing small cells in the HS. Since the HS area overlaps with the existing network, the coverage areas of existing small cells located in the HS need to be removed from the calculation of additional small cells in the HS area.The expected number of existing small cells in the HS area is given byχ
C
(
r
H
S
) following (5).The expected number of additional small cells in non-HS areas is(11)
χ
D
=
∫
x
N
S
∈
R
n
H
μ
d
x
N
S
=
μ
π
r
M
2
-
r
H
S
2
.The expected total amount of UE in the macrocell coverage area after the HS occurs is given by(12)
E
N
U
′
=
α
π
r
M
2
+
ν
π
r
M
2
1
-
e
-
r
M
2
/
2
σ
1
2
+
β
π
r
H
S
2
+
ρ
π
r
H
S
2
-
ν
π
2
r
H
S
2
r
S
2
1
-
e
-
r
H
S
2
/
2
σ
2
2
.


## 3.1. The Network without HS

By using the given intensities of event A and event C andh
1
(
x
U
,
x
S
) in (1), we can calculate the expected amount of non-HS UE in the coverage of an existing small cell BS at x
S, x
S
∈
R
M, as follows:(3)
χ
A
C
r
S
=
∫
x
U
∈
C
S
α
+
h
1
x
U
,
x
S
d
x
U
=
α
π
r
S
2
+
1
-
e
-
r
S
2
/
2
σ
1
2
,where C
S is the coverage area of a small cell and r
S is the coverage radius of a small cell.The expected number of existing small cells in the macrocell coverage area is given by(4)
χ
C
r
M
=
∫
x
S
∈
R
M
ν
d
x
S
=
ν
π
r
M
2
,where r
M is macrocell coverage radius.The expected total amount of non-HS UE in the macrocell coverage area before HS occurs is given by(5)
E
N
U
=
∫
x
U
∈
R
M
α
d
x
U
+
∫
x
U
∈
R
M
ν
h
1
x
U
,
x
S
d
x
U
=
α
π
r
M
2
+
1
-
e
-
r
M
2
/
2
σ
1
2
ν
π
r
M
2
.


## 3.2. The Network with HS

After a HS with UE intensityβ occurs in the coverage of a macrocell, by using h
2
(
x
H
S
U
,
x
N
S
) in (2), the expected amount of UE (including HS UE and non-HS UE) in an additional small cell coverage which is in the HS area can be written as(6)
χ
A
B
E
r
S
=
∫
x
H
S
U
∈
C
S
β
+
h
2
x
H
S
U
,
x
N
S
d
x
H
S
U
+
∫
x
U
∈
C
S
α
d
x
U
=
α
+
β
π
r
S
2
+
1
-
e
-
r
S
2
/
2
σ
2
2
,where σ
2 is defined in (2).The expected amount of UE (including HS UE and non-HS UE) in an existing small cell coverage that overlaps with the HS area is given by(7)
χ
A
B
r
S
=
χ
A
C
r
S
+
∫
x
H
S
U
∈
C
S
β
d
x
H
S
U
=
α
+
β
π
r
S
2
+
1
-
e
-
r
S
2
/
2
σ
1
2
,where C
h is the area of the small cell coverage in the HS area. For simplicity, we assume that the existing small cell is completely in the HS area in (7).The expected amount of non-HS UE served by additional small cells in non-HS areas is given by(8)
χ
A
D
r
S
=
∫
x
U
∈
C
S
α
d
x
U
=
α
π
r
S
2
.The expected number of existing small cells in non-HS areas is(9)
χ
C
′
=
∫
x
S
∈
R
n
H
ν
d
x
S
=
ν
π
r
M
2
-
r
H
S
2
,where R
n
H is the non-HS area in the macrocell coverage.The expected number of additional small cells in the HS area is given by(10)
χ
E
r
H
S
=
∫
x
N
S
∈
R
H
′
ν
d
x
N
S
=
ρ
π
r
H
S
2
-
ν
π
2
r
H
S
2
r
S
2
,where r
H
S is the radius of the HS area, which is assumed to be a disc area, and R
H
′ is the HS area excluding the coverage area of existing small cells in the HS. Since the HS area overlaps with the existing network, the coverage areas of existing small cells located in the HS need to be removed from the calculation of additional small cells in the HS area.The expected number of existing small cells in the HS area is given byχ
C
(
r
H
S
) following (5).The expected number of additional small cells in non-HS areas is(11)
χ
D
=
∫
x
N
S
∈
R
n
H
μ
d
x
N
S
=
μ
π
r
M
2
-
r
H
S
2
.The expected total amount of UE in the macrocell coverage area after the HS occurs is given by(12)
E
N
U
′
=
α
π
r
M
2
+
ν
π
r
M
2
1
-
e
-
r
M
2
/
2
σ
1
2
+
β
π
r
H
S
2
+
ρ
π
r
H
S
2
-
ν
π
2
r
H
S
2
r
S
2
1
-
e
-
r
H
S
2
/
2
σ
2
2
.


## 4. Intensity of Additional Small Cells

We assume that all the UE in the HetNet is satisfied with its service before a significant HS occurs. After a significant HS occurs, without deploying additional small cells, the HS UE that cannot be accommodated by existing small cells will be served by the macrocell. This extra burden on the macro-BS may reduce the QoS of macrocell UE. In order to avoid overloading the macrocell, we aim to keep the amount of macrocell UE after the HS occurs as close as possible to that before the HS occurs.The expected amount of macrocell UE before the HS occurs is given by(13)
E
N
M
U
=
E
N
U
-
χ
A
C
r
S
·
χ
C
r
M
.After the HS occurs and additional small cells are deployed, the expected amount of UE served by the existing small cells in non-HS areas can be calculated as(14)
E
N
N
H
S
=
χ
A
C
r
S
·
χ
C
′
.The expected amount of UE served by the existing small cells in the HS area can be calculated as(15)
E
N
H
S
′
=
χ
A
B
r
S
·
χ
C
r
H
S
.The expected amount of UE served by additional small cells in the HS area can be calculated as(16)
E
N
H
S
=
χ
A
B
E
r
S
·
χ
E
r
H
S
.The expected amount of UE served by additional small cells in non-HS areas can be calculated as(17)
E
N
N
H
S
′
=
χ
A
D
r
S
·
χ
D
.Hence, the expected amount of macrocell UE after the HS occurs can be calculated as(18)
E
N
M
U
′
=
E
N
U
′
-
E
N
N
H
S
+
E
N
H
S
+
E
N
H
S
′
+
E
N
N
H
S
′
.We optimize the intensities of additional small cells in the HS and non-HS areas through minimizing the difference between the amounts of macrocell UE after and before the HS occurs as follows:(19)
a
r
g
m
i
n
ρ
,
μ
E
N
M
U
′
-
E
N
M
U
s.t.
ρ
,
μ
≥
0
.By using the results in (3)–(18), the objective function in (19) can be rewritten as(20)
a
r
g
m
i
n
ρ
,
μ
a
·
ρ
+
b
·
μ
+
c
,
a
=
α
+
β
π
r
S
2
+
1
-
e
-
r
S
2
/
2
σ
2
2
π
r
H
S
2
-
ν
π
2
r
H
S
2
r
S
2
,
b
=
α
π
r
S
2
π
r
M
2
-
π
r
H
S
2
,
c
=
β
π
r
S
2
+
e
-
r
S
2
/
2
σ
1
2
-
e
-
r
S
2
/
2
σ
2
2
ν
π
r
H
S
2
-
β
π
r
H
S
2
.The optimization problem in (19) can be readily solved using numerical methods. Here we present numerical solutions of the optimal ρ and μ obtained under the system parameters in Table 2. The center of the HS area is randomly generated in the macrocell coverage area while ensuring the whole HS area is within the macrocell coverage area with a minimum distance from the macrocell BS of 100 m. The intensity of additional small cells in the HS area versus the intensity of HS UE is presented in Figure 1. It can be seen that the intensity of additional small cells in the HS area increases with the intensity of HS UE at a decreasing rate. Figure 2 shows the intensity of additional small cells in non-HS areas versus the intensity of HS UE. Comparing Figure 2 with Figure 1, the intensity of additional small cells in the HS area is much higher than that in non-HS areas; the rapid increase of the intensity for additional small cells in non-HS areas when β
<
1000
U
E
/
k
m
2 is because the intensity of additional small cells in the HS area is not enough to serve all the HS UE, thus requiring additional small cells in non-HS area to share the extra burden caused by HS UE to the cellular network. For large values of β, the intensity of additional small cells in non-HS areas decreases with β, because the additional small cells in the HS area are now able to serve the majority of HS UE. Figure 3 shows the expected numbers of additional small cells in the HS and non-HS areas under the setting in Table 2.Table 2
System setting.
Parameter
Value
α
50 UE/km2
ν
10 BS/km2
σ
1
2
0.1
σ
2
2
0.1
r
M
500 m
r
S
20 m
r
H
S
50 mFigure 1
The intensity of additional small cells in the HS area (ρ) versus the intensity of HS UE.Figure 2
The intensity of additional small cells in non-HS areas (μ) versus the intensity of HS UE.Figure 3
An example of the total number of new small cells under the setting in Table2.


## 5. Deployment of Additional Small Cells

Based on the analytical results in Section3, we propose to maximize the average UE throughput among all UE by jointly optimizing the locations of new small cells and user associations of all cells for a HetNet affected by a HS not expected in the original network planning.We consider the downlink (DL) of a two-tier HetNet consisting of one central macrocell andχ
C
(
r
M
) small cells randomly distributed in the macrocell coverage area. The number of existing BSs is N
e
B
S
=
1
+
χ
C
(
r
M
). Each cell has access to the total of N
R
B resource blocks (RBs). Denoting the number of additional small cells to be deployed in the HS area as N
N
S
1 and the new small cells to be deployed in non-HS area as N
N
S
2, the total number of BSs is given by N
B
S
=
N
e
B
S
+
N
N
S
1
+
N
N
S
2. Denote the set of BSs as N
B
S
=
{
1,2
,
…
,
N
B
S
}.According to the system model in Section2, the expected amount of HS UE is given by(21)
χ
B
E
r
H
S
=
β
π
r
H
S
2
+
1
-
e
-
r
H
S
2
/
2
σ
2
2
ν
π
r
H
S
2
.LetN
N
H
S
=
E
{
N
U
} denote the amount of non-HS UE and let N
H
S
=
χ
B
E
(
r
H
S
) denote the amount of HS UE in the macrocell coverage area. The set of all UE is given by N
U
=
{
1,2
,
…
,
N
U
}, where N
U
=
N
N
H
S
+
N
H
S.The throughput of theith UE (i
=
{
1,2
,
…
,
N
U
}) is given by(22)
γ
i
=
∑
j
=
1
N
B
S
N
j
R
B
·
W
·
log
2
⁡
1
+
P
j
·
g
i
,
j
·
u
i
,
j
I
i
,
j
+
N
0
,where u
i
,
j
=
1 if the ith UE is served by the jth BS and u
i
,
j
=
0 otherwise; W is the bandwidth of a RB; without considering power control, P
j is the DL transmit power of the jth BS in a RB; and P
j
=
P
M
S if it is a macro-BS (small-cell BS). Assuming that the channel on each RB sees independent and identical Rayleigh fading, the channel power gain of the link between the ith UE and the jth BS in a RB is expressed as(23)
g
i
,
j
=
g
f
,
i
j
·
g
p
l
,
i
j
,where g
f
,
i
j is the exponentially distributed fading gain with unit mean and g
p
l
,
i
j is the path loss as given in [1]; N
j
R
B is the number of RBs per UE in cell j and is given by(24)
N
j
R
B
=
N
R
B
∑
i
=
1
N
U
u
i
,
j
,
∀
j
,where, as illustrated and proven by Ye et al. in [12], equal resource allocation among the UE in all cells is optimal for the logarithmic utility; we assume that all the available RBs are allocated in each cell following the round robin algorithm with full bandwidth allocation [13], so that each cell is fully loaded and there will be intercell interference in each RB; N
0 is the additive white Gaussian noise (AWGN) power; and I
i
,
j is the interference power in a RB received by UE i from BSs other than BS j; that is,(25)
I
i
,
j
=
∑
j
′
=
1
,
j
′
≠
j
N
B
S
P
j
′
·
g
i
,
j
′
,
∀
j
∈
N
B
S
.The additional small cell deployment optimization problem is formulated as(26)
a
r
g
m
a
x
U
,
x
1
,
y
1
,
x
2
,
y
2
∑
i
=
1
N
U
γ
i
N
U
s.t.
x
1
,
y
1
∈
H
H
S
,
x
2
,
y
2
∈
H
N
H
S
∑
j
=
1
N
B
S
u
i
,
j
=
1
,
∀
i
∈
N
U
,
γ
i
≥
γ
t
h
,
∀
i
∈
N
U
,
N
R
B
≥
N
j
R
B
>
0
,
∀
j
∈
N
B
S
,
u
i
,
j
∈
0,1
,
∀
i
∈
N
U
,
∀
j
∈
N
B
S
,where U is the N
U
×
N
B
S UE-BS association matrix that contains all u
i
,
j as elements; (
x
1
,
y
1
) are the N
N
S
1
×
1 location vectors of additional small cells in the HS area; (
x
1
,
y
2
) are the N
N
S
2
×
1 location vectors of additional small cells in non-HS areas; |
H
H
S
| and |
H
N
H
S
| are the feasible deployment areas [14] for additional small cells in the HS and non-HS areas, respectively; and γ
t
h is the minimum UE throughput threshold.Note that the joint optimization of the locations of additional small cells and the user associations of all cells in (26) is a mixed integer programming problem, which is NP-hard and requires a high computational complexity to find the global optimal solution. Therefore, we propose a practical algorithm in Algorithm 1 to solve the optimization problem in (26).Algorithm 1
Initialization:
(1)u
i
,
j
r
←
0, ∀
i
,
j;  X
1
,
X
2
←
⌀; MAX ←
0
;
N
N
S
1
←
χ
E
(
r
H
S
)
;
N
N
S
2
←
χ
D
Main Function:
(2)H
H
S
←
H
X
1
(3)H
N
H
S
←
H
X
2
(4) (g
,
U
r
,
X
1
∗
,
X
2
∗
)
← GRG solve (22) for X
1
,
X
2
(5)if (22) is feasible, U
r
∈
Z
+  then
(6) if  g
> MAX then
(7) MAX ←
g
(
U
r
,
(
X
1
,
X
2
)
)
(8) U
∗
←
U
r
(9) X
1
∗
←
X
1
(10) X
2
∗
←
X
2
(11) if  N
N
S
1
=
χ
E
(
r
H
S
)  then
(12)  N
N
S
1
←
χ
E
(
r
H
S
)
(13)  return
(14) else if  N
N
S
1
=
χ
E
(
r
H
S
), N
N
S
2
=
χ
D  then
(15)   N
N
S
2
←
χ
D
(16)   return
(17)  else if  N
N
S
1
=
χ
E
(
r
H
S
), N
N
S
2
=
χ
D  then
(18)   return
(19)  end if
(20) else if  g
≤ MAX then
(21)  if  N
N
S
1
=
χ
E
(
r
H
S
)  then
(22)    N
N
S
1
←
χ
E
(
r
H
S
)
(23)    N
N
S
2
←
χ
D
(24)   return
(25)  else if  N
N
S
1
=
χ
E
(
r
H
S
), N
N
S
2
=
χ
D  then
(26)    N
N
S
2
←
χ
D
(27)   return
(28)  end if
(29)  return
(30) end if
(31) return MAX, U
∗
,
X
1
∗
,
X
2
∗
(32)else if (22) is feasible, U
r
∉
Z
+  then
(33) for all  u
i
,
j
r
∉
Z
+  do
(34)  g
(
u
i
,
j
r
=
0
)
→
U
r
,
X
1
,
X
2, MAX
(35)  g
(
u
i
,
j
r
=
1
)
→
U
r
,
X
1
,
X
2, MAX
(36) end for
(37)else if (22) is infeasible, then
(38) return
(39)end ifIn Algorithm1, the binary constraint of user association indicators is relaxed to 0
≤
u
i
,
j
r
≤
1 [15]. All user association indicators are initialized as 0. Denote X
1 and X
2 as the sets of additional small cells in the HS and non-HS areas, respectively. The two sets are both initialized as empty. The sizes N
N
S
1 and N
N
S
2 of vectors (
x
1
,
y
1
) and (
x
2
,
y
2
), respectively, are initialized based on the analytical results in Section 3. The optimized numbers of additional small cells to be deployed will be refined in the algorithm. The additional small cells’ locations are optimized by the generalized reduced gradient (GRG) method [16].


## 6. Simulation Results

In this section, we present simulation results to evaluate the performance of the proposed algorithm for deploying additional small cells on top of an existing HetNet affected by HS. In the simulation, in addition to Table2 we set the transmit power of the macro-BS and a small-cell BS as 46 dBm and 23 dBm, respectively, the bandwidth of each RB W
=
180kHz, the minimum UE throughput threshold γ
t
h
=
3 Mbps, the number of RBs in each cell N
R
B
=
50, and N
0
=
-
174 dBm/Hz.Figure4 shows the average UE throughput with or without additional small cells deployed following our proposed algorithm and with the same number of additional small cells randomly deployed versus the spatial intensity of HS UE. We can see that, by deploying additional small cells following our proposed algorithm, the average UE throughput is much higher than without deploying any additional small cells or randomly deploying the same number of additional small cells. The average UE throughput can be kept above the threshold even for a very high intensity of HS UE. If without deploying additional small cells or randomly deploying the additional small cells the average UE throughput drops below the threshold as the intensity of HS UE increases, indicating that some of the UE will have unsatisfactory QoS.Figure 4
Average UE throughput versus the intensity of HS UE.In order to evaluate the load balancing performance of our algorithm, we calculate the fairness index of all UE [17] as(27)
F
=
∑
i
=
1
N
U
γ
i
2
N
U
·
∑
i
=
1
N
U
γ
i
2
.The fairness index versus the intensity of HS UE is shown in Figure 5. Since the number and locations of additional small cells and user associations are optimized, the fairness index achieved by our proposed algorithm is much larger than those without deploying additional small cells or randomly deploying the additional small cells and even increases with the spatial intensity of HS UE. The fairness indexes of those without deploying additional small cells or randomly deploying additional small cells decrease with the spatial intensity of HS UE, indicating that not only the QoS of UE but also the fairness among UE (load balancing performance) is significantly degraded due to the HS.Figure 5
Fairness index versus the intensity of HS UE.Figure6 shows the area spectral efficiency (ASE) [18] with additional small cells deployed following our proposed algorithm and with the same number of additional small cells randomly deployed versus the spatial intensity of HS UE. We can see that by deploying additional small cells following our proposed algorithm, the ASE is much higher than randomly deploying the same number of additional small cells, and the gain in ASE increases with the intensity of HS UE. This is because the numbers of additional small cells deployed in HS and non-HS areas are, respectively, optimized for given intensity of HS UE, as shown in Figure 3.Figure 6
Area spectral efficiency versus the intensity of HS UE.We also perform simulation to evaluate the average interference power received by a macro-UE caused by the additional small cells. The simulation result is presented in Figure7. We can see that the average macro-UE received interference power caused by additional small cells increases with the number of additional small cells. However, compared with randomly deploying the same number of additional small cells, our proposed algorithm results in much less interference for any given number of additional small cells.Figure 7
Macro-UE received interference power versus the number of additional small cells.


## 7. Conclusion

In this paper, we have analyzed the relationship between the intensities of HS UE (not expected in the original network planning) and additional small cells required to fulfill the extra traffic demand of the HS UE based on a spatial bivariate PPP model of the HetNet. Based on the analytical results, we obtain the optimal numbers of additional small cells for the HS and non-HS areas and propose an algorithm to maximize the average UE throughput (after unexpected HS occurs) by jointly optimizing the locations of additional small cells and the user associations of all cells. Simulation results show that the proposed algorithm for optimizing the deployment of additional small cells on top of an existing HetNet can guarantee the QoS requirement of all UE even for a very high density of HS UE while achieving excellent load balancing performance with a lower interference to macro-UE for the HetNet.


## 8. Future Work

In our future work, we plan to extend our work in two directions: (1) stochastic geometry analysis and (2) small cell deployment optimization, both considering the possible occurrence of multiple HSs (with independent HS UE intensities), which is closer to real HetNets. User movement and mobile traffic patterns will also be considered in the small cell deployment algorithm.



---

*Source: 9727891-2016-02-14.xml*