Computer Science – Information Theory
Scientific paper
2011-08-31
Computer Science
Information Theory
Scientific paper
We consider the decentralized binary hypothesis testing problem in networks with feedback, where some or all of the sensors have access to compressed summaries of other sensors' observations. We study certain two-message feedback architectures, in which every sensor sends two messages to a fusion center, with the second message based on full or partial knowledge of the first messages of the other sensors. We also study one-message feedback architectures, in which each sensor sends one message to a fusion center, with a group of sensors having full or partial knowledge of the messages from the sensors not in that group. Under either a Neyman-Pearson or a Bayesian formulation, we show that the asymptotically optimal (in the limit of a large number of sensors) detection performance (as quantified by error exponents) does not benefit from the feedback messages, if the fusion center remembers all sensor messages. However, feedback can improve the Bayesian detection performance in the one-message feedback architecture if the fusion center has limited memory; for that case, we determine the corresponding optimal error exponents.
No associations
LandOfFree
The Value of Feedback in Decentralized Detection does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Value of Feedback in Decentralized Detection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Value of Feedback in Decentralized Detection will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-625014