Error Probability Bounds for M-ary Relay Trees

@article{Zhang2012ErrorPB,
  title={Error Probability Bounds for M-ary Relay Trees},
  author={Zhenliang Zhang and Edwin K. P. Chong and Ali Pezeshki and William Moran and Stephen D. Howard},
  journal={CoRR},
  year={2012},
  volume={abs/1202.1354}
}
We study the detection error probabilities associated with an M -ary relay tree, where the leaves of the tree correspond to identical and independent sensors. Only these leaves are sensors. The root of the tree represents a fusion center that makes the overall detection decision. Each of the other nodes in the tree is a relay node that combines M summarized messages from its immediate child nodes to form a single output message using the majority dominance rule. We derive tight upper and lower… CONTINUE READING