78 search results - page 7 / 16 » A Randomized Algorithm for Gossiping in Radio Networks |
128
click to vote
FCT
2005
Springer
15 years 8 months ago
2005
Springer
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
134
Voted
DCOSS
2006
Springer
15 years 6 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
131
click to vote
ESA
2004
Springer
15 years 8 months 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...
117
click to vote
MOBISYS
2004
ACM
16 years 2 months ago
2004
ACM
In this paper, we investigate the impact of radio irregularity on the communication performance in wireless sensor networks. Radio irregularity is a common phenomenon which arises...
119
Voted
PODC
2009
ACM
15 years 7 months ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...