Detecting malicious beacon nodes for secure localization in distributed wireless networks

Secure distance-based localization in the presence of cheating beacon (anchor) nodes is an important problem in mobile wireless adhoc and sensor networks. Despite significant research efforts in this direction, some fundamental questions still remain unaddressed. When the number of cheating beacon nodes is greater than or equal to a given threshold, no two-dimensional distance-based localization algorithms exist that can guarantee a bounded error. In this paper, the problem of robust distance-based localization in the presence of malicious beacon nodes will assume theoretically that the number of malicious beacon nodes are below threshold and derive a necessary and sufficient condition for having a bounded localization error and use heuristic algorithm that can achieve a bounded error. Suppose if the number of cheating beacons is equal or more than the threshold will use the suspicious message detection by signal strength for detecting and eliminating malicious beacon nodes. The primary goal here is to conduct a thorough analytical study of the distance-based localization problem in the presence of cheating beacons. Finally, it shows that the heuristic-based algorithm provides good localization precision with a very small tune cost.