An Optimized Cluster Structure Routing Method Based on LEACH in Wireless Sensor Networks

In order to improve the accuracy and speed of traditional K-Nearest-Neighbor (KNN) algorithms and solve the problem of determining the most appropriate initial center and number of clusters of K-Means algorithm, an improved clustering dynamic threshold location algorithm (ICD-KNN) is proposed in this paper. The algorithm consists of two stages: clustering stage and position estimation stage. The clustering stage employs K-Means clustering algorithm based on Canopy. The Canopy is used as the preprocessing procedure to improve efficiency and clustering accuracy of K-Means algorithm. In the position estimation stage, threshold is set dynamically according to the dispersion of reference points to filter out singular reference points and improve positioning accuracy compared with the previous threshold algorithms. We compare proposed algorithm with several existing algorithms. The simulation results show that the positioning accuracy of ICD-KNN is improved by 10%, 38% and 39% respectively compared with dynamic threshold algorithms (DH-KNN), K-Means algorithms and KNN algorithms.