This study considers three kinds of dynamic location registration schemes: the movement-based registration (MBR), location-based registration (LBR), and distance-based registration (DBR) schemes. We propose analytical models based on a 2-dimensional random walk in a hexagonal cell configuration to analyze and compare the performances of these schemes. We focus on the expression of the registration costs of LBR and DBR schemes using probability equations, and show that the DBR scheme is always superior to both MBR and LBR schemes. Numerical results are provided to demonstrate the validity of our models under various circumstances.

location registration, movement-based registration, location-based registration, distance-based registration.