Blind Adaptive Decision Fusion for Distributed Detection


  1. Mirjalily, G.
  2. Luo, Z-Q.
  3. Davidson, T.N.
  4. Bossé, É.
Corporate Authors
Defence R&D Canada - Valcartier, Valcartier QUE (CAN)
We consider the problem of decision fusion in a distributed detection system. In this system, each detector makes a binary decision based on its own observation, and then communicates its binary decision to a fusion center. The objective of the fusion center is to optimally fuse the local decision in order to minimize the final error probability. To implement such an optimal fusion center, the performance parameters of each detector (i.e., its probabilities of false alarm and missed detection) as well as the a priori probabilities of the hypotheses must be known. However, in practical applications these statistics may be unknown or may vary with time. We develop a recursive algorithm that approximates these unknown values on-line. We then use these approximations to adapt the fusion center. Our algorithm is based on an explicit analytic relation between the unknown probabilities and the joint probabilities of the local decisions. Under the assumption that the local observations are conditionally independent, the estimates given by our algorithm are shown to be asymptotically unbiased and converge to their true values at the rate of 0(1/k ½), in the rms error sense, where k is the number of iterations. Simulation results indicate that our algorithm is substantially more reliable than two existing (asymptotically biased) algorithms, and performs at least as well as those algorithms when they work.
Distributed detection;Fusion centers;Decision fusion
Date of publication
01 Jan 2003
Number of Pages
Reprinted from
IEE Transactions on Aerospace and Electronic Systems, vol 39, no 1, 2003, p 34-52
Hardcopy;Document Image stored on Optical Disk

Permanent link

Document 1 of 1

Date modified: