242 search results - page 31 / 49 » Approximately uniform random sampling in sensor networks |
PERCOM
2006
ACM
14 years 6 months ago
2006
ACM
Typical packet traffic in a sensor network reveals pronouncedpatterns that allow an adversary analyzing packet traffic to deduce the location of a base station. Once discovered, t...
SPAA
2004
ACM
14 years 5 days ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
CCR
2006
13 years 6 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
ESA
2004
Springer
14 years 4 days ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
HICSS
2008
IEEE
13 years 6 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...