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. The algorithm can be implemented without exact knowledge of the node positions, if each node is able to sense its distance to other nodes up to the cluster radius. Such a kinetic clustering can be used in numerous applications where mobile devices must be interconnected into an ad-hoc network to collaboratively perform some task.
Citations
|
7709
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
1579
|
Computational ge-ometry - an introduction
– Preparata, Shamos
|
|
383
|
Concrete Mathematics
– Graham, Knuth, et al.
- 1989
|
|
382
|
Mitigating Routing Misbehavior in Mobile Ad Hoc Networks
– Marti, Giuli, et al.
|
|
371
|
A Threshold of ln n for Approximating Set Cover
– Feige
- 1998
|
|
210
|
Data structures for mobile data
– Basch, Guibas, et al.
- 1999
|
|
204
|
A Course in Combinatorics
– Lint, Wilson
- 1992
|
|
174
|
On calculating connected dominating set for efficient routing in ad hoc wireless networks
– Wu, Li
- 1999
|
|
161
|
Approximation algorithms for connected dominating sets
– Guha, Khuller
- 1998
|
|
159
|
Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel
– Chiang, Wu, et al.
- 1997
|
|
143
|
Distributed clustering for ad hoc networks
– Basagni
- 1999
|
|
124
|
Max-min d-cluster formation in wireless ad hoc networks
– Amis, Prakash, et al.
- 2000
|
|
120
|
Approximation schemes for covering and packing problems in image processing and VLSI
– Hochbaum, Maass
- 1985
|
|
78
|
Optimal packing and covering in the plane are NP-complete
– Fowler, Paterson, et al.
- 1981
|
|
75
|
multimedia radio network
– Multicluster
- 1995
|
|
72
|
Kinetic data structures — a state of the art report
– Guibas
- 1998
|
|
66
|
NC-Approximation schemes for NP- and PSPACE-hard problems for geometric graphs
– Marathe, Radhakrishnan, et al.
- 1998
|
|
45
|
Proximity problems on moving points
– Basch, Guibas, et al.
- 1997
|
|
18
|
An Architecture for Mobile Radio Networks With Dynamically Changing Topology Using Virtual Subnets
– Sharony
- 1996
|
|
10
|
Lower bounds for kinetic planar subdivisions
– Agarwal, Basch, et al.
- 1999
|
|
10
|
Mobile facility location
– Bespamyatnikh, Bhattacharya, et al.
- 2000
|
|
