• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.05a
• /
• pp.132-132
• /
• 2001

본 논문에서는 혼합예약요청(hybrid reservation request) 알고리즘을 적용한 새로운 동적 예약 TDMA 프로토콜을 제안한다. 제안된 혼합 예약 요청 알고리즘은 기존의 랜덤접속방식과 기지국의 중재 없이 단말간 직접 신호교환을 통하여 이웃 단말의 새로운 예약 요청을 대신 전송하는 방식을 혼합해서 사용하는 방법이다. 이 알고리즘은 기존 slotted-ALOHA 방식을 이용한 예약 요청의 비효율성을 개선하여 새로운 단말의 예약 요청실패로 인한 셀 전송지연 및 호 봉쇄 확률(call blocking probability)을 줄이기 위한 목적으로 제안되었다. 제안한 알고리즘은 새로 전송할 데이터를 가진 단말이 많은 경우에 특히 효율적이다. 본 논문에서 제안하는 프로토콜은 모든 종류의 트래픽이 예약을 통한 전송방식으로 전송된다. 즉, 단말들로부터의 예약 요청을 바탕으로, 기지국이 스케줄링을 하여 트래픽 별로 접근 슬랏을 할당해 주는 방식이다. 이 경우, 예약 요청을 하는 방법은 새로 전송을 개시하는 단말과 이미 전송중인 단말의 경우가 다른데, 새로운 전송을 위한 예약이 필요한 단말은 제안하는 알고리즘을 이용하며, 이미 예약에 성공한 단말은 기존에 사용하던 자신의 버스트헤더(burst header)에 피기백(piggybacking)하는 방법을 이용한다. 제안한 알고리즘에 따라, 새로 접속하는 단말이나 새로운 예약 요청이 필요한 단말은 두 단계로 요청을 전송할 수 있다. 첫 번째 단계는 이미 예약에 성공하여 전송중인 이웃단말에게 전송요청신호를 보내 간접적으로 기지국에게 예약을 요청하는 방법이며, 두 번째 단계는 첫 번째 방법이 실패했을 경우 기존의 랜덤접속방법에 참가하는 것이다 먼저 첫 번째 방법에서는 단말이 랜덤접근 구간의 예약요청구간(resonation request)중 하나의 미니 슬랏을 선택해 이웃 단말들에게 한번 방송(broadcast) 한다 이후 ACK 응답구간(ACK receive)에서 응답을 받으면 예약요청성공이라 간주하고, 그렇지 않으면 실패로 판단, 뒤이어 오는 랜덤접근구간(normal random access period)에 참가하여 기지국에게 직접 예약 요청을 한다. 시뮬레이션은 기존 slotted-ALOHA방식으로 랜덤 접속을 할 경우와 제안한 방식과의 성공률을 비교해 제안한 방식의 call blocking probability가 낮음을 보였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2664-2673
• /
• 1997

The signal fading distortion has effect on the capacity of cellular mobile communication systems. The short term fading is solved by signal processing techniques depending on the radio communication methods, but another distortion compensation techniques are necessary to combat long term fading. in this paper, we have simulated the call processing in DS-CDMA system using distributed antennas to overcome the long term fading. From the simulation results, we have conformed that the blocking probability of a new call andthe forced probability of handoff-request-call have decreased by increasing the number of distributed antennas.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.1
• /
• pp.73-78
• /
• 2004

There are random, continuous, and periodic allocation methods in the time slot sequence integrity for the multi-slot call. In the T-S-T switch, there are 2 time switch and the 2*2 space switch. Three time-slot allocation methods are suggested for the simulation. In the simulation, the searching times for time-slots on a multi-slot call is chosen to 32, and the simulation time is chosen to 100,000 seconds. Three kinds of calls are supposed for a multi-slot call : one time-slot call, two time-slot call, and 6 time-slot call. In the simulation, the carried traffic and the blocking probability are calculated on the 3 different traffic cases of 8:1:1, 6:2:2, 4:3:3(one time-slot : two time-slot : 6 time-slot) multi slot calls. It is shown that the blocking probability for the periodic time slot allocation method is best. As a result, the periodic time-slot allocation method is the proper one for the multi-slot ATM switch.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9B
• /
• pp.892-899
• /
• 2009

Reuse-partitioning is a simple technique that can be used to improve the capacity of a cellular system. In the previous researches, authors do not explain how a channel is selected and what happens when there is no channel available when a call arrives. Therefore, in this paper, we describe a simple channel selection procedure and analyze the performance of a system. The performance is presented in terms of the channel utilization and call blocking probability by varying offered load per cell. Our analytical results may be added in a realistic performance analysis of reuse-partitioning-based system.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.3
• /
• pp.39-46
• /
• 1998

In the FDMA and TDMA Cellular Systems, call blocking rise when frewquence slots andtime slots are used to ther users. Otherwise, in the CDMA cellular systems, call locking arises when interference level is above 10dB according to call of other users. System capacity is defined to be Erlang capacity that is the number of users when CDMA blocking probability is 1% or 2%. Users number corresponded channel number of AMPS and TDMA cellular systems. In this paper, we proposed new reuse-fraction using square of interference poser and obtained Erlang capacity for reverse link of CDMA cellular system with bit rate $R_{b}$, 9.6kbps and 14.4kbps. As a results, Erlange capacity of CDMA system have more 20.7 and 5.5 times than AMPS and TDMA system and have more form 1 to 4 Erlang thatn Viterbi and Padovani obtaned.d.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.185-188
• /
• 2004

Sufficient bandwidth that can support multimedia service has to be provided in the next generation wireless communication system. In this paper, the effective handoff scheme considering the position of mobile terminal is proposed. In addition, the dynamic channel allocation scheme is proposed. The shared channel in this algorithm can reduce more the blocking probability and the dropping probability. The proposed algorithms are simulated by SMPL library in C language. The simulation results show that the blocking probability and the dropping probability of the call can be reduced up to $60\%\;and\;10\%$ using the proposed algorithms, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7A
• /
• pp.987-995
• /
• 1999

The handoff is a distinctive characteristic of the mobile networks. In the CDMA systems, if base stations support multiple Frequency Assignment (FA), they provide both soft handoff and hard handoff. Under the CDMA environments, the soft handoff guarantees the favorable service quality and the continuity of call connection without interruption, and increases the service capacity of the base stations. This paper proposes call connection control schemes with handoff queue for supporting efficient handoff processing. The proposed schemes are divided into two categories: single handoff queue scheme and multiple handoff queue scheme. We analyze the performance of the proposed call connection control schemes using numerical analysis. From the analysis results, we can say that it is more desirable to avoid hard handoff as long as handoff queues are used. When a single handoff queue used, adaptive scheme that properly mixes avoidable and avoidable hard handoff method under the given traffic condition is more desirable. In case that multiple handoff queues are used, the suitable trade-off needs to be developed between handoff blocking probability and hard handoff probability to guarantee a given blocking probability threshold.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2A
• /
• pp.61-65
• /
• 2005

We propose a soft QoS-based borrowing scheme for call admission control(CAC) in DVB-RCS(Digital Video Broadcast-Return Channel via Satellite). Some of the ongoing calls temporarily and fairly release bandwidths that can be used to accommodate a new call in an overloaded satellite network. The amount of bandwidth borrowed from each call is proportional to each user's critical bandwidth ratio, one of parameters for soft QoS mechanism. Simulation results show that the proposed scheme improves the system performance in terms of call blocking probability and bandwidth utilization.

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