International Journal of Networks and Communications
2012; 2(4): 47-54
doi: 10.5923/j.ijnc.20120204.02
V. Goswami , P. K. Swain
School of Computer Application KIIT University, Bhubaneswar, 751024, India
Correspondence to: V. Goswami , School of Computer Application KIIT University, Bhubaneswar, 751024, India.
| Email: | ![]() |
Copyright © 2012 Scientific & Academic Publishing. All Rights Reserved.
Mobility and radio resource management plays a major role in Quality of Service provisioning for cellular communication systems. Due to the limited radio coverage of a cell, an ongoing call while being handed off may get dropped. We develop an effective and efficient handoff scheme using mobile controlled handoff and fractional guard channel techniques, where mobile station measures the signal strength from surrounding base stations and interference level on all channels. A handoff can be initiated if the signal strength of the serving base station is lower than that of other base station by certain threshold. Two models are proposed to calculate the blocking probability of new calls and the dropping probability of handoff calls, using call admission control scheme in a cellular system. Numerical analyses of both the models are carried out to investigate the impact on performance of the parameters and comparisons with conventional channel reservation schemes.
Keywords: Quality Of Service, Fractional Guard Channel, Call Admission Control Scheme, Handoff, Cellular Networks
to another BS
is shown in Figure 1. It is assumed that the signal is averaged over time, so that rapid fluctuations due to the multipath nature of the radio environment can be eliminated. The mean signal strength of
decreases as the MS moves away from it. Similarly, the mean signal strength of
increases as the MS approaches it. MS measures the signal strengths from surrounding BSs and interference levels on all channels. A handoff can be initiated if the signal strength of the serving BS is lower than that of another BS by a certain threshold. The call is dropped if the received signal strength from the current BS falls below the receiver threshold level prior to the mobile being assigned a channel in the target cell[9]. As the number of handoffs increases, dropping probability also increases. Several handoff techniques have been proposed and implemented in various cellular networks[10-13]. ![]() | Figure 1. Signal level versus handoff point |
scheme accepts good quality signal with availability of channels exclusively for handoff calls in the adjacent cell[16]. The queuing handoff priority scheme that handles the channels reserved for handoff calls depending on the current status of the queue effectively reduces forced termination, at the expense of increased new call blocking probability[17]. It is not possible to always maintain a good signal quality when handoff takes place in a wireless mobile system. Mobile Controlled Handoff (MCHO) extends the role of the MS by giving overall control to it. It provides the opportunity to the MS for choosing good signal BS out of all received signals from surrounding BSs. MS measures the signal strengths from surrounding BSs and interference levels on all channels. A handoff can be initiated if the signal strength of the serving BS is lower than that of another BS by a certain threshold. This type of handoff has a short reaction time. In MCHO technology, MS made decision of handoff based on signal quality received and reaction time is very low. Good quality signal calls are received and served successfully while poor signal quality calls are dropped or handed over to other BSs. In this paper, we focus our attention in a generic communication network that guarantees seamless mobility to its customers. We proposed two analytical model where handoff calls handle based on its signal quality and re-handoff of low quality signal calls are taken care. A channel assignment scheme, called fractional guard channel (FGC) admits new calls with probability
when the channel occupancy is more than or equal toC. These new calls compensate free channels raised due to dropped handoff calls. In proposed model I preference is given to incoming handoff calls. The cell stops providing channels to the incoming handoff calls if all the channels are occupied. When the channel occupancy is more than or equal to threshold C , new calls are accepted with acceptance probability. Model II allocates available channels to the incoming handoff calls from general pool along with the incoming new calls on first-come, first-served (FCFS) basis. After threshold C , new calls are accepted with acceptance probability
. The poor signal quality incoming handoff calls are re-handed off to other BSs. The objective is to decrease the probability of dropping of a call due to low quality signal and make a trade-off between new and handoff calls so that all the channels efficiently used. The rest of the paper is structured as follows. Section 2 contains description and analysis of proposed Mode I and its computational aspects. Analysis of proposed Model II is given in section 3. Computational experiences with verity of numerical results in the form of graphs are discussed in section 4. Final section 5 concludes the paper.![]() | Figure 2. System model |
after C channels. If all the S channels are busy, new calls are also blocked. The analysis in[5] presumes that a handoff call always has an acceptable signal quality. In real practice, however, there may be a small probability that such calls do not have adequate signal quality. In such situations, a channel will be allocated to a handoff call, but such a call cannot be sustained by the new BS due to poor signal quality. Let
be the probability that a handoff call is of good signal and let
be the probability of receiving a poor quality handoff call that is immediately dropped for bad quality signal. The proposed model for varying signal quality (
) reduces new call blocking probability by accepting new calls with probability
when the channel occupancy is more than or equal to C . We assume that both new and handoff call attempts are generated according to a Poisson process with mean rates
and
, respectively. The effective incoming call traffic rate up to C channel is
, since any poor- signal-quality handoff call is immediately dropped. An incoming-call traffic rate from C to S channel capacity is
. After S all new call and handoff call traffic are blocked. Calls under progress in a cell are either completed or blocked. We assume the channel holding time
to have an exponential distribution with mean
. We define
as the state of the base station when j is the number of channels used in the cell. The state transition diagram for this traffic model is shown in Figure 3.Let
represent the steady state probability that the base station is in state
. Using the birth-death processes, the probability distribution
is found to be
Using normalization condition
, an expression for
is obtained as
Various performance characteristics of particular interest are the fraction of new call attempts which are blocked, completed and handoff call dropped due to unavailability of free channel. The dropping probability of handoff call is given by ![]() | (1) |
is the major indication of system traffic performance. The blocking probability of a new call is the sum of the probabilities that the state number of the base station is larger than or equal to C. Hence ![]() | (2) |
can be given as ![]() | (3) |
and
which is called cost function, and it can be expressed as![]() | (4) |
and indicates the relative importance of blocking and dropping probabilities. The cost function is an empirical measuring way of systems quality of service. The dropping probability
is more important than blocking probability
from the user’s point of view, so w must be within the interval
![]() | Figure 3. State transition diagram |
, and compute
where
and
. Then let
, and compute
This computation is more stable than the direct use of equation (1). The numerator and denominator above can become very large for large values of
and S , leading to overflow. A better recursion is the following:
Now, let
, then compute
In this case, the computation is more stable than the direct use of equation (2) and a better recursion is the following:
Let
and compute
Using recursive formula the computation of the channel utilization factor (3) is more stable. The recursion of the channel utilization factor (3) is
, where
denotes the number of poor signal quality handoff calls being handled, and
denotes the number of good signal quality ongoing calls. For more improvement of the probability of handoff dropping, we reserved a fractional amount of channels for the handoff calls to have more priority than the new calls which implies the decreasing of the probability of handoff dropping. The reservation of fractional number of channels will balance the handoff dropping probability and the new calls blocking probability. The proposed model II assumes a homogeneous cellular environment where each cell equipped with S number of channels. Out of S channels
number of channels are utilized for both handoff calls and new calls and rest of the channels use a fractional guard channel policy to accept new calls along with handoff calls that is,
channels accept new calls with probability
. Arrival of new and handoff calls are assumed to be exponentially distributed with rate
and
, respectively. A call entering to the system is either handled or leave the system due to poor signal quality with probability
. The call completion time and handoff time, are assumed to be exponentially distributed with rate
and
, respectively. The total time spent by a call is also assumed to be exponentially distributed with rate
.Since poor signal call in a cell is also random variable having exponential distribution and
. The time spent by a poor quality handoff quality handoff calls need to re-handed off quickly so it is assumed that
. The network performance will be improved due to the using of the two dimensional Markov model, that is, the new of handoff dropping decrease.Let
represent the steady state probability that the base station is in state
. For
and
, the state probabilities are given by
where
,
and
. Using the normalization equation
, the value of
can be computed as
We can compute the new call blocking probability (
) and handoff call dropping probability (
) after computing the steady-state probabilities for various states
. The blocking probability of new calls,
, can be derived as
The dropping probability of handoff call, that is, the call departs the handoff region before it can be assigned a channel is given by
The channel utilization (
) can be given as 
![]() | Figure 4. State transition diagram |
,
and
, respectively. The parameters for Figures 5 to 8 are taken as
and model I is under consideration. Figures 5 and 6 present the new call blocking probability (
)and the handoff call dropping probability (
), respectively, as a function of signal quality (
) for various values of
. It can be observed that the blocking probability increases with increase of signal quality of handoff calls for all values of
, but it is smaller in large value of
as compared to small value of
. The dropping probability seems to be insensitive of the
for
, that is, all curves go through the same point. This can be explained by the fact that, as the poor signal quality handoff call increases, such calls are dropped immediately. On dropping such calls released channels may be used for new incoming calls, thereby reducing the new call blocking probability. It is important to note that decrease in blocking probability is compensated by very little increase in dropping probability. Hence, by choosing proper value of
and
we can optimize both the new call blocking probability and the handoff call dropping probability.![]() | Figure 5. Impact of on blocking probability |
It can be seen that with the increase of channel size S both blocking and dropping probabilities decreases, as more channels are available. When the threshold C is small, the new call blocking probability is significantly more than the dropping probability, which is quite small. By increasing the value of C , the dropping probability increases, while the blocking probability decreases. The choice of C is made so as to properly trade-off between these two performance metrics.![]() | Figure 6. Impact of on dropping probability |
![]() | Figure 7. Effect of channel size on blocking probability |
![]() | Figure 8. Effect of channel size on dropping probability |
on handoff call dropping probability for various
. We choose the following set of parameters
,
,
and
. It can be observed that as
increases the dropping probability (
) increases mono-tonically. Because the new calls being accepted more in numbers as the value of
increases, which leaves few channels available for handoff calls. It is also observed that with increase of
the dropping probability decreases. As the new calls are facilitated by accepting with probability
, blocking probability decreases. Hence, by choosing the value of
appropriately a better performance result can be achieved for various signal quality handoff calls.![]() | Figure 9. Probability of dropping versus |
![]() | Figure 10. Channel size versus utilization |
,
and
. It can be seen that as channel size increases utilization decreases for all the schemes. As channel size increases more channels are available, which results in decrease in channel utilization. As expected, the proposed model II gives maximum channel utilization as compared to proposed model I and FGC scheme. Hence to utilize channels efficiently we can setup an admissible number of channels in the cell.![]() | Figure 11. Impact of α on blocking probability |
![]() | Figure 12. Impact of α on dropping probability |
on blocking and dropping probabilities for various channel allocation schemes. We choose the system parameters as
and
. Both the new call blocking and handoff call dropping probabilities jointly accounts for the user satisfaction or dissatisfaction. Since dropping an active call is usually more annoying to the user than blocking a new call. It can be seen that for all models blocking probability increases with increase of
. This is due to more acceptances of good signal quality handoff calls. For the model I and FGC scheme, dropping probability is invariant with respect to
. However, for the model II as
increases dropping probability decreases. This is due to the fact that the increased value of
implies fewer handoff calls being dropped immediately, which leaves fewer channels available for accepting new calls, thus increasing blocking probability. For the model II, the increased value of
implies fewer handoff calls being dropped or re-handed off. Furthermore, as
the dropping probability for all schemes converges to the same minimum value. It can be seen that as handoff signal quality increases the dropping probability decreases monotonically. We observed that proposed model II gives a lower dropping probability due to re-handoff of low signal quality handoff calls. When
, the dropping probability of all the models meet at a point. We can conclude that proposed model II is an efficient channel allocation mechanism, by lowering dropping as well as blocking probability.![]() | Figure 13. Impact of on cost factor |
. For each of the schemes we have chosen
, that is, more importance given to handover calls. We can note that the model II satisfies best our demands. The handoff dropping is more significant than new call blocking probability, because interruption of handoff calls upsets customers much more than blocking of new calls. As the model II utilizes the maximum resources, thus minimizes the cost function. Hence we can setup an admissible new call acceptance probability and the sufficient good signal quality in the system in order to have lower cost factor.
. A better performance results can be achieved for various signal quality handoff calls by choosing the new call acceptance probability appropriately. The analysis carried out in this paper shows that ignoring the effects of poor signal quality handoff calls leads to exasperating in performance. It is concluded that the proposed model II outperforms other proposed model I and FGC scheme.