DV-Hop Localization Algorithm Based on Minimum Mean Square Error in Internet of Things

In the practical application of node positioning in the Internet of Things (IOT), the distribution of beacon nodes is generally non-uniform, so there is a certain error in positioning accuracy. In order to make the positioning more accurate, The MMSDV-Hop localization algorithm which improved DV-Hop localization algorithm is proposed in this paper. At first, this algorithm needs to determine the valid beacon nodes in a local range by selecting threshold value, and after using minimization criterion of mean-square error and correcting to obtain the final average hop distance. The dynamic weight is added with the hop number and the number of valid nodes as weights to determine the distance between the unknown nodes and the beacon nodes. A Weighted centroid localization algorithm and a weighted least square method are used to obtain an estimated position separately and the final position is determined by the arithmetic mean value of the two estimated positions. The Matlab simulation experiment shows that compared with the DV-Hop localization algorithm, the improved MMSDV-Hop localization algorithm has increased significantly in the positioning accuracy.