On Decentralized Detection with Partial Information Sharing among Sensors
Name
Tsitsiklis_On decentralized.pdf
Size
557.76 KB
Format
Adobe PDF
Checksum (MD5)
a77e70ce96367ff919d17d6bcff9bbc5
Author(s)
Kreidl, Olivier Patrick
Tsitsiklis, John N.
Zoumpoulis, Spyridon Ilias
Date Issued
April 2011
Journal
IEEE transactions on signal processing
Publisher
Institute of Electrical and Electronics Engineers
Citation
Kreidl, O.P., J.N. Tsitsiklis, and S.I. Zoumpoulis. “On Decentralized Detection With Partial Information Sharing Among Sensors.” Signal Processing, IEEE Transactions On 59.4 (2011) : 1759-1765. Copyright (c) 2010 IEEE
Version
Author's final manuscript
Abstract
We study a decentralized detection architecture in which each of a set of sensors transmits a highly compressed summary of its observations (a binary message) to a fusion center, which then decides on one of two alternative hypotheses. In contrast to the star (or “parallel”) architecture considered in most of the literature, we allow a subset of the sensors to both transmit their messages to the fusion center and to also broadcast them to the remaining sensors. We focus on the following architectural question: Is there a significant performance improvement when we allow such a message broadcast? We consider the error exponent (asymptotically, in the limit of a large number of sensors) for the Neyman-Pearson formulation of the detection problem. We prove that the sharing of messages does not improve the optimal error exponent.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/TSP.2010.2099223
