Research On Routing Protocol Based On Genetic K-means Algorithm In Wireless Sensor Networks

With the development of information Network technology,Wireless Sensor Network(WSN)has been widely applied in many fields such as daily life and agricultural production.So,It has broad prospect.WSN is composed of sensor nodes randomly deployed in the monitoring area.It is a data-centric and self-organizing network.However,sensor nodes are hardware constrained devices,and their energy is limited and cannot be supplemented.Therefore,it is very important to reduce the energy consumption of nodes and maximize the life cycle of the entire network.Clustering routing protocol,as an effective energy optimization strategy in wireless sensor networks,has important research meaning.Based on LEACH protocol,this paper proposes an improved optimization algorithm for the energy consumption caused by its deficiencies in clust-head election,network clustering and data transmission.And verify it by simulation.Firstly,To the question of that LEACH protocol randomly selects cluster heads and uneven clustering leads to unbalanced energy consumption.A genetic k-means clustering algorithm for WSN clustering routing protocol cluster partitioning is designed by adopting the clustering idea in data mining and taking the distance between nodes as the clustering attribute.The algorithm combines genetic algorithm and k-means algorithm.The design of fitness function of genetic algorithm integrates the target function of k-means algorithm and the number of nodes in the cluster.The algorithm made WSN cluster uniform and balanced the energy consumption of the network.Secondly,In the cluster head election stage,improved the cluster head election method,Comprehensively considered the residual energy of nodes in the network and the node and the distance between the node and cluster center.Meanwhie,the improved formula of cluster head election threshold added in joined by the death of the weight coefficient of node number of feedback adjustment.The new improved the cluster head election algorithm guarantees the rationality of the distribution of cluster heads,the greedy algorithm was used to construct the optimal path to transmit data.Finally,With the help of MATLAB simulation platform,compared the improved protocol with LEACH and LEACH-C protocol in simulation experiment under a set of performance evalution indicatord.the simulation results show that the improved protocol can effectively improve the structure of cluster,distribute the cluster head nodes and the nodes within cluster equally,balance the nodes energy,effectively reduce the death of node,increase the life of network.