A Saved-Energy Clustering Protocol For Wireless Sensor Networks Using K-means Techniques

In this paper, we mainly research diverse routing protocols for wireless sensor networks and emphasize the hierarchical clustering routing algorithms—LEACH and the other protocols based on it. This paper proposes a Cluster-center and Energy-based Balanced Distributed Clustering (CEBDC) algorithm for Wireless Sensor Networks based on LEACH. It balances the clusters in terms of the node number to improve the intra-cluster communication consumption in the network and selects the cluster-heads by using two factors, which are 1) the distance between nodes and cluster-center; 2) the residual energy.Based on CEBDC, this paper improves the clustering algorithm gradually. It keeps the strategy for balancing the structure of the clusters and uses series K-means clustering algorithm (BSK-means) to divide sensor nodes. The algorithm based on K-means algorithm minimizes the amount of energy for the non-cluster head nodes to transmit their data to the cluster head, by minimizing the total sum of squared distances between all the non-cluster head nodes and the closest cluster centers.To achieve a distributed clustering scheme, the paper improves BSK-means algorithm more. In this new scheme, it only requires local communications: each tentative cluster-head only communicates with their topologically neighboring nodes and other tentative cluster-heads.We present the three algorithms, analyze its computing properties, and validate the algorithm by simulations. Both theoretical analyses and simulation results demonstrate that these algorithms can achieve better load-balance and less energy consumptions when compared with LEACH and LEACH-E. In addition, the three algorithms are able to distribute energy dissipation evenly among the sensor nodes, which then prolong the system lifetime for the networks significantly.