Movement-based location update and selective paging for PCS networks

This paper introduces a mobility tracking mechanism that combines a movement-based location update policy with a selective paging scheme. Movement-based location update is selected for its simplicity. It does not require each mobile terminal to store information about the arrangement and the distance relationship of all cells. In fact, each mobile terminal only keeps a counter of the number of cells visited. A location update is performed when this counter exceeds a predefined threshold value. This scheme allows the dynamic selection of the movement threshold on a per-user basis. This is desirable as different users may have very different mobility patterns. Selective paging reduces the cost for locating a mobile terminal in the expense of an increase in the paging delay. We propose a selective paging scheme which significantly decreases the location tracking cost under a small increase in the allowable paging delay. We introduce an analytical model for the proposed location tracking mechanism which captures the mobility and the incoming call arrival patterns of each mobile terminal. Analytical results are provided to demonstrate the cost-effectiveness of the proposed scheme under various parameters.

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

[2]  I. G. MacKenzie,et al.  Stochastic Processes with Applications , 1992 .

[3]  Ian F. Akyildiz,et al.  A dynamic mobility tracking policy for wireless personal communications networks , 1995, Proceedings of GLOBECOM '95.

[4]  Bruce Hajek,et al.  Optimization by simulated annealing: a time-complexity analysis , 1987 .

[5]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[6]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[7]  N. L. Johnson,et al.  Continuous Univariate Distributions. , 1995 .

[8]  Ian F. Akyildiz,et al.  Mobile user location update and paging under delay constraints , 1995, Wirel. Networks.

[9]  Ian F. Akyildiz,et al.  Dynamic mobile user location update for wireless PCS networks , 1995, Wirel. Networks.

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

[11]  D. Anderson,et al.  Algorithms for minimization without derivatives , 1974 .

[12]  David J. Goodman,et al.  Dynamic location area management and performance analysis , 1993, IEEE 43rd Vehicular Technology Conference.

[13]  Yi-Bing Lin,et al.  Modeling hierarchical microcell/macrocell PCS architecture , 1995, Proceedings IEEE International Conference on Communications ICC '95.

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

[15]  Ravi Jain,et al.  A caching strategy to reduce network impacts of PCS , 1994, IEEE J. Sel. Areas Commun..

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

[17]  Yi-Bing Lin Reducing location update cost in a PCS network , 1997, TNET.

[18]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.