• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.692-698
• /
• 1999

In this paper, we proposed the channel assignment scheme for the CDMA(Code Division Multiple Access) cellular system using power allocation concept. Also, the performance of the proposed scheme was analyzed and it was compared with the channel assignment scheme using the fixed power allocation method in the CDMA cellular system. The proposed scheme allocates the power adaptively in according to the traffic loads and the traffic distribution pattern of neighbor cells in the forward link. We found that total call blocking probability (Pr) is more dependent on blocking probability($P_B$) than outage probability (Po) under physical number of channels ($C_{th}$)=30. Pr(Call Blocking Probability) is dependent on $P_B$(Blocking Probability) and Po(Outage Probability) at the same ratio under $C_{th}$=32, in which case P$P_{TA}$(blocking probability for the adaptive power allocation) is greater than $P_{TF}$(blocking probability for the fixed power allocation) about 6%.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.8
• /
• pp.481-490
• /
• 2000

This paper analyzes interference power, Erlang capacity, the number of handoff occurrences, and call blocking probability with respect to the cell radius, the soft handoff region, and the mobile's velocity in a CDMA hierarchical cellular system. The microcell cellular system has the higher Erlang capacity than the macrocell cellular system. However, the microcell cellular system, which has a high system capacity through frequency reuse has the call blocking probability higher than macrocell cellular system. Also the interference power and the call blocking probability are decreased with the operation of soft handoff. Therefore, this paper presents the optimization of soft handoff region so as to maximize system's Erlang capacity with the low the call blocking probability according to mobile's velocity in the CDMA hierarchial cellular system.

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

• ETRI Journal
• /
• v.36 no.4
• /
• pp.609-616
• /
• 2014

Even though many computational methods (recursive formulae) for blocking probabilities in finite-capacity M/D/1 queues have already been produced, these are forms of transforms or are limited to single-node queues. Using a distinctly different approach from the usual queueing theory, this study introduces explicit (transform-free) formulae for a blocking probability, a stationary probability, and mean sojourn time under either production or communication blocking policy. Additionally, the smallest buffer capacity subject to a given blocking probability can be determined numerically from these formulae. With proper selection of the overall offered load ${\rho}$, the approach described herein can be applicable to more general queues from a computational point of view if the explicit expressions of random vector $D_n$ are available.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.1
• /
• pp.59-70
• /
• 1998

In the wireless mobile exchange communication system, the proper handling of originating call(OC) and handover call(HC) is important. Specially, when it's viewed from the user side, mobile users feel more weighting soul disappointment with the handover blocking probability moving from current cell to adacent cell than with originating call blocking probability happening new call in current cell. Accordingly,this paper is proposed and analyzed the timeout buffer system and guard channel for decreasing handover blocking probability. In analytic result, The more guard channel increase,t he more originating call blocking probability increase and handover blocking probability decrease. Also, the more timeout duration increase, the more handover blocking probability decrease.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.7
• /
• pp.24-31
• /
• 2009

Resource reservation scheme is an effective method to guarantee QoS for handoff calls in the next generation multimedia mobile communication systems, but it causes negative impacts on blocking probability of new calls. In this paper, to optimize the tradeoff between dropping probability of handoff calls and blocking probability of new calls, relay station based handoff prioritization control algorithm is proposed. In this algorithm, the relay station participates in handoff procedure and enables mobile stations to have guaranteed prompt service after handoff by providing highly efficient data transmission. In this paper, Markov chain models of the proposed handoff prioritization schemes are developed, and dropping probability of handoff packets and blocking probability of new packets are derived. By numerical analysis, the proposed algorithm has been proved to outperform conventional handoff prioritization schemes in terms of dropping probability of handoff packets and blocking Probability of new packets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.6
• /
• pp.1501-1509
• /
• 1996

Mobile stations can be classified by the transmission power level in CDMA system. Different performance parameters will be given to each class of mobile stations so that the appropriate quality ofservices can be provided. In this paper, it is assumed that there are two clsses of mobile stations. with the classification of mobile stations, analytical models are presented for the estimates of the reverse link capacity and the blocking probability. From the model for the reverse link capacity, the maximum number of each class of mobile stations to be served is derived. It is shown that $E_{b/}$I reduction of 1 dB allows the capacity to be increased by 25% and the data transmission rate and the power control accuracy have a significant effect on the reverse link capacity and the blocking probability. Simulation results are provided for validating the anlaytical estimates of the blocking probability.ocking probability.y.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.241-247
• /
• 2008

In this study we consider an M/D/1 queue with a finite buffer. Due to the finiteness of the buffer capacity arriving customers can not join the system and turn away without service when the buffer is full. Even though a computational method for blocking probabilities in an M/D/1/K queue is already known, it is very complex to use. The aim of this study is to propose a new way to compute blocking probability by using (max,+)-algebra. Our approach provide a totally different and easier way to compute blocking probabilities and it is, moreover, immediately applicable to more generous queueing systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1158-1163
• /
• 2002

In this paper it is focused on the relation between CLR (Cell Loss Ratio) and blocking probability, GoS(Grade of Services) parameters in the wireless ATM (Asynchronous Transfer Mode) access network which consists of access node and wireless channel. Traffic model of wireless ATM access network is based on the cell scale, burst scale and call connection level. The CLR equation due to buffer overflow for wireless access node is derived for CBR (Constant Bit Rate) traffic. The CLR equation due to random bit errors and burst errors for wireless channel is derived. Using the CLR equation for both access node and wireless channel, the CLR equation of wireless ATM access network is derived. The relation between access network CLR and blocking probability is analyzed for CBR traffic.

• Proceedings of the Korean Statistical Society Conference
• /
• 2005.05a
• /
• pp.203-207
• /
• 2005

A loss system where two types of customers arrive in accordance with two independent Poisson processes is considered. An efficient recursive formula is developed for calculating the loss probability when the number of servers is large. Some practical examples regarding the performance evaluation of telecommunications networks are discussed.