In this study, 2-location distance-based registration (2DBR) is proposed to improve the performance of traditional distance-based registration. In distance-based registration, when a mobile station (MS) enters a new cell, the MS calculates the distance from the last registered cell and registers its location if the calculated distance reaches a prescribed distance threshold D. In 2DBR, an MS stores not only the last registered location area (LA) but also the second-to-last LA, and then no registration is performed when the MS crosses the two stored LAs. The 2DBR may increase paging cost but it may decrease registration cost. Simulation results show that our proposed 2DBR outperforms current distance-based registration in most cases.

This study examines 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. We propose an improved MBR scheme, in which MBR combines with implicit registration (IR), to reduce registration cost. The performance of the proposed scheme is evaluated using a mathematical approach based on the 2-dimensional random walk mobility model in a hexagonal cell configuration. The numerical results for varying circumstances show that the proposed scheme performs better than conventional MBR.

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.