Distributed detection by a large team of sensors in tandem
Authors:
- M. AthansMAM. Athans
- 1 January 1990
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 246-251 vol.1
Abstract
The problem of decentralized binary hypothesis testing by a team consisting of N decision makers (DMs) in tandem is considered. Each DM receives an observation and transmits a binary message to its successor; the last DM has to decide which hypothesis is true. Necessary and sufficient conditions are derived for the probability of error to asymptotically (as N to infinity ) go to zero. The result is generalized for multiple hypothesis and multiple messages. An easily implementable suboptimal decision scheme is also considered; necessary and sufficient conditions for the probability of error to asymptotically go to zero are derived for this case as well. The tradeoff between the complexity of the decision rules and their performance is examined, and numerical results are presented.Keywords
This publication has 13 references indexed in Scilit:
- Explicit Solutions for Some Simple Decentralized Detection Problems1988
- Decentralized detection by a large number of sensorsMathematics of Control, Signals, and Systems, 1988
- Design and Performance Comparison of Distributed Detection NetworksIEEE Transactions on Aerospace and Electronic Systems, 1987
- Optimal Decision Fusion in Multiple Sensor SystemsIEEE Transactions on Aerospace and Electronic Systems, 1987
- Optimal Detection and Performance of Distributed Sensor SystemsIEEE Transactions on Aerospace and Electronic Systems, 1987
- On threshold rules in decentralized detection1986
- On the complexity of decentralized decision making and detection problemsIEEE Transactions on Automatic Control, 1985
- Detection networks1982
- Detection with Distributed SensorsIEEE Transactions on Aerospace and Electronic Systems, 1981
- Learning with Finite MemoryThe Annals of Mathematical Statistics, 1970