Paging and registration in cellular networks: jointly optimal policies and an iterative algorithm

This paper explores optimization of paging and registration policies in cellular networks. Motion is modeled as a discrete-time Markov process, and minimization of the discounted, infinite-horizon average cost is addressed. The structure of jointly optimal paging and registration policies is investigated through the use of dynamic programming for partially observed processes. It is shown that there exist policies with a certain simple structure that are jointly optimal, though the dynamic programming approach does not directly provide an efficient method to find the policies. An iterative algorithm for policies with the simple form is proposed and investigated. The algorithm alternates between paging policy optimization and registration policy optimization. It finds a pair of individually optimal policies, but an example is given showing that the policies need not be jointly optimal.

[1]  F. Riesz.  Sur Une Inégalité Intégarale , 1930 .

[2]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[3]  Leonard Kleinrock,et al.  Queueing Systems - Vol. 1: Theory , 1975 .

[4]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Vol. II , 1976 .

[5]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .

[6]  Amotz Bar-Noy,et al.  Tracking mobile users in wireless communications networks , 1993, IEEE Trans. Inf. Theory.

[7]  J. Massey.  Guessing and entropy , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[8]  Amotz Bar-Noy,et al.  Mobile users: To update or not to update? , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[9]  Yitzhak Birk,et al.  Using direction and elapsed-time information to reduce the wireless cost of locating mobile units in cellular networks , 1995, Wirel. Networks.

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

[11]  I Chih-Lin,et al.  Optimum location area sizes and reverse virtual call setup in PCS networks , 1995, 1995 IEEE 45th Vehicular Technology Conference. Countdown to the Wireless Twenty-First Century.

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

[13]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[14]  Kenneth Steiglitz,et al.  Optimization of wireless resources for personal communications mobility tracking , 1995, TNET.

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

[16]  John N. Tsitsiklis,et al.  Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.

[17]  Ian F. Akyildiz,et al.  Movement-based location update and selective paging for PCS networks , 1996, TNET.

[18]  Armand M. Makowski,et al.  From Optimal Search Theory to Sequential Paging in Cellular Networks , 1997, IEEE J. Sel. Areas Commun..

[19]  Christian Cachin,et al.  Entropy measures and unconditional security in cryptography , 1997 .

[20]  Christopher Rose,et al.  State-based paging/registration: a greedy technique , 1999 .

[21]  Vijay K. Garg,et al.  Wireless and Personal Communications Systems , 2000 .

[22]  Stephen B. Wicker,et al.  On the performance of sequential paging for mobile user location , 2001, IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211).

[23]  Alfredo De Santis,et al.  Bounds on entropy in a guessing game , 2001, IEEE Trans. Inf. Theory.

[24]  Stephen B. Wicker,et al.  Optimal Sequential Paging in Cellular Networks , 2001 .

[25]  Ian F. Akyildiz,et al.  Effective Paging Schemes with Delay Bounds as QoS Constraints in Wireless Systems , 2001, Wirel. Networks.

[26]  E. Lieb,et al.  Analysis, Second edition , 2001 .

[27]  Bruce E. Hajek.  Jointly optimal paging and registration for a symmetric random walk , 2002, Proceedings of the IEEE Information Theory Workshop.