Optimal sequential paging in cellular wireless networks

  • Authors:

  • Bhaskar Krishnamachari;Rung-Hung Gau;Stephen B. Wicker;Zygmunt J. Haas

  • Affiliations:

  • Department of Electrical Engineering, University of Southern California, Los Angeles, CA;Institute of Communications Engineering, National Sun Yat-Sen University, Kaoshiung, Taiwan, ROC;School of Electrical and Computer Engineering, Cornell University, Ithaca, NY;School of Electrical and Computer Engineering, Cornell University, Ithaca, NY

  • Venue:
  • Wireless Networks
  • Year:
  • 2004

Quantified Score

Hi-index 0.06

Visualization

Abstract

In a high-capacity cellular network with limited spectral resources, it is desirable to minimize the radio bandwidth costs associated with paging when locating mobile users. Sequential paging, in which cells in the coverage area are partitioned into groups and paged in a non-increasing order of user location probabilities, permits a reduction in the average radio costs of paging at the expense of greater delay in locating the users. We present a polynomial time algorithm for minimizing paging cost under the average delay constraint, a problem that has previously been considered intractable. We show the conditions under which cluster paging, a simple heuristic technique proposed for use with dynamic location update schemes, is optimal. We also present analytical results on the average delay and paging cost obtained with sequential paging, including tight bounds.