242 search results - page 3 / 49 » Approximately uniform random sampling in sensor networks |
ALGOSENSORS
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
ISCC
2006
IEEE
13 years 11 months ago
2006
IEEE
— Even for a specific application, the design space of wireless sensor networks is enormous, and traditional disciplinary boundaries are disappearing in the search for efficien...
ICALP
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
INFOCOM
2007
IEEE
13 years 11 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...