Abstract
A decentralized sequential detection problem is considered in which each one of a set of sensors receives a sequence of observations about the hypothesis. Each sensor sends a sequence of summary messages to the fusion center where a sequential test is carried out to determine the true hypothesis. A Bayesian framework for this problem is introduced, and for the case when the information structure in the system is quasi-classical, it is shown that the problem is tractable. A detailed analysis of this case is presented along with some numerical results.
Original language | English (US) |
---|---|
Pages (from-to) | 433-442 |
Number of pages | 10 |
Journal | IEEE Transactions on Information Theory |
Volume | 39 |
Issue number | 2 |
DOIs | |
State | Published - Mar 1993 |
Keywords
- Decentralized detection
- dy-
- namic programming
- sequential analysis
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences