Browse wiki

From MurrayWiki
Jump to: navigation, search
Estimation over Communication Networks: Performance Bounds and Achievability Results
Abstract This paper considers the problem of estima …
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. We also illustrate how this framework can be used in the synthesis of networks for the purpose of estimation. 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.
ng condition has a max-cut interpretation.  +
Authors Amir F. Dana, Vijay Gupta, Joao P. Hespanha, Babak Hassibi, Richard M. Murray  +
ID 2006e  +
Source Submitted, 2006 Conference on Decision and Control  +
Tag dan+06-cdc  +
Title Estimation over Communication Networks: Performance Bounds and Achievability Results +
Type Conference Paper  +
Categories Papers
Modification date
This property is a special property in this wiki.
15 May 2016 06:17:40  +
URL
This property is a special property in this wiki.
http://www.cds.caltech.edu/~murray/preprints/dan+06-cdc.pdf  +
hide properties that link here 
Estimation over Communication Networks: Performance Bounds and Achievability Results + Title
 

 

Enter the name of the page to start browsing from.