Robust distributed estimation in sensor networks using the embedded polygons algorithm
Authors:
Open Access
- 26 April 2004
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 405-413
Abstract
Conference PaperWe propose a new iterative distributed algorithm for linear minimum mean-squared-error (LMMSE) estimation in sensor networks whose measurements follow a Gaussian hidden Markov graphical model with cycles. The embedded polygons algorithm decomposes a loopy graphical model into a number of linked embedded polygons and then applies a parallel block Gauss-Seidel iteration comprising local LMMSE estimation on each polygon (involving inversion of a small matrix) followed by an information exchange between neighboring nodes and polygons. The algorithm is robust to temporary communication faults such as link failures and sleeping nodes and enjoys guaranteed convergence under mild conditions. A simulation study indicates that energy consumption for iterative estimation increases substantially as more links fail or nodes sleep. Thus, somewhat surprisingly, energy conservation strategies such as low-powered transmission and aggressive sleep schedules could actually be counterproductiveKeywords
This publication has 8 references indexed in Scilit:
- Coverage in wireless ad hoc sensor networksIEEE Transactions on Computers, 2003
- Energy-efficient DSPs for wireless sensor networksIEEE Signal Processing Magazine, 2002
- Correctness of Belief Propagation in Gaussian Graphical Models of Arbitrary TopologyNeural Computation, 2001
- On asynchronous iterationsJournal of Computational and Applied Mathematics, 2000
- Next century challenges1999
- The quickhull algorithm for convex hullsACM Transactions on Mathematical Software, 1996
- Graphical Models1996
- Statistics for Spatial Data1993