• ETRI Journal
• /
• v.25 no.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.

• IE interfaces
• /
• v.23 no.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.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.6
• /
• pp.1155-1169
• /
• 2010

This study considers movement-based registration (MBR). In MBR, a mobile station (MS) performs location registration whenever the number of entering cells reaches the specified movement threshold M. MBR is simple and its implementation is quite straightforward. However, it may result in more registrations than other similar schemes. An improved MBR scheme called MBIR (MBR with implicit registration) was proposed to reduce registration cost of MBR and its approximated performance was analyzed. In this study, we point out some problems of the previous analysis method and propose an exact analysis method of MBIR. Using the exact analysis method, we show that the previous analysis includes considerable errors and improvement of MBIR in our study seems to be larger than in the previous study.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.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.

• Journal of Computational Design and Engineering
• /
• v.1 no.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.