Competitive on-line paging strategies for mobile users under delay constraints

A mobile user is roaming in a zone of n cells in a cellular network system. When a call for the mobile arrives, the system pages the mobile in these cells since it never reports its location unless it leaves the zone. A delay constraint paging strategy must find the mobile after at most 1 ≤ D ≤ n paging rounds each pages a subset of the n cells. The goal is to minimize the number of paged cells until the mobile is found. Optimal solutions are known for the off-line case, for which an a priori probability of a mobile residing in any one of the cells is known. In this paper we address the on-line case. An on-line paging strategy makes its decisions based only on past locations of the mobile while trying to learn its future locations.We present deterministic and randomized on-line algorithms for various values of D (number of paging rounds) as a function of n (number of cells) and evaluate them using competitive analysis. In particular, we present a constant competitive on-line algorithm for the two extreme cases of D=2 and D=n. The former is the first nontrivial delay constraint case and the latter is the case for which there are no delay constraints. We then show that the constant competitiveness can be attained already for D ≥ log2n. All of the above algorithms are deterministic. Our randomized on-line algorithm achieves a near optimal performance for all values of D. This algorithm is based on solutions to the best expert problem.

[1]  Amotz Bar-Noy,et al.  Establishing wireless conference calls under delay constraints , 2002, PODC '02.

[2]  Stephen B. Wicker,et al.  Optimal Sequential Paging in Cellular Networks , 2001 .

[3]  William C. Y. Lee,et al.  Mobile Cellular Telecommunications Systems , 1989 .

[4]  Stephen B. Wicker,et al.  Optimal Sequential Paging in Cellular Wireless Networks , 2004, Wirel. Networks.

[5]  Amotz Bar-Noy,et al.  Establishing a mobile conference call under delay and bandwidth constraints , 2004, IEEE INFOCOM 2004.

[6]  Ian F. Akyildiz,et al.  An optimal paging scheme for minimizing signaling costs under delay bounds , 2001, IEEE Communications Letters.

[7]  Rung-Hung Gau,et al.  Concurrently searching for mobile users in cellular networks , 2003, IEEE Communications Letters.

[8]  Noga Alon,et al.  Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling , 1994, Theor. Comput. Sci..

[9]  Kalyan Basu,et al.  Adaptive paging algorithms for cellular systems , 1995, 1995 IEEE 45th Vehicular Technology Conference. Countdown to the Wireless Twenty-First Century.

[10]  Nicolò Cesa-Bianchi,et al.  Gambling in a rigged casino: The adversarial multi-armed bandit problem , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[11]  Manfred K. Warmuth,et al.  The weighted majority algorithm , 1989, 30th Annual Symposium on Foundations of Computer Science.

[12]  Roy D. Yates,et al.  Minimizing the average cost of paging under delay constraints , 1995, Wirel. Networks.

[13]  David J. Goodman,et al.  Cellular packet communications , 1990, IEEE Trans. Commun..

[14]  Roy D. Yates,et al.  Ensemble polling strategies for increased paging capacity in mobile communication networks , 1997, Wirel. Networks.

[15]  Victor O. K. Li,et al.  Location update optimization in personal communication systems , 1997, Wirel. Networks.

[16]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[17]  Ian F. Akyildiz,et al.  Mobility Management in Next Generation Wireless Systems , 1999, ICCCN.

[18]  Paul M. B. Vitányi,et al.  Distributed match-making , 1988, Algorithmica.

[19]  Adam Tauman Kalai,et al.  Static Optimality and Dynamic Search-Optimality in Lists and Trees , 2002, SODA '02.

[20]  David Haussler,et al.  How to use expert advice , 1993, STOC.

[21]  Yuval Rabani,et al.  Competitive Algorithms for Distributed Data Management , 1995, J. Comput. Syst. Sci..

[22]  Baruch Awerbuch,et al.  Online tracking of mobile users , 1995, JACM.

[23]  Ian F. Akyildiz,et al.  Effective Paging Schemes with Delay Bounds as QoS Constraints in Wireless Systems , 2001, Wirel. Networks.

[24]  P. Krishnan,et al.  Minimizing queuing delays and number of messages in mobile phone location , 1996, Mob. Networks Appl..

[25]  Sajal K. Das,et al.  LeZi-Update: An Information-Theoretic Framework for Personal Mobility Tracking in PCS Networks , 2002, Wirel. Networks.

[26]  Roy D. Yates,et al.  Location uncertainty in mobile networks: a theoretical framework , 1997 .

[27]  Victor O. K. Li,et al.  Paging strategy optimization in personal communication systems , 1997, Wirel. Networks.