• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.927-934
• /
• 2002

In order to provide various multimedia services in a wireless network, the call admission control for wireless channels should be resolved at the time of call setup and handoff by moving mobile terminal. In this paper. we propose a reliable DCAC( Distributed Call Admission Control)scheme using virtual cluster concept. The proposed DCAC scheme considers the state of $1^{st}$ and $2^{nd}$ adjacent cells to provide a reliable call handling. The proposed scheme is analyzed by simulations and mathematical methods.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.21 no.4
• /
• pp.104-114
• /
• 2007

In this paper, an Ad-hoc Routing Protocol that works in wireless Ad-hoc communication networks with multiple radios and multiple channels and that controls call admission based on bandwidth measurement is proposed. Unlike the conventional Ad-hoc node with a single radio using a single channel, an Ad-hoc node of the protocol proposed, the MCQosR(Multiple Channel Quality of Service Routing), has multiple radios and uses multiple channels, which allows full duplex transmission between wireless Ad-hoc nodes, and reduces intra interference on the route. Also, a fixed channel only for reception at each node enables the estimation of the available bandwidth, which is used to control the call admission for QoS provision. The performance of the MCQosR was verified by simulation.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.15-24
• /
• 2013

Provisioning of quality of service (QoS) is a key issue in any multi-media system. However, in wireless systems, supporting QoS requirements of different traffic types is a more challenging problem due to the need to simultaneously minimize two performance metrics - the probability of dropping a handover call and the probability of blocking a new call. Since QoS requirements are not as stringent for non-real-time traffic, as opposed to real-time traffic, more calls can be accommodated by releasing some bandwidth from the already admitted non-real-time traffic calls. If the released bandwidth that is used to handle handover calls is larger than the released bandwidth that is used for new calls, then the resulting probability of dropping a handover call is smaller than the probability of blocking a new call. In this paper, we propose an efficient call admission control algorithm that relies on adaptive multi-level bandwidth-allocation scheme for non-realtime calls. The scheme allows reduction of the call dropping probability, along with an increase in the bandwidth utilization. The numerical results show that the proposed scheme is capable of attaining negligible handover call dropping probability without sacrificing bandwidth utilization.

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

This paper proposes a call admission control scheme for delay guarantee in the wireless mesh networks. The admission of a new call is determined based on the expected delay inferred from the class level available bandwidth at nodes on the path. All nodes under the effects of the new call are considered in designing the call admission control scheme to maintain the delay guarantee of the pre-existing traffic. An effective technique for estimating the available bandwidth of the neighbor nodes is proposed with no addition of message interchanges. The class-level delay control is mainly performed by the queueing discipline while keeping the MAC operation simple. Simulations are performed to show the validity of the proposals. We observe acceptable performances in delay expectation with the addition of new calls. We also show that the proposed call admission control is helpful in guaranteeing the delay performances.

• 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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.6
• /
• pp.205-212
• /
• 2003

Because a wireless ad hoc network does not have fixed infrastructure, a call admission control approach researched in a wireless network is not feasible to this network. In this paper, we propose call admission control scheme to support this problem and the burst handoff traffic due to group mobility in a wireless ad hoc network. This scheme is an adaptive guard channel scheme which adapt the number of guard channels in each MBS(mobile base station) according to the current estimate of the potential handoff call rate derived from the number of ongoing calls within the coverage area of an MBS that initiate group handoff in a wireless ad hoc network. Our simulation studies are performed for comparisons of the proposed scheme with the other channel allocation schemes. Simulation results show that the proposed scheme efficiently reduces handoff call blocking probability in wireless ad hoc networks.

• The Journal of the Korea Contents Association
• /
• v.3 no.4
• /
• pp.55-62
• /
• 2003

In this paper, a call admission contro(cac) technique is proposed to reduce the dropping probabilities of handoff calls in wireless networks while guaranteeing QoS to the users. The proposed technique is based on the estimated effective load for the target eel if a call is accepted. When the estimated effective load is higher than a predetermined threshold, a nu call is blocked and a handoff call is queued irrespective of the availability channels. The SRN, an extended Stochastic Petri Net, modes are constructed to compare the performance of the techniques. The SRN uses rewards concepts instead of the complicate numerical analysis required for the Markov chain modes. As a result, the SRN modeling techniques provide an easier way to carry out performance analysis for call admission control and channel allocation.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.4
• /
• pp.445-459
• /
• 2008

This paper addresses a call admission control(CAC) scheme giving handoff calls a priority over new calls for OFDMA wireless communication systems. The characteristics of OFDMA system and a variety of user QoS (Quality of Service) requirements are incorporated into the proposed CAC scheme which consists of several optimization modules for the system resource(subcarriers and power) allocations. The mathematical models and its solution methods for the embedded resource allocation problems are proposed. Some extensive computational experiments are conducted to illustrate the superiority of our CAC.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1685-1690
• /
• 2006

The future mobile communication system should be operated with hierarchical cellular system for providing high quality multimedia services within limited wireless resources. In this paper, we have studied a call admission control scheme applied in hierarchical CDMA cellular system nested with macro, macro, and pico cells. When the proposed call admission control algorithm was applied we got 20% more system capacity than no admission control was applied.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.28-37
• /
• 2006

State-dependent call admission control (SDCAC) is proposed to make efficient use of scarce wireless resource in a hierarchical wireless network with heterogeneous traffic. With SDCAC, new calls are accepted according to an acceptance probability taking account of not only cell dwell time but also call holding time and system state (i.e., occupied bandwidth). An analytical method is developed to calculate performance measures of interest, e.g., new call blocking probability, forced termination probability, over. all weighted blocking probability. Numerical results with not only stationary but nonstationary traffic loads are presented to show the robustness of SDCAC. It is shown that SDCAC performs much better than the other considered schemes under nonstationary traffic load.