Research On Scheduling Based Clustering Routing Algorithm For Wireless Sensor Networks

In recent years,with the development of social intelligence,wireless sensor networks have gradually become a research hotspot.Because wireless sensor networks can be deployed to areas inaccessible to human resources,such as volcanoes,military borders,etc.,they can also replace human resources to monitor farmland humidity,forest fires,etc.,greatly saving labor,so they have been widely used.However,due to the low cost and portability of sensor nodes,their batteries are small and their power is limited.Therefore,how to extend the network lifespan and enhance the network monitoring effect has attracted more and more scholars’ attention.To address the above issues,this paper proposes an energy balanced non-uniform clustering scheduling algorithm(EBNC＿CHES).EBNC＿CHES first introduces a time competition mechanism scheduling algorithm,which is composed of residual energy,boundary degree,and neighboring node points weighted,which can reduce overlapping redundant information and transmission energy consumption.Then,an improved K-means non-uniform clustering method is adopted to balance the energy consumption of the inter cluster network by adjusting the centroid position.Finally,the improved sparrow search algorithm is used to balance the energy consumption within the cluster in the cluster head election.The improved sparrow search algorithm adds adjustment factors and mutation factors to strengthen its ability to jump out of the local optimum.The weight coefficient of the fitness function is calculated by the analytic hierarchy process,making the selected cluster heads more objective.Compared with the Low-power adaptive clustering hierarchical protocol(LEACH),Efficient clustering cluster head selection based on differential evolution improved sparrow search algorithm,and Energy-saving sleep scheduling tree routing protocol,this algorithm reduces redundant information,improves energy utilization,and extends the high coverage life of the network.Due to the short lifespan of high coverage and long lifespan of low coverage of the(EBNC＿CHES)algorithm,which is prone to ignoring critical information,it is not suitable in important scenarios such as forest fires and military borders.Therefore,in response to the problem of high network coverage and short lifespan,priority based node state selection and improved minimum spanning tree based routing protocol algorithms(PS＿IMST)are proposed.PS＿IMST first calculates the priority of nodes based on the density and remaining energy of adjacent nodes,and determines the node status in priority order based on the received neighboring node status information and coverage changes.Then use the Kmeans++algorithm to balance the selection of cluster heads and maximize the distance between cluster heads.Finally,the energy and hop count are added to the minimum spanning tree weight,and the improved minimum spanning tree algorithm is used to redesign the intra cluster and inter cluster routing.The near base station nodes between clusters directly hop to the base station,and the intra cluster nodes generate a routing tree based on the new weight,reducing the communication distance between nodes and balancing the energy consumption between clusters and within clusters.The CRITIC algorithm is used to calculate the weight coefficients,taking into account the correlation between energy,distance,and hop count to select the more suitable next hop.Compared with LEACH and non-uniform clustering routing protocols based on minimum spanning tree,this algorithm improves energy utilization and prolongs network lifespan;compared with energy-saving sleep scheduling tree routing protocol,it prolongs the lifespan of high network coverage;with compared to EBNC＿CHES,it improves the high coverage lifespan of the network and shortens the low coverage lifespan of the network.