To refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1kd1qk5r
Abstract: | A problem of distributed state estimation at multiple agents that are physically connected and have competitive interests is mapped to a distributed source coding problem with additional privacy constraints. The agents interact to estimate their own states to a desired fidelity from their (sensor) measurements which are functions of both the local state and the states at the other agents. For a Gaussian state and measurement model, it is shown that the sum-rate achieved by a distributed protocol in which the agents broadcast to one another is a lower bound on that of a centralized protocol in which the agents broadcast as if to a virtual CEO converging only in the limit of a large number of agents. The sufficiency of encoding using local measurements is also proved for both protocols. |
Publication Date: | 9-Jul-2012 |
Citation: | Sankar, Lalitha, Poor, H Vincent. (2012). Distributed estimation in multi-agent networks. 2012 IEEE International Symposium on Information Theory Proceedings, 10.1109/isit.2012.6284202 |
DOI: | doi:10.1109/isit.2012.6284202 |
Type of Material: | Journal Article |
Journal/Proceeding Title: | 2012 IEEE International Symposium on Information Theory Proceedings |
Version: | Author's manuscript |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.