• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.211-217
• /
• 2015

A dynamic spectrum access scheme with channel partitioning for secondary handover calls in cognitive radio networks is proposed to reduce forced termination probability due to spectrum handover failure. A continuous-time Markov chain method for evaluating its performance such as blocking probability, forced termination probability, and throughput is presented. Numerical and simulation results are provided to demonstrate the effectiveness of the proposed scheme with channel partitioning.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1333-1343
• /
• 2016

Spectrum sharing in centrally controlled cognitive radio (CR) networks has been widely studied, however, research on channel access for distributively controlled individual cognitive users has not been fully characterized. This paper conducts an analysis of random channel access of cognitive users controlled in a distributed manner in a CR network. Based on the proposed estimation method, each cognitive user can estimate the current channel condition by using its own Markov-chain model and can compute its own blocking probability, collision probability, and forced termination probability. Using the proposed scheme, CR with distributed control (CR-DC), CR devices can make self-controlled decisions based on the status estimations to adaptively control its system parameters to communicate better.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.145-150
• /
• 2010

In this paper, the performance of cognitive radio network is analyzed in terms of Erlang capacity. To improve the Erlang capacity with respect to primary user (PU) and secondary user (SU) traffic, we propose an efficient radio resource management scheme utilizing the buffer for new SUs and interrupted SUs. Markov model is developed, and analyzed to derive the performances of the proposed spectrum sharing scheme in both primary system and secondary system. To determine the Erlang capacity region, the blocking probability, the forced termination probability and the non-completion probability are calculated. Simulation results provide insight into the advantages of the buffer utilization. It is observed that the supportable traffic loads of PU and SU can be increased significantly according to the buffer length.

• Journal of the Korea Society for Simulation
• /
• v.11 no.1
• /
• pp.45-58
• /
• 2002

In the wireless communication systems of the next generation, the hard handover may frequent]y occur between the existing 2G(2nd generation) and the 3(1(3rd generation). When it occurs between the 2G and the 3G, the call setup procedure will be added to MT(Mobile Terminal), the relay bases in 2G and 3G, and the switches. It causes total time to handle the hangover to increase. Therefore, the forced termination probability may be increased since relative time decreases. In this paper, we propose a method to decrease the forced termination. The method execute the handover procedure with speed and direction of the MT preestimated in the inner cell when MT enters the boundary cell.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.4
• /
• pp.100-106
• /
• 2006

We analyze a voice/data integrated traffic model of the cellular mobile communication system with hybrid guard channels for voice and handoff calls. In a multi-service integrated wireless environment, quality of service guarantee is crucial for smooth transportation of real time information. Real time voice traffic requires a guaranteed upper bounded on both delay and packet error rate, whereas data traffic does not. Voice traffic has high transmission priority over data packets. Thus one of the important problems is the design of admission control schemes which can efficiently accommodate the differential quality of service requirements. In this paper, a hybrid guard channel scheme is considered in which arriving calls are assigned channels as long as the number of busy channels in the cell is below a predetermined first threshold. When the number of busy channels reaches the first threshold, new originating data calls are queued in the infinite data buffer. Then reaches second threshold, only handoff calls are assigned the remaining channels and new originating voice calls are blocked. We evaluate the system by a two-dimensional Markov chain approach and generating function method and obtain performance measures included blocking probability and forced termination probability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5A
• /
• pp.294-304
• /
• 2003

For an efficient software download in cellular CDMA systems, session admission control based on area (SACA) is presented. In the SACA scheme, the base station only allows mobile terminal to start session when the mobile locates near the base station of a cell. A mobile that is located near cell center can request software download session, but the mobile that is far away from the center can request session only after arriving near the cell center. Session duration time follows exponential and Pareto distribution. Performance is analyzed in terms of handoff rate, mean channel holding time, session blocking probability and handoff forced termination probability. As analysis results, handoff rate between cells in the proposed scheme is reduced to 30 ~ 250 % compared to conventional scheme, according to traffic characteristics such as terminal speed, session duration time and the size of the allowable zone area in a cell for the start of the session. And new session blocking probability slightly decreases to 5 ~ 20 %, but handoff session forced termination probability drastically decreases to 35 ~ 220 %.

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

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.833-836
• /
• 1999

In this paper, the communication performance and its characteristics of the polar Low Earth Orbit(LEO) mobile satellite have been described in terms of the generalized performance parameters via geometric modeling and analysis. Especially, the general formula related to the parameters such as the number of orbits(M) and the number of satellites per orbit(N) were derived in the LEO satellite system for voice service, and then we applied the general result to IRIDIUM system(M＝6, N＝11) that would be scheduled to commercialize soon. The offered traffic of Inter Satellite Link(ISL), ISL link blocking probability as well as both new call blocking probability and the probability of forced termination for the on going call are calculated as the result of performance analysis.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.3
• /
• pp.351-359
• /
• 1999

We present a new approach to the analysis of mobile cellular communication systems under the environment of mixed platforms adopting a guard channel scheme. We assume general cell residence time distributions according to platform-types. Our system model is based on a heterogeneous M/G/c loss system with customer-dependent guard channels, where heterogeneous customers with different service time distributions have different numbers of their own guard channels. We develop the general formula of steady state probabilities for the heterogeneous M/G/c loss system with customer-dependent guard channels. The mean channel occupancy times of new and handoff calls are rigorously derived under a general setting. Finally, our numerical results show that the blocking probability and the forced termination probability are sensitive to the cell residence time distributions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2131-2140
• /
• 1998

Signal-to-interference ratio (SIR)-based dynamic code allocation method to be rioritized for handoff call is proposed and evaluated in a direct sequence-code division multiple access (DS-CDMA) cellular systm. Proposed method allocates a code to a mobile terminal according to the restidual capacity computed by SIR in the base station. We consider the voice activity detection to increase the system capacity. We evaluate the performance of proposed method with computer simulation. And the handoff decision function that controls handoff of mobile terminal is interodcued. The proposed method provide much improvement in the forced termination probability and handoff call fail probability.