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

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