• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.10
• /
• pp.1-8
• /
• 1997

In this paper, we propose a call admission control scheme which can be used in real environment for the traffic cibtrik if a base station if DS-CDNA cellular systems. The proposed scheme estimates the mean and variance of other cell interference by using the values used for the closed loop power control. The reerse link capacity of the base station can be calculated by using the estimated mean and variance of other cell interference. The base station admits a call only if the number of users is less than the calculated reverse link capacity. In addition, we propose a simple method to obtain the equivalent number of voice call users per one data call user in multi-rate traffic environment. The method can be applied to call admission control in multi-rate traffic environment.

• Journal of Advanced Navigation Technology
• /
• v.20 no.5
• /
• pp.440-445
• /
• 2016

There is a scheme where secondary users (SU) use predicted spectrum holes for primary users (PU) not to utilize for efficient utilization of the limited spectrum resources in cognitive radio networks. In this paper, we propose an adaptive call admission control framework that minimizes spectrum hopping call dropped probability (SHDP) for satisfying SU quality of service (QoS). The scheme is based on a call admission control (CAC), bandwidth prediction and adaptive bandwidth assignment. The prediction model predicts not only the number of spectrum holes, but requested bandwidth of SU spectrum hopping call, and then the CAC minimizes SHDP via an adaptive bandwidth assignment in resources not being enough for reservation. We bring Wiener prediction model to predict the resources. Simulations are conducted to compare the performance of proposed scheme with an existing, and show its ability of minimizing the SHDP.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2188-2195
• /
• 1999

This paper proposes a new call admission control scheme utilizing an inverse fuzzy vector quantizer(IFVQ) and neuralnet, which combines benefits of IFVQ and flexibilities of FCM(Fuzzy-C-Means) arithmetics, to decide whether a requested call not to be trained in learning phase to be connected or not. The system generates the estimated traffic pattern for the cell stream of a new call, using feasible/infeasible patterns in codebook, fuzzy membership values that represent the degree to which each pattern of codebook matches input pattern, and FCM arithmetics. The input to the NN is the vector consisted of traffic parameters which are the means and variances of the number of cells arriving in decision as to whether to accept or reject a new call depends on whether the NN is used for decision threshold(+0.5). This method is a new technique for call admission control using the membership values as traffic parameter which declared to CAC at the call set up stage, and this is valid for a very general traffic model in which the calls of a stream can belong to an unlimited number of traffic classes. Through the simulations, it is founded the performance of the suggested method outperforms compared to the conventional NN method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.12
• /
• pp.1113-1118
• /
• 2012

Smart grid and intelligent transportation system draw significant interest since they are considered as one of the green technologies. These systems require a large number of sensors, actuators, and controllers. Also, machine-to-machine (M2M) communications is important because of the automatic control. The LTE-Advanced networks is preparing a set of functions that facilitate the M2M communications, and particularly the development of an efficient call admission control mechanism is critical. A method that groups MTC devices according to QoS constraints and determines the admission depending on the QoS satisfaction is limitedly applied only if the data transmission period and the maximum delay are identical. This paper proposed a call admission control that is free from such limitation and also optimizes the admission process under the certain condition of the transmission period and maximum delay. The theorems regarding the proposed method are presented with the proofs. The simulations confirms its validity and shows it is better in call admission probability than existing works.

• Journal of Information Processing Systems
• /
• v.2 no.2
• /
• pp.107-113
• /
• 2006

It is essential to guarantee a handoff dropping probability below a predetermined threshold for wireless mobile networks. Previous studies have proposed admission control policies for integrated voice/data traffic in wireless mobile networks. However, since QoS has been considered only in terms of CDP (Call Dropping Probability), the result has been a serious CBP (Call Blocking Probability) unfairness problem between voice and data traffic. In this paper, we suggest a new admission control policy that treats integrated voice and data traffic fairly while maintaining the CDP constraint. For underprivileged data traffic, which requires more bandwidth units than voice traffic, the packet is placed in a queue when there are no available resources in the base station, instead of being immediately rejected. Furthermore, we have adapted the biased coin method concept to adjust unfairness in terms of CBP. We analyzed the system model of a cell using both a two-dimensional continuous-time Markov chain and the Gauss-Seidel method. Numerical results demonstrate that our CAC (Call Admission Control) scheme successfully achieves CBP fairness for voice and data traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6A
• /
• pp.371-378
• /
• 2003

In Code Division Multiple Access (CDMA) system, the cell capacity is defined as the number of available channels in a cell, which is limited by the interferences. When a new call is accepted at its home cell, this adds the interference to the home and its neighboring cells. This paper proposes a call admission control based on mobile transmission power prediction. The home cell has enough capacity to admit new call and if home cell would have admitted a new call, it calculates the mobile transmission power. Also, its neighboring cell can predict the amount of interference using the predicted mobile transmission power. Thus, the new mobile is accepted by its home cell if QoS(Quality Of Service) is guaranteed in its neighboring cells. The simulation result shows that the proposed scheme largely reduces the outage probability in the neighboring cells.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12B
• /
• pp.1677-1685
• /
• 2001

In this paper, we propose a call admission control scheme that can be performed within guaranteeing of required QoS(Quality of Services) in DS-CDMA(Direct Sequence-Code Division Multiple Access) reverse link. It has been performed rely on a physical channel numberonly and based on quality of received signal from MODEM(modulator/demodulator) part in established study. In other methods, the standard for services would have been set from statistical analysis of users\` location and using received power level in BTS(Base Transceiver Station). These ways bring about not only system loads but time delay or great differences from real environment. To solve these problems, we propose a call drop rate estimation algorithm for the purpose of call admission control based on measured value at LNA(Low Noise Amplifier) ports of BTS(Base Transceiver Station) in real time. This method proposed in this paper estimates a quality of offered service in real time, reduce system loads and shorten time delay which is needed to determine the standard for call admission control. But it requires a additional 17W complexity which can measure received signal power in BTS and estimate call drop rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.8
• /
• pp.1958-1969
• /
• 1996

This paper proposed a new approach to adaptive call admission control based on a neural network for multiple service classes with different quality of service (QoS) in the ATM-based Broadband Integrated Services Digital Networks. the proposed method extend Hiramatsu's neural network based "leaky pattern table" method for the single QoS[1, 2, 3] to deal with multiple services with different QoS by constructing multiple pattern tables based on each service's acceptance or rejection at the call set-up requests, and by simultaneously controlling each service's QoS according to the target QoS of the service and the trunk capacity. Computer simulation results on two service classes with different traffic characteristics and different cell loss rates as QoS, highlight good performance and effectiveness of the proposed call admission controller for multiple service classes.e classes.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.461-473
• /
• 2003

Multimedia applications are much more sensitive to QoS(Quality of Service) than text based ones due to their data continuity. In order to provide a fast moving MH(Mobil Host) using multimedia application with a consistent QoS,an efficient call admission mechanism is in need. This paper proposes the 2SCA(2-Step Call Admission) scheme based on cal admission scheme using pripority to guarantee the consistent QoS for mobile multimedia applications. A calls of MH are classified new calls, hand-off calls, and QoS upgrading calls. The 2SCA is composed of the basic call admission and advanced call admission; the former determines the call admission based on bandwidth available in each cell and the latter determines the call admission by applying DTT(Delay Tolerance Time), PQeueu(Priority Queue), and UpQueue(Upgrade Queue) algorithm according to the type of each call blocked at the basic call admission stage. In order to evaluate the performance of our mechanism, we measure the metrics such as the dropping probability of new calls, dropping probability of hand-off calls, and bandwidth utilization. The result shows that the performance of our mechanism is superior to that of existing mechanisms such as CSP(Complete Sharing Policy), GCP(Guard Channel Policy) and AGCP(Adaptive Guard Channel Policy).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.681-688
• /
• 2008

In this paper, we propose a new price-based call admission control algorithm for multi-class communication networks. When a call arrives at the network, it informs the network of the number of requested circuits and the minimum amount of time that it will require. The network provides the optimal price for the arrived call with which it tries to maximize its expected revenue. The optimal price is dynamically adjusted based on the information of the arrived call, and the present and the estimated future congestion level of the network during the reservation time of the call. If the call accepts the price, it is admitted. Otherwise, it is rejected. We compare the performance of our dynamic pricing algorithm with that of the static pricing algorithm by Courcoubetis and Reiman [1], and Paschalidis and Tsitsiklis [2]. By the comparison, we show that our dynamic pricing algorithm has better performance aspects such as higher call admission ratio and lower price than the static pricing algorithm, although these two algorithms result in almost the same revenue as shown in [2]. This implies that, in the competitive situation, the dynamic pricing algorithm can attract more users than the static pricing algorithm, generating more revenue. Moreover, we show that if a certain fixed connection fee is introduced to the price for a call, our dynamic pricing algorithm yields more revenue.