Amortized efficiency of list update and paging rules
Communications of the ACM
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The weighted majority algorithm
Information and Computation
Lower bounds on the competitive ration for mobile user tracking and distributed job scheduling
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Online tracking of mobile users
Journal of the ACM (JACM)
Competitive algorithms for distributed data management
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Adaptive paging algorithms for cellular systems
Wireless information networks
Location update optimization in personal communication systems
Wireless Networks
Minimizing queuing delays and number of messages in mobile phone location
Mobile Networks and Applications - Special issue: mobility management
Minimizing the average cost of paging under delay constraints
Wireless Networks
LeZi-update: an information-theoretic framework for personal mobility tracking in PCS networks
Wireless Networks - Selected Papers from Mobicom'99
Mobile Cellular Telecommunications Systems
Mobile Cellular Telecommunications Systems
Gambling in a rigged casino: The adversarial multi-armed bandit problem
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Concurrent search of mobile users in cellular networks
IEEE/ACM Transactions on Networking (TON)
Optimal sequential paging in cellular wireless networks
Wireless Networks
Establishing wireless conference calls under delay constraints
Journal of Algorithms
Location uncertainty in mobile networks: a theoretical framework
IEEE Communications Magazine
Finding mobile data: efficiency vs. location inaccuracy
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Finding mobile data under delay constraints with searching costs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A PTAS for delay minimization in establishing wireless conference calls
Discrete Optimization
Paging mobile users in cellular networks: Optimality versus complexity and simplicity
Theoretical Computer Science
| Hi-index | 0.00 |
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.