661 search results - page 24 / 133 » On Distributed Computation in Noisy Random Planar Networks |
ICDCS
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper, we propose a novel duty cycling algorithm for large-scale dense wireless sensor networks. The proposed algorithm is based on a social behavior of nodes in the se...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper, we address the problem of the sensor placement for estimating the direction of a narrow-band source, randomly located in the far-field of a planar antenna array. E...
PODC
2004
ACM
15 years 3 months ago
2004
ACM
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
PODC
2006
ACM
15 years 3 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...