Adaptive algorithm for Admission Control in wireless networks

Abstract

Real time multimedia applications become an important part of Internet traffic and require a guaranteed quality of services. Call Admission Control (CAC) is a key element in the provision of guaranteed (QoS) in wireless networks. An adaptive algorithm is proposed in this paper. The QoS measures studied are new call blocking probability and handotT call probability. We describe and we compare several adaptive admission control schemes in terms of performance and complexity. Also, maintaining the blocking probability below a certain value (threshold) adaptively to QoS requirements is the common purpose of the proposed CAC algorithm. The bandwidth resources allocated to handotT calls and new calls change dynamically in order to maintain the threshold of the call blocking probabilities.

Dynamic Channel Allocation Control with thresholds in Wireless Cellular Networks using Simpy

“…Recent years, various dynamic guard channel schemes are discussed [4], [10]- [13]. Normally they use thresholds to periodically monitor the Pbh, and dynamically adjust the number of guard channels.…”