Estimation over communication networks: Performance bounds and achievability results

  • Dana A
  • Gupta V
  • Hespanha J
 et al. 
  • 23

    Readers

    Mendeley users who have this article in their library.
  • 9

    Citations

    Citations of this article.

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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • A. F. Dana

  • V. Gupta

  • J. P. Hespanha

  • B. Hassibi

  • R. M. Murray

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free