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...

Full description

Bibliographic Details
Main Authors: Kreidl, Olivier Patrick, Tsitsiklis, John N., Zoumpoulis, Spyridon Ilias
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Institute of Electrical and Electronics Engineers 2011
Online Access:http://hdl.handle.net/1721.1/62559
https://orcid.org/0000-0003-2658-8239
_version_ 1811072629949333504
author Kreidl, Olivier Patrick
Tsitsiklis, John N.
Zoumpoulis, Spyridon Ilias
author2 Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
author_facet Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Kreidl, Olivier Patrick
Tsitsiklis, John N.
Zoumpoulis, Spyridon Ilias
author_sort Kreidl, Olivier Patrick
collection MIT
description 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.
first_indexed 2024-09-23T09:09:03Z
format Article
id mit-1721.1/62559
institution Massachusetts Institute of Technology
language en_US
last_indexed 2024-09-23T09:09:03Z
publishDate 2011
publisher Institute of Electrical and Electronics Engineers
record_format dspace
spelling mit-1721.1/625592022-09-26T10:46:30Z On Decentralized Detection with Partial Information Sharing among Sensors Kreidl, Olivier Patrick Tsitsiklis, John N. Zoumpoulis, Spyridon Ilias Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Laboratory for Information and Decision Systems Tsitsiklis, John N. Kreidl, Olivier Patrick Tsitsiklis, John N. Zoumpoulis, Spyridon Ilias 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. National Science Foundation (U.S.) (Grant ECCS-0701623) 2011-04-28T20:00:25Z 2011-04-28T20:00:25Z 2011-04 Article http://purl.org/eprint/type/ConferencePaper 1053-587X http://hdl.handle.net/1721.1/62559 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 https://orcid.org/0000-0003-2658-8239 en_US http://dx.doi.org/10.1109/TSP.2010.2099223 IEEE transactions on signal processing Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/ application/pdf Institute of Electrical and Electronics Engineers MIT web domain
spellingShingle Kreidl, Olivier Patrick
Tsitsiklis, John N.
Zoumpoulis, Spyridon Ilias
On Decentralized Detection with Partial Information Sharing among Sensors
title On Decentralized Detection with Partial Information Sharing among Sensors
title_full On Decentralized Detection with Partial Information Sharing among Sensors
title_fullStr On Decentralized Detection with Partial Information Sharing among Sensors
title_full_unstemmed On Decentralized Detection with Partial Information Sharing among Sensors
title_short On Decentralized Detection with Partial Information Sharing among Sensors
title_sort on decentralized detection with partial information sharing among sensors
url http://hdl.handle.net/1721.1/62559
https://orcid.org/0000-0003-2658-8239
work_keys_str_mv AT kreidlolivierpatrick ondecentralizeddetectionwithpartialinformationsharingamongsensors
AT tsitsiklisjohnn ondecentralizeddetectionwithpartialinformationsharingamongsensors
AT zoumpoulisspyridonilias ondecentralizeddetectionwithpartialinformationsharingamongsensors