An optimal partition algorithm for minimization of paging costs

A novel paging scheme under delay bounds is proposed for personal communication systems. This paging scheme is independent of the location probability distributions of the mobile users and satisfies the delay bounds, while minimizing the amount of bandwidth used for locating a mobile user. The proposed paging scheme includes the optimal partition algorithm and paging procedure with respect to paging costs and average delays. The numerical results demonstrate that the proposed scheme is very effective in the minimization of the paging costs for location probability conditions such as uniform and non-uniform distributions