Evaluation of Range-Free Localization Algorithms Against Node Compromise Attack

Authors : Seyed Saber BANİHASHEMİAN, , Fazlollah ADİBNİA, Mehdi Agha SARRAM

Pages : 0-0

View : 17 | Download : 10

Publication Date : 2017-05-01

Article Type : Research Paper

Abstract : Different range-free algorithms are proposed for location estimation in Wireless Sensor Networks. In these algorithms, the network is assumed to have no error and false data. This article attempts to evaluate and compare the effect of malicious data produced by node compromised attacks in some of the range-free algorithms: DV-hop, LSVM, and NN. The false data may be produced by the malicious anchor nodes or compromised sensor nodes. The resistance of these algorithms against node compromise attacks is compared. The results show that although DV-hop has less localization error compared to the two other algorithms in a normal condition, in the case of attacks LSVM has less localization error. Further, in this research work, a new criterion is proposed for studying and comparing the border problem issue in the localization algorithms. Using the simulation results from various algorithms, the outcomes have been used for comparison, where it can be considered that LSVM has better performance in the border problem compared with the other studied algorithms.
Keywords : Localization, Wireless Sensor Networks, Range free, Node compromise attack, border problem