Improved 3-dimensional DV-hop localization algorithm based on information of nearby nodes.

DV-Hop, a range-free localization algorithm, has been one of the most popular localization algorithm. It is easy and inexpensive to implement. Therefore, in the literature, many improved variants of this algorithm exist. However, poor location accuracy and higher power consumption by DV-Hop algorithm always open new avenues for research on this algorithm and makes it a favorite among the researchers. In this paper, we have proposed an Improved 3-Dimensional DV-Hop algorithm based on the information of nearby nodes (I3D-DVLAIN). In the algorithm, by calculating hopsize at the unknown nodes, we eliminate one communication among the nodes, which reduces power consumption in the network. The hopsize calculation and location estimation is done by using only the nearby anchor nodes, which minimizes the network usage and decreases the computational effort. For the selection of nearby anchor nodes, we introduce a new method. Further, for localization, a novel method is used for solving the system of distance equations that restricts propagation of inherent error in the distance and increases localization accuracy. Furthermore, by mathematically analyzing the propagation of error in solving the system of equations, we prove the superiority of I3D-DVLAIN over other compared algorithms. The results obtained through simulation and complexity analysis of the computation and communication further strengthens our observations about the superiority of the proposed algorithm. [ABSTRACT FROM AUTHOR]