The Cellular Concept System Design Fundamentals

Table of Contents
Frequency Reuse Channel Assignment Strategies Handoff Strategies
Prioritizing Handoffs Practical Handoff Considerations

Interference and System Capacity Power Control Trunking and Grade of Service Improving Coverage and Capacity in Cellular Systems Trunking Theory
2

WITS Lab, NSYSU.

Frequency Reuse

Cellular System Design Considerations

To solve problems of spectral congestion and user capacity. Replacing a single, high power transmitter with many low power transmitters. Neighboring base stations are assigned different groups of channels so that the interference between base stations is minimized. Available Channels are distributed throughput the geographic region and may be reused as many times as necessary. With fixed number of channels to support an arbitrarily large number of subscribers.

WITS Lab, NSYSU.

Concepts of Frequency Reuse

WITS Lab, NSYSU.

Cellular Networks and Frequency Reuse One important characteristic of cellular networks is the reuse of frequencies in different cells. By reuse frequencies, a high capacity can be achieved. However, the reuse distance has to be high enough, so that the interference caused by subscribers using the same frequency (or an adjacent frequency) in another cells is sufficiently low. To guarantee an appropriate speech quality, the carrier-to-interference-power-ratio (CIR) has to exceed a certain threshold CIRmin which is 9 dB for the GSM system.
6

WITS Lab, NSYSU.

Hexagons
Hexagonal cell shape has been universally adopted. The actual radio coverage of a cell is known as the footprint and is determined from field measurements or propagation prediction models. Base stations can be placed at:
The cell center center-excited cells omni-directional antennas. The cell vertices edge-excited cells sectored directional antennas.

WITS Lab, NSYSU.

Analysis Model of Channel Reuse

S: # of duplex channels available for use k: # of channels assigned for a cell N:# of cells sharing S channels Cluster Size

S = kN
C: Total # of duplex channels with freq. reuse M: # of Replica of cluster

C = MkN = MS
8

WITS Lab, NSYSU.

Reuse Factor
Due to the fact that the hexagonal geometry has exactly six equidistant neighbors and that the lines joining the centers of any cell and each of its neighbors are separated by multiples of 60 degrees, there are only certain cluster sizes and cell layouts which are possible.

Reuse Factor = i2+ij+j2; i,j are non-negative integers.

9

WITS Lab, NSYSU.

Co-channel Neighbor Cells

Move i cells along any chain of hexagons. Turn 60o counter-clockwise and move j cells. For example:
N=19: i =3, j =2; N=12: i =2, j =2; N=7; i =2, j =1;

10

WITS Lab, NSYSU.

Channel Assignment Strategies

Channel Assignment Strategies

Fixed Channel Allocation Dynamic Channel Allocation Hybrid Channel Allocation Borrowed Channel Allocation

12

WITS Lab, NSYSU.

Fixed Channel Assignment

Each cell is allocated a predetermined set of voice channels. Any call attempt within the cell can only be served by the unused channels in that particular cell. Probability of blocking is high.

13

WITS Lab, NSYSU.

Dynamic Channel Assignment Strategy

Channels are not allocated to different cells permanently. Each time a call request is made, the serving base station requests a channel from the MSC. The MSC allocates a channel to the requested cell following an algorithm that takes into account the likelihood of future blocking within the cell, the frequency of use of the candidate channel, the reuse distance of the channel, and other cost functions. MSC only allocates a given frequency if that frequency is not presently in use in the cell or any other cell which falls within the minimum restricted distance of frequency reuse to avoid co-channel interference.
14

WITS Lab, NSYSU.

Dynamic Channel Assignment Strategy MSC has to collect real-time data on channel occupancy, traffic distribution, and radio signal strength indications (RSSI) of all channels on a continuous basis. Reduce the likelihood of blocking at the expense of increasing the storage and computational load.

15

WITS Lab, NSYSU.

Borrowing Strategy
Modified from fixed channel assignment strategies. A cell is allowed to borrow channels from a neighboring cell if all of its own channels are already occupied. The MSC supervises such borrowing procedures and ensures that the borrowing of a channel does not disrupt or interfere with any of the calls in progress in the donor cell.
16

WITS Lab, NSYSU.

Handoff Strategies

Handoff / Handover
In a cellular network, the process to transfer the ownership of a MS from a BS to another BS. Handoff not only involves identifying a new BS, but also requires that the notice and control signals be allocated to channels associated with the new base station. Usually, priority of handoff requests is higher than call initiation requests when allocating unused channels. Handoffs must be performed successfully and as infrequently as possible and be imperceptible to the uses.

18

WITS Lab, NSYSU.

Handoff / Handover
Handover Occasions
Bad signal quality on current channel
noise or interference

Traffic overload in current cell

load balancing

Handover Indicator: The parameters to monitor to determine HO occasion

RSSI, in ensemble average sense. Bit Error Rate (BER)/Packet Error Rate (PER), more accurate.

19

WITS Lab, NSYSU.

Handoff / Handover
Need to specify an optimum signal level to initiate a handoff. Minimum useable signal for acceptable voice quality at the base station receiver is normally taken as between -90 dBm to -100 dBm.

= Prhandoff Prminimum useable

If is too large, unnecessary handoffs may occur. If is too small, there may be insufficient time to complete a handoff.
20

WITS Lab, NSYSU.

Illustration of a handoff scenario at cell boundary

21

WITS Lab, NSYSU.

Illustration of a Handoff Scenario at Cell Boundary Figure (a) demonstrates the case where a handoff is not made and the signal drops below the minimum acceptable level to keep the channel active. The dropped call event in figure (a) can happen when there is an excessive delay by the MSC in assigning a handoff or when the threshold is set too small for the handoff time the system. Excessive delays may occur during high traffic conditions due to computational loading at the MSC or due to the fact that no channels are available on any of the nearby base stations.
22

WITS Lab, NSYSU.

Handoff / Handover
During handoff, it is important to ensure that the drop in the measured signal level is not due to momentary fading and that the mobile is actually moving away from the serving base station. The base station monitors the signal level for a certain period of time before a hand-off is initiated. The time over which a call may be maintained within a cell, without hand-off, is called the dwell time.

23

WITS Lab, NSYSU.

Handoff in 1st Generation Cellular Systems Signal strength measurements are made by the base stations and supervised by the MSC. Base station monitor the relative location of each user. Locator receiver is used to determine signal strengths of users in neighboring cells and is controlled by the MSC. Based on the information from locator receiver, MSC decides if a handoff is necessary or not.

24

WITS Lab, NSYSU.

Handoff in 2nd Generation TDMA Systems Handoff decisions are mobile assisted. In mobile assisted handoff (MAHO), every mobile measures the received power from surrounding base stations and reports the results to the serving base station. MAHO enables the call to be handed over at a much faster rate.

25

WITS Lab, NSYSU.

Handoff or Handover
Mobile Assistant Handover more efficient.
GSM:
MS monitors all BSs MS reports the measurements to the BS MSC makes decision

USDC (IS-54/136):
BSs monitor all MSs. When a MS is leaving the cell, the BS sends it a measurement order The MS begins its measurement and reports MSC makes the Handover decision.

26

WITS Lab, NSYSU.

Handover Algorithms (IS-95 vs. WCDMA)

Basic IS-95 handover algorithm uses absolute threshold algorithm. WCDMA handover algorithm users relative threshold algorithm.

27

WITS Lab, NSYSU.

Absolute Threshold Handover

Eb/No

Th_Add Th_Drop

(1) Neighbor Set

(2) (3) Active Set

(4) (5) (6) Neighbor Set

Time

Candidate Set

28

WITS Lab, NSYSU.

Basic IS-95 HO Algorithm

1. 2. 3. 4. 5. 6.

Pilot strength exceed T_Add. MS sends a Pilot Strength Measurement Message and transfers pilot to the Candidate Set. BS sends a Handover Direction Message. Mobile station transfers pilot to the Active Set and sends a Hanover Completion Message. Pilot strength drops below T_Drop. MS starts the handover drop timer. Handover drop timer expires. MS sends a Pilot Strength Measurement Message. BS sends a Handover Direction Message. MS moves pilot from the Active Set to the Neighbor Set and sends a Handover Completion Message.

29

WITS Lab, NSYSU.

Problems with Absolute Threshold Algorithm

Some locations in the cell receive only weak pilots (requiring a lower handover threshold). Some locations in the cell receive a few strong an dominant pilots (requiring a higher handover threshold).

30

WITS Lab, NSYSU.

Relative Threshold HO
Ec/Io MS_Ec/Io Window_Add AS_Th
AS_Th_Hyst AS_Th_Hyst

Strongest Pilot in Active Set

Window_Drop

Time T_Add MS
31

T_Drop AS MS WITS Lab, NSYSU.

Active vs. Monitored Set

Active Set (AS): User information is sent from all these cells and they are simultaneously demodulated and coherently combined. Monitored Set (MS): Cells, which are not included in the active set, but are monitored according to a neighboring list assigned by the UTRAN.

32

WITS Lab, NSYSU.

Soft Handover Algorithm (for Active Set limit = 2)

T
Ec/No CPICH 1

AS_Th + AS_Th_Hyst

AS_Th

-AS_Th_Hyst

AS_Rep_Hyst

CPICH 2

CPICH 3

Time

Cell 1 Connected

Event A Add Cell 2

Event C Remove Cell 3 Event B Replace Cell 1 with Cell 3

33

WITS Lab, NSYSU.

Intersystem Handoff
Intersystem handoff happens when a mobile moves from one cellular system to a different cellular system. The MSCs involved in the two cellular systems are different. Compatibility between the two MSCs must be determined.

34

WITS Lab, NSYSU.

Prioritizing Handover
Guard Channel Concept : Use reserved guard channel for handover.
Disadvantage: Reducing the total carrier traffic.

Queuing of Handover Requests: To prevent forced termination by queuing the request.

Queuing of handoffs is possible due to the fact that there is a 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.

35

WITS Lab, NSYSU.

Practical Handover Consideration

Problem 1: Simultaneous traffic of high speed and low speed mobiles.
Small cell high speed mobile frequent handoff large cell Reduce capacity

Solution: Umbrella Cell - Cell Split or Hierarchical Cell Structure

By using different antenna heights and different power levels, it is possible to provide large and small cells which are colocated at a single location. Small cell for low speed mobile Large cell for high speed mobile Need Strength Detection and Handoff control.
36

WITS Lab, NSYSU.

The Umbrella Cell Approach

37

WITS Lab, NSYSU.

Practical Handover Consideration

Problem 2: Cell Dragging
Caused by pedestrian users that provide a very strong signal to the base station. Often occurs in an urban environment when there is a line-ofsight (LOS) radio path between the subscriber and the base station. As the user travels away from the base station at a very low speed, the average signal strength does not decay rapidly and the received signal at the BS may be above the handoff threshold, thus a handoff may not be made. Creates a potential interference and traffic management problem.

Solution: Careful arrangement of handoff threshold and radio coverage parameters.

38

WITS Lab, NSYSU.

Handoff Control Parameters

= Prhandoff Prminimum useable

6~12 dB (AMPS) 0~6 dB (GSM) Typical time to make a handoff once the signal level is blow the handoff threshold : 10 sec (AMPS) 1~2 sec (GSM) The faster handoff process supports a much greater range of options for handling high speed and low speed users and provides the MSC with substantial time to rescue a call that is in need of handoff.
39

WITS Lab, NSYSU.

Handoff Miscellaneous
Intra-frequency Handoff: handoffs in the same system and carrier. Inter-frequency Handoff: handoffs between same systems and different carriers.
May be used for handoff between different cell layers of the multi-layered cellular network, when the cell layers use different carrier frequencies.

Inter-system Handoffs: handoffs between different systems. Inter-frequency and inter-system handoffs may be used for coverage or load balancing reasons.
40

WITS Lab, NSYSU.

Frequency Utilization with WCDMA

Operator band 15 MHz

Power

Another UMTS operator

4.2-5.0 MHz

4.2-5.0 MHz

Another UMTS operator

5.0-5.4 MHz

3 cell layers

5.0-5.4 MHz

Uplink: Downlink:

1920-1980 MHz 2110-2170 MHz

41

Frequency

WITS Lab, NSYSU.

Intra-Frequency Handoff
Hard Handoff: assign different radio channels during a handoff. Soft Handoff: the ability to select between the instantaneous received signals from a variety of base stations.
Soft handoff exploits macroscopic space diversity provided by the different physical locations of the base stations.

Softer Handover: A mobile station is in the overlapping cell coverage area of two adjacent sectors of a base station.
42

WITS Lab, NSYSU.

Interference and System Capacity

Interference
The major source limiting cellular system capacity comes from interferences (as oppose to noise). Interference has been recognized as a major bottleneck in increasing capacity and is often responsible for dropped calls. Major Types of Interference:
Co-Channel Interference Adjacent Channel Interference
Intra-Cell Type Inter-Cell Type

44

WITS Lab, NSYSU.

Co-channel Cells and Interference

In a given coverage area, there are several cells that use the same set of frequencies. These cells are called co-channel cells. The interference between signals from co-channel cells is called co-channel interference. Unlike thermal noise which can be overcome by increasing the signal-to-noise ratio (SNR), co-channel interference cant be overcome by simply increasing the carrier power because an increase in carrier power increases the interference to neighboring co-channel cells. To reduce co-channel interference, co-channel cells must be physically separated by a minimum distance.
45

WITS Lab, NSYSU.

Hexagon
3 R 2

r =
R
r= 3 R 2

r R

Cell Area =

(r R) 3 3 2 6 = R = 2 3r 2 2 2
46

WITS Lab, NSYSU.

Hexagon
A cell centered at (u,v)

(u , v) = (2ri,2rj ) 3 x = u cos(30 ) = u 2 u o y = u sin(30 ) + v = + v 2

o

i=3

47

WITS Lab, NSYSU.

Hexagon Distance
Distance between (ua, va) and (ub, vb)
2 Dab = ( xa xb ) 2 + ( ya yb ) 2 2 3 ua ub 3 = ua ub + + va vb 2 2 2 2 2

= ( ua ub ) + ( va vb ) + ( ua ub ) ( va vb )
2 2

= (2r ) 2 (ia ib ) 2 + ( ja jb ) 2 + (ia ib )( ja jb )

For special case (distance from origin)

D = 2r i 2 + j 2 + ij
48

WITS Lab, NSYSU.

Hexagonal Cluster
Hexagonal Cluster
Each cluster is surrounded by six similar clusters with the same orientation Each cluster has a total area equivalent to what can be called a super-hexagon
view a cluster as a hexagon

D = 2r i 2 + j 2 + ij
49

WITS Lab, NSYSU.

Super-Hexagon Concept
D=Frequency Reuse Distance D

R' = N= R

D 2 ASuper Hexagon ACell 3r 2 2 3R '2

( = (2

) )

= i2 + j 2 + i j = Cluster Size
50

WITS Lab, NSYSU.

Co-Channel Reuse Ratio

The signal to co-channel interference ratio is independent of the transmitted power and becomes a function of the radius of the cell (R) and the distance between centers of the nearest cochannel cells (D). Co-channel Reuse Ratio Q : The spatial separation between cochannel cells relative to the coverage distance of a cell.
D = 2 r i2 + j2 + i j = 2 r N = R 3N
D Q = = 3N R
51

3 r= R 2

WITS Lab, NSYSU.

CO-Channel Reuse Ratio

Small Q Large Q

Small N Large N

Large Capacity Small Level of Co-Channel Interference

52

WITS Lab, NSYSU.

Co-Channel Signal to Interference Ratio (SIR)

SIR: Signal to Interference Ratio. Consider only first tier interference. Assuming all interfering BSs are equal-distance. n d S S Pr = P0 = i0 d I 0 R 3N Ii
i =1

Worst Case SIR=

(Mobile)

Pt R n Pdi n t
i =1 i0

( 3N )n Rn = n i0 D i0

Example: i0=6, n=4 N=3 SIR=11.3 dB N=7 SIR=18.7 dB

53

WITS Lab, NSYSU.

7-Cell Co-channel Signal to Interference Ratio

An approximation of the exact geometry.

54

WITS Lab, NSYSU.

7-Cell Co-Channel Signal to Interference Ratio An Approximation

S Rn = I 2( D R ) n + 2( D + R) n + 2 D n

S 1 = I 2( Q 1)4 + 2( Q +1)4 + 2Q4

55

WITS Lab, NSYSU.

Adjacent Channel Interference

Adjacent channel interference results from imperfect receiver filters which allow nearby frequencies to leak into the passband. Adjacent channel interference can be minimized through careful filtering and channel assignments. Channels are allocated such that the frequency separation between channels in a given cell is maximized.

56

WITS Lab, NSYSU.

Near-Far Effect
A nearby transmitter (which may or may not be of the same type as that used by the cellular system) captures the receiver of the subscriber. Alternatively, the near-far effect occurs when a mobile close to a base station transmits on a channel close to one being used by a weak mobile. The base station may have difficulty in discriminating the desired mobile user from the close adjacent channel mobile.

57

WITS Lab, NSYSU.

Power Control

Power Control for 2G Cellular Systems Power levels transmitted by subscriber unit are under control by the serving base stations. Power control is 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, but also dramatically reduces the reverse channel S/I in the system.

59

WITS Lab, NSYSU.

Power Control in 3G (WCDMA)

Tight and fast power control is perhaps the most important aspect in WCDMA in particular on the uplink. Without it, a single overpowered mobile could block a whole cell. Near-Far problem of CDMA: A MS close to the base station may be overpowered and block a large part of the cell. Power control in WCDMA:
Open-loop power control Close-loop power control
Inner-loop power control Outer-loop power control
60

WITS Lab, NSYSU.

Open Loop Power Control in WCDMA

Attempt to make a rough estimation of path loss by measuring downlink beacon signal. Disadvantage: Far too inaccurate, because fast fading is essentially uncorrelated between uplink and downlink, due to the large frequency separation of uplink and downlink band of the WCDMA FDD mode. Open-loop power control is used in WCDMA to provide a coarse initial power setting of the MS at the beginning of a connection.

61

WITS Lab, NSYSU.

Outer Loop Power Control in WCDMA

To adjusts the target SIR setpoint in the BS according to the individual radio link quality requirements, usually defined as BER or FER. The required SIR for FER depends on the mobile speed, multipath profile, and data rate. Should the transmission quality is decreasing, the Radio Network Controller (RNC) will command the Node B to increase the target SIR. Outer loop power control is implemented in RNC because there might be soft handover combining.

62

WITS Lab, NSYSU.

Inner-loop Power Control in WCDMA Uplink

Base station performs frequent estimates of the received Signal-to-Interference Ratio (SIR) and compares it to a target SIR.
If the measured SIR is higher than the target SIR, the base station will command the MS to lower the power. If SIR is too low, it will command the MS to increase its power.

The power control is operated at a rate of 1500 times per second.

63

WITS Lab, NSYSU.

Inner-loop Power Control in WCDMA Downlink

Adopt same techniques as those used in uplink. Operate at a rate of 1500 times per second. There is no near-far problem in downlink. Purposes for downlink closed-loop power are:
Provide a marginal amount of additional power to MS at the cell edge as they suffer from increased other-cell interference. Enhancing weak signals caused by Rayleigh fading at low speeds when other error-correcting methods (interleaving and error correcting codes) doesnt work effectively.
64

WITS Lab, NSYSU.

Trunking and Grade of Service

Trunking System
Trunking system: A mechanism to allow many user to share fewer number of channels.
Not every user calls at the same time.

Penalty: Blocking Effect.

If traffic is too heavy, call is blocked!! Small blocking probability is desired.

There is a trade-off between the number of available circuits and blocking probability.

66

WITS Lab, NSYSU.

Grade of Service (GOS)

Erlang: The amount of traffic intensity carried by a channel that is completely occupied. For example, a radio channel that is occupied for 30 minutes during an hour carries 0.5 Erlangs of traffic. Grade of Service (GOS) is a measure of the ability of a user to access a trunked system during the busiest hour. 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.

67

WITS Lab, NSYSU.

Definitions of Terms Used in Trunking Theory Set-up Time: The time required to allocate a radio channel to a user. Blocked Call: Call which cant be completed at time of request, due to congestion. Holding Time: Average duration of a typical call. Denoted by H (in second). 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.
68

WITS Lab, NSYSU.

Definitions of Terms Used in Trunking Theory 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 (Erlang B), or the probability of a call being delayed beyond a certain amount of time (Erlang C). Request Rate: The average number of call requests per unit time. Denoted by second-1.

69

WITS Lab, NSYSU.

Computation of GOS
Au=H
Au : each user generate a traffic intensity of Au Erlang : average number of call request per unit time for each user. H : average duration of a call. A: Total offered traffic intensity. U: Total users in a system. C : # of channels in a truncking system Ac: channel intensity per channel
70

A=UAu

Ac=UAu/C

WITS Lab, NSYSU.

Computation of GOS
There are two types of trunked systems:
No queueing for call requests:
for every user who requests service, it is assumed there is no setup time and 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. Called blocked calls cleared. GOS: Erlang B formula determines the probability that a call is blocked.

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. Called blocked calls delayed. GOS: Erlang C formula gives the likelihood that a call is initially denied access to the system.
71

WITS Lab, NSYSU.

Trunked Systems with no Queuing for Call Requests blocked calls cleared. Blocking Probability -- Erlang B Formula:
AC Pr[blocking] = C C! k = GOS A k =0 k!

AMPS cellular system is designed for a GOS of 2% blocking.

There are infinite number of users. Call requests are memoryless; both new and blocked users may request a channel at any time. Service time of a user is exponentially distributed Traffic requests are described by Poisson model. Inter-arrival times of call requests are independent and exponentially distributed.
72

WITS Lab, NSYSU.

Trunked Systems with Queuing for Call Requests Blocked Calls Delayed Erlang C Formula the likelihood of a call is initially denied to access a channel:

Pr[ delay > 0 ] =

AC A C 1 A k C A + C! 1 C k =0 k!

Pr[delay > t ] = Pr[delay > 0] Pr[delay > t | delay > 0] = Pr[delay > 0] exp( (C A)t H )

73

WITS Lab, NSYSU.

Trunked Systems with Queuing for Call Requests Blocked Calls Delayed The average delay D for all calls in a queued system is given by:

H D = Pr[delay > 0] CA
The average delay for those calls which are queued is given by:

H CA
74

WITS Lab, NSYSU.

Erlang B Chart

75

WITS Lab, NSYSU.

Erlang C Chart

76

WITS Lab, NSYSU.

Trunking Efficiency
Trunking Efficiency is a measure of the number of users which can be offered a particular GOS with a particular configuration of fixed channels. The way in which channels are grouped can substantially alter the number of users handled by a trunked system. From Table 3.4, for GOS=0.01
10 trunked channels can support 4.46 Erlangs. Two 5 trunked channels can support 2x1.36=2.72 Erlang. 10 trunked channels support 64% more traffic than two 5 channel trunks do.
77

WITS Lab, NSYSU.

Improving Capacity in Cellular Systems

System Expansion Techniques

Adding New Channels Frequency borrowing Cell Splitting Sectoring / Sectorization Change of Cell Pattern Coverage zone

79

WITS Lab, NSYSU.

Cell Splitting
Cell splitting is the process of subdividing a congested cell into smaller cells, each with its own base station and a corresponding reduction in antenna height and transmitter power. Cell splitting increases the capacity of a cellular system since it increases the number of times that channels are reused.

80

WITS Lab, NSYSU.

Cell Splitting
Cell splitting small cells (microcells)
Same service area

More cells in the service area, more capacity.

81

WITS Lab, NSYSU.

Cell Splitting
Cell Splitting (Hot Spot)

82

WITS Lab, NSYSU.

Transmit Power for Split cell

The transmit power of the split cell must be reduced. For example, if new cell radius is half of that of old cell and the path loss exponent n = 4:
Pr [at old cell boundary] Pt1 R n
Pr [at new cell boundary] Pt 2 ( R 2) n

Pr [at new cell boundary] = Pr [at old cell boundary]

Pt1 Pt 2 = 16
83

WITS Lab, NSYSU.

Sectoring
The technique for decreasing co-channel interference and thus increasing system capacity by using directional antennas is called sectoring. The factor by which the co-channel interference is reduced depends on the amount of sectoring used. # of antenna , # of handover , trunking efficiency

84

WITS Lab, NSYSU.

Sectoring

85

WITS Lab, NSYSU.

Sectoring

86

WITS Lab, NSYSU.

Chang of cell Pattern

N=7, CT/7 channels per cell high SIR

87

N=3, CT/3 channels per cell low SIR ( by-product) WITS Lab, NSYSU.

A Novel Microcell Zone Concept

88

WITS Lab, NSYSU.

A Novel Microcell Zone Concept

Any channel may be assigned to any zone. When a mobile travels from one zone to another, there is no handover. A given channel is active only in a particular zone. Thus interference is reduced and capacity is increased. Without the degradation in trunking efficiency.

89

WITS Lab, NSYSU.

Summaries of Improving Capacity in Cellular Systems While cell splitting increases the number of base stations in order to increase capacity, sectoring and zone microcells rely on base station antenna placements to improve capacity by reducing co-channel interference. Cell splitting and zone microcell techniques do not suffer the trunking inefficiencies experienced by sectored cells, and enable the base station to oversee all handoff chores related to the microcells, thus reducing the computational load at the MSC.

90

WITS Lab, NSYSU.

Trunking Theory

Introduction
There are two major classes of trunked radio systems:
Lost Call Cleared (LCC) Lost Call Delayed (LCD)

Lost Call Cleared system

Queueing is not provided for call requests. When a user requests service, the user is given immediate access to a channel if one is available. If no new channels are available, the call is blocked without access to the system. The user is free to try the call again later. Calls are assumed to arrive with a Poisson distribution. The time between successive calls is exponentially distributed. The Erlang B formula describes the grade of service (GOS) as the probability that an user will experience a blocked call.
92

WITS Lab, NSYSU.

Introduction
Assumed that there are infinite number of users. Assume that all blocked calls are instantly returned to an infinite user pool, and may be retried at any time in the future.

Lost Call Delayed system:

Queues are used to hold call requests that are initially blocked. When a channel is not immediately available, the call request may be delayed until a channel becomes available. The Erlang C formula gives the likelihood that all channels are in use. It is also necessary to know the probability of how long the cal must be delayed before a channel is available. The GOS is measured by the probability that calls will have delayed greater than t seconds. Assume that all calls in the queue are eventually serviced.
93

WITS Lab, NSYSU.

Erlang B Formula

Basic Assumptions
Call requests are memoryless, implying that all users, including blocked users, may request a channel at any time. The probability of a user occupying a channel (call the service time) is exponentially distributed. Traffic requests are described by a Poisson distribution which implies exponentially distributed call inter-arrival times. Inter-arrival times of call requests are independent of each other. There infinite number of users and there are finite number of channels available in the trunked pool.
95

WITS Lab, NSYSU.

Derivation of Erlang B
Consider a system with C channels and U users. Let be the total mean call arrival rate per unit time for the entire trunked system (average number of call requests per unit time over all channels and all users). Let H be the average call holding time (average call duration). If A is the offered load for the trunked system, A=H. The probability that a call requested by a user will be blocked is given by: Pr[Blocking]=Pr[None of the C channels are free] Calls arrive according to the Poisson distribution: e n Pr {a ( t + ) a ( t ) = n} = ) for n = 0, 1, 2... ( n!
96

WITS Lab, NSYSU.

Derivation of Erlang B
a(t) is the number of call requests (arrivals) that have occurred since t = 0. The Poisson process implies that the time of the nth call arrival and the interarrival times between successive call requests are mutually independent. The interarrival times between call requests are exponentially distributed and mutually independent, and the probability that the interarrival time will be less than some time s is given by Pr(ns)=1-e-s, s0 where n is the interarrival time of the nth arrival and n=tn+1-tn, where tn is the time at which the nth call request arrived. The probability density function forn is: p ( n ) = e n , n 0.
97

WITS Lab, NSYSU.

Derivation of Erlang B
For every t 0 and0
Pr {a ( t + ) a ( t ) = 0} = 1 + O ( ) Pr {a ( t + ) a ( t ) = 1} = + O ( ) Pr {a ( t + ) a ( t ) 2} = O ( )

(A)

where O() is the probability of more than one call request arriving over the time interval and is a function of such that O ( ) lim =0 0 The probability of n arrivals in seconds is given by: e n Pr {a ( t + ) a ( t ) = n} = ( ) n!
98

WITS Lab, NSYSU.

Derivation of Erlang B
The user service time is the duration of a particular call that has successfully accessed the trunked system. Service times are assumed to be exponentially distributed with mean call duration H, where =1/H is the mean service rate. The probability density function of the service time is
p ( sn ) = e sn where sn is the service time of the nth call. This trunking system is called an M/M/C/C queueing system. The first M denotes a memoryless Poisson process for call arrivals, the 2nd M denotes an exponentially distributed service time, the first C denotes the number of channels available, and the last C indicates a hard limit on the number of simultaneous users that are served.
99

WITS Lab, NSYSU.

Derivation of Erlang B
Consider a discrete time stochastic process {Xn|n=0, 1, 2,} that takes values from the set of nonnegative integers, so that the possible states of the process are i=0,1, 2, . The process is said to be a Markov chain if its transition from the present state i to the next i+1 depends solely on the state i and not on previous states. At time k, the number of calls (occupied channels) Nk in the system may be represented as Nk = N(k), where N is a discrete random process representing the number of occupied channels. The transition probability Pi,j, which describes the probability of channel occupancies over a small observation interval, is given by Pi , j = Pr { N k +1 = j | N k = i}
100

WITS Lab, NSYSU.

Derivation of Erlang B
Using Equation (A) and letting 0, we obtain: Poo = 1 + O ( )
Pii = 1 + O ( ) i 1 Pi ,i +1 = + O ( ) i 0 Pi ,i 1 = + O ( ) i 1 Pi , j = O ( ) j i, j i + 1, j i 1

101

WITS Lab, NSYSU.

Derivation of Erlang B
At steady state, we have the Global Balance Equation:

Pn 1 = n Pn , n C As a result, we have: Pn 1 = Pn n

P0 P= 1

1 1 P2 = P = P0 1 2 2
n n C

P
n =0

=1
C i

1 1 Pn = P0 P0 = Pn n ! = 1 Pi = 1 P0 i =1 i =1 i ! n! 1 P0 = n C 1 n! n =0
102

WITS Lab, NSYSU.

Derivation of Erlang B
The probability of blocking for C trunked channels is:

1 C C! 1 = n Pc = P0 C! C 1 n! n=0
The total offered traffic is A=H=/. The Erlang B formula which gives the probability of blocking can be obtained by:

1 Pc = C C ! n 1 A n! n =0 AC
103

WITS Lab, NSYSU.

Erlang C Formula

Derivation of Erlang C
Assumption: if an offered call cant be assigned a channel, it is placed in a queue which has an infinite length. The Erlang C formula is derived by assuming that the trunked system is a M/M/C/D queue, where C denotes the maximum number of simultaneous users and D is the maximum number of calls that may be held in the queue for service.

105

WITS Lab, NSYSU.

Derivation of Erlang C
From the state diagram:
1 Pk 1 = k Pk for k C Pk = Pk 1 for k C k 1 Pk 1 = C Pk for k C Pk = Pk 1 for k C C k 1 P0 k ! Pk = k 1 1 C ! C k C P0 k C k C

106

WITS Lab, NSYSU.

Derivation of Erlang C
Since Pk =1, we have:
k =0 C +1 1 1 + .... = 1 P0 1 + + ...... + ( C +1) C C ! C

C 1 k 1 1 k 1 P0 1 + + k C = 1 k =1 k ! k =c C ! C 1 P0 = k C C 1 1 1 1 k ! + k ! k =1 1 C
107

WITS Lab, NSYSU.

Derivation of Erlang C
Pr [C channels are busy ] = Pk
k =C

1 1 k C P0 k =C C ! C
C

1 = P0 C !

k =C

k C

1 C k C

1 1 = P0 C ! 1 C

<1 C

108

WITS Lab, NSYSU.

Derivation of Erlang C
1 C! 1 Pr [C channels are busy ] = 1 k C C C 1 1 1 k ! + k ! k =0
C

Substituting for P0

1 1 C

k C 1 C 1 + C !1 k ! C k =0

109

WITS Lab, NSYSU.

Derivation of Erlang C
With A=/=H, the Erlang C formula is given by:
Pr [C channels are busy ] = AC
k A C 1 A AC + C !1 C k =0 k !

110

WITS Lab, NSYSU.