• 전자공학회논문지 IE
• /
• v.45 no.3
• /
• pp.50-55
• /
• 2008

In CDMA system, the number of mobile stations which can be served simultaneously in a base station is limited by the amount of total interference received. Considering the facts, the call admission control method using the effective bandwidth concept is employed in this paper. The bandwidth for a new call and a handoff call is allocated by considering the number of mobile station being served and dynamically assigned by taking account of the blocking rate of new calls and the dropping rate of handoff calls. Also, there is reserved resource for handoff call. We analyze the performance of system according to reserved resource by a simulation study. The more a resource reserved, the less it is the dropping rate of handoff.

• Journal of Industrial Technology
• /
• v.22 no.B
• /
• pp.175-184
• /
• 2002

In this paper, we proposed separate queue scheme in each hierarchical cell for effective use of wireless channel. This method reduces the blocking rata of high speed mobile station's handoff in hierarchical cellular systems. Basically for the high speed mobile stations channels are allocated in macrocell and for the low speed mobile stations channels are allocated in microcell. In order to reduce the rate of forced handoff termination, some reservation channels are employed for the fast handoff calls in the macrocells. And the queue is located in each cell to be able to store handoff requests and takeback requests. The overflowed mobile station are able to perform takeback as soon as a corresponding channel is available.

• Journal of Advanced Navigation Technology
• /
• v.13 no.6
• /
• pp.901-906
• /
• 2009

This paper proposes a call admission control(CAC) method for wireless networks, which is based on the upper bound of a possibility distribution of handoff calls dropping rates. The possibility distribution is estimated in a fuzzy inference and a learning algorithm in neural network. The learning algorithm is considered for tuning the membership functions(then parts)of fuzzy rules for the inference. The fuzzy inference method is based on a weighted average of fuzzy sets. The proposed method can avoid estimating excessively large handoff calls dropping rates, and makes possibile self-compensation in real time for the case where the estimated values are smaller than real values. So this method makes secure CAC, thereby guaranteeing the allowed CDR. From simulation studies we show that the estimation performance for the upper bound of call dropping rate is good, and then handoff call dropping rates in CAC are able to be sustained below user's desired value.

• Journal of the Korean Mathematical Society
• /
• v.35 no.3
• /
• pp.691-712
• /
• 1998

We consider an M$_1$, M$_2$/G/1/ K retrial queueing system with a finite priority queue for type I calls and infinite retrial group for type II calls where blocked type I calls may join the retrial group. These models, for example, can be applied to cellular mobile communication system where handoff calls have higher priority than originating calls. In this paper we apply the supplementary variable method where supplementary variable is the elapsed service time of the call in service. We find the joint generating function of the numbers of calls in the priority queue and the retrial group in closed form and give some performance measures of the system.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.3
• /
• pp.1-9
• /
• 2006

The handoff in IEEE 802.11 WLAN is a hard handoff. In hard handoff, a station has to stop the communication. As a result, the station is likely to miss some packets that arrival during the handoff process. To recover these lost packets, buffer-and-forward scheme is used. But, buffer-and-forward scheme is not efficient for real time service. In this paper, we propose new handoff scheme for real time service in home network based WLAN. The scheme uses priority queue which is recommended in IEEE 802.lie, and priority of priority queue is given to real time handoff calls. The simulation results show that the proposed scheme reduces traffic loss and transmission sequence error.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1282-1289
• /
• 2000

In this paper we propose a Fractional Channel Reservation (FCS) scheme to satisfy a desired handoof dropping probability and to reduce the blocking probability of new calls using mobility characteristics and incoming handoff rate in mobile communication networks. When the ratio of the handoff call arrival rate is less then the ratio of the new call arrival rete, the proposed scheme is capable of determining the number of the guard channels which can guarantee the Quality of Service(QoS) in terms of the request handoff dropping probability and allocating dynamically the wireless channels the new calls according to the rest of the guard channels to reduce the new call blocking probability. Also we perform mathematical analysis and simulation to evaluate the performance of proposed scheme and compare to conventional guard channel scheme in terms of dropping probability blocking probability and the utilization efficiency of wireless channels.

• Journal of Advanced Navigation Technology
• /
• v.16 no.5
• /
• pp.794-800
• /
• 2012

In this paper, we propose a scheme for improving not only the utilization of frequency bands in the guard channel scheme but also the dropping rate of cognitive radio user in the wireless cognitive radio-based cellular network. The proposed scheme enables cognitive radio users to utilize the guard channel for servicing only handoff calls in normal times, but cognitive radio users must vacate the frequency channel when handoff call appearing. At this time our scheme ensures their seamless services for cognitive radio users, by predicting handoff call's appearance by MMOSPRED (Multi-Media One Step Prediction) method and then reserving the demanded channels for spectrum handoff calls. Our simulations show that our scheme performs better than other schemes; GCS(Guard Channel Scheme) and a scheme without prediction in terms of cognitive users call's dropping rate and resource utilization efficiency.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.2
• /
• pp.155-164
• /
• 2000

Recently Fiber-optic Micro-cellular Wireless Network is considered to solve frequent handoffs and local traffic unbalance in microcellular systems. In this system, central station which is connected to several microcells by optical fiber manages the channels. We propose an efficient sectorization algorithm which dynamically clusters the microcells to minimize the blocked and handoff calls and to balance the traffic loads in each cell. The problem is formulated as an integer linear programming. The objective is to minimize the blocked and handoff calls. To solve this real time sectorization problem the Tabu Search is considered. In the tabu search intensification by Swap and Delete-then-Add (DTA) moves is implemented by short-term memory embodied by two tabu lists. Diversification is considered to investigate proper microcells to change their sectors. Computational results show that the proposed algorithm is highly effective. The solution is almost near the optimal solution and the computation time of the search is considerably reduced compared to the optimal procedure.

• Journal of Advanced Navigation Technology
• /
• v.23 no.4
• /
• pp.322-327
• /
• 2019

In this paper, we propose first a scheme of grouping spectrum holes that are created in the multiple channels of primary users, and then by using the scheme we enhance quality of service (QoS) of wideband cognitive radio users in cellular cognitive radio networks. In our scheme, spectrum holes created in each primary channel are predicted by Wiener prediction process, and then the predicted spectrum holes happened in the same time are grouped into a group. The wideband cognitive radio users explore the group of spectrum holes to improve their QoS. Simulation results show that their handoff calls dropping rate and initial calls blocking rate are significantly reduced in our scheme, compared to those in the single primary channel.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.4
• /
• pp.173-182
• /
• 1997

In this paper, an efficient dynamic channel assignment scheme is suggested, which consists of two types of channel allocation strategies : ordinary channel allocation strategy and channel reallocation strategy. An analysis on the handoff probabilities of handoff and new calls is also performed, and using the analyzed handoff probability, the presented scheme is compared with other existing schemes in terms of three types of blocking probabilities- new call blocking probability, handoff call blocking probability, and network blocking probability (incomplete service probability). Simulation results show that the presented scheme significantly reduces those blocking probabilities over the existing schemes. Furthermore, the scheme has much smaller number of reallocation than other schemes.