ArticlePDF Available

Effect of Outdated CSI on Handover Decisions in Dense Networks

Authors:

Abstract

We consider an ultra-dense network (UDN) where each mobile is attached to the access point (AP) which provides the best reference signal received power (RSRP) according to both path-loss and small scale fading. In order to evaluate the effect of outdated channel state information (CSI) brought by feedback delay on handover decisions, we first derive the estimated and accurate handover probability according to outdated and perfect CSI respectively. Further, two metrics are proposed to measure the handover failure, i.e., false handover probability (FHP) and miss handover probability (MHP). Simulations show that in sparse or ultra-dense networks, the imperfection of outdated CSI is acceptable for handover decisions. But in between, i.e., dense networks (medium-size networks), handover decisions are very sensitive to the user velocity and CSI imperfection.
1089-7798 (c) 2016 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/LCOMM.2017.2720162, IEEE
Communications Letters
1
Effect of Outdated CSI on Handover Decisions in
Dense Networks
Yinglei Teng, Mengting Liu, and Mei Song
Abstract—We consider an ultra-dense network (UDN) where
each mobile is attached to the access point (AP) which provides
the best reference signal received power (RSRP) according to
both path-loss and small scale fading. In order to evaluate the
effect of outdated channel state information (CSI) brought by
feedback delay on handover decisions, we first derive the esti-
mated and accurate handover probability according to outdated
and perfect CSI respectively. Further, two metrics are proposed
to measure the handover failure, i.e., false handover probability
(FHP) and miss handover probability (MHP). Simulations show
that in sparse or ultra-dense networks, the imperfection of out-
dated CSI is acceptable for handover decisions. But in between,
i.e., dense networks (medium-size networks), handover decisions
are very sensitive to the user velocity and CSI imperfection.
Index Terms—outdated CSI, handover failure, ultra-dense
network, stochastic geometry.
I. INT ROD UC TI ON
TO meet the 1000-fold data traffic demand growth foreseen
in the 5th Generation (5G) networks, increasing the num-
ber of access points (APs) is deemed as a promising solution,
thus resulting in ultra-dense networks (UDNs). Meanwhile, the
cell coverage shrinks with the densification of APs, which also
means that the mobile users would experience more frequent
handoffs [1]. Thereby, mobility management becomes vital for
dense network wherein the handover decision plays a key role
on the guarantee of quality of service (QoS) for mobile users.
Over the last years, considerable efforts have been devoted
to the study of handover performance in UDNs utilizing
stochastic geometry methods. Most of these works which as-
sume that the mobile user connects to the nearest AP evaluate
handover probability (HP) by only considering the path-loss
effect [2]–[4]. Besides, only few works take the effect of small
scale fading into consideration. In [5], with a more general
model including both slow fading (log-normal shadowing) and
fast fading (Rayleigh fading), the mobile in the network is
assumed to be served by the AP providing the instantaneous
strongest mean signal power. However, one defect of [5] is that
the effect of channel imperfection is ignored. Due to the users’
mobility, outdated channel state information (CSI) caused by
feedback delay has become a non-negligible impact on the
accuracy of handover decisions. By now, the previous work
is limited to mobility performance, and there are potential
Y. L. Teng, M. T. Liu, and M. Song are with the Beijing Key Labora-
tory of Space-ground Interconnection and Convergence, Beijing University
of Posts and Telecommunications (BUPT), Beijing, China, 100876 (email:
lilytengtt@gmail.com, liumengting@bupt.edu.cn, songm@bupt.edu.cn). This
work was supported in part by the National Natural Science Foundation of
China under Grant No. 61427801 and No. 61302081, and the 863 Project
under Grant No. 2014AA01A701.
gaps for the study of the effect of channel imperfection
on handover decisions. Is the handover decision using just
large scale fading or perfect/outdated CSI trustable under
different mobility cases or diverse density network? Motivated
by these questions, we investigate the effect of outdated CSI on
handover decisions in UDN using stochastic geometry theory.
However, several technological challenges are to be addressed:
(i) Typical HP analysis is achieved using stochastic geometry
and Euclidean geometry theory. However, the introduction of
small scale fading would change the tractable Poisson-Voronoi
topology and make the theoretical analysis far from easy to
handle; (ii) The impact of outdated CSI on HP and handover
failure probability needs to be characterized; (iii) New metrics
should be defined to effectively measure the effect of channel
imperfection on handover decisions.
In this letter, UDNs are modeled as a homogeneous Poisson
point process (HPPP). By applying the displacement theorem,
the aggregated small scale and large scale fading can be
described by a modified HPPP. Meanwhile, Jakes’ scattering
model is utilized to address the outdated CSI. Finally, to mea-
sure the handover failure probability brought by the channel
imperfection, we propose two metrics including false handover
probability (FHP) and miss handover probability (MHP).
II. SY ST EM MO DE L
A. Network Model
In this letter, a single-tier UDN is considered where the
M-antenna APs and single-antenna users are modeled by
two independent HPPPs (Φoand Φu) with density λoand
λurespectively. In this letter, we adopt the transmit antenna
selection (TAS) scheme, i.e., the mobile user always selects
the best antenna with the highest channel gain. And we assume
that each AP transmits at a constant power P. For each mobile
user ziΦu, i = 0,1,2,· · · , it connects to the AP which
provided the best reference signal received power (RSRP).
B. Propagation Model
Both large scale and small scale fading are considered in
the propagation model. The large scale effect is denoted by
L(zi) = di(t)α, where di(t)denotes the distance between
the mobile ziand its serving AP APiat time tand αis the
path-loss exponent. The small scale fading is considered to be
constant during a specific time slot but changes in different
time slots. In this letter, the small scale fading φi,m (t)from
antenna mof APito the mobile user at time tis assumed
as a zero-mean Gaussian random variable with variance µ,
i.e., φi,m (t)∼ CN (0, µ). Thus, the channel gain hi,m (t) =
1089-7798 (c) 2016 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/LCOMM.2017.2720162, IEEE
Communications Letters
2
|φi,m (t)|2is an exponential random variable with mean µ, i.e.,
hi,m (t)exp 1
µ. Suppose the random variables φi,m (t)for
all the APs, antennas and time slots are independent identically
distributed (i.i.d). Then the RSRP (accurate) from antenna m
of APito the mobile ziat time tis
yi,m(t) = hi,m (t)L(zi)P=(hi,m(t))1
αdi(t)αP. (1)
Different from the previous works on HP analysis in [2]–[4],
we assume a practical scenario where the feedback CSI from
the APs is delayed and the mobile user makes the handover
decision using outdated CSI. Due to the adoption of TAS
scheme, the mobile user ziselects the best antenna with the
highest channel gain at time texpressed as
Hi(t) = max
m=1,2...M hj,m (t), j = 1,2. . . (2)
Accordingly, the mobile is connected to the AP providing
the best antenna. Then the serving AP transmits useful signals
to the mobile and the RSRP from APiwhich is outdated by
feedback delay and can be denoted as
˜yi(t) = ˜
Hi(t)1
αdi(t)α
P. (3)
In (3), due to the short time delay (ms level), the change of
di(t)would be rather small which can be ignored. And ˜
Hi(t)
is τdtime-delayed channel coefficient version of Hi(t). The
correlation between ˜
Hi(t)and Hi(t)can be modeled by the
Jakes’ scattering model which is based on a sum of sinusoids
approach to simulate Rayleigh fading channel [6]. Then we
can obtain the probability distribution function (PDF) of ˜
Hi
(variable tis removed due to the i.i.d. character) as
g˜
H=g˜
H(x)=M
M1
k=0 M1
k(1)
k
ηk
e
ηk(1+k)x,(4)
where ηk=1
µ(1+k),ρ= [J0(2πfdτd)]2with J0()
denotes the 0th order Bessel function of first kind [9, Eq.
(8.402)]. And fd=f
cvcos ϖindicates the maximum Doppler
frequency with currently used frequency f, electromagnetic
wave propagation velocity c= 3 ×108m/s, the user velocity
v, and the angle between the mobile’s moving direction and
the incident wave direction ϖ(assume ϖ= 0 in this letter).
C. Mobility Model
A simple random walk mobility (RWM) model is utilized
to describe users’ mobility as depicted in Fig. 1(a). Without
loss of generality, we study a typical mobile user z0which
is initially located at the origin O1and connects to APo(the
serving AP) and then shifts to O2after moving a distance v
in unit time at a random angle θ. So vcan also be viewed
as the mobile user velocity. According to the maximal RSRP
association rule, the serving AP is chosen with respect to the
minimal equivalent distance ˜
H1
αRwhere Ris the distance
between the mobile user and the previous serving AP after
movement. Note that regarding the small scale fading effect,
APois not necessary the nearest AP to the mobile. Specifically,
in Fig. 1(a), H1
αRis the scaled distance between the user and
its serving AP considering the perfect CSI which is the radius
v
q
1
O
v
q
q
1
O
O
O
O
O
O
O
O
O
O
O
O
1
r
R
2
O
1
H R
a
-
1
1
-
1
H R
a
-
o
AP
A
B
(a)
v
q
1
O
2
O
A
B
1
H R
a
-
r
b
j
j
d
S
d
d
S
d
d
v
v
q
q
q
1
1
O
OOOOOO
1
1
2
O
2
v
1
O
O
O
O
O
O
O
O
O
O
O
O
O
O
1
1
1
1
1
H
1
R
-
r
b
b
b
d
d
d
S
(b)
Fig. 1. (a) A mobile user moves from O1to O2(the black solid circles
represent the actual possible positions of the serving AP before and after
movement), (b) An illustration of the calculation of ˜
Sdand Sd.
of the red dash dotted circles. Similarly, ˜
H1
αRis the scaled
distance considering the outdated CSI and the corresponding
circles are showed by the blue dotted lines.
With respect to the handover protocol, a handover decision
is made once there’s at least one AP (except the serving AP)
can provide a higher RSRP. Thereby, the mobile users always
enjoy the best service during each time slot.
III. HANDOVER FAIL UR E ANALYSIS
To make handover failure tractable, we first derive the
density of the generalized HPPP considering perfect and
outdated CSI respectively. Then estimated and accurate HP
are given according to the outdated and perfect CSI. Further,
we propose FHP and MHP to evaluate the handover failure.
A. Preliminary Analysis
Consider a new process Ξ = ξi=(χi(t)L(zi))
1, i =
0,1, . . .,χi(t)=hi(t)or ˜
Hi(t)(subscript mis removed due
to the i.i.d. character), where ξidenotes the generalized path-
loss between APiand z0and is indexed in an increasing order,
i.e., ξ0< ξ1< ξ2. . .. Then we have the following theorem.
Theorem 1. Ξis an HPPP with density λ=λoEχ2
α.
Proof: The proof of theorem 1 is given in Appendix.
Specifically, some special cases are given as follows.
1) when χi(t) = hi(t), i.e., perfect CSI,
λa=λoEhi
2
α=λo
0
l2
α1
µe
l
µdl =λoµ2
αΓ2
α+1.(5)
2) when χi(t) = ˜
Hi(t), i.e., outdated CSI,
λe=λoE˜
H
2
α
i
=λo
0l2
αM
M1
k=0 M1
k(1)
k
ηkeηk(1+k)ldl
=λoM
M1
k=0 M1
k(1)k
1+k[ηk(1+k)]2
αΓ2
α+1,
(6)
where Γ ()is the gamma function.
Remark: According to (5) and (6), we can see that an
independent generalized HPPP generates during each time slot.
In this light, the original HPPP Φotransforms into a new HPPP
1089-7798 (c) 2016 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/LCOMM.2017.2720162, IEEE
Communications Letters
3
Φewith density λe. And ˜
H1
αdican be regarded as a stretched
(˜
H < 1) or shrunken ( ˜
H > 1) transformation of the distance
di. Similarly, considering perfect CSI, Φowould be displaced
by another new HPPP Φawith density λa.
B. Handover Failure Analysis
1) Estimated/Accurate HP: Before conducting handover
failure analysis, we first give the estimated/accurate HP by
Pe
HO =Pthere is at least one AP in ˜
Sd
=2π
0
0
01e
λo˜
Sdg˜
Hf(r)f(θ)d˜
Hdrdθ, (7)
Pa
HO =P(there is at least one AP in Sd)
=2π
0
0
01e
λoSdf(h)f(r)f(θ)dhdrdθ. (8)
Here, g˜
His given by (4), f(h) = 1
µeh
µ, h > 0and other
variables in (7) and (8) are explained as follows:
i) the PDF of the moving angle θis f(θ) = 1
2πand the
distance distributions between the mobile and it’s serving AP
is given by f(r) = 2πλereπλer2. What should be noted is
that λeis the density of the new process Φe.
ii) ˜
Sdin Fig.1 (b) is recognized as a “dangerous area”
because handover happens if there’s any AP in it and the area
of ˜
Sdcan be calculated by
˜
Sd=˜
β+ ˜φ ˜
H1
αR2˜
βr2+vr sin ˜
β, (9)
where ˜φ=O
1AO
2= sin1vsin β
˜
H
1
αRand ˜
β=AO
1O
2=
cos1r2+v2˜
H1
αR22vr.
iii) similar to ˜
Sd,Sdwith perfect CSI is given by
Sd=(β+φ)h
1
αR2βr2+vr sin β, (10)
where β= cos1
[r2+v2(h
1
αR)2]
2vr
and φ=sin
1vsin β
h
1
αR.
From (7) and (8), we can find that the difficulty of figuring
out the mapping relation between the serving AP and the
corresponding AP in the previous Poisson-Voronoi tessellated
Φodissolves by studying the new process Φe. Handover failure
occurs because of the impact of outdated CSI feedback, which
can be divided into two categories, i.e., false handover and
miss handover. Next, both FHP and MHP are studied.
2) FHP: Concerning FHP, we first give its definition as the
joint probability that no handover occurs using perfect CSI but
handover is to be made based on outdated CSI, which means
that the mobile makes a false handover decision and can be
derived as
p
f=PHO using perfect CSI,HO using outdated CSI
=Ptheres at least one AP in ˜
SdSd
given that ˜
H<h
=2π
0
0
0h
01e
λo(˜
Sd
Sd)f˜
H, h
f(r)f(θ)d˜
Hdhdrdθ,
wheref˜
H, h=f˜
H,h (x, y) = 1
(1ρ)µ2ex+y
µ(1ρ)×I02ρxy
µ(1ρ)[7, Eq.
(6.2)]. ˜
Sdand Sdare given by (9) and (10).
3) MHP: Likewise, MHP is defined as the joint probability
that handover occurs using perfect CSI but no handover
happens based on outdated CSI. In other words, the mobile
misses the handoff. Therefore, MHP can be derived by
AP Density ( )
10-7 10-6 10-5 10-4 10-3 10-2 10-1
Estimated/Accurate HP
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1 , Analytical
, Analytical
, Simulation
, Simulation
Handover Probability of DDHP in [2]
/m2
PHO
a
PHO
e
PHO
a
PHO
e
v = 4, 20, 40, 100m/s
0.23%
1.61%
4.03%
6.70%
5.47%
Fig. 2. Estimated/Accurate HP vs. AP density with different user velocity.
AP Density ( )
10-7 10-6 10-5 10-4 10-3 10-2 10-1
FHP/MHP/Handover Failure Probability
0
0.02
0.04
0.06
0.08
0.1
0.12
0.14
0.16 pf , Analytical
pm , Analytical
pe , Analytical
pf , Simulation
pm , Simulation
pe , Simulation
/m2
10-6.32 ~10-3.1/m2
10-6.28 ~10-4.55 /m2
10-6.3~10 -3.69/m2
v=20, 40, 100m/s
(a)
Velocity (m/s)
0 20 40 60 80 100
Handover Failure Probability
0
0.02
0.04
0.06
0.08
0.1
0.12
0.14
0.16
λo=10-5/m2, Analytical
λo=10-5/m2, Simulation
λo=10-4/m2, Analytical
λo=10-4/m2, Simulation
λo=10-3/m2, Analytical
λo=10-3/m2, Simulation
(b)
Fig. 3. (a) FHP/MHP/Handover failure probability vs. AP density with
different user velocity. (b) Handover failure probability vs. user velocity with
different AP density.
p
m=PHO using perfect CSI,HO using outdated CSI
=Ptheres at least one AP inSd˜
Sd
given that ˜
H>h
=2π
0
0
0˜
H
01eλo(Sd
˜
Sd)f˜
H, h
f(r)f(θ)dhd ˜
Hdrdθ.
Finally, we can calculate the total handover failure proba-
bility pHF by summing FHP and MHP as pHF =pf+pm.
IV. SIM UL ATION RESULTS
In this section, we first verify the accuracy of the derived
theoretical expressions by comparing with simulation results.
Note that simulation results are performed by Monte Carlo
methods. Then we test the effect of mobility on handover
failure probability. For the sake of clarity, the simulation
parameters are listed in TABLE I.
TABLE I
SIM ULATI ON PARAMETERS
Symbol Definition Value
λoThe density of APs 107101/m2
λuThe density of users 5×10
4/m2
αThe path-loss exponent 4
RThe radius of network coverage 1000m
MThe number of antennas of APs 4
τdThe delay of each channel 8ms
vThe user velocity 0100m/s
fCommunication frequency 3×109Hz
µThe variance of Complex Gauss
distribution 0.98
Fig. 2 indicates that the analytical results match the simula-
tions well in depicting the estimated and accurate HP. Besides,
as λoor vincreases, some conclusions can also be observed: 1)
The estimated HP Pe
HO is always a bit higher than the accurate
1089-7798 (c) 2016 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/LCOMM.2017.2720162, IEEE
Communications Letters
4
one. This can be explained by (5) and (6), which indicates
that the new HPPP Φeis denser than Φa, i.e., λe> λa.
2) The gap between Pe
HO and Pa
HO diminishes with the
increasing AP density or user velocity. Specifically, in the case
of v= 40m/s, the gap decreases from 5.47% to 1.61% when
λoincreases from 104/m2to 103/m2. Similarly, in the
case of λo= 103/m2, this gap drops from 6.70% to 0.23%
when vgrows from 4m/s to 100m/s. 3) In dense networks
(105m2<λo<103m2) [10], i.e., medium-size networks,
handover probability is very sensitive to velocity shown by
the steep slopes of these curves in Fig. 2. 4) Compared with
the HP of distance-dependent handover protocol (DDHP) in
[2], both the estimated and accurate HP are higher, but they
gradually approach that in [2] with the increasing AP density.
This is because distance dependent fading plays a more and
more dominant role than small scale fading as the network
becomes denser or the user moves faster.
Fig. 3(a) and Fig. 3(b) illustrate the effect of outdated CSI
on handover failure probability pHF comprising both FHP pf
and MHP pm. Two distinct phenomena can be viewed. First,
as shown in Fig. 3(a), there’s a peak phase for FHP/MFP as
well as the total handover failure probability. Specifically, if
we treat the case of pHF >10% as a relative “vulnerable”
region, in the case of v= 20m/s, the “vulnerable” region
is 106.32 103.1/m2. The reasons behind are that in the
dense network, handover failure is largely affected by both
small fading effect and Doppler effect, while in the sparse
network where the distance based path loss fading dominates,
the handover decision through accurate CSI and estimated CSI
agrees for a very large possibility. However, for UDNs, since
the inter-AP distance is pretty small, ”handover” is always
decided for both accurate and estimated CSI, handover failure
is lowered again. Second, Fig. 3(b) illustrates that pHF first
grows but then declines with the increasing user velocity for
various AP density. This is because when the mobile users
start moving, it would experience a higher handover failure
due to Doppler effect. But when the velocity reaches the
very fast cases, the distance variance begins to dominate and
users are prone to experience a handoff no matter using the
estimated or accurate CSI-based handover scheme. Moreover,
in the decline stage, handover failure probability drops faster
for denser network due to the higher handover probability for
both estimated and accurate CSI cases.
V. CO NC LU SI ON
The effect of outdated CSI on handover decisions in UDNs
is investigated in this letter. Simulations demonstrate that in
sparse or ultra-dense networks, handover failure probability is
rather small but turns higher in dense networks. In other words,
channel imperfection can be tolerant in sparse or ultra-dense
networks. However, in dense networks, handover decisions
are very sensitive to user velocity and CSI imperfection. To
conclude, the observations in this letter provide the theory
evidence suggesting that sophisticated speed-aware handover
protocols need to be studied, especially in dense network
where more accurate CSI is requested for making a handover
decision. However, in sparse or ultra-dense network, the ac-
quisition of CSI becomes loose.
APP EN DE X A: PROO F OF TH EO RE M 1
Let Υ = {zi, χi}
i=0 be the marked point process. Since
the marks χi, i = 1,2, . . . are i.i.d, Υis still an HPPP with
intensity λodz pχ(l)dl. Applying the displacement theorem
[8, theorem 1.3.9], we can get that Ξis an HPPP with intensity
Λ (A) = λoR2Rp((z, l), A)pχ(l)dzdl
=λoR2R1{(lL(z))1A}pχ(l)dzdl, (11)
where p((z, l), A)is the probability kernel for Borel AR+.
First, we give the derivation of Λ ((0,T]) when A= (0,T].
Λ ((0,T]) = λoR2R1{(lL(z))1T}pχ(l)dzdl
(a)
=λoR2Fχ(L(z)T)1dz =λoΦ (T),(12)
where (a) is obtained by assuming Fχ(ε) = P(χε) =
εpχ(l)dl and we derive
Φ (T)=R2R1{(lL(z))1T}pχ(l)dzdl
(b)
=
0pχ(l)2π
0
01{r(lT )1
α}rdrdθdl
=2π
0pχ(l)(lT )1
α
0rdrdl
=πT 2
αEχ2
α,
(13)
where (b) is obtained by plugging L(z)=rα, z = (r, θ)in (13).
Hence, the intensity of the new process is
λ=Φ (T)
Φ (T)|χ= 1 λo=Eχ2
αλo.(14)
This concludes the proof.
REF ER EN CE S
[1] H. Kao, et al., “Adaptive Measurement for Energy Efficient Mobility
Management in Ultra-Dense Small Cell Networks,” in Proc. IEEE ICC,
pp. 1–6, July 2016.
[2] S. Sadr and R. Adve, “Handoff rate and coverage analysis in multi-tier
heterogeneous networks,” IEEE Trans. Wireless Commun., vol. 14, no. 5,
pp. 2626–2638, May. 2015.
[3] Y. T. Hong, et al., “Cross-tier handover analyses in small cell networks:
A stochastic geometry approach,” in Proc. IEEE ICC, pp. 3429-3434,
Jun. 2015.
[4] W. Bao and B. Liang, “Stochastic geometric analysis of user mobility in
heterogeneous wireless networks,” IEEE J. Sel. Areas Commun., vol. 33,
no. 10, pp. 2212–2225, Oct. 2015.
[5] T. T. Vu, L. Decreusefond and P. Martins, “An analytical model for eval-
uating outage and handover probability of cellular wireless networks,” in
Proc. Wireless Personal Multimedia Communications (WPMC), pp. 643–
647, Sept. 2012.
[6] N. Ferdinand, D. Benevides da Costa, and M. Latva-aho, “Effects of
outdated csi on the secrecy performance of miso wiretap channels
with transmit antenna selection,” IEEE Commun. Lett., vol. 17, no. 5,
pp. 1822–1834, May. 2013.
[7] M. K. Simon and M. S. Alouini, “Digital communications over fading
channels: A unified approach to performance analysis,” 1st ed., New
York: John Wiley and Sons, 2000.
[8] F. Baccell and B. Blaszczyszyn, “Stochastic Geometry and Wireless
Networks,” Volume I - Theory vol. 3, No 3-4 of Foundations and Trends
in Networking, NoW Publishers, 2009.
[9] I. S. Gradshteyn and I. M. Ryzhik, “Table of integrals,” IEEE Commun.
Mag., 7th ed., New York: Academic, 2007.
[10] M. Ding, et al., “Performance Impact of LoS and NLoS Transmissions
in Dense Cellular Networks,” IEEE Trans. Wireless Commun., vol. 15,
no. 3, pp. 2365–2380, Mar. 2016.
... In this paper, the authors proposed a scheme to dynamically adjust the hysteresis margin of RSRP and RSRQ on the basis of the speed and location when a high-speed train enters the overlapping region. In [7], they analyzed the effect of delayed channel quality indicators on HO decisions in dense small cell network, and it is confirmed that the probability of handover failure is increased in a dense small cell network, and that HO is very sensitive to user speed and channel state. ...
Article
Full-text available
To construct a femtocell based ultra-dense network (UDN) is the important way to satisfy the ever-growing data traffic demands in the next generation mobile networks. However, it causes frequent handovers (HOs), thus leading to negative consequences such as increased power consumption and poor quality of service (QoS). This paper represents a research on the uplink handover (UL-HO) being watched recently and proposes a new method to further improve the energy efficient and QoS. First, we confirm the UL-HO mechanism, formulate the power consumption caused by UL-HO and compare downlink handover (DL-HO) with UL-HO in terms of the performance parameters including the power consumption, handover rate (HOR), handover failure rate (HOFR), ping-pong rate (PPR), delay, packet loss rate (PLR) and throughput during handover (HO). Then, it is proved through simulation that the reliable target cell determination scheme considering uplink reference signal received power (UL-RSRP), available bandwidth, direction of user equipment (UE), and admission control is lower in HOR, HOFR, PPR, power consumption, delay and PLR. In particular, we propose a new algorithm to determine the reasonable target cell considering UL-RSRP, available bandwidth and moving direction of UE, thus reducing HOR and PPR. The improved UL-HO scheme can be implemented easily by adding some functions besides the upper-layer protocol, while it can provide a lot of benefits such as reduced power consumption, delay, frequent HOs resulting in reducing HOR and PPR. Accordingly, this can be introduced into 5G as a HO scheme.
... The feedback information obtained via the forward link may not ideally represent the reverse link since they are not available simultaneously. Another issue is the outdated feedback caused by feedback delays [41]- [44]. Conversely, it must include all variations to ideally adjust the processes, such as antenna selection or beamforming. ...
Article
Full-text available
Communications are realized as a result of successive decisions at the physical layer, from modulation selection to multi-antenna strategy, and each decision affects the performance of the communication systems. Future communication systems must include extensive capabilities as they will encompass a wide variety of devices and applications. Conventional physical layer decision mechanisms may not meet these requirements, as they are often based on impractical and oversimplifying assumptions that result in a trade-off between complexity and efficiency. By leveraging past experiences, learning-driven designs are promising solutions to present a resilient decision mechanism and enable rapid response even under exceptional circumstances. The corresponding design solutions should evolve following the lines of learning-driven paradigms that offer more autonomy and robustness. This evolution must take place by considering the facts of real-world systems and without restraining assumptions. In this paper, the common assumptions in the physical layer are presented to highlight their discrepancies with practical systems. As a solution, learning algorithms are examined by considering the implementation steps and challenges. Furthermore, these issues are discussed through a real-time case study using software-defined radio nodes to demonstrate the potential performance improvement. A cyber-physical framework is presented to incorporate future remedies.
Article
Next-generation mobile communication systems are planned to support millimeter Wave (mmWave) transmission in scenarios with high-mobility, such as in private industrial networks. To cope with propagation environments with unprecedented challenges, data-driven methodologies such as Machine Learning (ML) are expected to act as a fundamental tool for decision support in future mobile systems. However, high-quality measurement datasets need to be made available to the research community in order to develop and benchmark ML-based methodologies for next-generation wireless networks. We present a reliable testbed for collecting channel measurements at sub-6 GHz and mmWave frequencies. Further, we describe a rich dataset collected using the presented testbed. Our public dataset enables the development and testing of innovative ML-based channel simulators for both sub-6GHz and mmWave bands on real-world data. We conclude this paper by discussing promising experimental results on two illustrative ML tasks leveraging on our dataset, namely, channel impulse response forecasting and synthetic channel transfer function generation, upon which we propose future exploratory research directions. The original dataset employed in this work is available on IEEE DataPort (https://dx.doi.org/10.21227/3tpp-j394), and the code utilized in our numerical experiments is publicly accessible via CodeOcean (https://codeocean.com/capsule/9619772/tree).
Article
Handover modifies the user equipment using mobility in which base station provides the best one. The repeated handovers may corrupt mobility reliability due to high signaling load and therefore, network capability enhancement is affected. Here, a network management system in a network is difficult one owing to the rising number of complexity issues and base stations. In this paper, Crow Sun Flower Optimization (CSFO)-based handover method is developed for enabling efficient handover in Fifth Generation (5G) network. This handover method mainly consists of four parts, such as User Preference (UP) section, Network Quality of Service (NQ) module, power section, and Decision System (DS) module. The Quality of service (QoS) is controlled by UP section and NQ module, whereas the power module is concentrated on power. Thus, the handover is decided based on three segments and DS module is used to enable the network. The DS module is effectively decided whether to offer handover in 5G network or not. Moreover, the decision is optimally selected based on an optimization technique, named as CSFO algorithm. The developed CSFO technique is newly designed by integrating Crow Search Algorithm (CSA) and Sun Flower Optimization (SFO) technique. Additionally, three performance indicators, including received power, throughput, and user-served ratio, are used to assess how well the created CSFO-based handover model performs. High received power, throughput, and user served ratio of [Formula: see text][Formula: see text]dBm, [Formula: see text][Formula: see text]kbps and 0.071, respectively, are achieved by the developed handover strategy.
Article
Channel state information (CSI) estimation is part of the most fundamental problems in 5G wireless communication systems. In mobile scenarios, outdated CSI will have a serious negative impact on various adaptive transmission systems, resulting in system performance degradation. To obtain accurate CSI, it is crucial to predict CSI at future moments. In this paper, we propose an efficient channel prediction method in multiple-input multiple-output (MIMO) systems, which combines genetic programming (GP) with higher-order differential equation (HODE) modeling for prediction, named GPODE. In the first place, the variation of one-dimensional data is depicted by using higher-order differential, and the higher-order differential data is modeled by GP to obtain an explicit model. Then, a definite order condition is given for the modeling of HODE, and an effective prediction interval is given. In order to accommodate to the rapidly changing channel, the proposed method is improved by taking the rough prediction results of Autoregression (AR) model as a priori, i.e., Im-GPODE channel prediction method. Given the effective interval, an online framework is proposed for the prediction. To verify the validity of the proposed methods, We use the data generated by the Cluster Delay Line (CDL) channel model for validation. The results show that the proposed methods has higher accuracy than other traditional prediction methods.
Article
Owning to the agility and the transform between line-of-sight (LoS) and non-LoS (NLoS) links, the time-varying channel in unmanned aerial vehicle (UAV) networks leads to the frequent handover (HO). Hence, existing HO models only considering path-loss are unable to analyze the unnecessary HO caused by fading. In this letter, a path-loss-plus-fading model with HO parameters is considered for HO in UAV networks and the impact of channel fading on HO performance is theoretically characterized, where HO states during time-to-trigger (TTT) duration is discretized to analyze the HO trigger probability. By modeling the fading as Nakagami-m distribution, a discrete time Markov chain is utilized where the user’s states along the trajectory is discretized into multiple HO states by coherence time. Based on the discretization, HO failure (HOF) and pingpong (PP) probabilities are derived by analyzing the HO state probabilities during the TTT duration. The results show that the transform between LoS and NLoS links increases HOF probability, and there is a tradeoff between HOF and PP probabilities when configuring TTT duration.
Article
Full-text available
In this paper, we introduce a sophisticated path loss model incorporating both line-of-sight (LoS) and non-line-of-sight (NLoS) transmissions to study their impact on the performance of dense small cell networks (SCNs). Analytical results are obtained for the coverage probability and the area spectral efficiency (ASE), assuming both a general path loss model and a special case with a linear LoS probability function. The performance impact of LoS and NLoS transmissions in dense SCNs in terms of the coverage probability and the ASE is significant, both quantitatively and qualitatively, compared with the previous work that does not differentiate LoS and NLoS transmissions. Our analysis demonstrates that the network coverage probability first increases with the increase of the base station (BS) density, and then decreases as the SCN becomes denser. This decrease further makes the ASE suffer from a slow growth or even a decrease with network densification. The ASE will grow almost linearly as the BS density goes ultra dense. For practical regime of the BS density, the performance results derived from our analysis are distinctively different from previous results, and thus shed new insights on the design and deployment of future dense SCNs.
Article
Full-text available
Multiple antennas at the transmitter enhance the diversity performance of multiple-input single-output (MISO) wiretap channels by selecting a single antenna that maximizes the instantaneous signal-to-noise ratio (SNR) at the intended receiver. However, the expected diversity performance may not be fully realized when channel state information (CSI) is outdated at the transmitter. Owing to this fact, in this letter we analyze the effects of outdated CSI on the secrecy outage performance of MISO wiretap channels with transmit antenna selection. More specifically, assuming Nakagami-m fading, a closed-form expression for the exact secrecy outage probability is derived, from which an asymptotic analysis is carried out. Our asymptotic results reveal that the expected diversity gain cannot be realized when CSI is outdated during the antenna selection process. The validity of our formulations is corroborated by Monte Carlo simulations.
Article
Full-text available
We consider stochastic cellular networks where base stations locations form a homogenous Poisson point process and each mobile is attached to the base station that provides the best mean signal power. The mobile is in outage if the SINR falls below some threshold. The handover decision has to be made if the mobile is in outage for some time slots. The outage probability and the handover probability is evaluated in taking into account the effect of path loss, shadowing, Rayleigh fast fading, frequency factor reuse and conventional beamforming. The main assumption is that the Rayleigh fast fading changes each time slot while other network components remain static during the period of study.
Article
Horizontal and vertical handoffs are important ramifications of user mobility in multitier heterogeneous wireless networks. They directly impact the signaling overhead and quality of calls. However, they are difficult to analyze due to the irregularly shaped network topologies introduced by multiple tiers of cells. In this paper, a stochastic geometric analysis framework on user mobility is proposed, to capture the spatial randomness and various scales of cell sizes in different tiers. We derive theoretical expressions for the rates of all handoff types experienced by an active user with arbitrary movement trajectory. Furthermore, noting that the data rate of a user depends on the set of cell tiers that it is willing to use, we provide guidelines for optimal tier selection under various user velocities, taking both the handoff rates and the data rate into consideration. Empirical studies using user mobility trace data and extensive simulation are conducted, demonstrating the correctness and usefulness of our analysis.
Article
This paper analyzes the impact of user mobility in multi-tier heterogeneous networks. We begin by obtaining the handoff rate for a mobile user in an irregular cellular network with the access point locations modeled as a homogeneous Poisson point process. The received signal-to-interference-ratio (SIR) distribution along with a chosen SIR threshold is then used to obtain the probability of coverage. To capture potential connection failures due to mobility, we assume that a fraction of handoffs result in such failures. Considering a multi-tier network with orthogonal spectrum allocation among tiers and the maximum biased average received power as the tier association metric, we derive the probability of coverage for two cases: 1) the user is stationary (i.e., handoffs do not occur, or the system is not sensitive to handoffs); 2) the user is mobile, and the system is sensitive to handoffs. We derive the optimal bias factors to maximize the coverage. We show that when the user is mobile, and the network is sensitive to handoffs, both the optimum tier association and the probability of coverage depend on the user's speed; a speed-dependent bias factor can then adjust the tier association to effectively improve the coverage, and hence system performance, in a fully-loaded network.
Article
The purpose of this introductory chapter is to provide several measures of performance related to practical communication system design and to begin exploring the analytical methods by which they may be evaluated. While the deeper meaning of these measures will be truly understood only after their more formal definitions are presented in the chapters that follow, the introduction of these terms here serves to illustrate the various possibilities that exist, depending on both need and relative ease of evaluation.
Article
This monograph surveys recent results on the use of stochastic geometry for the performance analysis of large wireless networks. It is structured in two volumes. Volume I focuses on stochastic geometry and on the evaluation of spatial averages within this context. It contains two main parts, one on classical stochastic geometry (point processes, Boolean models, percolation, random tessellations, shot noise fields, etc.) and one on a new branch of stochastic geometry which is based on information theoretic notions, such as signal to interference ratios, and which is motivated by the modeling of wireless networks. This second part revisits several basic questions of classical stochastic geometry such as coverage or connectivity within this new framework. Volume II - Applications (see http://hal.inria.fr/inria-00403040) bears on more practical wireless network modeling and performance analysis. It leverages the tools developed in Volume I to build the time-space framework needed for analyzing the phenomena which arise in these networks. The first part of Volume II focuses on medium access control protocols used in mobile ad hoc networks and in cellular networks. The second part bears on the analysis of routing algorithms used in mobile ad hoc networks. For readers with a main interest in wireless network design, the monograph is expected to offer a new and comprehensive methodology for the performance evaluation of large scale wireless networks. This methodology consists in the computation of both time and space averages within a unified setting which inherently addresses the scalability issue in that it poses the problems in an infinite domain/population case. For readers with a background in applied probability, this monograph is expected to provide a direct access to an emerging and fast growing branch of spatial stochastic modeling.