Paper Review of PBPO

Decentralized detection
Tsitsiklis has shown that the computational complexity of determining the optimal strategy is exponential in the number of sensors.

An algorithm for determining the decision thresholds in a distributed detection problem
Tang et al. have addressed a number of issues, e.g., the effect of different starting points, variations in costs, number and quality of local detectors, etc.

Optimization of detection networks. I. Tandem structures
Optimization of detection networks. II. Tree structures
Tang found the PBPO algorithm was most efficient but more sensitive to initial larg number of sensors. But the other three algorithms were found to be more robust to initial conditions.

Direction of Research About Fault Tolerance

Optimal 4x10 Code Matrix (min. Hamm dist = 5)

1 1 1 1 1 0 0 0 0 0
1 1 1 1 1 1 1 1 1 1
0 0 0 0 0 1 1 1 1 1
0 0 0 0 0 0 0 0 0 0

Proof ?
Design ?

Direction of The Recent Research

1. Tolerance to the certain sensors in specail cases.
2. Simulated annealing algorithm for the large code matrix.
3. Proof of the same tolerance for the same characterized codematrix.
4. (Hans) Simplify the process of PBPO.