Sciweavers

Share
TSP
2011

On Decentralized Detection With Partial Information Sharing Among Sensors

11 years 4 months ago
On Decentralized Detection With Partial Information Sharing Among Sensors
—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.
O. Patrick Kreidl, John N. Tsitsiklis, Spyros I. Z
Added 15 May 2011
Updated 15 May 2011
Type Journal
Year 2011
Where TSP
Authors O. Patrick Kreidl, John N. Tsitsiklis, Spyros I. Zoumpoulis
Comments (0)
books