Zhenliang Zhang

Learn More
We study the detection error probability associated with a balanced binary relay tree, where the leaves of the tree correspond to <i>N</i> identical and independent 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 two binary messages to form(More)
—The problem of objectively choosing a string of actions to optimize an objective function that is string submodular has been considered in [1]. There it is shown that the greedy strategy, consisting of a string of actions that only locally maximizes the step-wise gain in the objective function, achieves at least a (1 − e −1)-approximation to the optimal(More)
Consider a large number of nodes, which sequentially make decisions between two given hypotheses. Each node takes a measurement of the underlying truth, observes the decisions from some immediate predecessors, and makes a decision between the given hypotheses. We consider two classes of broadcast failures: 1) each node broadcasts a decision to the other(More)
— We study the distributed detection problem in a balanced binary relay tree, where the leaves of the tree are sensors generating binary messages. The root of the tree is a fusion center that makes the overall decision. Every other node in the tree is a fusion node that fuses two binary messages from its child nodes into a new binary message and sends it to(More)
— The problem of choosing a string of actions to optimize an objective function that is string submodular has been considered in [1]. There it is shown that the greedy strategy, consisting of a string of actions that only locally maximizes the step-wise gain in the objective function, achieves at least a (1 − e −1)-approximation to the optimal strategy.(More)
—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,(More)
We study the distributed detection problem in the context of a balanced binary relay tree, where the leaves of the tree correspond to <i>N</i> identical and independent sensors generating binary messages. The root of the tree is a fusion center making an overall decision. Every other node is a relay node that aggregates the messages received from its child(More)
We study the detection error probability associated with balanced binary relay trees, in which sensor nodes fail with some probability. We consider N identical and independent crummy sensors, represented by leaf nodes of the tree. The root of the tree represents the fusion center, which makes the final decision between two hypotheses. Every other node is a(More)