• 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 the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.3
• /
• pp.159-159
• /
• 2004

With the increasing number of subscribers in the mobile communication, the reduction of the cell size and the increment of roaming frequency have increased the cost of location management. In order to reduce the cost of location management, we propose a new strategy of location management. In this scheme, whether the terminal executes location update or not is decided both by the call arrival probability in a new LA and by the number of location updates which are unexecuted despite that the terminal moved into a new LA. The call arrival probability is computed using the predicted information about the terminal mobility pattern. We simulated to evaluate our strategy's performance. In the high mobility prediction level, this scheme reduces the cost of location update considerably. Even though it is in the low mobility prediction level, the cost does not exceed that of IS-41 at most. This scheme also showed better performance, compared with that of AS(Alternative Strategy) which requires an overhead such as predicted information maintenance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.3
• /
• pp.1-8
• /
• 2004

With the increasing number of subscribers in the mobile communication, the reduction of the cell size and the increment of roaming frequency have increased the cost of location management. In order to reduce the cost of location management, we propose a new strategy of location management. In this scheme, whether the terminal executes location update or not is decided both by the call arrival probability in a new LA and by the number of location updates which are unexecuted despite that the terminal moved into a new LA. The call arrival probability is computed using the predicted information about the terminal mobility pattern. We simulated to evaluate our strategy's performance. In the high mobility prediction level, this scheme reduces the cost of location update considerably. Even though it is in the low mobility prediction level, the cost does not exceed that of IS-41 at most. This scheme also showed better performance, compared with that of AS(Alternative Strategy) which requires an overhead such as predicted information maintenance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.7 s.337
• /
• pp.1-6
• /
• 2005

Now that the reduction of the cell size in order to serve the increasing subscribers has raised the frequency of the location update, it has increased the cost of location management. In this paper, we show that the location management strategy based on the call arrival probability(CAP) can reduce the cost of the location management by analyzing that cost in this strategy which was proposed in [1] to reduce the cost of the location management in mobile communication. And we compare the location management cost by analyzing with that by simulating.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.85-94
• /
• 2005

In this thesis, we propose a Speed Accommodation Priority Algorithm Scheme(SPAS) and Traffic Control Model Scheme (TCMS) to satisfy a desired handoff dropping probability and to reduce the blocking probability of new calls using mobility characteristics and handoff rate in mobile communication networks. The guard channels below threshold can guarantee the Quality of Service(QoS) in terms of the request handoff dropping probability and the guard channels above the threshold can be used to handle high priority new calls and high priority handoff calls. When the ratio of the handoff call arrival rate is less then the ratio of the new call arrival rate, the proposed method can guarantee the new call better than the previous guard channel scheme.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.2
• /
• pp.119-131
• /
• 2008

The paper considers the computation method in the performance evaluation of cellular network in the phase-type distribution assumptions that the channel holding times induced from mobility are modeled by well-fitted distributions to reflect an actual situation. When ww consider a phase-type distribution model instead of exponential distribution, the complexity of the computation increase exponential even though the accuracy is improved. We consider an efficient numerical algorithm to compute the performance evaluations in cellular networks such as a handoff call dropping probability, new call blocking probability, and handoff arrival rate. Numerical experiment shows that numerical analysis results are well approximated to the results of simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.12
• /
• pp.3098-3108
• /
• 1996

This paper proposed two mechanisms of fixed method and new arrival method. They are all interactive meachanisms in that a SCP and the SSPs exchange load information for overload control. These mechanisms using simple algorithm based on the standard ACG, apply differenct call gapping time on each SSP under the fairness scheme when they allocates SCP capacity to competing demends. Also in the mechanisms, priority scheme is implemented. Two mechanisms show the almost same results on the call throughput. Fairness about the probability of rejection is maintained same value on all SSPs. On Priority scheme, new arrival method has better achievement than fixed method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.12
• /
• pp.529-538
• /
• 2002

Conventional method to reduce the handoff call blocking probability(PBH) in mobile communication system is to reserve a predetermined number of channels only for handoff calls. To determine the number of reserved channels, an optimization problem, which is generally computationally heavily involved, must be solved. In this Paper, we propose a call admission control (CAC) scheme that can be used to reduce the PBH without reserving channels in advance. For this, we define a new measure, gain, which depends on the state of the system upon the arrival of a new call. The proposed CAC decision rule relies on the gain computed when a new call arrives. SRN, an extended stochastic Petri nets, provides compact modeling facilities for system analysis can be calculated performance index by appropriate reward to the model. In this Paper, we develop SRN models which can perform the CAC with gain. The SRN models are 2 level hierarchical models. The upper layer models are the structure state model representing the CAC and channel allocation methods considering QoS with multimedia traffic The lower layer model Is to compute the gain under the state of the upper layer models.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.1
• /
• pp.110-122
• /
• 1993

When voice is transmitted through packet switching network, there needs a overload control, that is, a control for the congestion which lasts short periods and occurrs in local extents. In this thesis, we analyzed the performance of the statistical packet voice multiplexer using the overload control strategy by bit dropping. We assume that the voice is coded accordng to (4,2) embedded ADPCM and that the voice packet is generated and transmitted according to the procedures in the CCITT recomendation G. 764. For the performance analysis, we must model the superposed packet arrival process to the multiplexer as exactly as possible. It is well known that interarrival times of the packets are highly correlated and for this reason MMPP is more suited for the modelling in the viewpoint of accuracy. Hence the packet arrival process in modeled as MMPP and the matrix geometric method is used for the performance analysis. Performance analysis is similar to the MMPP IG II queueing system. But the overload control makes the service time distribution G dependent on system status or queue length in the multiplexer. Through the performance analysis we derived the probability generating function for the queue length and using this we derived the mean and standard deviation of the queue length and waiting time. The numerical results are verified through the simulation and the results show that the values embedded in the departure times and that in the arbitrary times are almost the same. Results also show bit dropping reduces the mean and the variation of the queue length and those of the waiting time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2430-2437
• /
• 1999

This paper introduces an adaptive time-based location update scheme that dynamically determines when to perform location update based on moving distance of mobile station and incoming call arrival probability using fuzzy logic. Comparison with other schemes demonstrate that proposed scheme adapts well to the environment where the characteristics of mobility pattern of mobile station is changed all the time, and reveals better performance in the aspect of network signaling load.