Abstract
Efficient paging procedures help minimize the amount of bandwidth expended in locating a mobile unit. Given a probability distribution on user location, it is shown that the optimal paging strategy which minimizes the expected number of locations polledE[L] is to query each location sequentially in order of decreasing probability. However, since sequential search over many locations may impose unacceptable polling delay,D, optimal paging subject to delay constraints is considered. It is shown that substantial reductions inE[L] can be had even after moderate constraints are imposed on acceptableD (i.e.,D<-3).
Since all methods of mobility management eventually reduce to considering a time-varying probability distribution on user location, this work should be applicable to a wide range of problems in the area. most notably those with additive cost structures.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K.S. Meier-Hellstern, G.P. Pollini and D.J. Goodman, Network protocols for the cellular packet switch, IEEE Trans. Commun., to appear.
K.S. Meier-Hellstern, E. Alonso and D. O'Neil, The use of SS7 and GSM to support high density personal communications,Proc. Int. Conf. on Communications ICC '92 (1992).
R. Thomas, H. Gilbert and G. Mazziotto, Influence of the movement of the mobile station on the performance of a radio cellular network,Proc. 3rd Nordic Seminar (1988) Paper 9.4.
H. Xie, S. Tabbane and D.J. Goodman, Dynamic location area management and performance analysis,Proc. IEEE Veh. Tech. Conf. (1993).
S. Tabbane, Comparison between the alternative location strategy and the classical location strategy, WINLAB Technical Report No. 37 (1992).
A. Bar-Noy and I. Kessler, Tracking mobile users in wireless networks,INFOCOMM '93 (1993) pp. 1232–1239.
S. Tabbane, Evaluation of an alternative location strategy for future high density wireless communications systems, WINLAB Technical Report No. 51 (1993).
G. Pollini and S. Tabbane, The intelligent network signaling and switching cost of an alternative location strategy using memory,IEEE VTC '93 (1993).
J.Z. Wang, A fully distributed location registration strategy for universal personal communication systems, IEEE J. SAC 11 (1993) 850–860.
S. Okasaka, S. Onoe, S. Yasuda and A. Maebara, A new location updating method for digital cellular systems,IEEE VTC '91 (1991) pp. 345–350.
B. Awerbuch and D. Peleg, Concurrent online tracking of mobile users,Proc. ACM SIGCOMM Symp. on Communication, Architecture and Protocols (1991).
C. Rose, Minimizing the average cost of paging and registration: A timer-based method,ICC95 (1995), also submitted for publication.
C. Rose, State-based paging/registration: A greedy technique, Winlab Technical Report, (TR-92) (1994), submitted for publication.
D.P. Bertsekas,Constrained Optimization and Lagrange Multiplier Methods (Academic Press, San Diego, CA, 1982).
F.B. Hildebrand,Advanced Calculus for Applications (Prentice Hall, Englewood Cliffs, NJ, 1976).
D.P. Bertsekas,Dynamic Programming (Prentice Hall, Englewood Cliffs, NJ, 1987).
G.F. Simmons,Differential Equations with Applications and Historical Notes (Mc Graw-Hill, New York, NY, 1972).
A. Papoulis,Probability, Random Variables, and Stochastic Processes (McGraw-Hill, New York, 1965).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rose, C., Yates, R. Minimizing the average cost of paging under delay constraints. Wireless Netw 1, 211–219 (1995). https://doi.org/10.1007/BF01202543
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01202543