Call admission control schemes and performance analysis in wireless mobile networks

Abstract

Abstract-Call admission control (CAC) plays a significant role in providing the desired quality of service in wireless networks. Many CAC schemes have been proposed. Analytical results for some performance metrics such as call blocking probabilities are obtained under some specific assumptions. It is observed, however, that due to the mobility, some assumptions may not be valid, which is the case when the average values of channel holding times for new calls and handoff calls are not equal. In this paper, we reexamine some of the analytical results for call blocking probabilities for some call admission control schemes under more general assumptions and provide some easier-to-compute approximate formulas.

TCP-Aware Call Admission Control in High Altitude Platforms Using Cross-Layer Design

“…The rationale behind this approach is that users tend to be much more sensitive to call dropping than to call blocking [17]. Therefore, once a user has been admitted, the system should guarantee that he will not be dropped due to lack of resources.…”

Stochastic comparisons: A methodology for the performance evaluation of fixed and mobile networks

“…We suppose as in [30,27,28], that the arrivals of voice connection follow a Poisson process with rate k v i . The distribution of the communication time for voice is assumed to be an exponential distribution with rate l v i .…”

Dynamic admission control and bandwidth reservation for IEEE 802.16e mobile WiMAX networks

“…The objective of our scheme is to simultaneously increase the admission opportunities for new coming users and guarantee QoS for handoff users. The basic idea of our adaptive BR scheme is a rational inference that generally the occurrences of new incoming connections may be much more frequent than that of handoff connections [22][23][24]. Thus, the optimal BR should take into account the arrival behavior of not only handoff connections, but also new connections in order to avoid a waste of network resource as possible.…”

“…After the admission criteria are determined, the proposed BR scheme dynamically adjusts the amount of reserved bandwidth for handoffs according to the arrival distributions of new/handoff connections to increase the connection admission opportunities and also guarantee the bandwidth requirements for handoff QoS. The basic idea of our adaptive BR scheme is a rational inference that generally the occurrences of new incoming connections may be much more frequent than that of handoff connections [21][22][23][24]. This observation originates from common BS deployment that the overlap areas of a given BS between its neighboring stations are parts of its coverage area.…”