
Optimal Byzantine attack strategy for distributed localisation with M ‐ary quantised data
Author(s) -
Chen Huifang,
Xie Lei,
Shen Congqi
Publication year - 2015
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2015.2172
Subject(s) - byzantine architecture , byzantine fault tolerance , computer science , probabilistic logic , wireless sensor network , computer network , distributed computing , fault tolerance , geography , archaeology , artificial intelligence
The distributed localisation with M ‐ary quantised data at sensor nodes is investigated in the presence of Byzantines from the attacker's perspective. The Byzantine nodes attack the network by transmitting falsified data to the fusion centre (FC) to deteriorate the performance of the distributed target localisation, where the independent and probabilistic Byzantine attack model is considered. By making the determinant of Fisher information matrix be zero, the optimal Byzantine attack strategy, which makes the FC incapable of estimating target location using the data at sensor nodes, is found. Numerical results show that the security performance of the distributed localisation improves sharply as the number of quantisation bits increases. Moreover, the security performance also increases tremendously as the attack probability decreases. Hence, the Byzantine attacker faces a trade‐off between the performance damage and the hazard to be identified.