• 대한산업공학회지
• /
• 제23권2호
• /
• pp.385-401
• /
• 1997

In this paper, we evaluate the performance of zone-based registration and distance-based registration. First, we propose the mobility model which can be used to analyze the performance of both zone-based registration and distance-based registration. And using the proposed mobility model, we obtain several performance measures and perform numerical computation to compare the performance of two registration methods. Numerical results show that in general zone-based registration needs less number of registration than distance-based registration. On the other hand, if distance-based registration is used, registration load is equally distributed to all cells in a location area and ping-pong phenomenon is not occurred. And when a VLR area is composed of a few location areas, distance-based registration may need less registration load than zone-based registration. Therefore, a proper registration method should be selected considering system circumstances and implementation complexity, and the selected method should be implemented so as to change system parameters according to system circumstances.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2003년도 춘계종합학술대회논문집
• /
• pp.449-453
• /
• 2003

In this paper, we evaluate the performance of zone-based registration, distance-based registration and distance-based registration considering call arrival. We propose the mobility model, which can be used to analyze the performance of three registration schemes. Numerical results show that zone-based registration needs less number of registration than distance-based registration. On the other hand, the registration load of the distance-based registration is equally distributed to all cells in a location area. However, the registration load of the distance-based registration considering call arrival is similar to that of zone-based registration and equally distributed to all cells in a location am Therefore, the proposed scheme can be effectively used restricted radio resources.

• 정보처리학회논문지C
• /
• 제10C권1호
• /
• pp.103-110
• /
• 2003

본 논문에서는 호의 도착을 고려한 거리기준 위치등록 방식을 제안하고 성능을 평가하였다. 이를 위해 이동성 모형을 제시하고, 이를 이용하여 제안한 방식의 성능을 분석하였다. 분석 결과 거리기준 위치등록 방식은 영역기준 위치등록 방식에 비하여 위치등록이 자주 발생하지만 위치등록 부하가 위치영역 내 모든 셀에 분산된다. 반면에 호의 도착을 고려한 거리기준 위치등록 방식의 위치등록 부하는 영역기준 위치등록 방식과 비슷한 수준이면서도 위치등록 부하가 위치영역 내 모든 셀에 분산되기 때문에 한정된 무선자원을 효율적으로 사용할 수 있다.

• 한국산업정보학회논문지
• /
• 제11권2호
• /
• pp.1-8
• /
• 2006

본 논문은 이동망에서 위치등록 방식에 따른 성능평가에 관한 것이다. 먼저 거리기반 위치등록 방식을 제안하고, 이를 이동망 모델에 적용하여 성능을 평가하였다. 제안한 방식과 기존의 지역기반 위치등록 방식과의 성능을 비교, 평가한 결과, 거리기반 위치등록 방식은 지역기반 위치등록 방식과 위치 등록에 따른 부하는 대동소이하나 주어진 지역내에서 모든 셀들이 고르게 분포하여 주파수 자원이 효율적으로 사용됨을 알 수 있다.

• ETRI Journal
• /
• 제25권6호
• /
• pp.527-530
• /
• 2003

In this study, we consider distance-based registration (DBR) and propose a DBR with implicit registration (DBIR) in order to improve the performance of the DBR. With analytical models based on a 2-dimensional random walk in a hexagonal cell configuration, we analyzed the performance of the DBR and DBIR. Our results showed that the DBIR always outperforms the DBR.

• 대한산업공학회지
• /
• 제34권2호
• /
• pp.151-159
• /
• 2008

An efficient location registration scheme is essential to accommodate continuously increasing mobile subscribers and to offer a variety of multimedia services with good quality. In this study, we consider a distance-based registration scheme where the number of location areas varies on the basis of cell-by-cell, not of ring-by-ring, to analyze the optimal size of the location area. Using our proposed cell-by-cell distance-based registration scheme with random walk mobility model, we analyze a variety of circumstances to obtain the optimal number of cells for location area that minimizes total signaling traffic on radio channels. From our analysis results, we show that the optimal number of cells for location area is between 4 and 6 in most cases, and our cell-by-cell distance-based location registration scheme has less signaling traffic than optimal ring-by-ring distance-based location registration scheme where optimal distance threshold is 2 (thus the optimal number of cells for location area is 7).

• 한국시뮬레이션학회논문지
• /
• 제17권4호
• /
• pp.41-50
• /
• 2008

본 연구에서는 거리기준 위치등록(Distance-Based Registration, DBR) 방법의 성능 개선 방안을 제안하고 그 성능을 분석한다. DBR 방법에서는 이동국이 새로운 셀에 진입할 때마다 현재 셀에서 가장 최근에 위치등록한 셀까지의 거리를 계산하여, 그 값이 기준거리 D 이상이면 위치등록을 수행하게 된다. 본 연구에서는 기존DBR 방법의 성능을 개선하기 위하여 2개의 위치영역을 가질 수 있는 이중영역 거리기준 위치등록(Two-Location Distance-Based Registration, TDBR) 방법을 제안하였다. TDBR에서는 이동국이 가장 최근에 위치등록한 위치영역뿐만 아니라 그 직전에 위치등록한 위치영역까지도 저장하게 되며 이 경우 저장된2개 위치영역을 넘나들 때는 위치등록이 필요 없게 된다. 반면에 페이징 부하는 DBR보다 증가하게 되므로 줄어드는 위치등록 부하와 늘어나는 페이징 부하의 절충이 필요하게 된다.본 연구에서는 육각형 셀 환경 하에서2차원 랜덤워크 모형에 기반을 둔 이동성 모형을 이용하여 두 위치등록 방법의 성능을 분석하고 비교하였다. 시뮬레이션과의 비교를 통하여 수리적 분석이 정확함을 보였으며, 다양한 환경에 대한 수리적 결과로부터 제안하는 TDBR 방법이 기존의 DBR 방법보다 대부분의 경우 성능이 우수함을 알 수 있었다.

• 산업공학
• /
• 제15권4호
• /
• pp.401-408
• /
• 2002

An efficient mobility management for mobile stations plays an important role in mobile communication network. In this study, we consider movement-based registration(MBR) and distance-based registration(DBR). Analytical models based on 2-dimensional random walk in hexagonal cell configuration are considered to analyze the performance of MBR and DBR. Especially, we focus on the derivation of the registration cost of DBR scheme by using two analytical methods and then show that DBR always outperforms MBR. Numerical results are provided to demonstrate optimal condition under various circumstances.

• 산업공학
• /
• 제23권4호
• /
• pp.357-364
• /
• 2010

In this study, we consider performance analysis of distance-based registration (DBR). DBR causes a mobile station (MS) to register its location when the distance between the current base station (BS) and the BS in which it last registered exceeds a distance threshold D. In general, DBR has some advantages over the other registration schemes but has a tendency to causes an MS to register more frequently than zone-based registration (ZBR) that is adopted in most of mobile communication systems. The DBR with implicit registration (DBIR) was proposed to improve the performance of DBR. In this study, we point out some problems of the previous analytical model based on continuous time Markov chain and analyze exact performance of the DBIR. We show that the DBIR always outperforms the DBR by using our exact analytical model.

• 한국정보기술응용학회:학술대회논문집
• /
• 한국정보기술응용학회 2007년도 춘계학술대회
• /
• pp.47-54
• /
• 2007

In this study, we consider the movement-based registration (MBR), location-based registration (LBR) and distance-based registration (DBR) schemes. Analytical models based on a 2-dimensional random walk in a hexagonal cell configuration are considered to analyze and compare the performances of these three schemes. We focus on the derivation of the registration costs of LBR and DBR using an analytical method and then show that DBR always outperforms both MBR and LBR. Numerical results are provided to demonstrate the validity of our models under various circumstances.