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 Markov processes. It is shown that there exist policies with a certain simple form that are jointly optimal. 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. Majorization theory and Riesz's rearrangement inequality are used to show that jointly optimal paging and registration policies are given for symmetric or Gaussian random walk models by the nearest-location-first paging policy and distance threshold registration policies.

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

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

[3]  Bruce E. Hajek,et al.  Paging and registration in cellular networks: jointly optimal policies and an iterative algorithm , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

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

[6]  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).

[7]  L. Schrage,et al.  Queueing systems, Vol. I: Theory , 1977, Proceedings of the IEEE.

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

[9]  S. Wittevrongel,et al.  Queueing systems , 2019, Autom..

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

[11]  Amotz Bar-Noy,et al.  Mobile users: To update or not to update? , 1995, Wirel. Networks.

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

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

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

[15]  Stephen B. Wicker,et al.  Optimal Sequential Paging in Cellular Wireless Networks , 2004, Wirel. Networks.

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

[17]  Marion Kee,et al.  Analysis , 2004, Machine Translation.

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

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

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

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

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

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

[24]  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.

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

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

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

[28]  Amotz Bar-Noy,et al.  Tracking mobile users in wireless communications networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

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

[30]  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.