MC 2011
MC 2011
MC 2011
=
=
i
i
i
I
S
I
S
(2.6) or ,
0
0
n
r
d
d
P P
|
|
.
|
\
|
=
( ) (2.7) ) log (10 - dBm) ( dBm
0
0
|
|
.
|
\
|
=
d
d
n P P
r
Co-channel interference and system capacity (5)
Now consider the forward link where the desired signal is the
serving BS and where the interference is due to co-channel BSs.
If D
i
is the distance of the i th interferer from the mobile, the
received power at a given mobile due to the i th interfering cell
will be proportional to (D
i
)
-n
.
The path loss exponent typically ranges between 2 and 4 in
urban cellular systems.
When the transmit power of each BS is equal and the path loss
exponent is the same throughout the coverage area.
S/I for a mobile can be approximated as
( )
(2.8)
0
1
=
i
i
n
i
n
D
R
I
S
Co-channel interference and system capacity (6)
Considering only the first layer of interfering cells.
If all the interfering BSs are equidistant from the desired
BS and if this distance is equal to the distance D between
cell centers.
Then equation (2.8) simplifies to
Eq. (2.9) relates S/I to the cluster size N which in turn
determines the overall capacity of the system from eq.
(2.2).
It should be noted that eq. (2.9) is based on the hexagonal
cell geometry where all the interfering cells are equidistant
from the BS receiver.
( )
( )
(2.9)
3
0 0
n
n
i
N
i
R
D
I
S
= =
Co-channel interference and system capacity (7)
From figure 2.11
It can be seen for a 7-cell cluster with the
mobile unit is at the cell boundary.
The mobile is a distance D-R from the two
nearest co-channel interfering cells and,
approximately D+R/2, D, D-R/2, and
D+R from the other interfering cells in the
first tier.
Using eq. (2.9) and assuming n equals 4.
The SIR for the worst case can closely
approximated as
Eq. (2.10) can be rewritten in terms of the
co-channel reuse ratio Q as
(2.10)
2 ) ( 2 ) ( 2
4 4 4
4
+ + +
=
D R D R D
R
I
S
Fig. 2.11 Illustration of the first
tier of co-channel cells for N=7
(2.11)
2 ) 1 ( 2 ) 1 ( 2
1
4 4 4
+ + +
=
Q Q Q I
S
Illustration of the first tier of co-channel cells for N=7
Co-channel interference and system capacity (8)
Example 2.2
If SIR of 15 dB is required for satisfactory forward 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-channels cells in the first tier, and all of them
are at same distance from the mobile. Use suitable approximations.
Solution
(a) n = 4
First, let us consider a 7-cell reuse pattern.
Using eq. (2.4), the co-channel reuse ratio D/R = 4.583.
Using eq. (2.9), the SIR is given by
S/I = (1/6) (4.583)
4
= 75.3 = 18.66 dB.
Since this is greater than the minimum required S/I, N =7 can be used.
Co-channel interference and system capacity (9)
(b) n = 3
First let us consider a 7-cell reuse pattern.
Using equation (2.9), the SIR is given by:
S/I = (1/6) (4.583)
3
= 16.04 = 12.05 dB.
Since this is less than the minimum required S/I, larger N
should be used.
Using eq. (2.3), the next possible value of N is 12, (i = j = 2).
The corresponding co-channel ratio is given by eq. (2.4) as
D/R = 6.0
Using eq. (2.3) the SIR is given by
S/I = (1/6) (6)
3
= 36 = 15.56 dB.
Since this is greater than minimum required S/I, N = 12 can
be used.
Adjacent Channel Interference
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.
The problem can be particularly serious if
An adjacent channel user is transmitting in very close range to a
subscribers receiver.
While the receiver attempts to receive a BS on the desired
channel.
This is referred as the near-far effect.
Alternatively the near far effect occurs when a mobile
close to a BS transmits on a channel close to one being
used by a weak mobile.
The BS may have difficulty in discriminating the desired
mobile user from the bleedover caused by the close
adjacent channel mobile.
Adjacent Channel Interference (2)
Adjacent channel interference can be minimized through careful
filtering and channel assignments.
Since each cell is given only a fraction of the available channels.
A cell need not be assigned channels which are all adjacent in
frequency.
By keeping the frequency separation between each channel in a
given cell as large as possible
The adjacent channel interference may be reduced considerably.
Thus instead of assigning channels which form a contiguous band of
frequencies within a particular cell
Channels are allocated such that the frequency separation between
channels in a given cell is maximized.
By sequentially assigning successive channels in the frequency band
to different cells
Many channels allocation schemes are able to separate adjacent
channels in a cell by as many as N channels bandwidths.
Where N is the cluster size.
Adjacent Channel Interference (3)
If the frequency reuse factor is small
The separation between adjacent channels may not be
sufficient to keep the adjacent channel interference
level within tolerable limits.
If a mobile is 20 times as close to the base station as
another mobile and energy spill out of its passband.
SIR for the weak mobile is approximately
For a path loss exponent n = 4, this is equal to -52 dB.
(2.12) ) 20 (
n
I
S
=
Adjacent Channel Interference (4)
Example
This example illustrates how channels are divided into subsets
and allocated to different cells so that adjacent channel
interference is minimized.
The US AMPS system initially operated with 666 duplex
channels.
In 1989 the FCC allocated an additional 10 MHz of spectrum for
cellular services.
This allowed 166 new channels to be added to the AMPS
system.
There are now 832 channels used in AMPS.
The forward channel (870.030 MHz) along with the
corresponding reverse channel (825.030 MHz) in numbered as
channel 1.
Similarly the forward channel 889.98 MHz along with the
reverse channel 844.98 MHz is numbered as 666.
The extended band has channels numbered as 667 through
799, and 990 through 1023.
Example (cont.)
In order to encourage competition
FCC licensed the channels to two competing
operators in every service area.
Each operator received half of the total channels.
The channels used by the two operators are
distinguished as block A and block B channels.
Block B is operated by companies which have
traditionally provided telephone services called
(wireline operators), and
Block A is operated by companies that have not
traditionally provided telephone services called
(nonwireline operators).
Example (cont.)
Out of the 416 channels used by each operator
395 are voice channels
The remaining 21 are control channels.
In block A
Channels 1 through 312 (voice channels). (312 CHs)
Channels 313 through 333 (control channels). (21 CHs)
Extended block A voice channels
Channels 667 through 716 (voice channels). (50 CHs)
Channels 991 through 1023 (voice channels). (33 CHs)
In block B
Channels 355 through 666 (voice channels). (312 CHs)
Channels 334 through 354 (control channels). (21 CHs)
Extended block B voice channels
Channels 717 through 799 (voice channels). (83 CHs)
Example (cont.)
Each of the 395 voice channels are divided into
21 subsets.
Each containing about 19 channels.
In each subset
The closet adjacent channel is 21 channels away.
In a 7-cell reuse system
Each cell uses 3 subsets of channels.
The 3 subsets are assigned such that every channel in
the cell is assured of being separated from every other
channel by at least 7 channels spacing.
AMPS Frequency Allocation
AMPS Channel Allocation for A and B Side Carriers
Power Control for Reducing Interference
In practical cellular radio and PCS the power levels
transmitted by every subscriber unit are under constant
control by the serving base stations.
This is done to ensure that each mobile transmits the
smallest power necessary to maintain a good quality link on
the reverse channel.
Power control not only helps prolong battery life for the
subscriber unit.
It also dramatically reduces the reverse channel S/I in the
system.
power control is especially important for emerging CDMA
spread spectrum systems that allow every user in every cell
to share the same radio channel.
Trunking and Grade of Service
Cellular radio systems rely on trunking to
accommodate a large number of users in a limited
radio spectrum.
The concept of trunking allows a large number of users
to share the relatively small number of channels in a
cell
By providing access to each user on demand from a pool of
available channels.
In a trunked radio system each user is allocated a channel
on a per call basis.
Upon termination of the call the previously occupied
channel is immediately returned to the pool of available
channels.
Trunking exploits the statistical behavior of users so that a
fixed number of channels or circuits may accommodate a
large, random user community.
Trunking and Grade of Service (2)
The telephone company uses trunking theory to determine
the number of telephone circuits that need to be allocated
for office buildings with hundreds of telephones.
The same principle is used in designing cellular radio systems.
There is a trade-off between the number of available
telephone circuits and the likelihood of a particular user
finding that no circuits are available during the peak calling
time.
As the number of phone lines decreases, it becomes more likely
that all circuits will be busy for a particular user.
In a trunked mobile radio system when a particular user
requests service and all of the radio channels are already in
use,
the user is blocked, or
denied access to the system.
In some systems a queue may be used to hold the requesting
users until a channel becomes available.
Trunking and Grade of Service (3)
The fundamentals of trunking theory were developed
by Erlang a Danish mathematician,
In the late 19th century he embarked on the study of how
a large population could be accommodated by a limited
number of servers.
Today, the measure of traffic intensity bears his name.
One Erlang represents the amount of traffic intensity
carried by a channel that is completely occupied.
one call-hour per hour or one call-minute per minute.
For example a radio channel that is occupied for thirty
minutes during an hour carries 0.5 Erlangs of traffic.
The grade of service (GOS) is a measure of the ability of
a user to access a trunked system during the busiest
hour.
Trunking and Grade of Service (4)
The busy hour is based upon customer demand
at the busiest hour during a week, month, or
year.
The busy hours for cellular radio systems typically
occur during rush hours, between 4 p.m. and 6 p.m.
on a Thursday or Friday evening.
It is the wireless designers job to
Estimate the maximum required capacity, and
Allocate the proper number of channels in order to
meet the GOS.
GOS is typically given as the likelihood that a call
is blocked, or the likelihood of a call experiencing
a delay greater than a certain queuing time.
Definitions of Common Terms Used in Trunking Theory
Set-up Time: The time required to allocate a trunked radio channel to
a requesting user.
Blocked Call: Call which cannot be completed at time of request, due
to congestion. Also referred to as a lost call.
Holding Time: Average duration of a typical call. Denoted by H (in
seconds).
Traffic Intensity: Measure of channel time utilization, which is the
average channel occupancy measured in Erlangs. This is a
dimensionless quantity and may be used to measure the time
utilization of single or multiple channels. Denoted by A.
Load: Traffic intensity across the entire trunked radio system,
measured in Erlangs.
Grade of Service (GOS): A measure of congestion which is specified as
the probability of a call being blocked (for Erlang B), or the probability
of a call being delayed beyond a certain amount of time (for Erlang C).
Request Rate: The average number of call requests per unit time.
Denoted by seconds1.
Trunking and Grade of Service (5)
The traffic intensity offered by each user is equal to the call request
rate multiplied by the holding time.
That is, each user generates a traffic intensity of A
u
Erlangs given by
A
u
= H (2.13)
where H is the average duration of a call and is the average
number of call requests per unit time for each user.
For a system containing U users and an unspecified number of
channels, the total offered traffic intensity A is given as
A = UA
u
(2.14)
Furthermore in a C channel trunked system, if the traffic is equally
distributed among the channels then the traffic intensity per
channel A
c
is given as
A
c
= UA
u
/ C
(2.15)
Note that the offered traffic is not necessarily the traffic which is
carried by the trunked system, only that which is offered to the
trunked system.
Trunking and Grade of Service (6)
The maximum possible carried traffic is the total number of
channels C in Erlangs.
The AMPS cellular system is designed for a GOS of 2% blocking.
This implies that the channel allocations for cell sites are designed so
that 2 out of 100 calls will be blocked due to channel occupancy during
the busiest hour.
There are two types of trunked systems which are commonly
used.
1. Blocked Calls Cleared
It offers no queuing for call requests.
it is assumed there is no setup time.
the user is given immediate access to a channel if one is available.
If no channels are available
the requesting user is blocked without access and is free to try again
later.
Blocked Calls Cleared (cont.)
Assumes that calls arrive as determined by a Poisson
distribution.
It is assumed that there are an infinite number of users as
well as the following:
a) There are memoryless arrivals of requests, implying that all
users, including blocked users, may request a channel at any
time.
b) The probability of a user occupying a channel is exponentially
distributed, so that longer calls are less likely to occur as
described by an exponential distribution.
c) There are a finite number of channels available in the trunking
pool.
This is known as an M/M/m/m queue, and leads to the
derivation of the Erlang B formula.
Blocked Calls Cleared (cont.)
The Erlang B formula determines the probability that a call is
blocked
It is a measure of the GOS for a trunked system which provides no queuing
for blocked calls.
The Erlang B formula is given by:
where C is the number of trunked channels offered by a trunked radio
system and A is the total offered traffic.
The Erlang B formula provides a conservative estimate of the
GOS, as the finite user results always predict a smaller
likelihood of blocking.
| | (3.16)
!
!
0
GOS
k
A
C
A
blocking P
C
k
k
C
r
= =
=
Blocked Calls Cleared (cont.)
The capacity of a trunked radio system where blocked calls are lost
is tabulated for various values of GOS and numbers of channels in
Table.
Capacity of an Erlang B System
Trunking and Grade of Service (7)
2. Blocked Calls Delayed
It is the second kind of trunked system.
It is one in which a queue is provided to hold calls
which are blocked.
If a channel is not available immediately
The call request may be delayed until a channel becomes
available.
Its measure of GOS is defined as
The probability that a call is blocked after waiting a specific
length of time in the queue.
To find the GOS
it is first necessary to find the likelihood that a call is
initially denied access to the system.
Blocked Calls Delayed (cont.)
The likelihood of a call not having immediate access to a
channel is determined by the Erlang C formula derived in
Appendix A
If no channels are immediately available the call is delayed
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.
The GOS of a trunked system where blocked calls are
delayed is hence given by
| | (3.17)
!
1 !
0
1
0
=
|
.
|
\
|
+
= >
C
k
k
C
C
r
k
A
C
A
C A
A
delay P
| | | | | |
| | ( ) ( ) (3.18) / exp 0
0 0
H t A C delay P
delay t delay P delay P t delay P
r
r r r
> =
> > > = >
Blocked Calls Delayed (cont.)
The average delay D for all calls in a queued system is given by
where the average delay for those calls which are queued is given by H/(C A).
The Erlang B and Erlang C formulas are plotted in graphical form
in Figures 2.12 and 2.13.
These graphs are useful for determining GOS in rapid fashion, although computer
simulations are often used to determine transient behaviors experienced by
particular users in a mobile system.
To use Figures 2.12 and 2.13, locate the number of channels on
the top portion of the graph.
Locate the traffic intensity of the system on the bottom portion of the graph.
The blocking probability Pr[blocking] is shown on the abscissa of Figure 3.6.
Pr[delay] > 0 is shown on the abscissa of Figure 3.7.
With two of the parameters specified it is easy to find the third parameter.
| | (3.19) 0
A C
H
delay P D
r
> =
Erlang B
Fig. 2.12 The Erlang B chart showing the probability of blocking as functions of the number of
channels and traffic intensity in Erlangs
Erlang C
Fig. 2.13 The Erlang C chart showing the probability of a call being delayed as a function of
the number of channels and traffic intensity in Erlangs.