Convex Hull Centroid Localization in Wireless Local Sensor Networks Using k-Means++Algorithm
In order to improve the accuracy of convex hull centroid localization in wireless local sensing networks,k-Means++clustering algorithm is used to calculate the received signal strength and path loss of sensor nodes,representative and stable nodes are selected as convex hull centroids,and then weighted algorithm is used to calculate the weight of convex hull centroid localization,selecting a more accurate geological center.Based on the selected convex hull centroids,a weighted algorithm is used to calculate the weight of the con-vex hull centroid location in the wireless local sensing network,and a more accurate geological center is selected.On this basis,the con-nectivity relationship between the convex hull centroids is determined by analyzing the interval time of wireless sensor signals and com-paring the actual conditions of receiving signals between the surrounding convex hull centroids and unknown nodes.Based on the set threshold for locating the centroid of the convex hull,the positioning results of the centroid of the convex hull are further determined,and the accuracy and reliability of the positioning are improved.The simulation results show that the maximum positioning error of the pro-posed method is 0.167 m,and the positioning error is less than 0.35 m when the communication radius is 40 m under different numbers of convex hull centroids.It has been proven that the proposed method can effectively achieve centroid localization in wireless local sens-ing networks with small positioning errors.
万方数据
维普
