loading...
Bayesian Detection in Bounded Height Tree Networks
Snowbird, Utah March 27-March 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2007.162007 Data Compression Conference (DCC ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Wee-Peng Tay, MIT, Cambridge, MA, USA
John N. Tsitsiklis, MIT, Cambridge, MA, USA
Moe Z. Win, MIT, Cambridge, MA, USA
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
Usage of this product signifies your acceptance of the Terms of Use.