We study the asymptotic detection performance of large sensor networks, configured as trees with bounded height, in which information is progressively compressed as it moves towards the root of the tree. We show that the error probability decays exponentially fast, and we provide bounds for the error exponent. We analyze further the case where the tree has certain symmetry properties, and derive simple, easily implementable, suboptimal strategies.
Citation:
Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win, "Bayesian Detection in Bounded Height Tree Networks," dcc, pp.243-252, 2007 Data Compression Conference (DCC'07), 2007