370 search results - page 36 / 74 » Improved Approximation Algorithms for Connected Sensor Cover |
134
click to vote
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
This paper proposes a guaranteed robust bounded-error distributed estimation algorithm. It may be employed to perform parameter estimation from data collected in a network of wire...
100
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
—Many sensor network protocols in the literature implicitly assume that sensor nodes are deployed uniformly inside a simple geometric region. When the real deployment deviates fr...
130
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
121
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gatewa...
115
click to vote
DIALM
2004
ACM
15 years 8 months ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...