23 search results - page 5 / 5 » 3d local algorithm for dominating sets of unit disk graphs |
OPODIS
2004
13 years 6 months ago
2004
A localized Delaunay triangulation owns the following interesting properties in a wireless ad hoc setting: it can be built with localized information, the communication cost impos...
ICDCS
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
CLUSTER
2002
IEEE
13 years 4 months ago
2002
IEEE
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...