DocumentCode :
1039575
Title :
Computationally efficient method to evaluate the performance of guard-channel-based call admission control in cellular networks
Author :
Yavuz, Emre Altug ; Leung, Victor C M
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC
Volume :
55
Issue :
4
fYear :
2006
fDate :
7/1/2006 12:00:00 AM
Firstpage :
1412
Lastpage :
1424
Abstract :
Many guard-channel-based call admission control (CAC) schemes for cellular networks have been proposed to provide the desired quality of service to not only new calls but also ongoing calls when they hand off to neighboring cells. Blocking/dropping probabilities of new/handoff calls are generally analyzed using one-dimensional Markov chain modeling under specific assumptions to avoid solving large sets of flow equations that makes exact analyses of these schemes using multidimensional Markov chain models infeasible. This is the case with the "traditional" approach, which assumes that channel holding times for new and handoff calls have equal mean values, and the "normalized" approach, which relaxes this assumption but is accurate only for the new call bounding CAC scheme. In this paper, we reevaluate the analytical methods for computing new/handoff call blocking/dropping probabilities for several widely known CAC schemes and develop an easy-to-implement method under more general assumptions. Numerical results show that when the mean channel holding times for new and handoff calls are different, the proposed "effective holding time" approach gives more accurate results compared with the traditional and the normalized methods while keeping the computational complexity low. The accuracy of these methods and their levels of computational complexity with the exact solution are also compared
Keywords :
Markov processes; cellular radio; computational complexity; probability; quality of service; telecommunication congestion control; wireless channels; CAC; call admission control; call blocking probability; call dropping probability; cellular networks; channel holding times; computational complexity; guard channel; handoff calls; mean channel holding; one-dimensional Markov chain; quality of service; Admission control; Call admission control; Computational complexity; Computer networks; Equations; Intelligent networks; Land mobile radio cellular systems; Multidimensional systems; Quality of service; Resource management; Call admission control (CAC); call blocking probability; cellular networks; computational complexity; performance evaluation; resource allocation;
fLanguage :
English
Journal_Title :
Vehicular Technology, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9545
Type :
jour
DOI :
10.1109/TVT.2006.877470
Filename :
1658435
Link To Document :
بازگشت