Tolerant Majority-Colluding Attacks for Secure Localization in Wireless Sensor Networks
Xingfu Wang, Lei Qian, Haiqing Jiang · 2009
To solve the secure localization problems, a number of secure localization schemes have been developed at present. However, most of these techniques cannot survive malicious attacks in hostile environments where a majority of beacons launch colluding attacks. In this paper, we propose a novel localization algorithm called TMCA (tolerate majority-colluding attacks) that is well suited to WSN which is a resource constrained environment. The TMCA is a distributed algorithm based on the cooperation of non-beacon neighbor nodes and consistency of the Minimum Mean Square Error. TMCA is robust against well known attacks on a WSN such as the wormhole attack, the Sybil attack and Replay attack. Even when there are more colluding malicious anchors than benign anchors on a WSN, it can still work well to generate precise localization results. At the same time, it has reasonable and acceptable communication cost and algorithm complexity. Through simulations, we compare the performance of TMCA with other secure localization schemes and show that TMCA has more efficient and resilient performance.