Exploration of a New Location Algorithm for Wireless Sensor Network

Abstract

Abstract-To further study the basic principle and localization process of DV-Hop location algorithm, the location error reason of traditional location algorithm caused by the minimum hop number was analyzed and demonstrated in detail. The RSSI ranging technology was introduced to modify the minimum hops stage, and the minimum hop number was improved by the DV-Hop algorithm. For the location error caused by the average hop distance, the hop distance of the original algorithm was optimized. The improved location algorithm of DV-Hop average hop distance was used to modify the average range calculation by introducing the proportion of beacon nodes and the optimal threshold value. The optimization algorithm of the two different stages was combined into an improved location algorithm based on hop distance optimization, and the advantages of the two algorithms were taken into account. Finally, the traditional DV-Hop location algorithm and the three improved location algorithms were simulated and analyzed by beacon node ratio and node communication radius with multi angle. The experimental results showed that the improved algorithm was better than the original algorithm in the positioning stability and positioning accuracy.Keywords-wireless sensor network, DV-Hop location, minimum hops, average hop distance IntroductionThere are many methods for the division of node location technology. The most commonly used is the division standard based on ranging and positioning technology and non-ranging location technology. The ranging location algorithm mainly obtains the location of the unknown node by measuring the angle or distance between the nodes. In order to accurately measure the information, the requirements for the sensor are high and the power consumption is high. However, at the same time, the accuracy of the algorithm is relatively high. The non-ranging location algorithm has low hardware requirements and low power consumption. Its implementation is relatively simple, and its application is more extensive. However, the location precision of the nonranging finding algorithm is also lower than the ranging algorithm. For example, the centroid method is a kind of non-ranging location algorithm, which is simple and easy iJOE

A Hybrid Range-free Algorithm Using Dynamic Communication Range for Wireless Sensor Networks

“…However, it will increase hardware cost since introduced RSSI. Minimum hop count is optimized by employed RSSI technology in reference [14]. In addition, average hop size is controlled by anchor node proportion.…”