Data Fusion Trees for Detection: Does Architecture Matter?

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 and identically distributed (i.i.d.) observations. We characterize the optimal error exponent under a Neyman

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win
• Keywords: CORR 2008, Education, II Error Probability, Optimal Error, Optimal Error Exponent