Minimization of paging and registration costs through registration deadlines

摘要

Given that the probability distribution on the user location as a function of time is either known or can be calculated, the author shows how to formulate the paging/registration optimization problem in terms of a timeout parameter, /spl tau//sub m/; the maximum amount of time to wait before registering given the last known location was m. Timer-based methods, as opposed to location-based methods, do not require the user to record and process location information during the time between location updates. This feature might be desirable for minimizing mobile receiver transmitter use during idle periods.