Reducing the paging costs under delay bounds for PCS networks

New paging schemes are presented for locating mobile users in wireless networks. Paging costs and delay bounds are considered since the paging cost is associated with bandwidth utilization and delay bounds influence call setup time. In general, location tracking schemes require intensive computation to search for a mobile terminal in current PCS networks. To reduce the paging cost, three new paging schemes-reverse, semi-reverse and uniform-are introduced to provide a simple way of partitioning the service areas and accordingly minimizing the paging cost based on each mobile terminal´s location probability distribution. Numerical results demonstrate that our approaches significantly reduce the paging cost for various location probability distributions such as uniform, truncated discrete Gaussian, and irregular distributions