Security Location Based On Ranging

The technology of localization based on sensor node,recent years,has achieved impressive growth.Traditional WSNs localization algorithms,however,are under the assumption of that the anchors' coordinates are security.In actual hostile scenario,such as battlefield environments,some anchor nodes are compromised,and turn into malicious anchor nodes under hostile attacks.They disguise themselves as benign anchor nodes and send false position information to network in order to interfere with the correct localization of ordinary nodes.To solve this problem,some effective approaches should be explored to ensure the security of localization and eliminate the adverse influence due to the malicious anchors.To achieve reliable and accurate localization,this thesis introduces a dynamic security key verification mechanism.It can produce a set of random numbers based on the coverage of the anchor node signal strength.Security detection can filter out malicious location information,and security checks are independent of each other.This methods can not only determine the security of the positioning environment,but also ensure that the positioning accuracy will not be greatly affected.With the increase in demand for tracking technology,this thesis presents Mobile Security Location Based on Ranging.The algorithm uses the positioning of the last time,which undergoes safety inspections process,as a reference to test whether the positioning signal strength of the mobile node is perceived at present.This method reduces the sensor nodes storage and computation overhead.The node only needs to store the previous location information.Simulation results show that this safety detection method can not only significantly improve the accuracy of positioning results but also effectively resist the attack.