Abstract
In wireless mobile network, handoff dropping probability and new call blocking probability are main issues for satisfaction of quality of service (QoS) requirements. Seeking just to control handoff dropping probability and to optimize utilization without any consideration of fair allocation, serious unfairness occurs among new connections with different QoS requirements. In this paper, we propose a novel call admission control (CAC) scheme and resource management algorithm that guarantee both short-term and long-term fairness between heterogeneous services with different traffic properties and enhance resource utilization of system. These improvements are largely dependent of seeking reservation partition for each class based on stochastic control. We analyze the system model of a cell using two-dimensional Markov chain and Neut’s matrix-geometric solutions. By numerical analysis, we demonstrate that our CAC scheme actually achieves call blocking probability (CBP) fairness for wideband and narrowband calls and improve resource utilization.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Naghshineh, M., et al.: Distribued call admission control in mobile/wireless networks. IEEE JSAC 15, 1208–1225 (1996)
Luo, X.Y., et al.: A dynamic measurement-based bandwidth allocation scheme with QoS guarantee for mobile wireless networks. In: IEEE WCNC 2000 (September 2000)
Choi, S., et al.: Predictive and adaptive bandwidth reservation for handoffs in QoS-sensitive cellular networks. In: ACM SIGCOMM 1998, pp. 254–275 (1998)
Misic, J., et al.: Admission control for wireless networks with heterogeneous traffic using event based resource estimation. In: IEEE ICCCN 1997 (September 1997)
Prihandoko, F., et al.: Adaptive call admission control for QoS provisioning in multimedia wireless networks. Journal of Computer Communications, Elsevier Publisher (November 2002)
Xiao, Y., et al.: Optimal Admission Control for Multi-Class of Wireless Adaptive Multimedia Services. IEICE Transactions on Communications, Special Issue on Mobile Multimedia communications E84-B(4), 795–804 (2001)
Naghshineh, M., Acampora, A.S.: QoS Provisioning in Micro-Cellular Networks Supporting Multiple Classes of Traffic. Wireless Networks 2, 195–203 (1996)
Lee, J.Y., et al.: Realistic Cell-Oriented Adaptive Admission Control for QoS Support in Wireless Multimedia Networks. IEEE Trans. Vehicular Technology 52(3) (May 2003)
Epstein, B.M., et al.: Predictive QoS-based admission control for multiclass traffic in cellular wireless networks. IEEE JSAC 18(3), 523–534 (2000)
Wei, L.J.: The Adaptive Biased Coin Design for Sequential Experiments. Journal of Annals of Statistics 6, 92–100 (1978)
Steele, J.M.: Efron’s Conjecture on Vulnerability to Bias in A Method for Balancing Sequential Trials. Biometrika 67, 503–504
Pocock, S.J.: Clinical Trials: A Practical Approach, pp. 79–80. John Wiley & Sons Ltd., Chichester (1991)
Efron, B.: Forcing a Sequential Experiment to be balanced. Biometrika 58, 403–417
Schwartz, M.: Broadband Integrated Networks. Prentice-Hall, Englewood Cliffs (1996)
Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models. Johns Hopkins University Press, Baltimore (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Noh, S., Hwang, Y., Kim, K., Kim, S. (2004). Achieving Fair New Call CAC for Heterogeneous Services in Wireless Networks. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24768-5_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-24768-5_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22060-2
Online ISBN: 978-3-540-24768-5
eBook Packages: Springer Book Archive