Modeling and Performance Analysis of Three Zone-Based Registration Scheme in Wireless Communication Networks

Abstract

For wireless communication networks, researchers have proposed many schemes to reduce the cost of location registration and paging signals caused by the mobility of user equipment (UE). Among them, a zone-based method that designates one zone (1Z, group of cells) as a registration area (RA) and then performs registration whenever the UE leaves the RA is commonly adopted due to its convenient implementation. However, the performance of 1Z is known to be very poor when the UE frequently crosses the RA’s boundary requesting location updates. Two or three zone-based schemes (2Z or 3Z) have since been recommended to overcome these limitations. In our previous work, we analyzed the performances of 1Z, 2Z, and 3Z systems while assuming a square-shaped zone. However, there is no reason why the shape of the zone is limited to a square. This paper analyzes the performance of 3Z while assuming a hexagonal-shaped rather than a square-shaped zone. Using a semi-Markov process theory, registration and paging costs are evaluated after defining states in 3Z operations and calculating the transition probability between states. Based on various realistic parameters, the numerical results showed that the 3Z outperformed 1Z and 2Z for most call-to-mobility ratio (CMR) values. The performance of 3Z was improved more when the registration cost decreased if the probability of returning to the previously registered zone increased or the time staying in the zone decreased. The 3Z system is easy to implement with simple software modifications. It can be dynamically applied as an efficient mobility management method in the future for various devices that will emerge in the 5G/6G environment.