Data Fusion Trees for Detection: Does Architecture Matter?

DOI10.1109/TIT.2008.928240MaRDI QIDQ3604810zbMATH OpenOpenAlexFDO

Authors Wee Peng Tay, Moe Z. Win, John N. Tsitsiklis

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0803.2337

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Detection theory in information and communication theory (94A13)

Abstract: We consider the problem of decentralized detection in a network consisting of a large number of nodes arranged as a tree of bounded height, under the assumption of conditionally independent, identically distributed observations. We characterize the optimal error exponent under a Neyman-Pearson formulation. We show that the Type II error probability decays exponentially fast with the number of nodes, and the optimal error exponent is often the same as that corresponding to a parallel configuration. We provide sufficient, as well as necessary, conditions for this to happen. For those networks satisfying the sufficient conditions, we propose a simple strategy that nearly achieves the optimal error exponent, and in which all non-leaf nodes need only send 1-bit messages.

Recommendations

• Error exponents for decentralized detection in tree networks
• Decentralized detection by a large number of sensors
• New asymptotic results in parallel distributed detection
• The decentralized Wald problem
• Decentralized sequential detection

Cited in

(2)

• Error exponents for decentralized detection in tree networks
• Fault detection for tree structured energy networks

This page was built for publication: Data Fusion Trees for Detection: Does Architecture Matter?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604810)