Tech-
invite
3GPP
space
IETF
space
21
22
23
24
25
26
27
28
29
31
32
33
34
35
36
37
38
4‑5x
Content for
TS 45.022
Word version: 16.0.0
1…
A…
A
Example 1 (Siemens AG)
B
Example 2 (DeTeMobil)
C
Example 3 (Alcatel)
D
Example 4 (France Telecom/CNET)
E
Simulation Model for Handover Performance Evaluation in Hierarchical Cell Structures
$
Change history
A
Example 1 (Siemens AG)
Word‑p. 10
A.1
Introduction
A.2
Functional requirements
A.3
BSS pre-processing and threshold comparisons
Word‑p. 11
A.3.1
Measurement averaging process
A.3.2
Handover threshold comparison process
A.4
BSS decision algorithm
Word‑p. 12
A.5
Additional O&M parameters stored for handover purposes in hierarchical networks
A.6
Bibliography
Word‑p. 13
B
Example 2 (DeTeMobil)
Word‑p. 14
B.1
Introduction
B.2
Definitions
B.2.1
Categories of cells
B.2.2
Classification of MS in connected mode
Word‑p. 15
B.2.2.1
Classification in the lower layer
B.2.2.2
Classification in the middle layer or the upper layer
B.2.2.3
Loss of the "slow MS" or "quasi-stationary MS" status
Word‑p. 16
B.3
Power Control Algorithm
B.3.1
MS connected over a cell of the lower layer
B.3.2
MS connected over a cell of the middle layer or the upper layer
B.4
Handover algorithm in a hierarchical cell structure
B.4.1
MS connected over a cell of the lower layer
B.4.2
MS connected over a cell of the middle layer or the upper layer
Word‑p. 17
B.4.3
Handover at borders of different cell structures
B.5
O&M-Parameter
B.6
State diagrams
Word‑p. 18
C
Example 3 (Alcatel)
Word‑p. 21
C.1
General description
C.1.1
Speed discrimination
C.2
Handover causes
Word‑p. 22
C.2.1
Emergency causes
C.2.2
Better cell causes
C.3
Dwell time in lower layer cells:
C.3.1
Serving cell = lower layer cell
C.3.2
Serving cell = upper layer cell
C.3.3
Mechanism of increasing / decreasing tdwell
C.4
Speed discrimination process:
Word‑p. 23
C.4.1
Serving cell = upperlayer cell
C.4.2
Serving cell = lower layer cell
C.5
Representation of handovers
Word‑p. 24
C.5.1
Ideal behaviour: target cells are available
C.5.2
Real behaviour: target cells may not be available
C.6
Emergency handover
Word‑p. 25
C.6.1
Target cell = upper layer cell
C.7
Upper layer to lower layer cells handover
Word‑p. 26
C.7.1
General principles
C.7.2
Homogeneity of speed discrimination in lower layer and upper layer cells
C.8
Minicells
C.8.1
Handover diagrams
C.9
O&M parameters
Word‑p. 27
D
Example 4 (France Telecom/CNET)
Word‑p. 28
D.1
Introduction
D.2
Descriptions of the algorithm
Word‑p. 29
D.3
Handover causes
D.3.1
emergency handover causes
D.3.2
mobile speeds estimation causes
D.4
Mobile speeds estimations
Word‑p. 30
D.4.1
Estimation of the field strength variations
D.5
BSS decision algorithm
Word‑p. 31
D.6
O&M parameters
D.7
Examples
Word‑p. 32
D.8
State diagrams
Word‑p. 35
D.8.1
Case of a three layers hierarchical network
D.8.2
Case of a two layers hierarchical network
Word‑p. 36
E
Simulation Model for Handover Performance Evaluation in Hierarchical Cell Structures
Word‑p. 38
E.1
Introduction
E.2
Mobile Environment
E.3
Radio Network Model
E.3.1
Scenario 1: Hot Spot
E.3.2
Scenario 2: Line of Cells
Word‑p. 39
E.3.3
Scenario 3: Manhattan Coverage
E.4
Propagation Model
E.4.1
Upper Layer Path Loss
E.4.1.1
Macrocells
E.4.1.2
Small cells
Word‑p. 40
E.4.2
Lower Layer Path Loss
Word‑p. 41
E.4.2.1
Line-of-sight Case
E.4.2.2
Non Line-of-sight Case
Word‑p. 42
E.4.2.3
Shape of the level with the proposed path loss model
E.4.3
Fading
Word‑p. 43
E.5
Motion Model
E.6
Handover Algorithms
Word‑p. 44
E.7
Measurement Reporting
E.8
Performance Criteria
E.9
Open Issues
$
Change history
Word‑p. 45