Tracking Moving Objects with Few Handovers

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.

[1]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[2]  Jennifer C. Hou,et al.  Tracking targets with quality in wireless sensor networks , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[3]  Leonidas J. Guibas,et al.  A practical evaluation of kinetic data structures , 1997, SCG '97.

[4]  David Eppstein,et al.  Studying (non-planar) road networks through an algorithmic lens , 2008, GIS '08.

[5]  Qin Zhang,et al.  Multi-dimensional online tracking , 2009, SODA.

[6]  Leonidas J. Guibas,et al.  Kinetic data structures: a state of the art report , 1998 .

[7]  Noga Alon,et al.  Conflict-free colorings of shallow discs , 2006, SCG '06.

[8]  Tarek F. Abdelzaher,et al.  Analysis of Target Detection Performance for Wireless Sensor Networks , 2005, DCOSS.

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

[10]  Bhaskar Krishnamachari,et al.  Energy-Quality Tradeoffs for Target Tracking in Wireless Sensor Networks , 2003, IPSN.

[11]  Feng Zhao,et al.  Information-driven dynamic sensor collaboration , 2002, IEEE Signal Process. Mag..

[12]  David M. Mount,et al.  Maintaining Nets and Net Trees under Incremental Motion , 2009, ISAAC.

[13]  Leonidas J. Guibas,et al.  Kinetic Connectivity for Unit Disks , 2001, Discret. Comput. Geom..

[14]  Rudolf Mathar,et al.  Estimating position and velocity of mobiles in a cellular radio network , 1997 .

[15]  Sandy Irani,et al.  Randomized Algorithms for Metrical Task Systems , 1995, Theor. Comput. Sci..

[16]  S. Tekinay,et al.  Handover and channel assignment in mobile cellular networks , 1991, IEEE Communications Magazine.

[17]  David M. Mount,et al.  A computational framework for incremental motion , 2004, SCG '04.

[18]  David Eppstein,et al.  Going off-road: transversal complexity in road networks , 2009, GIS.

[19]  E. J. V. Leeuwen.  Better Approximation Schemes for Disk Graphs , 2006, SWAT.

[20]  Mark H. Overmars,et al.  Range Searching and Point Location among Fat Objects , 1994, J. Algorithms.

[21]  Roberto Tamassia,et al.  Selecting tracking principals with epoch awareness , 2010, GIS '10.

[22]  Leonidas J. Guibas,et al.  Kinetic bsps for intersecting segments and disjoint triangles , 1998, SODA 1998.

[23]  Orhan Dagdeviren,et al.  Tracking Fast Moving Targets in Wireless Sensor Networks , 2010 .

[24]  Marek Chrobak,et al.  A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem , 1997, Inf. Process. Lett..

[25]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[26]  Gary L. Miller,et al.  Separators for sphere-packings and nearest neighbor graphs , 1997, JACM.