State-based paging/registration: A greedy technique

doi:10.1109/25.740083

State-based paging/registration: A greedy technique

1999-01-01

52

PRE

AI

C

Christopher Rose *

DOI：10.1109/25.740083

Original

Original request for help

Save

Abstract

En 中文

For a mobile unit moving according to some ergodic stochastic process, we show how to minimize the expected average cost of paging and registration based on system state information. Specifically, we assume that both the system and mobile unit (user) have access to or can derive the following: the user location probability distribution as a function of time given the last location known to the system; the time elapsed since this last known location. We then derive methods by which the user decides whether to register based on the following: current location (x); the time elapsed since last contact with the system (t); the paging cost F(x(t), x(o), t) to be incurred by the system at time t given the current location x(t) and the last known location x(o), i.e., the user knows the paging strategy to be used by the system for each time t. If x and t define the system state, the method can be called state based. Since the optimization is based only on the current expected cost rate and not that of all registration intervals, the method is greedy. The greedy method was compared to a timer-based method using a simple diffusive motion process, Reductions in average paging registration cost of approximately 10% were observed. The more striking improvement was a reduction in the variability of paging/registration costs by a factor of three. Thus, taking both cost and variability reduction as a performance measure, even suboptimal inclusion of location information in the registration decision affords substantial improvement.

Keywords:

TRACKING

State-based paging/registration: A greedy technique

Abstract

Journal

Organization