• International Journal of Contents
• /
• 제8권2호
• /
• pp.19-22
• /
• 2012

New and handoff calls control mechanisms are the key point to wireless cellular networks. In this paper, we present an adaptive algorithm for dynamic channel allocation scheme with guard channels and also with handoff calls waiting queue ensuring that handoff calls take priority over new calls. Our goal is to find better tradeoff between handoffs and new calls blocking probabilities in order to achieve more efficient channel utilization. Simpy is a Python based discrete event simulation system. We use Simpy to build our simulation models to get analytical data.

• 전자공학회논문지S
• /
• 제34S권2호
• /
• pp.11-20
• /
• 1997

It is a recent trend that mobile communications and PCS are intergrated into the broadband network. Broadband mutlimedia traffic will be transported over the integrated network. In this paper, we propose a connection re-routing method for fast inter-switch hadoffs and dynamic resurce reservation scheme, which is based on the proposed re-routing method, for the ATM-based personal communications network. To reduce the delay for re-routing method, for the ATM-based personal communications network. To reduce the delay for re-routing, the proposed re-routing method is to reserve VPI/VCIs for possible inter-swich handoff calls in advance. Our reservation scheme is to statistically reserve the fixed resources for possible inter-switch handoff calls, according to the QoS of the handoff calls. The simmulation reslts show that our proposed scheme satisfies the required QoS of handoff calls and keep the dropping probability of handoff calls lower than other schemes.

• 한국산업융합학회 논문집
• /
• 제6권4호
• /
• pp.401-404
• /
• 2003

In most resource reservation strategies, which give higher priorities to handoff calls over new calls, new calls are often blocked even though there is plenty of available reserved resource. This causes inefficient resource utilization, especially when there are not so many handoff attempts. In this paper, we propose a new reservationstrategy called soft reservation in which new calls can be allocated to the reserved resource while maintaining the QoS of handoff acceptable. Using an M/M/c/c queuing model, we can see that the proposed strategy provides better performance than the conventional reservation strategy in terms of blocking probability of new call and dropping probability of handoff calls.

• 한국통신학회논문지
• /
• 제22권4호
• /
• pp.748-760
• /
• 1997

The handoff failure probability has to be enhanced efficiently to enhance the performance of PCS system. In this paper a new scheme called velocity adaptive handoff algorithm for reducing handoff failure probability and maintaining the carried traffic constantly in PCS systems, by assigning low handoff threshold value for high mobility calls, and assigning high handoff threshold value for low mobility calls, is presented. The performance of evaluation of this new scheme is carried out in terms of tranffic characteristics. Also velocity estimation algorithm for this new scheme is presented. According to the result, the handoff failure probability of velocity adaptive handoff algorithm is enhanced about 60%.

• 한국통신학회논문지
• /
• 제30권2A호
• /
• pp.26-33
• /
• 2005

무선 IP 망의 자원 예약 방식에서는 미래의 호가 요구하는 무선자원의 양을 정확히 예측함으로써 제한된 무선자원의 이용률을 높일 수 있다. 본 연구에서는 멀티미디어 무선 IP 망에서 미래의 핸드오프 호가 요구하는 무선자원(대역폭)의 양을 예측하는 LMS-Wiener 예측방법을 제안하고, 자원의 예측 오차양의 크기에 관해서 기존외 위너 모델링에 기초한 예측방법과 성능을 비교한다. 성능비교를 위한 트래픽 환경은 피코셀 구조의 무선 IP 망에서 장시간 호의 도착패턴이 일반적인 포아송 분포보다는 비포아송 분포를 보이므로, 핸드오프 호의 도착과정을 비 포아송 분포, 핸드오프 호의 채널 점유 시간도 비 지수 분포로 모델링 하였다. 시뮬레이션 결과 기존의 위너모델에 의한 방법에서는 예측시점이 경과함에 따라 예측 오차량의 크기가 증가하는 반면에 제안한 방법에서는 예측 오차량의 크기가 감소하는 수렴성을 보였다. 따라서 제안한 자원의 예측 방법이 기존의 방법보다 미래의 핸드오프 호가 필요로 하는 무선자원의 양을 상대적으로 정확히 예측함으로써, 필요이상의 과도한 자원의 예약으로 발생되는 무선자원의 낭비를 줄일 수 있음을 알 수 있다.

• 한국경영과학회지
• /
• 제23권3호
• /
• pp.135-151
• /
• 1998

The demand of large capacity in coming cellular systems makes inevitable the deployment of small cells, rendering more frequent handoff occurrences of calls than in the conventional system. The key issue is then how effectively to reduce the chance of unsuccessful handoffs, since the handoff failure is less desirable than that of a new call attempt. In this study, we consider the control policies which give priority to handoff calls by limiting channel assignment for the originating new calls, and allow queueing the new calls which are rejected at their first attempts. On this system. we propose the problem of finding an optimal call control strategy which optimizes the objective function value, while satisfying the requirements on the handoff/new call blocking probabilities and the new call delay. The objective function takes the most general form to include such well-known performance measures as the weighted average carried traffic and the handoff call blocking probability. The problem is formulated into two different linear programming (LP) models. One is based on the direct employment of steady state equations, and the other uses the theory of semi-Markov decision process. Two LP formulations are competitive each other, having its own strength in the numbers of variables and constraints. Extensive experiments are also conducted to show which call control strategy is optimal under various system environments having different objective functions and traffic patterns.

• 전자공학회논문지B
• /
• 제33B권6호
• /
• pp.136-148
• /
• 1996

In this paper, we analyze the traffic characteristics in microcell and macrocell overlaid PCS system which process voice and dta calls separately each others. in this system, data calls are delayed in queue when all of channels are occupied, while voice calls are bolcked in that case. For this, we calculated inter-microcell handoff area dwelling time distribution and handoff area dwelling time distribution between microcell and macrocell. We analyze traffic performance using this results. We used M/M/C/K model, and analyzed traffic performance of macrocell with handoff area variation of microcell.

• 한국통신학회논문지
• /
• 제21권11호
• /
• pp.2817-2827
• /
• 1996

In this paper, we propose a new channel assignment scheme considering traffic characteristics in the CDMA cellular system. The object of proposed method is to reduce the hard handoff of data calls which are very sensitive to transmission errors. In this algorithm, we use three channel assignment policies. First, all of the data calls are assigned to the primary CDMA channel if possible. Second, priority for primary CDMA channel is given to data calls by assigning some primary CDMA traffic channels exclusively for data calls. Third, data calls are assigned to the CDMA channel most served by neighbor cells, when all of the primary CDMA traffic channels are used. A performance analysis shows the minimum soft handoff probability of data calls in handoff which is guarantied any cellconfiguration is increased above 40% by the adopting proposed algorithm.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.127-130
• /
• 1998

Wireless multimedia networks require channel allocation strategies for various multimedia traffic since the mobility of users needs to be considered in addition to diversity of QoS requirements of multimedia traffic. In this paper, we propose an Efficient Channel Allocation strategy, based on prioritization of handoff calls used in Guard channel method. Gurad channels can be shared between non real time calls and real time handoff calls. To decrease the probability of handoff failure, when resources become scarce, the Call Admission Control can take some resources away from the active calls. It is shown through extensive simulations that the proposed strategy provides higher channel utilization and lower probability of handoff failure than existing strategies.

• 산업공학
• /
• 제25권4호
• /
• pp.450-457
• /
• 2012

This study addresses the call admission control(CAC) problem for OFDMA wireless communication systems in which both subcarriers and power should be considered together as the system resources. To lessen the exccessive allocation of radio resources for protecting handoff calls, the proposed CAC allows the less data rate than their requirements to handoff calls. The CAC problem is formulated as a semi-Markov decision process(SMDP) with constraints on the blocking probabilities of handoff calls. Some extensive experiments are conducted to show the usefulness of the proposed CAC model.