Professional Documents
Culture Documents
Ari Viinikainen
Department of Mathematical Information Technology
University of Jyvskyl
October 17, 2007
Contents
1 Radio wave propagation models
1.1
1.2
1.3
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
2.6
2.7
2.8
2.9
2.10
2.11
2.12
2.13
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
2
2
2
3
3
4
5
6
7
9
9
9
10
10
11
11
11
11
11
11
11
11
11
12
12
12
15
15
15
15
15
16
16
16
16
16
16
18
18
18
18
3.2
3.3
Introduction . . . . . . . . . . . . . . . .
Frequency Reuse . . . . . . . . . . . . .
Channel Assignment Strategies . . . . .
Hando Strategies . . . . . . . . . . . .
Interference and System Capacity . . . .
Trunking and Grade of Service . . . . .
Improving Capacity in Cellular Systems
4.7.1 Cell Splitting . . . . . . . . . . .
4.7.2 Sectoring . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
ii
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
21
21
21
21
21
21
23
23
23
23
23
25
25
25
26
26
26
27
27
28
28
29
29
30
30
31
31
35
35
35
36
36
37
37
38
38
39
40
40
40
42
42
44
47
52
52
53
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
55
56
56
56
56
56
57
57
57
58
58
58
59
61
62
62
62
62
63
63
63
63
65
65
65
65
66
Chapter 1
P1
P2
(1.1)
PT
4d2
(1.2)
If a receiving antenna is placed on a spherical wave front, then the received power is
PR =
PT AR
4d2
(1.3)
4AT AR
,
2 4d2
(1.5)
so
PR = PT
4AT 4AR
2
2
= PT GT GR
In decibels, the
PT
PR
4d
4d
(1.6)
10 log
PT
PR
= 20 log
4d
10 log GT 10 log GR
[dB]
(1.7)
The term in (1.6), which depends on distance and frequency, is called the Free Space Loss between two
isotropic radiators. In decibels, the Free Space Loss can be expressed as
Free Space Loss
(FSL)dB = 20 log
4d
(1.8)
or
If is changed to frequency and expressed in MHz and distance is expressed in km, then
FSLdB = 21.98 + 20 log
(1.9)
(1.10)
Example
A WLAN base station transmits (frequency 2.4 GHz) at 100 mW power. Assuming Free Space Loss, what
is the strength of the received signal at a distance of (a) 1 km (b) 2 km (c) 10 km?
h1 h2
d2
(1.11)
where Pt is the transmitter power, h1 and h2 are heights of the transmitter and receiver and d is the
distance between them.
Does not take into consideration the frequency.
Example
The signal strength can be increased by raising the base station antenna height. If the received signal
strength is -110 dBm and the base station antenna height is 30 m, how much should the base station
antenna height be increased in order to increase the received signal strength by 10 dB (i.e. eli -110 dBm
-100 dBm)?
2
h1 h2
P
2
t
d
Pr
= 10 dB = 10 log
10 log
h1 h2 2
Pr
Pt d2
h1 = 94.87 m
Increase = 64.87 m.
(1.12)
where the frequency f = 150 1500 MHz, base station height hb = 20 200 m receiver height hm = 1
10 m and distance R = 1 20 km.
Parameter a(hm ) is a correction term for the mobile antenna height and depends on the environment, i.e.
the size of the city (Hata classies as a large city one which has buildings higher then 15 m)
(1.1 log10 fM Hz ) hm
small/medium
(1.13)
K = 2 log10
fM Hz
28
+ 5.4
(1.14)
Example
Calculate the loss with (a) the Free Space (b) the Okumura-Hata model (large city), when the GSM base
station (frequency 900 MHz) height is 47 m and the distance to the mobile (which is at height 1.8 m) is
17 km.
(a) 116.1 dB
(b) 164.8 dB
Large and small cells (i.e. base station antenna heights above roof-top levels of buildings adjacent to the
base station).
Lu [dB] = 46.3 + 33.9 log(f ) 13.82 log(hb ) a(hm )
+ [44.9 6.55 log(hb )] log(d) + Cm ,
where
( or Lb = Lo
Lcri
10 + 0.354
2.5 + 0.075( 35 )
=
4.0 0.114( 55 )
for 0 < 35
for 35 < 55
for 55 < 90
Lbsh =
18 log(1 + hb hroof )
0
54
54 0.8 (hb hroof )
ka =
kf =
4 + 0.7 (f /925 1)
4 + 1.5 (f /925 1)
18
18 15 (hb hroof )/hroof
for medium sized cities and suburban centres with moderate tree density
for metropolitan centres
160
Loss [dB]
140
120
100
80
FSL
2Ray
Okumura
60
40
10
Distance [km]
15
20
160
Loss [dB]
140
120
100
80
FSL
2Ray
Okumura
60
40
10
Distance [km]
15
20
160
Loss [dB]
140
120
100
80
FSL
2Ray
Okumura
60
40
10
Distance [km]
15
20
Chapter 2
Full-Rate TCH
Full-Rate TCH (TCH/F) channel can be used for transmission of voice or dierent speeds of
data.
One user is using one physical channel (one time slot at some frequency (which might be
hopped)).
Half-rate TCH
Half-Rate TCH (TCH/H) channel can also be used for transmission of voice or dierent speeds
of data.
Now, tow users are using one physical channel alternating on the same time slot.
9
10
In theory, the capacity of the system can be doubled, is all TCH/F channels are changed to
TCH/H channels.
(SCH)
(BCCH)
(CBCH)
11
12
13
14
(MSISDN)
(IMSI)
(TMSI)
(LAI)
(CGI)
(BSIC)
(IMEI)
(MSRN)
(HON)
15
16
17
18
(2.1)
(2.2)
(2.3)
where
and
The parameter p1 = 110 . . . 48 dBm is the minimum of the received level with which the cell can be
accessed.
The parameter p2 is the maximum transmit power allowed for an MS in the cell.
In cell selection, only cells with positive C1 are considered and the one with the highest C1 is selected, if
possible.
C1 determines two things
the coverage limit of each individual cell (note: this may be dierent for dierent MS's)
the boundary between two adjacent cells
These borders are not xed but change over time depending on weather, trac conditions etc.
19
2.16 Modulation
GMSK
Phase modulation
1
Reference
Transmitted
0.8
0.6
0.4
0.2
0
0.2
0.4
0.6
0.8
1
100
200
300
400
500
600
700
20
Frequency modulation
1
Reference
Transmitted
0.8
0.6
0.4
0.2
0
0.2
0.4
0.6
0.8
1
100
200
300
400
500
600
700
Chapter 3
symmetric or asymmetric
symmetric: same number of Uplink and Downlink TCHs
consecutive or non-consecutive time slots can be allocated
one main channel - FACCH signaling
21
22
Figure 3.3: HSCSD network architecture - only one circuit can be allocated on the A interface
Intra-PLMN
Inter-PLMN
HLR
23
24
MSC/VLR
SMS-GMSC/SMS-IWMSC
25
Figure 3.6:
26
27
Supports either circuit switched calls or GPRS data transfer but not simultaneous communication
Class C operation mode
Attach
Know who is the MS and what it can or is allowed to do
Detach
Leave the system
Attach and detach typically happen so seldom that these procedures do not need to be optimized
Attach in the morning and detach in the evening
Normally this is not a big issue
28
Two extremes
1. MS updates its location when it changes a big area
Like in GSM, update network when changing a Location Area
Good for MSs case
Saves battery, less MS originated updates
Mobile may move around the area without telling the network
Uplink radio capacity is not wasted so much for mobility management messages
Uplink radio capacity is wasted on paging responses
MS's location is not known exactly, every downlink packet requires paging of the mobile
Data transfer is delayed signicantly
Paging load increases (data trac is totally dierent than voice calls in GSM)
2. MS updates its location to network in every cell change
like in GSM, when a call is established, update location in every cell change
good for MSs that get lot of data downlink and move seldom
MS's location is always known in accuracy of a cell
No paging is needed
Paging channel practically unused
Data delivery is very fast, no need to wait paging response
MS's battery is draining due to continuous cell updates
Uplink radio capacity is wasted with continuous cell updates
3.2.14 Procedures
Attach
Routing Area Update
PDP Context Activation
Figure 3.7:
29
30
Figure 3.8:
Inter SGSN
Intra-SGSN
31
PDP type
PDP address (optional)
QoS parameters (optional)
Access point name (optional)
SGSN checks if MS is allowed to activate the requested context and denes the missing optional parameters
SGSN selects GGSN to be used
QoS negotiation
32
33
34
Due to high C/ I requirements, EDGE will be (initially) restricted to `micro' cell environments
35
36
37
Class A:
8PSK in the DOWNLINK
GMSK in the UPLINK
Maximum data rates are not increased from the rates supported in current GSM.
The same services as in GSM are achievable with smaller number of time slots and relatively simple
MS implementation making them more attractive to various data applications
ECSD will support interworking with audio modems and ISDN services on various data rates.
Support for realtime applications like videotelephony
38
Peak throughput:
39
Chapter 4
Further capacity increase possible by adding base stations and decreasing cell size
A xed number of channels serves a large number of subscribers
No regular shape
Consider the following
(k < S).
(4.1)
If the N cells are replicated M times, then the total number of duplex channels i.e capacity is
C = M kN = M S
(4.2)
The capacity of a cellular system is directly proportional to the number of times a cluster is replicated.
Typical cluster sizes N are 4,7 or 12.
What happens if we increase the cluster size N (i.e. the channels are divided among a greater number of
cells)?
40
41
i, j = 0, 1, 2, 3, . . .
(4.3)
(4.4)
Example
If a total of 33 MHz of bandwidth is allocated to a particular FDD cellular telephone system which uses
two 25 kHz simplex channels to provide full duplex voice and control channels, compute the number of
channels available per cell if a system uses (a) 4-cell reuse, (b) 7-cell reuse, (c) 12-cell reuse.
Solution to Example
Total bandwidth = 33 MHz
Channel bandwidth = 25 kHz 2 simplex channels = 50 kHz / duplex channel
Total available channels = 33000/50 = 660 channels
The total number of channels available per cell is
42
(b) 660/7 95
(c) 660/12 55
43
In practical design of hando algorithms the statistics of dwell time have shown to be important.
In the rst generation analog cellular systems
Prioritizing handos
The wide range of mobile velocities arises problems on practical cellular systems.
Several schemes have been investigated to handle the simultaneous trac of high and low speed users,
while minimizing the load to the system.
44
i, j
i = 1, j
i = 0, j
i = 1, j
i = 0, j
i = 2, j
i = 1, j
=1
=2
=2
=3
=2
=3
Cluster size
3
4
7
9
12
13
(N )
The umbrella cell approach means that we have dierent sizes of cells in the same location (Figure
4.4) to provide service to mobile users with dierent velocities.
D
= 3N
R
(4.5)
where D is the distance to the center of the nearest co-channel cell and R is the radius of the cell.
45
S
=
I
(4.6)
i0
i=1 Ii
where S is the signal power from the base station and Ii is the interference power caused by the ith
co-channel base station.
The average received power Pr at a distance d from the transmitting antenna can be approximated
by
Pr = P0
d
d0
(4.7)
or
d
d0
(4.8)
where P0 is the power received at a close-in reference point in the far eld region of the antenna at
a small distance d0 from the transmitting antenna and n is the path loss exponent.
If Di is the distance to the ith interferer, then the received power will be proportional to (Di )n .
If the transmit powers and the path loss exponents of the base stations are equal, then we can use
the approximation
S
=
I
Rn
(4.9)
i0
n
i=1 (Di )
n
(D/R)n
( 3N )
S
=
=
I
i0
i0
(4.10)
where S/I is related to the cluster size N , which determines the overall capacity of the system.
From Figure 4.5 you can see the distances to the nearest co-channel interfering cells, when the mobile
is at the cell boundary.
R n
2)
(R)n
+ (D +
R n
2)
+ (D + R)n + Dn
(4.11)
S
=
I
1
2(Q+1)n +(Q1)n
(Q2 1)n
(Q+0.5)n +(Q0.5)n
(Q2 0.25)n
1
Qn
(4.12)
Example
If a signal to interference ratio of 15 dB is required for satisfactory downlink channel performance of a
cellular system, what is the frequency reuse factor and cluster size that should be used for maximum
capacity if the path loss exponent is (a) n = 4, (b) n = 3 ? Assume that there are 6 co-channel cells in
the rst tier and all of them are at the same distance from the mobile. Use suitable approximations.
46
Solution to Example
(a) First, let us consider a 7-cell reuse pattern. We get D/R = 4.583 and S/I = (1/6) (4.583)4 =
75.3 = 18.66dB. OK!
(b) Let's consider again a 7-cell reuse pattern. Now S/I = (1/6) (4.583)3 = 16.04 = 12.05dB.
Is this OK??? No, we must have S/I 15dB .
Ok, then try
!#%&&%!!
Aah, well N = 12 then... S/I = (1/6) (6)3 = 36 = 15.56dB.
Finally, a bit over the required!
Interference, which results from imperfect transceivers which allow the neighboring frequencies to
leak into the pass band.
Adjacent Channel Interference can be diminished with good ltering and careful channel assignments
a cell should not use adjacent frequencies.
The channels in a cell can be separated by N channel bandwidths with certain allocation schemes.
In some schemes the use of adjacent channels in neighboring cells is also prevented.
In practice, the receiver lters are designed to reject most of the adjacent channel interference.
Power Control for Reducing Interference
Load
Grade of Service (GOS)
Requested Rate
47
The system controls the mobiles to use the smallest possible power level necessary to maintain good
quality.
Power control is especially important in CDMA direct sequence spread spectrum (DSSS) systems.
(4.13)
where H is the average duration of a call and is the average number of call requests per unit time.
For a system with an unspecied number of channels and containing U users, the total oered trac
intensity A, is given as
A = U Au
(4.14)
If the trac density is equally divided among the channels in a C channel trunked system, then the trac
intensity per channel, Ac , is given by
Ac =
U Au
C
(4.15)
48
The maximum possible trac carried by the system is the total number of channels, C , in Erlangs.
There are two types of trunked systems which are commonly used: one without queuing and the other
with queuing.
Blocked calls cleared is a type of trunking system in which it is assumed that the call arrival is determined
by a Poisson distribution and the number of users is innite.
Other assumptions are
(a) All users, including blocked users, may request a channel at any time.
(b) Longer calls are less likely to appear than shorter calls (i.e. occupation of channel is exponentially
distributed).
(c) There is a nite number of channels in the trunking pool.
This is known as a M/M/m queue and leads to derivation of the Erlang B formula or Blocked calls cleared
formula.
The Erlang B formula determines the probability that a call is blocked, when queueing is not used, and
is given by
P r[blocking] =
AC
C!
C
Ak
k=0 k!
(4.16)
= GOS
where C is the number of trunked channels oered by a trunked radio system and A is the total oered
trac.
Blocked calls delayed is a type of trunking system where the blocked calls are queued and delayed until a
channel becomes available.
Blocked calls delayed is a measure of GOS dened as the probability that a call is blocked after waiting a
specic time in the queue.
For nding this GOS the likelihood, that a call is initially denied access to the system, must rst be
obtained which is given by the Erlang C formula
P r[delay > 0] =
AC
AC + C! 1
A
C
C1 Ak
k=0 k!
(4.17)
The probability that the delayed call is forced to wait more than t seconds is given by the probability that
a call is delayed, multiplied by the conditional probability that the delay is greater than t seconds.
P r[delay > t] = P r[delay > 0]P r[delay > t|delay > 0]
= P r[delay > 0]exp
(C A)t
H
(4.18)
(4.19)
H
C A
where the average delay for those calls which are queued is given by
(4.20)
H
CA .
Example
How many users can be supported for 0.5 % blocking probability for the following number of trunked
channels in a blocked calls cleared system? (a) 5,(b) 10,(c) 20,(d) 100. Assume that each user generates
0.1 Erlangs of trac.
49
Figure 4.6: The Erlang B chart showing the probability of blocking as functions of the number of channels and
trac intensity in Erlangs.
Figure 4.7: The Erlang C chart showing the probability of a call being delayed as a function of the number of
channels and trac intensity in Erlangs.
50
Solution to Example
(a) Given C = 5, Au = 0.1, GOS = 0.005.
From Figure 4.6 we obtain A = 1.13.
Therefore the total number of users , U =
A
Au
1.13
0.1
11 users .
A
Au
3.96
0.1
39 users .
A
Au
11.10
0.1
A
Au
80.9
0.1
110 users .
809 users .
Example
An urban area has a population of 2 million residents. Three competing trunked mobile networks (systems
A, B and C) provide cellular service in this area. System A has 394 cells with 19 channels each, system B
has 98 cells with 57 channels each and system C has 49 cells, each with 100 channels. Find the number of
users that can be supported at 2% blocking if each user averages 2 calls per hour at an average call duration
of 3 minutes. Assuming that all three trunked systems are operated at maximum capacity, compute the
percentage market penetrations of each cellular provider.
Solution to Example
System
A Given
Probability of blocking = 2% = 0.02.
Number of channels per cell , C = 19.
Trac intensity per user , Au = H = 2
3
60
= 0.1 Erlangs .
For GOS = 0.02 and C = 19, from the Erlang B chart, the total carried trac , A, is obtained
as 12 Erlangs .
12
Therefore, the number of users that can be supported per cell is U = AAu = 0.1
= 120.
Since there are 394 cells, the total number of subscribers that can be supported by system A is equal
to 120 394 = 47280.
System B Given
Probability of blocking = 2% = 0.02.
Number of channels per cell , C = 57.
Trac intensity per user , Au = H = 2
3
60
= 0.1 Erlangs .
For GOS = 0.02 and C = 57, from the Erlang B chart, the total carried trac , A, is obtained
as 45 Erlangs .
45
Therefore, the number of users that can be supported per cell is U = AAu = 0.1
= 450.
Since there are 98 cells, the total number of subscribers that can be supported by system A is equal
to 450 98 = 44100.
System C Given
Probability of blocking = 2% = 0.02.
Number of channels per cell , C = 100.
Trac intensity per user , Au = H = 2
3
60
= 0.1 Erlangs .
51
For GOS = 0.02 and C = 100, from the Erlang B chart, the total carried trac , A, is obtained
as 88 Erlangs .
88
Therefore, the number of users that can be supported per cell is U = AAu = 0.1
= 880.
Since there are 49 cells, the total number of subscribers that can be supported by system A is equal
to 880 49 = 43120.
Therefore, total number of cellular subscribers that can be supported by these three systems are
47280 + 44100 + 43120 = 134500 users .
For System A, the percentage market penetration is equal to
2.36 %
2.205 %
2.156 %
Example
A certain city has an area of 1300 square kilometers and is covered by a cellular system using a 7-cell
reuse pattern. Each cell has a radius of 4 kilometers and the city is allocated 40 MHz of spectrum with a
full duplex channel bandwidth of 60 kHz. Assume a GOS of 2 % for an Erlang B system is specied. If the
oered trac per user is 0.03 Erlangs, compute (a) the number of cells in the service area, (b) the number
of channels per cell, (c) trac intensity of each cell, (d) the maximum carried trac, (e) the total number
of users that can be served for 2 % GOS, (f) the number of mobiles per channel and (g) the theoretical
maximum number of users that could be served at one time in the system.
Solution to Example
(a) Given :
The coverage area = 1300 km2
Cell radius = 4 km
The area of a cell (hexagon) can be shown to be 2.5981R2 , thus each cell covers 2.5981 (4)2 =
41.57km2 .
Hence, the total number of cells is Nc = 1300/41.57 = 31 cells .
(b) The total number of channels per cell (C )
= allocated spectrum / (channel width frequency reuse factor )
= 40000000/(60000 7) = 95 channels/cell .
(c) Given : C = 95 and GOS = 0.02
From the Erlang B chart, we obtain trac intensity per cell, i.e. A = 84 Erlangs/cell .
(d) Maximum carried trac = number of cells trac intensity per cell = 31 84 = 2604 Erlangs.
= number of users
/ number of channels
= 86800/666 = 130
52
(g) The theoretical maximum number of served mobiles is the number of available channels in the system
(i.e. all channels occupied) = C Nc = 9531 = 2945 users , which is 3.4 % of the customer base .
Example
A hexagonal cell within a 4-cell system has a radius of 1.387 km. A total of 60 channels are used within
the entire system. If the load per user is 0.029 Erlangs, and = 1 call/hour, compute the following for an
Erlang C system with a GOS of 5 % :
(a) How many users per square kilometer will this system support?
(b) What is the probability that a delayed call will have to wait more than 10 seconds?
(c) What is the probability that any call will be delayed for more than 10 seconds?
Solution to Example
Cell radius , R = 1.387 km
Area covered per cell is 2.5981 (1.387)2 = 5km2
Number of cells per cluster = 4
Total number of channels = 60
Therefore, number of channels per cell = 60/4 = 15 channels .
(a) From the Erlang C chart, for 5 % probability of delay with C = 15, trac intensity = 8.8 Erlangs
.
Therefore, number of users = total trac intensity / trac per user
= 8.8 / 0.029 = 303 users and 303 users / 5 km2 = 60 users /km2 .
(b) Given = 1, holding time H = Au / = 0.029 hours = 104.4 seconds .
Probability that a delayed call will have to wait for more than 10 seconds is
= exp (158.8)10
= 0.5522 = 55.22 %.
P r[delay > t|delay] = exp (CA)t
H
104.4
(c) Given GOS = 5 % = 0.05
Probability that any call is delayed more than 10 seconds ,
P r[delay > 10] = P r[delay > 0] P r[delay > t|delay] = 0.05 0.5522 = 0.0276 = 2.76%
Trunking eciency is a measure of the number of users which can be oered a particular GOS with a
particular conguration of xed channels.
The grouping of the channels in a trunked system can substantially alter the number of users that can be
handled.
For example, if GOS = 0.01, then 10 trunked channels can support 4.46 Erlangs of trac, whereas 2
groups of 5 channels can support 2 1.36 = 2.72 Erlangs of trac.
53
The transmitter powers have to be adjusted. For new cells with radius half that of the original cell the
transmitter powers can be obtained by examining the received power at the new and old cell boundaries
Pr [at old cell boundary ] Pt1 Rn
Pr [at new cell boundary ] Pt2 (R/2)
(4.21)
n
(4.22)
Pt2 =
Pt1
2n
(4.23)
i.e. the transmit power must be reduced by 12 dB to maintain the S/I requirement.
In practice, dierent cell sizes exist, so special care is to be taken to keep the interference levels in the
system below the required value.
Radio coverage is often limited by antenna downtilting
4.7.2 Sectoring
In cell splitting the radius R is decreased and the co-channel reuse ratio D/R is kept constant.
Another approach is sectoring, where the radius of the cell is not changed, but the D/R ratio is decreased
by some method.
Capacity improvement is achieved by reducing the number of cells in a cluster without decreasing the
transmit power reduce the relative interference use of directional antennas instead of omni-directional
ones.
Increase in S/I which
54
Figure 4.9: Illustration of how 120 sectoring reduces interference from co-channel cells.
Chapter 5
55
56
Supports one User Service Identity Module (USIM) application (possibly several)
Supports one or more user proles on a USIM card
Updating of USIM information over the radio interface
Security functions
User authentication
Charging methods (optional)
Secure downloading of new applications (optional)
HSUPA
WLAN Interworking
MIMO
3GPP Release 7 and beyond
57
58
Logical Channels,
which are mapped to Transport Channels
which for one are mapped to Physical Channels
Logical channels are mapped to Transport Channels in Medium Access Control (MAC) layer which is part
of Link Control layer (L2)
Forward Access Channel (FACH), DL, mapped to BCCH, CCCH, CTCH, DCCH and DTCH
Paging Channel (PCH), DL, mapped to PCCH
Random Access Channel (RACH), UL, mapped to CCCH, DCCH and DTCH
Uplink Common Packet Channel (CPCH), UL, mapped to DCCH and DTCH
Downlink Shared Channel (DSCH), DL, mapped to DCCH and DTCH
59
60
61
Dierent QoS parameters for maximum transfer delay, delay variation and bit error rate
Oered data rate targets are
144 kbits/s (satellite and rural outdoor)
384 kbits/s (urban outdoor)
2048 kbits/s (indoor and low range outdoor)
UMTS network services
62
63
64
65
shorter Transmission Time Interval (10ms -> 2ms) enabling faster link adaptation;,
HARQ (hybrid ARQ) with incremental redundancy making retransmissions more eective.
66
OFDMA for the downlink, Single Carrier FDMA (SC-FDMA) for the uplink and employs MIMO
with up to four antennas per station,