Abstract
We study the online problem of assigning a moving point to a base-station region that contains it. Our goal is to minimize the number of handovers that occur when the point moves outside its assigned region and must be assigned to a new one. We study this problem in terms of a competitive analysis measured as a function of Δ, the ply of the system of regions, that is, the maximum number of regions that cover any single point. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Eppstein, D., Goodrich, M. T., & Löffler, M. (2011). Tracking moving objects with few handovers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6844 LNCS, pp. 362–373). https://doi.org/10.1007/978-3-642-22300-6_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
