A new fractional channel policy

Authors:
Hamid Beigy;M. R. Meybodi
Affiliations:
Soft Computing Laboratory, Computer Engineering Department, Amirkabir University of Technology, Tehran, Iran and Institute for Studies in Theoretical Physics and Mathematics (IPM), School of Compu ...;Soft Computing Laboratory, Computer Engineering Department, Amirkabir University of Technology, Tehran, Iran and Institute for Studies in Theoretical Physics and Mathematics (IPM), School of Compu ...
Venue:
Journal of High Speed Networks
Year:
2004

Citing 1
Cited 4

On optimal call admission control in cellular networks

Wireless Networks

A general call admission policy for next generation wireless networks

Computer Communications
An adaptive call admission algorithm for cellular networks

Computers and Electrical Engineering
Learning automata based dynamic guard channel algorithms

Computers and Electrical Engineering
Performance analysis of finite population fractional guard channel policies in mobile cellular networks

International Journal of Wireless and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dropping probability of handoff calls and blocking probability of new calls are two important QoS measures for cellular networks. Since the dropping probability of handoff calls is more important, call admission policies are used to maintain the upper bound of dropping probability of handoff calls. The fractional channel policy (FC) is a general call admission policy and includes most prioritized channel allocation schemes such as guard channel (GC) and limited fractional channel (LFC) policies. In this paper, we introduce a subclass of fractional channel policy, called uniform fractional channel policy (UFC) and study its performance. Expressions for both dropping probability of handoff calls and blocking probability of new calls are derived. Then it is shown that there is an optimal value for the parameter of UFC, which minimizes the blocking probability of new calls with the constraint on the upper bound on the dropping probability of handoff calls. An algorithm for finding the optimal parameter of UFC is also given. Conditions under which the UFC performs better than GC is derived. It is concluded that, the UFC policy performs better than GC policy under the low handoff/new traffic ratio.