Adaptive paging algorithms for cellular systems
Seshu Madhavapeddy, Kaustav Basu, A. Roberts · 2002
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.