The Research Of Energy-efficient Clustering Multi-hop Routing Algorithm For Wireless Sensor Networks Based On K-means Clustering

Wireless sensor network(WSN)is a core technology for the Internet of Things.Therefore,the research of WSN is important to both intelligent life and the development of economy.The routing algorithm is the key to the study of WSN.It is used to determine the path of data transmission,reduce the expense of routing and improve the performance of network.In this work,we focus on energy-efficient routing algorithm and propose a new routing algorithm with high energy efficiency and good performance for WSN.The paper is organized as follows.First of all,we give a review of the classical clustering algorithm: low-energy adaptive clustering hierarchy(LEACH).We indicate its main deficiencies and compare it with some improved versions.Based on this,we propose a new energy-efficient routing algorithm: multi-hop energy clustering hierarchy base on k-means(MECHK),which can save energy,extend the life cycle of network and improve network performance.The new algorithm is composed of three parts: clustering,selection of cluster head and data communication in the network.In the process of establishing clusters,the number of clusters is determined by the number of surviving nodes of network.Then the k-means clustering algorithm is applied to cluster evenly.For the selection of cluster head,related parameters like the residual energy of nodes and location information are taken into account to establish linear equations,whose solution can lead to the required cluster head.The linear system is solved by Gaussian elimination method.To avoid frequently clustering or selecting cluster head,the kmeans clustering will be executed only when the dead nodes in the network result in the change of network structure,and the cluster head will be re-elected only when the energy of cluster head node is lower than the average energy of its neighbor nodes.In this way,the cost of clustering and selecting cluster head can be minimized while the network can still run normally.Secondly,in the process of data transmission,some special techniques are adopted to balance the consumption of cluster heads and avoid the occurrence of hot zone and hot spot problem.Inside each cluster,the train structure is built so that the data can be transmitted to cluster head by chain.Among clusters,inter-cluster routing table is created by finding the shortest path with Dijkstra algorithm.Based on this table,the data can be transmitted from the cluster head to the base station by means of multi-hop.Between two data transmission models,data fusion will be performed before the transmission of next hop so as to reduce the redundancy of data.Finally,simulation tests are performed by use of MATLAB.The results show that MECHK algorithm can save energy,improve the transmission efficiency,balance network load and extend the life cycle for WSN.