Conte

nt 4 -Wireless System Planning

Unit-
 Link-Budget Analysis (8.8 of
T2)
 Tele-traffic Theory(8.9)
 Tele-traffic System Model (8.10)
 Steady State Analysis(8.11)

1 05/18/2025
 Objective
sTo make students understand Various aspects of wireless-system planning.


Outcome
• Describe and analyse the aspects which are necessary to characterize the
overall performance of a large wireless network

2 05/18/2025
 Wireless System
Planning
Introduction
To plan the installation and deployment of a comprehensive wireless
network, it needs to characterize the performance of the communication
system in terms of
• The transmitted power
• The total load in terms of users that can be supported by the
network.
3 05/18/2025
 • The strength of the transmitted wireless radio signal decreases as the distance of
propagation increases.
• Radio waves follow an inverse square law for power density: the power density is
proportional to the inverse square of the distance.
• Every time we double the distance, we receive only one-fourth the power.
• The signal strength at the mobile is a function of the distance d. Hence, we need
models which predict the mean signal strength at the receiver as a function of the
separation between the transmitter and the receiver. These models are also termed
4
large-scale propagation models 05/18/2025
05/18/2025
Log-Normal Shadowing
• The surrounding environment at different locations is very different in a
wireless scenario.
• Example, users can be shadowed by large objects such as walls or buildings.
• Thus, the net received signal strength is basically a random variable with the
mean predicted by the path loss.
• This random dB deviation about the mean signal strength
2
canbe modelled as a Gaussian random variable- Xσ ∼ N (0, σ )
2
where σ is variance.
• X ∼ N (m, σ2 ) This is read as X is distributed normally with mean m and
2
variance σ
• Deviation: How much variation from mean?
• Variance: Spread between numbers in data set
01/28/2022
05/18/2025
•
Xσ, the deviation about the mean is Gaussian or normally distributed.
• Xσ,in dB, is logarithmically related to the signal power.
• Hence, Log of the received signal power is Gaussian distributed, OR
• Xσ is a log normal Gaussian random variable with variance σ^2. This is termed as
log-normal shadowing.
31
•

05/18/2025
 Path loss in dB is given by
Where, L50 denotes the median-path

loss Therefore, the probability that this path loss is greater than the threshold value γ is

given as

where Q (·) denotes the Gaussian Q-

function.
05/18/2025
Example: Consider the previous example where L50 = 167 dB. Let the deviation σ of
the log-normal shadowing be given by σ = 6 dB. Compute the threshold γ such that
the path loss (PL) is greater than γ at only 5% of the locations in the cell. In other
words, at 95% of the locations the path loss is less than γ.

05/18/2025
Path loss is greater than 177 dB only 5% of the time. In other words, 95% of the time,
the path loss is lower than 177 dB.
i.e reliability is ρ = 95% = 0.95.
The required margin M dB is given as, σQ−1 (1 − ρ)
Prof. R R
Itkarkar
=6 dB × Q^−1 (0.05) = 6 dB × 1.65 ≈ 10 B01/28/2022
05/18/2025
3
4 dB
 Receiver-Noise Computation
• With Path loss in propagation there is a noise at the receiver arises due to thermal
effects and is also known as thermal noise.

• The noise Power Spectral Density (PSD) η0 denotes the noise power per hertz of
bandwidth.

Noise power = η0 × B

noise power spectral density η0 is given by, η0 = kT

F Noise power = kT BF

where k = 1.38 × 10−23 is the Boltzmann constant, T is the temperature in Kelvin,

and F is the noise figure.(Take a Numerical)
11 05/18/2025
 Link-Budget Analysis of a wireless link
Systematic listing 1)Power losses
2) Gains of different intermediate components in the transceiver chain

12 05/18/2025
link-budget expression for the SNR required is given as

SNRreq = Pt ( dB) + Gt ( dB) − L50 ( dB) − M dB + Gr ( dB) − Lc ( dB) − (N +

1) dB

From the above the required transmit power is given as

Pt ( dB) = SNRreq − Gt ( dB) + L50 ( dB) + M dB − Gr ( dB) + Lc ( dB) + (N +

1) dB

13 05/18/2025
Consider a wireless-signal-propagation scenario with cell radius d = 8 km, carrier
frequency fc = 2.1 GHz, transmit antenna height hte = 40 m, and receive antenna height
hre = 2 m. Let the standard deviation σ = 6 dB for the log-normal shadowing and it is
required to achieve a reliability of ρ = 95%. The temperature T = 293 K, bandwidth B
= 30 kHz, noise figure F = 5 dB. Further, the wireless link has a receive antenna gain of
5 dB, cabling losses of 3 dB and a transmit antenna gain of 12 dB. Consider a scenario
with level of interference equal to the noise power, and a Rayleigh fading channel
with average power unity. Through a link-budget analysis, compute the transmit power
required to achieve a bit-error rate of 10^−4 at the receiver for BPSK modulation.
Pt ( dB) = SNRreq − Gt ( dB) + L50 ( dB) + M dB − Gr ( dB) + Lc ( dB) + (N +
1) dB
14 05/18/2025
15 05/18/2025
• The median-path loss = L50 ( dB) = 167 dB.
• For a reliability of ρ = 95% = 0.95, (as seen in above
Examplethe required margin M dB = 10 dB.
• the noise power at 293 K and bandwidth 30 kHz
is 3.84 × 10^−16 = −154 dB
• Given that the interference power I is equal to that of the
noise power N,
i.e., I = N = 3.84 × 10^−16.
Hence, N + I = 2 × 3.84 ×
10^−16 (N + 1) dB
= −154 dB + 3 dB = −151 dB
16 05/18/2025
 Gt ( dB) =
12dB M dB =
10 dB Gr ( dB)
= 5 dB Lc
( dB) = 3 dB
Pt = 37 − 12 + 167 + 10 − 5 + 3 − 151 = 49 dBW (db per
watt or we can calculate dB/mW)

17 05/18/2025
05/18/2025
05/18/2025
 • Link Budget is a way of quantifying the link performance.
• The difference between the minimum received signal level and the
actual received power is called as Link Margin.
• The link margin should be a positive value should be maximized(at
least should be 10dB or more for reliable link)

20 05/18/2025
21 05/18/2025
 Teletraffic Theory
• Cellular systems employ the principle of trunking to meet the demands
of a large number of users, with a limited number of
channels.
• one-to-one or dedicated channel allocation results in wastage of
resources as the probability that all users are active at a given
instant of time is low.
• Practically, only a few channels are necessary to meet the demands of
users as they are random in nature.
• The large number of users share these limited number of channels,
which is basically statistical multiplexing, i.e., assigning the
channels to the various users based on demand
22 05/18/2025
 Schematic showing teletraffic system with 100 users and much fewer
23 channels 05/18/2025
 In a cellular
•system
Less channels in each cell are shared by a large number of subscribers the
cell. In a landline or a PSTN network
• few trunck lines at the exchange for a large number of subscriber
• customers on these lines have to share the limited number of outgoing lines
at the telephone exchange.
• Thus, since the number of users is much greater than the number of
channels available in the cell, there is always a finite probability that all
the lines are occupied.
• Hence, when a new user requests a channel for communication, his call is
blocked as there are no channels available for communication. This
probability with which calls are blocked is termed blocking
46
probability, or in cellular systems, is also termed grade of 05/18/2025
Prof. R R Itkarkar service
01/28/2022
• The blocking probability is a key parameter of a cellular communication

system.

• This can be derived using teletraffic theory and was proposed by the

Danish engineer Erlang in 1917.

• to characterize the traffic in this cellular system.

• The traffic per user A0 is defined as

• A0 = (user call rate) × (average call duration)

• IF per-user call rate of 2 calls per hour of 2-minute average duration

05/18/2025
05/18/2025
05/18/2025
 Teletraffic System Model
• In Teletraffic the random-call-arrival and and call terminations are independent
random events, modeled by the Poisson distribution.
• Let the average call-arrival rate in this system be denoted by λ.
Probability that k calls arrive in a time duration t is given as

• The Poisson distribution is a discrete distribution defined for k = 0, 1, . . , ∞.

• Consider now a cellular system with N available channels. Therefore, a
maximum of N users can be supported.
• The state of the wireless system is the number of channels occupied at a
given point of time. Therefore, the system can be in states S0 , S1, . . . , SN ,
where Si denotes the state the i channels are occupied.
• A schematic representation of the state-space transition diagram is
shown in Figure 05/18/2025
• Consider now a cellular system with N available channels.
maximum of N users can be supported
• The state of the wireless system that the number of channels
occupied at a given point of time is given by a state diagram
• Consider states S0, S1, . . . , SN ,
where Si denotes the state the i channels are occupied.
State SN

State So

05/18/2025
• In the state S0, all the channels are vacant,
• In the state SN , all the N channels are occupied.
• Any new call arrival in the state SN will, be blocked.
• Let Pk denote the probability of the system being in the state k (Sk), i.e., k of the
N channels are occupied.
• Therefore, PN denotes the probability of the system being in state N, in which any
arriving call is blocked.
• PN denotes the blocking probability of the system.

05/18/2025
 Steady State analysis
• Consider small time interval Δt.
The probability that one call arrives in time interval Δt is given
by

• Consider the average call time as T. the call departure can be modeled as a Poisson
process with departure μ = 1/T.
• Therefore, the probability of one call departure in the time Δt is given as
Pr(one call departs) = μΔt
• If k channels occupied. Hence, probability of call departure in the state k is
= kμ (Δt). 05/18/2025
1. The system is in the state Sk−1 at the time t and one call arrives in Δt.

The probability of this event is given as Prob = Pk−1 × (λΔt)

2.The system is in the state Sk+1 at the time t and one call departs in Δt.

The probability of this event is given as Prob = Pk+1 × (k + 1) (μΔt)

3. .The system is in the state k, and call neither arrives or departs.

The probability of this event is given as Prob = Pk × (1 − λΔt − (k + 1)

μΔt)

05/18/2025
Therefore, the probability Pk can be expressed as
Pk = Pk−1 × (λΔt) + Pk+1 × (k + 1) (μΔt) + Pk × (1 − λΔt − (k + 1)
μΔt)

Simplifying the above expression,

(λ + kμ) Pk = λPk−1 + (k + 1) μPk+1

As no further calls can depart from S0, the expression for P0 can be derived as
P0 = P0 (1 − λΔt) + P1μΔt & P1 = λ/ μ P0
Sim

05/18/2025
05/18/2025
05/18/2025
T =h
A =C
Traffic is fraction of erlang equal to average portion of time fro
which trunk is busy
This is occupancy..
Probability = occupancy (A) of trunk

36
• Blocking probability derived using teletraffic theory
i.e traffic per user A0

Traffic Intensity = A0 = (user call rate) × (average call duration)

Consider call rate of 2 calls per hour & 2-minute average holding time for
each.

E denotes the unit erlang of traffic. For N number of

users
Traffic Intensity = A0 *N
05/18/2025
05/18/2025
05/18/2025
Extra Learning Material

05/18/2025
Busy hour
Holding time
Traffic Intensity (Erlang)
Avg. no. of calls in progress
1 erlang = 36 ccm (hundreds of call second per hour)

Ch
A
T e1

A Traffic in erlangs
C avg. no of call arrivals in time T
h avg call holding time
41
Ex 4.1,4.2
05/18/2025
Reference : Mathematical model

Pure chance traffic

Call arrivals & terminations are independent random events

Statistical equilibrium
Traffic → Stationary random process
Probabilities do not change during the period considered

43
Probability of
call arrival

 x
-
P(x)  e
x!
x no.of call arrivals in time T
 mean no. of call arrivals in time T

44
Probability of Congestion or lost call

Grade of Service
N
A
N!
B E 1, N A   N

 Ak
k 0
k!

Probability of a lost call or Congestion

Erlang B formula or Erlang loss formula

45
 5
((2^5) / 5!) /  (2^5) / 5!
k 0

A x / x!
P( x)  N

 / k!
A k

k 0

46
05/18/2025