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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Coalitions for distributed sensor fusion


    Contributors:
    Howard, M. (author) / Payton, D. (author) / Estkowski, R. (author)


    Publication date :

    2002-01-01


    Size :

    671731 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Coalitions for Distributed Sensor Fusion

    Howard, M. / Payton, D. / Estowski, R. et al. | British Library Conference Proceedings | 2002


    The nucleolus and the essential coalitions

    Huberman, Gur | Springer Verlag | 1980


    An Algorithm Design for N-coalitions Games

    He, Bing / Zheng, Zhiyuan / Zhou, Jian et al. | British Library Conference Proceedings | 2022


    An Algorithm Design for N-coalitions Games

    He, Bing / Zheng, Zhiyuan / Zhou, Jian et al. | Springer Verlag | 2022


    Distributed Passive Sensor Trajectory Association and Fusion

    Chang, Ruowang / Wang, Bolan / Xu, Shengli et al. | Springer Verlag | 2022