The Clustering Algorithm Of LEACH-R And Its Application In The "Internet Of Things"

The WSN(Wireless Sensor Networks) emerges with the hypergrowth of MEMS(Micro-Electro-Mechanism System),SOC(System on Chip), wireless communication, low power consumption embedded technology. It has been one of the most development vision technology because of its wide application prospect in military affairs, environment, urban communications, space science.The most challenge of WSN is how to use the energy more efficiently. Besides the channel assignment in MAC, data fusion and suspend mode, a efficient routing algorithm is a more important method to use the energy efficiently.The paper studies the clustering routing protocols such as LEACH,DCHS,TEEN,ACE etc., compares with their choice of cluster head, establishment of the cluster, communication, reconstruction and regard the max connectivity clustering algorithm as the emphasis.Based on the above studies, the paper puts forward a new clustering algorithm, the algorithm based on energy and connectivity. The new algorithm compares a parameter "T" which contains energy and connectivity of the node. A node will be a cluster head if its T is max in its broadcast domain. The head's energy consumption is max generally, so the paper decides that the cause of the cluster's reconstruction is energy consumption. When the head's residual energy is two thirds of its initial energy, the cluster will reconstructs and votes a new head. In the overall network, it will remove all the clusters and reconstructs if more than half of the clusters will reconstructs in a short time.The experiment is run in the simulation tool OMNeT++3.3.The result indicates that the new algorithm reduces the energy consumption, improves the efficiency of nodes' energy, prolongs the network's life-span than LEACH and the algorithm based on max connectivity.