Coalitions for distributed sensor fusion
Michael D. Howard, David W. Payton, Regina Estkowski · 2003
We address the problem of efficient use of communication bandwidth in a network of distributed sensors. Each sensor node has enough computational power to fuse its own estimates with those of other nodes using an optimal filter, but message passing is expensive. The goal is to give each node an identical tactical picture of the area of interest without compromising target track accuracy. In the current leading approach, each sensing node sends an Associated Measurement Report (AMR: a sensor reading matched to a track ID) to every other node. This paper considers a method of decimation of reporting nodes by choosing a subset (coalition) of those nodes that have the best information on the target. Only coalition nodes share AMRs with each other; then the coalition sends a report to non-coalition nodes. Simulations and analytical studies are used to support the promise of the coalition approach.