Proposing a measurement criterion to evaluate the border problem in localization algorithms in WSNs

Abstract

Localization algorithms are one of the most important protocols that may be used in many different fields of wireless sensor networks. The border problem is a considerable challenge for localization algorithms. In this regard, the sensor nodes that are placed on the boundary of a deployment area have a larger localization error as compared to the other sensor nodes. In this article, a new criterion is proposed for measuring the impact of the border problem on the performance of localization algorithms in isotropic networks. The performance of some range-free localization algorithms is studied by simulation. The results show that, contrary to LSVM and NN algorithms, the impacts of the border problem are reduced by a reduction in the dimensions of the deployment environment in the DV-hop algorithm. Besides, the effect of the border problem on the performance of the localization algorithms can be reduced by an increase in the number of anchor nodes. On the other hand, the number of sensor nodes does not have a significant impact on reducing the effect of the border problem in localization algorithms. Finally, a solution is proposed to reduce the negative impact of this issue on the performance of localization methods.