Call Blocking Probability (call + blocking_probability)

Distribution by Scientific Domains


Selected Abstracts


Evaluation of call blocking probabilities in LEO satellite networks

INTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS AND NETWORKING, Issue 2 2009
Derya Yiltas
Abstract In this paper, we present a new method for calculating call blocking probabilities (CBPs) in a low Earth orbit satellite network that carries voice calls. The calculation of the CBPs uses the Erlang-B formula, but the traffic intensity has been modified to take into the time and location in which the calls are made. Copyright © 2009 John Wiley & Sons, Ltd. [source]


Performance analysis of microcell/macrocell with reuse partitioning in TDMA-based cellular systems

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 9 2008
Jane Y. Yu
Abstract System capacity and grade of service (GoS) are both important for the rapid growth of cellular communication services. In this paper, we propose a two-tier TDMA-based cellular system with macrocell overlaid on microcell clusters by implementing fixed channel assignment (FCA) scheme and fixed reuse partitioning (FRP) scheme in microcell layer and macrocell layer, respectively, named FCA,FRP overlay scheme. Improvement can be achieved in both system capacity and GoS. Theoretical analysis based on the overlay scheme without overflow and with overflow is first presented. It shows that the simulation results are agreed with the analytical results. Then, simulation results, obtained from the overlay scheme with and without overflow, show that the performance in terms of the call blocking probability, the call dropping probability and system capacity of such a system can be greatly improved compared with a conventional one-tier cellular system deployed with FCA or FRP scheme. Copyright © 2008 John Wiley & Sons, Ltd. [source]


A distributed adaptive guard channel reservation scheme for cellular networks

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 9 2007
H.K. Pati
Abstract In this paper, a distributed adaptive guard channel reservation (DAGCR) scheme is proposed to give priority to handoff calls. This scheme is built upon the concept of guard channels and it uses an adaptive algorithm to search automatically the optimal number of guard channels to be reserved at each base station. The quality-of-service (QoS) parameters used are the new and handoff call blockings. Simulation studies are performed to compare the present algorithm with the static guard channel policy. Simulation results show that this proposed algorithm guarantees the handoff call blocking probability to remain below the targeted threshold up to a substantially high offered load with a minimal blocking to new calls up to a moderate offered load and also shows significantly high channel utilization in all offered load conditions. This scheme is examined over a wide range of offered load. Thus, it seems the proposed scheme is very useful in controlling the blocking performances in wireless cellular networks. Copyright © 2006 John Wiley & Sons, Ltd. [source]


Performance analysis of dynamic channel assignment algorithms in cellular mobile systems with hand-off

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 8 2002
L. Cong
Abstract In this paper, the traffic performance of dynamic channel assignment (DCA) in cellular mobile system with hand-off is investigated. A traffic model for cellular system incorporating hand-off is established first. Under the framework of the model, a hand-off priority scheme is developed to reduce the forced termination of calls in progress. This paper analyses and derives the traffic performance bound for DCA strategies with hand-off by extending the maximum packing (MP) scheme to include the hand-off procedure. For practical implementation, a distributed DCA algorithm (DDCA) is also proposed. A non-priority scheme and the proposed priority scheme can be combined with either MP or DDCA. It is shown that the simulation results of DDCA scheme are comparable with the analytical bounds given by MP for both the non-prioritized case and prioritized case. A reasonable trade-off between the new call blocking probability and forced termination probability can be achieved by using the proposed prioritized scheme in DCA. Copyright © 2002 John Wiley & Sons, Ltd. [source]