A gossip-based distributed processing algorithm for multiple transmitter localization

We consider the problem of estimating the locations of multiple interfering transmitters based on measurements of received signal strength. Specifically, we explore the challenge of performing this estimation task in a distributed fashion. We propose a gossip-based distributed algorithm for multiple transmitter localization and determine the gossip configuration that minimizes bounds on convergence time. A performance comparison between the proposed distributed algorithm and competing centralized algorithms is presented. Results enable the study of trade-offs between localization accuracy and system parameters such as fault tolerance, energy consumption, and computational complexity.