3047 search results - page 513 / 610 » Randomized Parallel Selection |
116
click to vote
ICDCS
2010
IEEE
15 years 6 months ago
2010
IEEE
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
133
click to vote
PODC
2010
ACM
15 years 6 months ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
133
Voted
DCOSS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
115
Voted
DCOSS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We present a comparative mathematical analysis of two important distinct approaches to hybrid push-pull querying in wireless sensor networks: structured hash-based data-c...
147
Voted
DCOSS
2006
Springer
15 years 6 months ago
2006
Springer
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...