2012 Volume E95.B Issue 9 Pages 3019-3023
We consider distance-based registration (DBR). DBR causes a mobile station (MS) to reregister when the distance between the current base station (BS) and the BS with which it last registered exceeds a distance threshold. The addition of implicit registration to DBR (DBIR) was proposed to improve the performance of DBR, and its performance has also been presented using a continuous-time Markov chain. In this study, we point out some problems of the previous DBIR performance analysis, and we propose a new model of the DBIR to analyze its exact performance. Using the new method, we show that DBIR is always superior to DBR, and the extent of the improvement is generally greater than what is currently known.