BITS Pilani

Pilani Campus

RKTiwary
The Wireless Channel
Topics
 Cellular Concept
 Frequency reuse
 Channel Assignment Strategies
 Handoff Strategies
 Interference and System Capacity
 Co-channel Interference
 Adjacent Channel Interference
 Power Control for Reducing Interference
 Trunking
 Improving Capacity in Cellular Systems

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Key Definitions for Trunked Radio

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Traffic theory

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Two kind of services based on GOS

Erlang B: Based on blocking probablity

Erlang C: Based on waiting time

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

 Types of trunked system

• No queuing for call requests(B) • Queue is provided to hold calls (C)

“ Blocked Calls Cleared ” “ Blocked Calls Delayed ”

Assumption :
• calls arrive as determined by Poisson distribution
• infinite number of users
• memoryless arrivals of requests : all users can request channel at
any time
• probability of user occupying a channel is exponentially
distributed
• finite number of channels available in the trunking pool

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Blocked calls cleared

Offers no queuing for call requests

A simple analysis then shows that, with C channels available,

the call blocking probability Pr is given by the so-called
Erlang-B formula
𝐴𝐶
𝐶!
𝑃𝑟 𝑏𝑙𝑜𝑐𝑘𝑖𝑛𝑔 = 𝐴𝑘
= 𝐺𝑂𝑆
σ𝐶
𝑘=0 𝑘!
Where A is the total offered traffic and C is the number of
trunked channels

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

https://www-
ens.iro.umontreal.ca/~chanwyea/erlang/erlan
gB.html
We assume the classic M/M/c queueing model with Poisson arrival process,
exponential service time and no queueing capacity. That is, any new customer
that sees all servers busy at their time of arrival will be blocked from the
system and forced to abandon. The number of states in the system is equal
to: number of servers + 1 (empty state). With a minimum of 1 server, this
queueing system is always stable, because there is no waiting queue. All non-
blocked customers are automatically served and their waiting time is 0.

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Example

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

ERLANG B

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Example

2 million Cells/channel GOS Calls/hr Call duration

A 394/19 2% 2 3 minutes 120X 394=47280
B 98/57 450 X 98=44100
C 49/100 43120

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Example

A certain city has an area of 1300 sq km and is covered by a cellular

system using a 7-cell reuse pattern . Each cell has a radius of 4km
and the city is allocated 40Mhz of spectrum with a full duplex
channel bandwidth of 60kHz. Assume a GOS of 2% for an Erlang B
system is specified. If the offered traffic per user is 0.03 Erlangs the
a. The number of cells in the service area
b. The number of channels per cell
c. Traffic intensity of each cell
d. the maximum carried traffic
e. the total number of users that can be served for 2% GOS
f. number of mobiles per channel
g. the theoretical maximum number of users that can be served at
one time by the system?

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956
Erlang C
 Erlang C formula : if offered call cannot be assigned a channel, it is placed in a
queue which has a finite length, each call is then serviced in the order of its arrival
 Probability that an arriving call occurs when all C channels are busy and thus has
to wait is

 If no channels are immediately available the call is delayed, and the probability
that the delayed call is forced to wait more than ‘t’ secs is

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956
Example

Au= 0.029 Erlangs call rate= 1 call/ hr

R= 1.387Km, thus Area= 2.59 X 1.3872 = 5km
channels per cell= 60/4= 15
a. From the graph with C= 15, and probability = 0.05 ;
Then A= 9 Erlangs, Thus U= 9/0.029= 310 and
then number of users per sqm= 310/5= 62
𝑐−𝐴 𝑡
−
b. prob[(delay>10)/(delay>0)]= 𝑒 𝐻

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Example

𝑐−𝐴 𝑡
−
b. prob[(delay>10)/(delay>0)]= 𝑒 𝐻

C= 15, A= 9 ;
H= Au/λ= 0.029 X 3600= 104.4Seconds
15−9 10
Pr= 𝑒 − 104.4 =0.57=57 %
c. Pr[delay>10]= Pr[delay>0]Pr[(delay>10)/(delay>0)]
= 0.05 X 0.57= 2.85%

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Handoff strategies
•When a mobile moves into a different cell while a
conversation is in progress, the MSC automatically
transfers the call to a new channel belonging to the new
base station.

• This handoff operation not only involves identifying a

new base station, but also requires that the voice and
control signals be allocated to channels associated with the
new base station.
• Dwell time: the time over which a call may be maintained
without handoff

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Handoff strategies
•System designers must specify a an optimum signal level
at which to initiate handoff
• Particular signal level specified as minimum usable signal
for acceptable voice quality at the base station receiver
(range -90 dBm to -100dBm)
• A slightly stronger level is used where the handoff is
made called threshold
• This margin ∆= 𝑃𝑟 ℎ𝑎𝑛𝑑𝑜𝑓𝑓 − 𝑃𝑟 𝑚𝑖𝑛𝑖𝑚𝑢𝑚 𝑢𝑠𝑎𝑏𝑙𝑒 can not
be too large or small
 too large may burden the MSC
 or too small may not allow sufficient time

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Handoffs – the basics

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Handoff
•In the first generation analog cellular systems, Signal strength
Measurements are made by the base station to determine the
relative location of each mobile user with respect to the base
station.
•In second generation systems that use digital TDMA
technology, handoff decisions are made mobile assisted handoff
(MAHO). Every mobile station measures the received power
from surrounding base stations and continually reports the
results of these measurements to the serving base station. A
handoff is initiated when the power received from the base
station of a neighboring cell begins to exceed the power
received from the current base station by a certain level or for a
certain period of time.

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Prioritizing handoffs
• Guard channel concept
In this a fraction of total available channels in a cell is
reserved exclusively for handoff requests from ongoing
calls which may be handed off into the cell.
• Queuing of handoff requests is another method
to decrease the probability of forced termination of a call
due to lack of available channels.
 finite time interval between the time the received signal
level drops below the handoff threshold and the time the
call is terminated due to insufficient signal level
 queuing does not guarantee a zero probability of forced
termination

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Practical handoff considerations
•Using different antenna heights and different power levels it is
possible to provide large and small cells which are co-located at a
single location.
•This technique is called umbrella cell approach and is used to
provide large area coverage to high speed users while providing
small area coverage to users traveling at low speeds.
• The umbrella cell approach ensures that the number of handoffs
in minimized for high speed users and provides additional
microcell channels for pedestrian users.

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

type of Handoff (Handover)

Basically, There are two type of Handoff (Handover).

O With Reference to the Network

1. Intra-system handoff or Inter-BS handoff.

2. Intersystem handoff or Inter-MSC handoff.

O With Reference to the Link Transfer

1. Hard Handoff

2. Soft Handoff
BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956
Intra-system handoff or Inter-BS handoff.

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Intersystem handoff or Inter-MSC handoff.

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Hard handoff and soft handoff
Hard handoff: When the signal strength of a
neighboring cell exceeds that of the current cell, plus a
threshold, the mobile station is instructed to switch to a
new frequency band that is within the allocation of the
new cell.
Soft handoff: a mobile station is temporarily connected
to more than one base station simultaneously. A mobile
unit may start out assigned to a single cell. If the unit
enters a region in which the transmissions from two
base stations are comparable (within some threshold of
each other), the mobile unit enters the soft handoff state
in which it is connected to the two base stations. The
mobile unit remains in this state until one base station
clearly predominates, at which time it is assigned
exclusively to that cell.
BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956
Hard Handoff

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956
Soft Handoff

 The two BSs are briefly simultaneously

connected to the MS while crossing the cell
boundary.
 As soon as the mobile's link with the new BS
is acceptable, the initial BS disengages from
the MS.
 Simply, When the two Connections to the
Cell Phone from Different base station .
 This ensure that no break during the handoff.

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Soft Handoff

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Advantages of Soft Handoff

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Example

𝑑𝑖
𝑃𝑟,𝑖 𝑑𝑖 = 𝑃0 − 10𝑛𝑙𝑜𝑔10 ൗ𝑑 𝑑𝐵𝑚 ; 𝑖 = 1,2
0
𝑃0 = 0 dBm and 𝑑�0= 1m ; n is path loss and is 2.9, speed of the vehicle= 80km/hr
Pr,minimum = -88 dBm and minimum threshold is Pr,HO
the time needed to complete handoff when signal reaches Pr,HO is ∆𝑡 = 4.5𝑠
Then Find ∆= 𝑃𝑟,𝐻𝑂 − 𝑃𝑟,𝑚𝑖𝑛
BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956
BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956