Sciweavers

IPSN
2004
Springer

Locally constructed algorithms for distributed computations in ad-hoc networks

14 years 5 months ago
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 computation. The algorithms are locally constructed at each node by exploiting only locally available and macroscopic 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. Categories and Subject Descriptors C.2.4 [Computer-Communication Networks]: Distributed Systems—distributed applications General Terms Algorithms Keywords Sensor networks, distributed algorithms, distributed estimation
Dzulkifli S. Scherber, Haralabos C. Papadopoulos
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where IPSN
Authors Dzulkifli S. Scherber, Haralabos C. Papadopoulos
Comments (0)