
Sparsity‐incorporated secure localisation for wireless sensor networks
Author(s) -
Zhang Q.,
Wan J.W,
Wang D.D,
Chen J.Y,
Wang D.H
Publication year - 2017
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.2017.0005
Subject(s) - wireless sensor network , computer science , wireless , scheme (mathematics) , identification (biology) , real time computing , computer network , algorithm , mathematics , telecommunications , mathematical analysis , botany , biology
To enable efficient and accurate secure localisation in wireless sensor networks, a sparsity‐incorporated localisation algorithm is proposed. Unlike most of the existing schemes, the localisation problem is solved in an L1 minimisation framework which is based on the attack sparsity and the linearisation of a distance measurement model including the bogus data from malicious anchors. The localisation errors, speed and detection rates of the scheme are analysed in the simulations. Results demonstrate that the method can simultaneously achieve target localisation and malicious anchor identification in an efficient and accurate way.