Locally constructed algorithms for distributed computations in ad-hoc networks
In this paper we develop algorithms for distributed computation of a broad range of estimation and detection tasks over networks with arbitrary but fixed connectivity. The distributed algorithms we develop are linear dynamical systems that generate sequences of approximations to the desired computat...
Saved in:
Published in | Information Processing In Sensor Networks: Proceedings of the third international symposium on Information processing in sensor networks; 26-27 Apr. 2004 pp. 11 - 19 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
New York, NY, USA
ACM
01.01.2004
IEEE |
Series | ACM Conferences |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In this paper we develop algorithms for distributed computation of a broad range of estimation and detection tasks over networks with arbitrary but fixed connectivity. The distributed algorithms we develop are linear dynamical systems that generate sequences of approximations to the desired computation. The algorithms are locally constructed at each node by exploiting only locally available and macro-scopic information about the network topology. We present methods for designing these distributed algorithms so as to optimize the convergence rates to the desired computation and demonstrate their performance characteristics in the context of a problem of signal estimation from multi-node signal observations in Gaussian noise. |
---|---|
Bibliography: | SourceType-Conference Papers & Proceedings-1 ObjectType-Conference Paper-1 content type line 25 |
ISBN: | 1581138466 9781581138467 |
DOI: | 10.1145/984622.984625 |