Tracking mobile users in cellular networks using timing information

Authors:
Evangelos Kranakis;Danny Krizanc;Sunil Shende
Affiliations:
School of Computer Science, Carleton University, Ottawa, ON, Canada;Department of Mathematics and Computer Science, Wesleyan Universiry, Middletown, CT;Department of Computer Science, Rutgers University, Camden, NJ
Venue:
Nordic Journal of Computing
Year:
2008

Citing 8
Cited 0

Concurrent online tracking of mobile users

SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Recontamination does not help to search a graph

Journal of the ACM (JACM)
Topology-based tracking strategies for personal communication networks

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
Tracking mobile users with uncertain parameters

Wireless Networks
Establishing wireless conference calls under delay constraints

Journal of Algorithms
Location uncertainty in mobile networks: a theoretical framework

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of tracking a mobile user moving through a cellular network using node queries that provide information as to last time the user visited the node. Queries are executed in rounds, each round may involve queries to many nodes simultaneously, and the user may move at the same time that queries are performed. The cost measures considered are the number of rounds required to find the user and the total number of queries made during the execution of the algorithm. We present a number of algorithms for general networks, as well as upper and lower bounds for specific network topologies.