47 search results - page 8 / 10 » On Geometric Spanners of Euclidean and Unit Disk Graphs |
PODC
2006
ACM
14 years 1 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
DCOSS
2009
Springer
14 years 5 days ago
2009
Springer
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E)...
COMPGEOM
2004
ACM
14 years 29 days ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
CCCG
2010
13 years 5 months ago
2010
Various notions of coverage provided by wireless sensor networks have attracted considerable attention over the past few years. In general, coverage can be expressed geometrically...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We show for several planar and geometric problems that the best known approximation schemes are essentially optimal with respect to the dependence on ǫ. For example, we show that...