A modified distributed target localization scheme in the presence of Byzantine attack

The problem of distributed target localization with binary quantized data at sensor nodes is investigated in the presence of Byzantine attack. We assume that the Byzantine nodes attack the distributed estimation by flipping the binary quantized data and transmitting falsified data to the fusion center. In this paper, we propose a distributed target localization scheme in the presence of Byzantine attack. In our proposed scheme, ambiguous nodes are selected based on the observed behavior of sensor nodes. And the target location is estimated using the locations of these ambiguous nodes by fitting a circle with the target as the center. We also derive a lower bound of threshold for ambiguous nodes selection such that the target location can be estimated by our proposed scheme effectively. Simulation results show that the proposed target localization scheme performs well no matter the fraction of Byzantine nodes.