An Improved Balanced Energy Consumption Routing Algorithm For Internet Of Things Based On LEACH Protocol

With the development of Internet of Things(IOT) technology, many key technologies of IOT caused the attention of researchers in different extent, such as the important sensing layer technology-- wireless sensor network(WSN).WSN has been favored by researchers once again after years of independent development. IOT is always depend on the sensing network layer to complete the information acquisition and data transmission,and data transmission mostly depends on the routing protocol. So we can carry out the research of routing of IOT based on the sensing layer routing protocol, and it will push the development and progress of networking with no doubt.Through the tireless efforts of researchers, a variety of routing protocols oriented IOT have been proposed. However, these protocols are proposed according to specific application environment mostly, and it can only improve the specific performance of the network. So it can not take into account all aspects of the network. So after analyzing the research status of routing protocol of IOT and WSN comprehensively, and taking into account the networking of energy consumption, load balancing and large-scale problems,this paper decided to research LEACH Routing Protocol in WSN. This paper introduced the working process of the LEACH protocol and summarized the advantages and disadvantages of the protocol. And in order to solve the existing iot-oriented shortcomings, this paper proposed the corresponding improvement strategy.LEACH protocol can effectively save the energy consumption by selecting the cluster heads fairly and forwarding data from cluster heads to the base station. The mechanism of distributed computing is adopted to speed up the emergency response of the network, and the realization is simple and the robustness is good. However, the way of randomly selecting cluster heads will cause uneven clustering and inharmonious cluster size, and the number of cluster heads is related to the network size. These problems have differnt extent influence on network energy consumption. Therefore, this paper studied the LEACH protocol, and improved it in order to save the network energy consumption in a greater extent. The three improvements is as follows:1.This paper proposed a new method to calculating the optimal number of cluster heads in order to solve the problem of determining the optimal number of cluster heads.By minimizing the total energy consumption of the stage of cluster formation and the stage of stable transmission, it can get the optimal number of cluster heads. So the network can fuse and transfer data more reasonably. It also can make full use of the advantages of energy saving of the LEACH clustering algorithm.2.In order to solve the problem that the clustering is not uniform and the energy consumption is not reasonable, this paper proposed a new LEACH clustering algorithm,which is based on K-Means. When it updated the centering cluster, this paper used the trimmed mean method to make up for the disadvantages that the original K-Means clustering algorithm is sensitive to outliers, and it can make clustering more uniform; To make the cluster energy consumption minimum, this paper proposed a new standard measurement function. So it can make the clustering method more energy-saving.3.In view of the problem that the cluster head is easy to cause the premature death of the nodes, a new cluster head selection algorithm is proposed. At the stable clustering center, this paper selected the suitable cluster head according to the remaining energy of cluster head and the distance from the cluster head to the cluster center and to the base station to achieve the goal of load balancing of Internet of Things.Finally, this paper verified the proposed optimal cluster number, and confirmed the effectiveness of the algorithm. The simulation compared and analysed LEACH-KDE algorithm, LEACH algorithm and LEACH-K algorithm. Verified that the selection of a suitable number of cluster heads has saved the network energy consumption and prolonged the survival time of the nodes in a certain extent; And the LEACH-KDE algorithm not only has a more uniform clustering strategy, but also has a better performance in the survival time of the nodes and the network life cycle than the original algorithm.