460 search results - page 36 / 92 » Bounding the locality of distributed routing algorithms |
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—We are interested in topological analysis and processing of the large-scale distributed data generated by sensor networks. Naturally a large-scale sensor network is depl...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
ISPA
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. In mobile ad hoc networks (MANETs), networks can be partitioned into clusters. Clustering algorithms are localized algorithms that have the property of creating an upper ...
SPAA
2009
ACM
14 years 3 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
ICASSP
2010
IEEE
13 years 9 months ago
2010
IEEE
This paper proposes a guaranteed robust bounded-error distributed estimation algorithm. It may be employed to perform parameter estimation from data collected in a network of wire...