Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published July 30, 2007 | public
Book Section - Chapter Open

Estimation over Communication Networks: Performance Bounds and Achievability Results

Abstract

This paper considers the problem of estimation over communication networks. Suppose a sensor is taking measurements of a dynamic process. However the process needs to be estimated at a remote location connected to the sensor through a network of communication links that drop packets stochastically. We provide a framework for computing the optimal performance in the sense of expected error covariance. Using this framework we characterize the dependency of the performance on the topology of the network and the packet dropping process. For independent and memoryless packet dropping processes we find the steady-state error for some classes of networks and obtain lower and upper bounds for the performance of a general network. Finally we find a necessary and sufficient condition for the stability of the estimate error covariance for general networks with spatially correlated and Markov type dropping process. This interesting condition has a max-cut interpretation.

Additional Information

© Copyright 2007 IEEE. Reprinted with permission. [Posted online: 2007-07-30]

Files

DANacc07.pdf
Files (167.1 kB)
Name Size Download all
md5:f843023c2bcfdd1d5b32f29484239de6
167.1 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
March 5, 2024