• 제목/요약/키워드: Implicit Registration

검색결과 5건 처리시간 0.019초

Modeling and Analysis of Distance-Based Registration with Implicit Registration

  • Baek, Jang-Hyun;Ryu, Byung-Han
    • 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.

  • PDF

묵시적 위치등록을 고려한 거리기준 위치등록의 모형화 및 성능 분석 (Modeling and Performance Analysis of Distance-Based Registration Considering Implicit Registration)

  • 이태한;서재준;문유리;백장현
    • 산업공학
    • /
    • 제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.

발신호의 묵시적 위치등록 효과를 고려한 이동기준 위치등록의 모형화 및 성능 분석 (Modeling and performance analysis of movement-based registration considering implicit registration effect of outgoing calls)

  • 서재준;이태한;백장현
    • Journal of the Korean Data and Information Science Society
    • /
    • 제21권6호
    • /
    • pp.1155-1169
    • /
    • 2010
  • 본 연구에서는 이동기준 위치등록을 고려한다. 이동기준 위치등록에서는 미리 정해진 특정 개수의 셀에 진입할 때마다 새로 위치등록을 수행한다. 이동기준 위치등록은 구현이 용이하다는 장점이 있으나 다른 위치등록 방법에 비하여 위치등록이 자주 발생하는 경향이 있다. 이러한 이동기준 위치 등록의 성능을 개선하기 위하여 이동기준 위치등록에 묵시적 위치등록을 결합한 방법이 제안되었다. 본 연구에서는 육각형 셀 환경 하에서 2차원 랜덤워크 이동성 모형을 기반으로 묵시적 위치등록과 결합된 이동기준 위치등록의 성능을 분석한 기존 연구의 문제점을 지적하고 그 정확한 성능을 분석하는 방법을 제시한다. 제안한 정확한 분석 방법을 이용하여 기존의 분석방법이 상당한 오차를 포함하고 있음을 보이고 정확한 분석방법을 이용할 경우 위치등록과 결합된 이동기준 위치등록의 성능 개선 효과가 기존의 분석 방법에 비하여 더욱 크게 나타남을 보인다.

이동통신망에서 영역기준 위치등록 방법의 개선 및 성능평가 (Improvement and Performance Evaluation of Zone-based Registration in Mobile Communication Network)

  • 박진원
    • 대한산업공학회지
    • /
    • 제34권2호
    • /
    • pp.172-180
    • /
    • 2008
  • Many strategies have been proposed to reduce mobility management cost. Among them, in this paper, we study three schemes of zone-based registrationthat have been adopted by most of mobile systems. These special schemes are referred to as the single-zone-based registration (SZR), the two-zone-based registration (TZR) and the two-zone-based registration with outgoing call (TZRC) respectively. We propose a mathematical model to evaluate the performance of TZRC in order to compare with those of SZR and TZR. Numerical results show that TZRC outperforms not only SZR but also TZR in most cases.

Orthogonal projection of points in CAD/CAM applications: an overview

  • Ko, Kwanghee;Sakkalis, Takis
    • Journal of Computational Design and Engineering
    • /
    • 제1권2호
    • /
    • pp.116-127
    • /
    • 2014
  • This paper aims to review methods for computing orthogonal projection of points onto curves and surfaces, which are given in implicit or parametric form or as point clouds. Special emphasis is place on orthogonal projection onto conics along with reviews on orthogonal projection of points onto curves and surfaces in implicit and parametric form. Except for conics, computation methods are classified into two groups based on the core approaches: iterative and subdivision based. An extension of orthogonal projection of points to orthogonal projection of curves onto surfaces is briefly explored. Next, the discussion continues toward orthogonal projection of points onto point clouds, which spawns a different branch of algorithms in the context of orthogonal projection. The paper concludes with comments on guidance for an appropriate choice of methods for various applications.