Effective paging schemes with delay bounds as QoS constraints in wireless systems

  • Authors:
  • Wenye Wang;Ian F. Akyildiz;Gordon L. Stüber;Boo-Young Chung

  • Affiliations:
  • Georgia Institute of Technology, Atlanta, GA;Georgia Institute of Technology, Atlanta, GA;Georgia Institute of Technology, Atlanta, GA and IEEE;Korea Telecom Access Network Laboratory, 17 Woomyun-Dong, Seocho-Gu, Seoul 137792, Korea

  • Venue:
  • Wireless Networks
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper new paging schemes are presented for locating mobile users in wireless networks. Paging costs and delay bounds are considered since paging costs are 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 costs, three new paging schemes, reverse, semi-reverse and uniform, are introduced to provide a simple way of partitioning the service areas and decrease the paging costs based on each mobile terminal's location probability distribution. Numerical results demonstrate that our approaches significantly reduce the paging costs for various probability distributions such as uniform, truncated discrete Gaussian, and irregular distributions.