Error Probability Bounds for M-ary Relay Trees

Details Error Probability Bounds for M-ary Relay Trees Error Probability Bounds for M-ary Relay Trees

2012-02-07

arxiv.org/abs/1202.1354v1

Computer Science

Information Theory

Submitted to ISIT 2012

Scientific paper

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 bounds for the Type I and II error probabilities at the fusion center as explicit functions of the number of sensors in the case of binary message alphabets. These bounds characterize how fast the error probabilities converge to 0 with respect to the number of sensors.

Affiliated with

Also associated with

No associations

Rating

Error Probability Bounds for M-ary Relay Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Error Probability Bounds for M-ary Relay Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Error Probability Bounds for M-ary Relay Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-578864