113 / 2019-05-31 09:54:29

Performance Comparison of Localization Algorithm Based on the N-hop Anchors for Wireless Sensor Networks

wireless sensor network,range-free,multi-hop anchor nodes,geometric constraint,flooding algorithm

Node localization is a fundamental issue for supporting many key applications in wireless sensor networks(WSNs). In order to overcome the shortcomings of existing location algorithms, which can’t make full use of the location information of multi-hop anchor nodes, and obtain the ideal result of node localization, a new range-free location algorithm is proposed in this paper—n-hop connection relationship-based localization (NHCRL) algorithms. The core idea of this algorithm is to use beacon nodes with different hop values as geometric constraints of unknown node positions, and then to reduce their location areas continuously so as to achieve the purpose of accurate positioning. The simulation results show that under the same conditions, compared with the traditional location algorithm, NHCRL has higher location accuracy.