Communications management in decentralised data fusion systems

We compare two communications management algorithms: one based on an information theoretic approach, which builds on and complements previous work in this area, the other based on a non-information based (round robin) approach. We consider different numbers and combinations of targets. The results are presented as process models which relate the delay in achieving reliable identification to the communications to sensor update ratios for both algorithms. Future research areas highlighted by the work are discussed.