661 search results - page 5 / 133 » On Distributed Computation in Noisy Random Planar Networks |
SODA
2008
ACM
13 years 8 months ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
EWSN
2008
Springer
14 years 7 months ago
2008
Springer
Abstract. A localization algorithm using radio interferometric measurements is presented. A probabilistic model is constructed that accounts for general noise models and lends itse...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we use random-selection protocols in the full-information model to solve classical problems in distributed computing. Our main results are the following: • An O(l...
CMSB
2009
Springer
14 years 1 months ago
2009
Springer
Molecular noise, which arises from the randomness of the discrete events in the cell, significantly influences fundamental biological processes. Discrete-state continuous-time st...
DCOSS
2006
Springer
13 years 11 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...