Paging strategies for highly mobile users

In this work, we consider the problem of minimizing average paging cost and polling delay in a wireless system. It is assumed that users to be paged move according to a general motion process during the paging events. We find and evaluate the optimal sequential paging strategies for given maximum delay tolerance and compare our results to the classical paging strategy as well as the optimal strategies for stationary units (users).

[1]  R. Bellman.  Dynamic programming. , 1957, Science.

[2]  K.S. Meier-Hellstern,et al.  The use of SS7 and GSM to support high density personal communications , 1992, [Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications.

[3]  D.J. Goodman,et al.  Network protocols for the cellular packet switch , 1994, IEEE Trans. Commun..

[4]  Roy D. Yates,et al.  Paging cost minimization under delay constraints , 1995, Proceedings of INFOCOM'95.

[5]  Kalyan Basu,et al.  Adaptive paging algorithms for cellular systems , 1995, 1995 IEEE 45th Vehicular Technology Conference. Countdown to the Wireless Twenty-First Century.

[6]  Christopher Rose,et al.  Minimization of paging and registration costs through registration deadlines , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[7]  Roy D. Yates,et al.  Minimizing the average cost of paging under delay constraints , 1995, Wirel. Networks.

[8]  C. Rose,et al.  Minimizing the average cost of paging and registration: A timer-based method , 1996, Wirel. Networks.

[9]  Christopher Rose,et al.  Highly mobile users and paging: optimal polling strategies , 1998 .