Skip to main content
SpringerLink
Log in

Tracking Moving Objects with Few Handovers

  • Conference paper
Algorithms and Data Structures (WADS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6844))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Smorodinsky, S.: Conflict-free colorings of shallow discs. In: Proc. 22nd Symp. on Computational Geometry (SoCG), pp. 41–43. ACM, New York (2006)

    Google Scholar 

  2. Cho, M., Mount, D., Park, E.: Maintaining Nets and Net Trees under Incremental Motion. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 1134–1143. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Eppstein, D., Goodrich, M.T.: Studying (non-planar) road networks through an algorithmic lens. In: GIS 2008: Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 1–10 (2008)

    Google Scholar 

  4. Eppstein, D., Goodrich, M.T., Löffler, M.: Tracking moving objects with few handovers, arXiv.org/abs/1105.0392 (2011)

    Google Scholar 

  5. Eppstein, D., Goodrich, M.T., Trott, L.: Going off-road: transversal complexity in road networks. In: Proc. 17th ACM SIGSPATIAL Int. Conf. on Advances in Geographic Information Systems (ACM GIS), pp. 23–32. ACM, New York (2009)

    Google Scholar 

  6. Ghica, O., Trajcevski, G., Zhou, F., Tamassia, R., Scheuermann, P.: Selecting Tracking Principals with Epoch Awareness. In: Proc. 18th ACM SIGSPATIAL Internat. Conf. on Advances in Geographic Information Systems, ACM GIS (2010)

    Google Scholar 

  7. Guibas, L., Hershberger, J., Suri, S., Zhang, L.: Kinetic Connectivity for Unit Disks. Discrete Comput. Geom. 25(4), 591–610 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Guibas, L.J.: Kinetic data structures — a state of the art report. In: Agarwal, P.K., Kavraki, L.E., Mason, M. (eds.) Proc. Workshop Alg. Found. Robot., pp. 191–209 (1998)

    Google Scholar 

  9. He, G., Hou, J.: Tracking targets with quality in wireless sensor networks. In: 13th IEEE Conf. on Network Protocols (ICNP), pp. 1–12 (2005)

    Google Scholar 

  10. Irani, S., Seiden, S.: Randomized algorithms for metrical task systems. Theor. Comput. Sci. 194(1-2), 163–182 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  11. Miller, G.L., Teng, S.-H., Thurston, W., Vavasis, S.A.: Separators for sphere-packings and nearest neighbor graphs. J. ACM 44, 1–29 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  12. Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: A computational framework for incremental motion. In: Proc. 20th Symp. on Computational Geometry (SoCG), pp. 200–209. ACM, New York (2004)

    Google Scholar 

  13. Overmars, M., van der Stappen, F.: Range Searching and Point Location among Fat Objects. J. Algorithms 21(3), 629–656 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  14. Pattem, S., Poduri, S., Krishnamachari, B.: Energy-Quality Tradeoffs for Target Tracking in Wireless Sensor Networks. In: Zhao, F., Guibas, L. (eds.) IPSN 2003. LNCS, vol. 2634, pp. 32–46. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28, 202–208 (1985)

    Article  MathSciNet  Google Scholar 

  16. Tekinay, S., Jabbari, B.: Handover and channel assignment in mobile cellular networks. IEEE Communications Magazine 29(11), 42–46 (1991)

    Article  Google Scholar 

  17. van Leeuwen, E.J.: Better Approximation Schemes for Disk Graphs. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 316–327. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  18. Yang, Z., Liu, Y.: Quality of Trilateration: Confidence-Based Iterative Localization. IEEE Trans. on Parallel and Distributed Systems 21(5), 631–640 (2010)

    Article  Google Scholar 

  19. Yao, A.: Probabilistic computations: Toward a unified measure of complexity. In: 18th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 222–227 (1977)

    Google Scholar 

  20. Yi, K., Zhang, Q.: Multi-dimensional online tracking. In: Proc. of the 20th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 1098–1107. SIAM, Philadelphia (2009)

    Google Scholar 

  21. Zhao, F., Shin, J., Reich, J.: Information-driven dynamic sensor collaboration. IEEE Signal Processing Magazine 19(2), 61–72 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Univ. of California, Irvine, USA

    David Eppstein, Michael T. Goodrich & Maarten Löffler

Authors
  1. David Eppstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael T. Goodrich
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maarten Löffler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Parallel Computing and Bioinformatics Laboratory, Carleton University, VISM Building, Room 6210, 1125 Colonel By Drive, K1S 5B6, Ottawa, ON, Canada

    Frank Dehne

  2. Department of Computer Science and Engineering, Polytechnic Institute of New York University, 5 MetroTech Center, 11201, New York, NY, USA

    John Iacono

  3. School of Computer Science, Herzberg Laboratories, Carleton University, Herzberg Building, Room 5350, 1125 Colonel By Drive, K1S 5B6, Ottawa, ON, Canada

    Jörg-Rüdiger Sack

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eppstein, D., Goodrich, M.T., Löffler, M. (2011). Tracking Moving Objects with Few Handovers. In: Dehne, F., Iacono, J., Sack, JR. (eds) Algorithms and Data Structures. WADS 2011. Lecture Notes in Computer Science, vol 6844. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22300-6_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22300-6_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22299-3

  • Online ISBN: 978-3-642-22300-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation