Adaptive paging algorithms for cellular systems

Adaptive algorithms which optimize the paging activity in a cellular system are presented. The basic approach is to use fixed interval registration rather than location areas to track the mobile location and employ a two step paging algorithm: first, page only those cells the mobile is most likely to be in (paging zone), and if no page response is received from them, then page the rest of the system also. In this paper, a novel method of computing the optimal paging zones is presented. The mobile switching center (MSC) continuously collects page response data in the location accuracy matrix (LAM). Using the LAM data, the mean probability of locating the mobile in any cell of the system at the time of paging, given its last known cell is computed. Several algorithms that use these probabilities to compute the optimal paging zones are presented.

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

[2]  Ivan Seskar,et al.  Rate of location area updates in cellular systems , 1992, [1992 Proceedings] Vehicular Technology Society 42nd VTS Conference - Frontiers of Technology.

[3]  Dieter Plassmann.  Location management strategies for mobile cellular networks of 3rd generation , 1994, Proceedings of IEEE Vehicular Technology Conference (VTC).

[4]  D. Munoz-Rodriguez.  Cluster paging for traveling subscribers , 1990, 40th IEEE Conference on Vehicular Technology.

[5]  Seshu Madhavapeddy.  Optimal Paging in Cellular Mobile Telephone Systems , 1994 .

[6]  Seizo Onoe,et al.  A new location updating method for digital cellular systems , 1991, [1991 Proceedings] 41st IEEE Vehicular Technology Conference.