Abstract

We study the decentralized detection problem in the context of balanced binary relay trees. We assume that the communication links in the tree network fail with certain probabilities. Not surprisingly, the step-wise reduction of the total detection error probability is slower than the case where the network has no communication link failures. We show that, under the assumption of identical communication link failure probability in the tree, the exponent of the total error probability at the fusion center is o(√N) in the asymptotic regime. In addition, if the given communication link failure probabilities decrease to 0 as communications get closer to the fusion center, then the decay exponent of the total error probability is Θ(√N), provided that the decay of the failure probabilities is sufficiently fast.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.