Robust distributed estimation in sensor networks using the embedded polygons algorithm

ABSTRACT

We 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 counterproductive.

References

1. D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, "Next century challenges: Scalable coordination in sensor networks," in Proc. ACM/IEEE MobiCom'99, pp. 263--270, Aug. 1999.
2. A. Wang and A. Chandrakasan, "Energy-eficient DSPs for wireless sensor networks," IEEE Signal Processing Mag., pp. 68--78, July 2002.
3. S. L. Lauritzen, Graphical Models. Oxford, 1996.
4. C. B. Barber, D. P. Dobkin, and H. T. Huhdanpaa, "The Quickhull algorithm for convex hulls," ACM Trans. Math. Software, vol. 22, no. 4, pp. 469--483, 1996.
5. K. Plarre and P. R. Kumar, "Extended message passing algorithm for inference in loopy Gaussian graphical models," Ad Hoc Networks, 2002.
6. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
7. Y. Weiss and W. T. Freeman, "Correctness of belief propagation in Gaussian graphical models of arbitrary topology," Neural Computation, vol. 13, pp. 2173--2200, 2001.
8. M. J. Wainwright, Stochastic Processes on Graphs with Cycles: Geometric and Variational Approaches. PhD thesis, ECE Dept., MIT, Jan. 2002.
9. E. Sudderth, M. J. Wainwright, and A. S. Willsky, "Embedded trees: Estimation of Gaussian processes on graphs with cycles," tech. rep., MIT, 2003.
10. V. Delouille, R. Neelamani, V. Chandrasekaran, and R. G. Baraniuk, "The embedded triangles algorithm for distributed estimation in sensor networks," in IEEE Statistical Signal Processing Workshop, (St. Louis), pp. 357--360, 2003.
11. R. G. Cowell, A. P. Dawid, S. L. Lauritzen, and D. J. Spiegelhalter, Probabilistic Networks and Expert Systems. Springer, 1999.
12. J. Liebeherr, M. Nahas, and W. Si, "Application-layer multicast with Delaunay triangulations," tech. rep., CS Dept., University of Virginia, 2001.
13. X.-Y. Li, P.-J. Wan, and O. Frieder, "Coverage in wireless ad-hoc sensor networks," IEEE Trans. Computers, vol. 52, pp. 727--741, June 2003.
14. N. A. C. Cressie, Statistics for Spatial Data. Wiley, 1993.
15. R. S. Varga, Matrix Iterative Analysis. Prentice-Hall, 1962.
16. A. Abdalla, N. Deo, and P. Gupta, "Random-tree diameter and diameter-constrained MST," Congressus Numerantium, vol. 144, pp. 161--182, 2000.
17. J.-F. Chamberland and V. V. Veeravalli, "The art of sleeping in wireless sensing systems," in IEEE Statistical Signal Processing Workshop, (St. Louis), pp. 9--12, 2003.
18. Y. Xu, S. Bien, Y. Mori, J. Heidemann, and D. Estrin, "Topology control protocols to conserve energy in wireless ad hoc networks," Tech. Rep. 6, UCLA, Center for Embedded Networked Computing, Jan. 2003.
19. A. Frommer and B. Szyld, "On asynchronous iterations," J. Comput. Appl. Math., vol. 123, pp. 201--216, 2000.

Index Terms

• Applied computing

  • Physical sciences and engineering

    • Engineering

• Mathematics of computing

  • Probability and statistics

    • Statistical paradigms

      • Statistical graphics