A New Model to Analyzing of Node Compromise Attack in Range-free Localization Algorithms and New Criterion for Border Problem

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 paper attempts to model an attack and evaluate and analysis the effect of malicious data produced by node compromised attacks in some of the range-free algorithms: DV-hop, LSVM, NN and ELM. 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 three other algorithms in a normal condition. However, LSVM and ELM, respectively, have less localization error in the case of beacon node compromise and sensor node compromise attacks. Further, in this research work, a new criterion is proposed for studying and comparing border problem issue in the localization algorithms. Using the simulation results from various algorithms outcomes has been used for comparison, where it can be considered that LSVM has better performance in the border problem compared with the other studied algorithms.