A call admission control strategy for multiservice wireless cellular packet networks

A simple connection control system for multiservice cellular wireless networks is presented. Mobile stations are classified depending on the traffic they generate (e.g., voice, data). Within each class, two subclasses are also identified: stations which have originated inside the cell and stations which come from adjacent cells. The connection control mechanism is carried out by considering a number of priorities among the various classes and their subclasses. It works on two levels: static and dynamic. The static level looks at packet-level quality of service (QoS), such as cell loss and delay, while the dynamic level takes care of connection dynamics and allows the load of the system to be driven with respect to the various subclasses. Results that illustrate the performance of this control mechanism are presented.     

On call admission control in DS/CDMA cellular networks

Analytical models are proposed for various direct sequence code-division multiple-access (DS/CDMA) call admission control schemes. Many mathematical call admission models for DS/CDMA cellular networks have been proposed. However, they have shortcomings. First, by ignoring the stochastic traffic load variation or call blocking effect, they failed to sufficiently characterize the second moment of other-cell interference. This leads to inaccurate analysis of a real network. Second, the optimal control parameters were often obtained through an exhaustive search which was very time consuming. Finally, the estimation of system capacity in previous models was obtained by using a simple one-slope path-loss propagation model. However, it is well known that a two-slope path loss propagation model is needed in a line-of-sight (LOS) microcell propagation environment. We propose an analytical model for call admission to overcome these drawbacks. In addition, we combine a modified linear programming technique with the built analytical model to find better call admission control schemes for a DS/CDMA cellular network     

A novel call admission control scheme in cellular/WLAN integration and performance analysis

In order to achieve the Quality of Service (QoS) provisioning and efficient resource utilization in cellular network and Wireless Local Area Network (WLAN) integration, an Integrated Service-Based Call Admission Control (ISB-CAC) scheme is proposed in this paper. The integrated network is modeled by using multi-dimensional Markov chains. The numerical analysis is presented to evaluate the important performance measures such as the blocking probability of originating calls, the dropping probability, and the average transfer time, etc. The steady-state probabilities of the multi-dimensional Markov chains are obtained by using an iterative approach, and the CAC parameters are optimally designed. The analytical model is validated by the computer simulation. It is shown that compared with the conventional WLAN-First Call Admission Control (WF-CAC) scheme, the proposed ISB-CAC scheme not only provides better QoS for mobile users but also utilizes the bandwidth resources more efficiently.     

SIR-based call admission control for DS-CDMA cellular systems

Signal-to-interference ratio (SIR)-based call admission control (CAC) algorithms are proposed and studied in a DS-CDMA cellular system. Residual capacity is introduced as the additional number of initial calls a base station can accept such that system-wide outage probability will be guaranteed to remain below a certain level. The residual capacity at each cell is updated dynamically according to the reverse-link SIR measurements at the base station. A 2^k factorial experimental design and analysis via computer simulations is used to study the impact of the parameters used in the algorithms. The influence of these parameters on system performance, namely blocking probability and outage probability, is then examined via simulation. The performance of the algorithms is compared together with that of a fixed call admission control scheme (fixed CAC) under both homogeneous and hot spot traffic loading. The results show that SIR-based CAC always outperforms fixed CAC even under overload situations, which is not the case in FDMA/TDMA cellular systems. The primary benefit of SIR-based CAC in DS-CDMA cellular systems, however, lies in improving the system performance under hot spot traffic     

Integrated call control in a CDMA cellular system

Soft handoff is an essential component of code-division multiple-access (CDMA) digital mobile communication systems. While soft handoff has some advantages of system capacity and communication quality, it also has some disadvantages arising from the excessive use of channel resources. In this study, we propose a new control policy to alleviate effectively this excessive use of channel resources. For CDMA cellular mobile systems consisting of homogeneous cells, a variety of traffic parameters are estimated by the detailed traffic analysis, based on which a Markovian queueing model is developed to analyze the performance of the proposed call control policy. With a well-known performance objective, a mathematical problem of finding optimal call control parameters is proposed, along with its solution method     

Performance analysis of voice/data cellular CDMA with SIR-based admission control

In this paper, we analyze the performance of a signal-to-interference ratio (SIR)-based admission control strategy on the uplink in cellular code-division multiple-access (CDMA) systems with voice and data traffic. Most studies in the current literature to estimate CDMA system capacity with both voice and data traffic do not take into account admission control based on SIR constraints. Here, we present an analytical approach to evaluate the outage probability for voice traffic, the average system throughput, and the mean delay for data traffic in a voice/data CDMA system, which employs an SIR-based admission control. We make two main approximations in the voice call outage analysis-one based on the central limit theorem (CLT) and the other based on the Fenton's method. We apply the Fenton's method approximation to compute the retransmission probability and the mean delay for data traffic, and the average system throughput. We show that for a voice-only system, a capacity improvement of about 30% is achieved with the SIR-based admission control as compared with the code availability-based admission control. For a mixed voice/data system with 10 Erlangs of voice traffic, an improvement of about 40% in the mean delay for data is shown to be achieved. Also, for a mean delay of 50 ms with 10 Erlangs of voice traffic, the data Erlang capacity improves by about 50%.     

On optimal call admission control in cellular networks

Two important Quality-of-Service (QoS) measures for current cellular networks are the fractions of new and handoff “calls” that are blocked due to unavailability of “channels” (radio and/or computing resources). Based on these QoS measures, we derive optimal admission control policies for three problems: minimizing a linear objective function of the new and handoff call blocking probabilities (MINOBJ), minimizing the new call blocking probability with a hard constraint on the handoff call blocking probability (MINBLOCK) and minimizing the number of channels with hard constraints on both of the blocking probabilities (MINC). We show that the well-known Guard Channel policy is optimal for the MINOBJ problem, while a new Fractional Guard Channel policy is optimal for the MINBLOCK and MINC problems. The Guard Channel policy reserves a set of channels for handoff calls while the Fractional Guard Channel policy effectively reserves a non-integral number of guard channels for handoff calls by rejecting new calls with some probability that depends on the current channel occupancy. It is also shown that the Fractional policy results in significant savings (20-50\%) in the new call blocking probability for the MINBLOCK problem and provides some, though small, gains over the Guard Channel policy for the MINC problem. Further, we also develop computationally inexpensive algorithms for the determination of the parameters for the optimal policies. This revised version was published online in July 2006 with corrections to the Cover Date.     

Call admission control for CDMA mobile communications systems supporting multimedia services

The call admission control (CAC) belongs to the category of resource management. Since the radio spectrum is very scarce resource, CAC is one of the most important engineering issues for mobile communications. In this paper, we propose a CAC scheme for direct sequence code-division multiple-access cellular systems supporting mobile multimedia communications services. There are multiple call classes in multimedia services and the required signal-to-interference ratio (SIR) varies with call classes. Call admission decision in the proposed scheme is based on SIR measurement. We take account of the traffic asymmetry between uplink and downlink, which is the most important characteristic of multimedia traffic. In addition, the proposed scheme guarantees the priority of handoff call requests over new call requests. We evaluate the performance of the proposed scheme using Markov analysis. The performance measures which we focus on are the system throughput and the blocking probabilities of handoff calls and new calls. The outage probability of a call in progress is also calculated, which is the probability that the measured bit energy-to-noise density ratio of the call is smaller than the required value for maintaining adequate transmission quality. We present some numerical examples with practically meaningful parameter values and, as a result, show that the proposed CAC scheme can operate well in the mobile multimedia systems such as the International Mobile Telecommunications-2000 (IMT-2000) systems.     

A flexible downlink scheduling scheme in cellular packet data systems

Fast downlink scheduling algorithms play a central role in determining the overall performance of high-speed cellular data systems, characterized by high throughput and fair resource allocation among multiple users. We propose a flexible channel-dependent downlink scheduling scheme, named the (weighted) alpha-rule, based on the system utility maximization that arises from the Internet economy of long-term bandwidth sharing among elastic-service users. We show that the utility as a function of per-user mean throughput naturally derives the alpha-rule scheme and a whole set of channel-dependent instantaneous scheduling schemes following different fairness criteria. We evaluate the alpha-rule in a multiuser CDMA high data rate (HDR) system with space-time block coding (STBC) or Bell Labs layered space-time (BLAST) multiple-input multiple-output (MIMO) channel. Our evaluation shows that it works efficiently by enabling flexible tradeoff between aggregate throughput, per-user throughput, and per-user resource allocation through a single control parameter. In other words the Alpha-rule effectively fills the performance gap between existing scheduling schemes, such as max-C/I and proportional fairness (PF), and provides an important control knob at the media-access-control (MAC) layer to balance between multiuser diversity gain and location-specific per-user performance.     

Adaptive channel reservation for call admission control to support prioritized soft handoff calls in a cellular CDMA system

This paper proposes a prioritized call admission control (CAC) model to support soft handoff calls with quality of service (QoS) assurances for both the uplink and downlink connections in a CDMA system. CAC is formulated as a combinatorial optimization problem in which the problem objective is to minimize the handoff forced termination rate. The model, which is based on the adaptive channel reservation (ACR) scheme for prioritized calls, adapts to changes in handoff traffic where the associated parameters (reserved channels, and new and handoff call arrival rates) can be varied. To solve the optimization model, iteration-based Lagrangean relaxation is applied by allocating a time budget. We express our achievements in terms of the problem formulation and performance improvement. Computational experiments demonstrate that the proposed ACR scheme outperforms other approaches when there are fewer rather than more channels, and it reduces the handoff call blocking rate more efficiently when the handoff traffic is heavily loaded. Moreover, the model can be adapted to any kind of reservation service.     

A call admission control scheme for ATM networks using a simplequality estimate

The authors propose a call admission control scheme based on a method of estimating cell loss quality for individual bursty traffic sources. The estimate is expressed in terms of virtual cell loss probability, which may be defined by two traffic characteristic parameters alone: peak and mean rate. The approach is suitable for the estimation of real cell loss probability in heterogeneous and homogeneous traffic models when burst length is larger than buffer capacity. The concept of virtual cell loss probability is extended to the individual call level so as to be able to estimate the quality of service (QOS) provided to individual calls. A virtual bandwidth method is used to develop a practical call admission control system. Quality is ensured by combining a traffic clustering scheme, with a scheme for assigning individual clusters to subcapacities of a link. Priority levels are presented in terms of the class of QOS required, i.e., deterministic or statistical, and the allocation of virtual bandwidth is discussed in terms of both QOS class and traffic characteristics     

多业务CDMA蜂窝移动通信系统的功率控制

本文提出了多业务CDMA蜂窝移动通信系统的一种下行链路功率控制策略，系统的最优功率分配可以归结为求解归一化链路增益矩阵在有约束条件下的最大实特征值。在对系统的最优功率分配进行理论分析的基础上，给予了相应的仿真结果，并针对实际系统负载过重的情形，提出了按照业务优先级别逐步去除小区用户的功率控制策略。     

Optimal resource allocation and adaptive call admission control for voice/data integrated cellular networks

Resource allocation and call admission control (CAC) are key management functions in future cellular networks, in order to provide multimedia applications to mobiles users with quality of service (QoS) guarantees and efficient resource utilization. In this paper, we propose and analyze a priority based resource sharing scheme for voice/data integrated cellular networks. The unique features of the proposed scheme are that 1) the maximum resource utilization can be achieved, since all the leftover capacity after serving the high priority voice traffic can be utilized by the data traffic; 2) a Markovian model for the proposed scheme is established, which takes account of the complex interaction of voice and data traffic sharing the total resources; 3) optimal CAC parameters for both voice and data calls are determined, from the perspective of minimizing resource requirement and maximizing new call admission rate, respectively; 4) load adaption and bandwidth allocation adjustment policies are proposed for adaptive CAC to cope with traffic load variations in a wireless mobile environment. Numerical results demonstrate that the proposed CAC scheme is able to simultaneously provide satisfactory QoS to both voice and data users and maintain a relatively high resource utilization in a dynamic traffic load environment. The recent measurement-based modeling shows that the Internet data file size follows a lognormal distribution, instead of the exponential distribution used in our analysis. We use computer simulations to demonstrate that the impact of the lognormal distribution can be compensated for by conservatively applying the Markovian analysis results.     

QoS-oriented packet scheduling for wireless multimedia CDMA communications

In the third-generation (and beyond) wireless communication systems, there will be a mixture of different traffic classes, each having its own transmission rate characteristics and quality-of-service (QoS) requirements. In this paper, a QoS-oriented medium access control (MAC) protocol with fair packet loss sharing (FPLS) scheduling is proposed for wireless code-division multiple access (CDMA) communications. The QoS parameters under consideration are the transmission bit error rate (BER), packet loss, and delay requirements. The MAC protocol exploits both time-division and code-division statistical multiplexing. The BER requirements are guaranteed by properly arranging simultaneous packet transmissions and controlling there transmit power levels, whereas the packet loss and delay requirements are guaranteed by proper packet scheduling. The basic idea of FPLS is to schedule the transmission of multimedia packets in such a way that all the users have a fair share of packet loss according to their QoS requirements, which maximizes the number of the served users under the QoS constraints. Simulation results demonstrate effectiveness of the FPLS scheduler, in comparison with other previously proposed scheduling algorithms.     

A dynamic joint scheduling and call admission control scheme for IEEE 802.16 networks

We propose a dynamic joint scheduling and call admission control (CAC) scheme for service classes defined in IEEE 802.16 standard. Using priority functions, equipped with service weights and service arrival rates, the proposed scheduling scheme differentiates service classes from each other. Based on obtained priority values, we first allocate the achievable bandwidth proportionally. Within individual service classes, we then use appropriate local schedulers to transmit packets accordingly. Moreover, instead of immediate admitting or blocking a new connection request, the proposed CAC scheme computes the average transmission rate that can be allocated to that connection during a time interval. The connection is admitted if its required rate is satisfied while at the same time QoS requirements of ongoing connections are not violated. Our numerical results demonstrate the effectiveness of the proposed schemes compared to the other schemes in the literature.     

Capacity design and performance of call admission control incellular CDMA systems

Since code-division multiple-access (CDMA) capacity is interference limited, call admission control (CAC) must guarantee both a grade of service (GoS), i.e., the blocking rate, and a quality of service (QoS), i.e., the loss probability of communication quality. This paper describes the development of a new capacity design method based on these two concepts. Theoretical expressions for GoS and QoS as functions of traffic intensity and CAC thresholds are first derived from the traffic theory viewpoint, and then a design method using these expressions is presented. At that time, two strategies for CAC are assumed. One is based on the number of users, and the other is based on the interference level. Computer simulation results are presented that strongly support the proposed design method. Furthermore, numerical examples and a performance comparison of the two strategies considering various propagation parameters, nonuniform traffic distributions, and various transmission rates are shown     

蜂窝无线通信网络呼叫允许控制分析

无线网络中由于用户的移动性、频谱资源的缺乏以及信道的衰落,使无线网络的服务质量的供给成为一个日益严峻的问题。呼叫允许控制(CAC)是无线资源管理中的重要组成部分,是一种保证服务质量和网络资源利用率的重要机制。总结了CAC领域的研究成果,对蜂窝无线通信网络的CAC方案进行了分析,指出了目前CAC研究中存在的问题,并探讨了今后的研究方向。     

Optimal call admission control with QoS guarantee in a voice/data integrated cellular network

This paper addresses the issue of call admission control with the necessary quality-of-service (QoS) guarantee for an integrated service mobile cellular network. Specifically, we extend the limited fractional guarded channel (LFGC) scheme to incorporate the multiple traffic types, and derive the set of parameters that leads to the optimal call admission control. The key challenges are the state-dependent nature of the admission control, and the increasing complexity of the state space in a multi-services environment. We propose a novel control mechanism that only uses a few parameters (2-5) to characterize the optimal control planes, and use the simulated annealing technique to obtain the optimal control parameters.     

Real-time call admission control for packet-switched networking by cellular neural networks

In this paper, novel call admission control (CAC) algorithms are developed based on cellular neural networks. These algorithms can achieve high network utilization by performing CAC in real-time, which is imperative in supporting quality of service (QoS) communication over packet-switched networks. The proposed solutions are of basic significance in access technology where a subscriber population (connected to the Internet via an access module) needs to receive services. In this case, QoS can only be preserved by admitting those user configurations which will not overload the access module. The paper treats CAC as a set separation problem where the separation surface is approximated based on a training set. This casts CAC as an image processing task in which a complex admission pattern is to be recognized from a couple of initial points belonging to the training set. Since CNNs can implement any propagation models to explore complex patterns, CAC can then be carried out by a CNN. The major challenge is to find the proper template matrix which yields high network utilization. On the other hand, the proposed method is also capable of handling three-dimensional separation surfaces, as in a typical access scenario there are three traffic classes (e.g., two type of Internet access and one voice over asymmetric digital subscriber line.     

SINR threshold lower bound for SINR-based call admission control in CDMA networks with imperfect power control

Signal to interference plus noise ratio (SINR)-based call admission control schemes admit calls as long as SINR is higher than a threshold value (SINR/sub th/). Setting a relatively low SINR/sub th/ results in more users admitted into the system and this in turn yields an increased outage probability (P/sub out/). Hence, determining the lower bound of SINR/sub th/ (SINR/sub th/spl I.bar/lb/) is vital to keep P/sub out/ below a maximum value, P/sub out/spl I.bar/max/x. In this letter, we derive SINR/sub th/spl I.bar/lb/ in the reverse link of CDMA systems with imperfect power control by finding the relationship between P/sub out/ (due to power control infeasibility and SINR fluctuation) and SINR/sub th/. Then, SINR/sub th/spl I.bar/lb/ is determined as the lowest SINR/sub th/ that keeps P/sub out/ below a certain P/sub out/spl I.bar/max/.