Wireless Networks

, Volume 1, Issue 2, pp 211–219

Minimizing the average cost of paging under delay constraints

  • Christopher Rose
  • Roy Yates
Article

DOI: 10.1007/BF01202543

Cite this article as:
Rose, C. & Yates, R. Wireless Netw (1995) 1: 211. doi:10.1007/BF01202543

Abstract

Efficient paging procedures help minimize the amount of bandwidth expended in locating a mobile unit. Given a probability distribution on user location, it is shown that the optimal paging strategy which minimizes the expected number of locations polledE[L] is to query each location sequentially in order of decreasing probability. However, since sequential search over many locations may impose unacceptable polling delay,D, optimal paging subject to delay constraints is considered. It is shown that substantial reductions inE[L] can be had even after moderate constraints are imposed on acceptableD (i.e.,D<-3).

Since all methods of mobility management eventually reduce to considering a time-varying probability distribution on user location, this work should be applicable to a wide range of problems in the area. most notably those with additive cost structures.

Copyright information

© J.C. Baltzer AG, Science Publishers 1995

Authors and Affiliations

  • Christopher Rose
    • 1
  • Roy Yates
    • 1
  1. 1.Department of Electrical and Computer EngineeringRutgers UniversityPiscatawayUSA