Modeling Research On Energy Saving And Partition Connectivity Of Wireless Sensor Network Nodes

Wireless Sensor Network(WSN)is widely used for data monitoring in a variety of scenarios due to its cheap and easy deployment.However,the sensor node can only be powered by a tiny battery embedded in itself,so the node will fail as the energy is exhausted,and the network is usually deployed in a harsh environment,which may also cause the node to fail in a large area.The above two conditions will cause the network to lose Data monitoring function.If you want to extend its life cycle,you need to consider two aspects,one is energy consumption,and the other is to reconnect after failure.The domestic and foreign researches in these two aspects mainly focus on several trends such as energy saving,redeployment of nodes,energy replenishment,replacement of node batteries,mobile nodes,and deployment of relay nodes.In order to reduce the manpower and material resources required for the solution,and reduce the addition of third-party organizations,this paper mainly studies the extension of the network life cycle from the two options of saving and balancing node energy consumption and deploying relay nodes.The research contents and innovations involved in this article are as follows:1.Due to the heterogeneity of the sensor network,the energy balance of all nodes needs to be considered.By improving the cluster head election algorithm and adding the clustering evaluation function to take the remaining energy of the nodes as the control factor,it can effectively avoid selecting nodes with less remaining energy.An ant colony strategy is used to find the optimal path for data forwarding between clusters.A fitness function is added to the state transition formula to provide guarantee for finding the optimal forwarding node.Adding the remaining energy trade-off factor to the pheromone update method can effectively control the increase and decrease of the pheromone of the path,and increase the probability of selecting the energy-balanced path.2.In view of the uneven number of nodes in the network partition,if a small number of isolated nodes in the network are independently formed into a region,there may be a problem that the number of relay nodes is greater than the number of nodes in the partition.This article first selects the partition closest to the independent node,stores the distance between all nodes and individual nodes in the array in ascending order,and then finds the first leaf node in the array as a candidate node and moves it to Between the independent node and the next node excluding the candidate node in the array,it is finally judged whether the two sensors are within the communication radius of the other party.If it is satisfied,it means that the independent node can re-implement communication after moving.3.Aiming at the problem of insufficient fault tolerance of the existing partition connectivity schemes,this paper selects the quadrangular Steiner tree for the first round of partition connectivity schemes.This scheme has been proven to be superior in the average node degree and the number of relay nodes after connectivity restoration Sex.Next,the convex hull fixed point in the partition is selected using the Graham convex hull algorithm and the convex polygon formed by sequentially connecting them is used as the second round connected path of the partition.Because of the difference in connectivity between the two schemes,the two paths are completely independent.In this way,a sleep wake mechanism can be set on the second path,which can reduce the redundancy rate of the node and ensure the energy conservation of the sleep node without affecting the normal progress of data collection and transmission.de,but also do not affect the normal transmission of data collection.