DV-Hop localization algorithm has greater localization error which estimates distance from an unknown node to the different anchor nodes by using estimated average size of a hop to achieve the location of the unknown node. So an improved DV-Hop localization algorithm based on correctional average size of a hop, HDCDV-Hop algorithm, is proposed. The improved algorithm corrects the estimated distance between the unknown node and different anchor nodes based on fractional hop count information and relatively accurate coordinates of the anchor nodes information, and it uses the improved Differential Evolution algorithm to get the estimate location of unknown nodes so as to further reduce the localization error. Simulation results show that our proposed algorithm have lower localization error and higher localization accuracy compared with the original DV-Hop algorithm and other classical improved algorithms.

An improved DV-Hop localization algorithm based on hop distances correction

In this paper, firstly, the number of positions for beacon is deduced to send a signal according to the acreage of ROI (region of interest); then a simple method is presented to calculate the coordinates of the sending positions in rectangular ROI; and then, a method is advanced based on virtual force to arrange the positions in arbitrary ROI; further, the wandering salesman problem (WSP) algorithm is applied to the positions sequence so as to get the optimal path touring it. When mobile beacon moves according to the optimal path and emits RF signals at every position, the sensors in ROI could work out their position with multilateration. Experimental results demonstrate that the proposed localization method is efficient and flexible.

Getting Mobile Beacon Path for Sensor Localization

In order to solve the problem that the DV-Hop algorithm has large error in the network topology environment of random distribution of nodes, this paper proposes a WSN localization algorithm based on hop distance correction. The algorithm uses the method of multi communication radius to correct the hop number within 1 hops, which makes it more consistent with the real situation; Then, the weighted factor is obtained by error of the average distance per hop of anchor node; Finally, the total least squares method is used to calculate the coordinates of the unknown nodes to improve the positioning accuracy of DV-Hop positioning algorithm. The simulation results show that the improved algorithm has a better accuracy and stability than the original DV-Hop algorithm.

http://www.sersc.org/journals/IJMUE/vol11_no6_2016/28.pdf

An Improved DV-Hop Localization Algorithm Based on Hop Distance and Hops Correction

Localisation precision is one of the predominant challenges in static and mobile wireless sensor networks. It is a critical issue to be tackled when developing applications that rely on this type of networks. This paper presents three localisation techniques, named eDV-Hop1, eDV-Hop2, and eDV-Hop3, based on geometry principles. The performance of these techniques was evaluated using the network simulator (OMNeT++) and compared to the basic DV-Hop, iDV-Hop1, and iDV-Hop2. Results show that significant improvement is obtained in terms of energy consumption and localisation error according to several parameters, mainly the number of sensors, the number of anchor nodes, and the communication range of sensor nodes.

Novel localisation algorithms in wireless sensor networks

NB-IoT (Narrowband Internet of Things), as a part of new-generation cellular communication technology, leads an innovation in wireless sensor networks. It pushes wireless sensor networks to be appl...

https://journals.sagepub.com/doi/pdf/10.1177/1550147718821851

A research on wireless sensor networks’ node positioning mechanism based on Narrowband Internet of Things data linking:

This paper proposes a node localisation algorithm with multi-mobile beacons in order to improve the accuracy of localisation and avoid scanning the unknown nodes repeatedly. Three mobile beacons are designed to traverse the WSNs and simultaneously maintain the relative location relations between them based on equal distance three-coverage and then trilateration technology and DV-hop algorithm are used to localise the unknown nodes. The simulation results show that the algorithm outperforms DV-hop and MB-DV-hop in the aspects of accuracy and communication overhead and its moving path length of single beacon is also shorter than that of MB-DV-hop.

Wenxiu He

Papers

DV-hop node localisation algorithm with multi-mobile beacons in wireless sensor networks