A greedy method of state-based registration

We derive registration methods by which a mobile user decides whether to register based on its current location, the time elapsed since last contact with the system, and paging cost at each time and place. We assume that both the system and mobile unit (user) have access to a location probability distribution as a function of time given the last known location. Reductions in average paging registration cost of approximately 10% were observed compared to time-alone methods. The more striking improvement was a reduction in the variability of paging/registration costs by a factor of three