Mobility management is very important in mobile cellular networks, since to connect incoming calls, the network must maintain the locations of the mobiles. This study considers the zone-based registration methods that most mobile cellular networks have adopted. We focus on two special zone-based registration methods, called two-zone registration (2Z), and two-zone registration with implicit registration by outgoing calls (2Zi). Although some mathematical models for their performances have been presented, they still cannot accurately estimate 2Zi performance. We provide a new and simple mathematical model based on Markov chain theory that can accurately analyze the performances of 2Z and 2Zi. We also explain the propositions underlying the explicit expressions adopted by our model. We finally present various numerical results, to compare the performance of 2Zi with those of 2Z and one-zone registration (1Z), and show that in every case, 2Zi is superior to 2Z, and in most practical cases, to 1Z.

An efficient location management for mobile stations plays an important role in personal communication systems. The key elements of location management are location registration and paging. In this paper, we propose the improved movement-based registration method with a selective paging scheme which enables to minimize the signaling traffic such as a paging load and a registration load. For reducing the paging load, we newly establish a paging area and analyze its performance by modeling as one dimensional random walk model with a barrier state. Further, for decreasing the registration load, we also propose a new movement-based registration scheme by using a counter and a buffer which can store the number of cell boundary crossings and the cell identification, respectively. Through numerical results, we show that our proposed movement-based registration provides a better performance than the conventional movement-based registration.

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.