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.
Coalitions for distributed sensor fusion
2002-01-01
671731 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Coalitions for Distributed Sensor Fusion
British Library Conference Proceedings | 2002
|The nucleolus and the essential coalitions
Springer Verlag | 1980
|An Algorithm Design for N-coalitions Games
Springer Verlag | 2022
|Coalitions: More Than Just Flags at the Table
NTIS | 2011
|Distributed Passive Sensor Trajectory Association and Fusion
Springer Verlag | 2022
|