Discrete & Computational Geometry

, Volume 30, Issue 1, pp 45–63

Discrete Mobile Centers

  •  Gao
  •  Guibas
  •  Hershberger
  •  Zhang
  •  Zhu

DOI: 10.1007/s00454-003-2925-6

Cite this article as:
Gao, Guibas, Hershberger et al. Discrete Comput Geom (2003) 30: 45. doi:10.1007/s00454-003-2925-6

Abstract. We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a variable subset of the nodes as cluster centers. This subset has the property that (1) balls of the given radius centered at the chosen nodes cover all the others and (2) the number of centers selected is a constant-factor approximation of the minimum possible. As the nodes move, an event-based kinetic data structure updates the clustering as necessary. This kinetic data structure is shown to be responsive, efficient, local, and compact. The produced cover is also smooth, in the sense that wholesale cluster re-arrangements are avoided. This clustering algorithm is distributed in nature and can enable numerous applications in ad hoc wireless networks, where mobile devices must be interconnected to perform various tasks collaboratively.

Copyright information

© 2003 Springer-Verlag New York Inc.

Authors and Affiliations

  •  Gao
    • 1
  •  Guibas
    • 1
  •  Hershberger
    • 2
  •  Zhang
    • 3
  •  Zhu
    • 1
  1. 1.Department of Computer Science, Stanford University, Stanford, CA 94305, USA jgao@cs.stanford.edu, guibas@cs.stanford.edu, anzhu@cs.stanford.edu US
  2. 2.Mentor Graphics, 8005 S.W. Boeckman Road, Wilsonville, OR 97070, USA john_hershberger@mentor.com US
  3. 3.Compaq Systems Research Center, 130 Lytton Avenue, Palo Alto, CA 94301, USA l.zhang@compaq.comUS

Personalised recommendations