Slides 4 Part 1
Slides 4 Part 1
• Problems:
• fixed network needed for the base stations
• handover necessary
• interference with co-channel, adjacent-channel
• Important Issues:
• Cell sizing; Frequency reuse planning
• Channel allocation strategies
• Handover
• Usually large cells are employed in remote area, coastal regions, area
with few subscribers or large areas that need to be covered withes
mall number of BSs
• Small cells are used where there are large numbers of users or in a low
transmission power region to reduce interference, or in urban areas.
S=k*N
N=i2+ij+j2
- where i and j are non-negative integers.
D = 3(i + ij + j ) R
2 2
• General Questions
• Probability that call
request is blocked?
• What capacity is
needed to achieve a
certain upper bound on
probability of blocking?
• What is the average
delay?
• What capacity is
needed to achieve a
certain average delay?
Pr[delay>t]=Pr[delay>0]Pr[delay>t|delay>0]
=Pr[delay>0]exp(-(C-A)t/H)
N = D2 / 3R2
• Due to short term fluctuations in the traffic, FCA
schemes are often not able to maintain high quality of
service and capacity attainable with static traffic
demands. One approach to address this problem is to
borrow free channels from neighboring cells.
Simple Borrowing A nominal channel set is assigned to a cell, as in the FCA case.
(SB) After all nominal channels are used, an available channel from a
neighboring cell is borrowed.
Borrow from the Channels that are candidates for borrowing are available channels
Richest (SBR) nominally assigned to one of the adjacent cells of the acceptor cell.
If more than one adjacent cell has channels available for
borrowing, a channel is borrowed from the cell with the greatest
number of channels available for borrowing.
Basic Algorithm This is an improved version of the SBR strategy which takes
(BA) channel locking into account when selecting a candidate channel
for borrowing. This scheme tried to minimize the future call
blocking probability in the cell that is most affected by the channel
borrowing.
Basic Algorithm This scheme provides for the transfer of a call from a borrowed
with Reassignment channel to a nominal channel whenever a nominal channel
(BAR) becomes available.
Borrow First Instead of trying to optimize when borrowing, this algorithm
Available (BFA) selects the first candidate channel it finds.
• In practice, not all cells are split at the same time. Therefore,
different cell sizes might exist simultaneously.
• special care needs to be taken to keep the distance between co-
channel cells at the required minimum, and hence channel
assignments become more complicated
• When cell splitting occurs, the designer should minimize
changes in the system. The value of the reuse factor, N, is
important with respect to the type of split. The following
splitting patterns can be used for various values of N:
• For N = 3, use 4:1 cell splitting.
• For N = 4, use 3:1 cell splitting.
• For N = 7, use 3:1 or 4:1 cell splitting.
• For N = 9, use 4:1 cell splitting.
• Thus, with cell splitting, where the radius of the new cell
is one-half of that of the old cell, we achieve a 12 dB
reduction in the transmit power.
Wireless and Mobile Networks 4.65
Cell Sectoring
• Cell splitting achieves capacity improvement by essentially
rescaling the system.
• By decreasing the cell radius R and keeping the co-channel
reuse ratio D/R unchanged, cell splitting increases the number
of' channels per unit area.
HO decision
HO required HO request
resource allocation
ch. activation
HO complete HO complete
clear command clear command
clear complete clear complete