23-Sep-19

 Interference resulting from signals which are adjacent in

frequency to the desired signal is called adjacent channel
interference.
 Adjacent channel interference results from imperfect
receiver filters which allow nearby frequencies to leak into
the passband.
 Adjacent channel interference can cause near-far effect.
 It can be reduced by keeping the frequency separation
between each channel in a given cell as large as possible.
 By sequentially assigning successive channels in the
frequency band to different cells, many channel allocation
schemes are able to separate adjacent channels in a cell by
as many as N channel bandwidths.

 Power levels transmitted by every subscriber unit are

kept under control by the serving base stations.
 This ensures that each mobile transmits the smallest
power necessary to maintain a good quality link.
 It helps to:
 prolong battery life for the subscriber unit
 reduce the reverse channel (uplink) S/I in the system.
 Power control is especially important for CDMA spread
spectrum systems that allow every user in every cell to
share the same radio channel.

1
 23-Sep-19

 Trunking is a technique to provide many users with access

to a network by sharing multiple lines or frequencies.
 In cellular communication each user is allocated a channel
on a per call basis, and upon termination of the call, the
previously occupied channel is immediately returned to the
pool of available channels.
 The grade of service (GOS) is a measure of the ability of a
user to access a trunked system during the busiest hour.
 It is a benchmark used to define the desired performance of
a particular trunked system.
 It is the wireless designer's job to estimate the maximum
required capacity and to allocate the proper number of
channels in order to meet the GOS.
 GOS is typically given as the likelihood that a call is blocked

 Erlang is a unit of measurement of traffic density

 One Erlang represents the amount of traffic intensity
carried by a channel that is completely occupied
 For example, a radio channel that is occupied for thirty
minutes during an hour carries 0.5 Erlangs of traffic.
 Similarly 60 calls in one hour, each lasting 5 minutes,
results in 5 Erlangs.
 The traffic intensity offered by each user is equal to the
call request rate (𝜆) multiplied by the holding time (H).
 Each user generates a traffic intensity of 𝐴 Erlangs
𝐴 = 𝜆𝐻
 For a system containing U users, the total offered
traffic intensity (A) is
𝐴 = 𝑈𝐴

2
 23-Sep-19

 In a C channel trunked system, if the traffic is equally

distributed among the channels, then the traffic
intensity per channel, 𝐴
𝐴 = 𝑈𝐴 /𝐶
 Note that it is not necessary that all offered traffic is
also carried by a trunked system.
 The maximum possible carried traffic is the total
number of channels, C, in Erlangs.
 Two types of trunked systems are commonly used
 No queuing for call requests, aka blocked calls cleared.
 A queue is provided to hold calls, aka blocked calls delayed

 When queuing is not available, probability of blocking

𝐴
Pr 𝑏𝑙𝑜𝑐𝑘𝑖𝑛𝑔 = 𝐶! = 𝐺𝑂𝑆
𝐴
∑
𝑘!
 It is also called Erlang-B formula, it is valid under the
assumptions,
1. arrivals are memoryless, i.e. arrival rate does not depend on
number of active users
2. infinite number of users
3. probability of a user occupying a channel is exponentially
distributed,
4. finite number of channels (C) are available
 It is possible to model trunked systems with finite users, the
resulting expressions are much more complicated and
difference is small when the users outnumber available
channels by orders of magnitude.

3
23-Sep-19

4
 23-Sep-19

 The second kind of trunked system is one in which a

queue is provided to hold calls which are blocked.
 The likelihood of a call not having immediate access to
a channel is determined by the Erlang C formula
𝐴
Pr 𝑑𝑒𝑙𝑎𝑦 > 0 =
𝐴 𝐴
𝐴 + 𝐶! 1 − 𝐶 ∑
𝑘!
𝐺𝑂𝑆 = Pr 𝑑𝑒𝑙𝑎𝑦 > 𝑡
= Pr 𝑑𝑒𝑙𝑎𝑦 > 0 Pr 𝑑𝑒𝑙𝑎𝑦 > 𝑡|𝑑𝑒𝑙𝑎𝑦 > 0
= Pr 𝑑𝑒𝑙𝑎𝑦 > 0 exp − 𝐶 − 𝐴 𝑡/𝐻
The average delay D for all calls in a queued system is
given by 𝐷 = Pr 𝑑𝑒𝑙𝑎𝑦 > 0 𝐻/(𝐶 − 𝐴)

5
 23-Sep-19

 Example 3.4: 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) 1, (b) 5, (c)
10, (d) 20, (e) 100. Assume each user generates 0.1 Erlangs
of traffic.
a) U=1, b) U≈11, U=39
 Example 3.5 : An urban area has a population of two 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 two calls
per hour at an average call duration of three minutes.
Assuming that all three trunked systems are operated at
maximum capacity, compute the percentage market
penetration of each cellular provider.