Research On Energy-balanced Non-uniform Clustering Multi-path Routing In WS

Wireless sensor networks is a self-organizing network composed of tiny sensor nodes placed in the detection area with sensing,computing,data processing and communication capabilities.Network routing undertakes the task of transporting information from source node across the network to destination node,which is the basis of achieving efficient network communication.Since sensor nodes have limited energy,computing and storage capabilities,they are almost non-rechargeable after deployment.The death of sensor nodes due to node failure or energy depletion may cause changes in the network topology,which leads to routing failures.Saving node energy enhancing network robustness and extending network life cycle are the ultimate goals of wireless sensor network routing research.This paper mainly studies the clustering problem,multipath routing problem and the path planning problem of mobile sink node in wireless sensor networks.The main contents and innovations of the paper are as follows:To solve the problems of unbalanced energy consumption reducing life cycle and node failure causing network connection interruption,a multipath routing algorithm based on ring clustering is proposed.Based on the energy consumption model and the distance of the nodes from the Sink node the wireless sensor network is divided into ring areas.The clustering process is optimized by constraining the inter-cluster distance and cluster diameter to avoid the premature death of cluster head nodes close to the Sink.Optimize the cluster head election considering the node’s own energy and communication energy consumption with other nodes in the cluster,so that the node with more energy and less communication energy consumption with other nodes in the cluster becomes the cluster head.By removing next-hop nodes,the suboptimal path calculation of Yen algorithm is optimized to generate multiple routing paths to enhance routing robustness.The simulation results show that the RCMR algorithm is more reasonable than Leach algorithm and K-means algorithm in cluster division,and effectively reduces the total energy consumption of the network.Compared with k-means algorithm,the network life cycle is extended by 37.84%.In order to save network energy,extend the network life cycle and improve network robustness,the WSN ant colony optimized dynamic routing algorithm based on optimal communication radius is proposed.Constrain the set of next-hop candidate nodes to speed up the convergence of the algorithm by calculating the optimal communication radius of the nodes and the distance between them and the Sink.The communication cost function is established based on the residual energy of nodes and the energy consumption of communication between nodes to reduce the total energy consumption of the network during routing.Dynamic routing strategy is used to enhance network robustness by replanning routing paths for some nodes when local node failure or energy reaches a threshold value.The simulation results show that under the same conditions,compared with Dijkstra and ACOMP algorithms,the ACODR algorithm reduces the node energy consumption by 46.50% and 25.66%,and extends the network life cycle by 98.68% and41.12%,which verifies the effectiveness of the ACODR algorithm.The path planning problem of mobile Sink node is a classic NP-hard problem.To solve this problem,a path planning algorithm of mobile Sink node based on improved ant colony was proposed.The clustering process of k-means algorithm was optimized by selecting the node furthest from the initial node center as the initial clustering center in turn to avoid falling into local optimum.The node with the highest energy became the cluster head to avoid the premature death of nodes and reduce the network lifetime.By considering the communication range of the cluster head node,the appropriate anchor point is selected to plan the mobile path of the Sink node,so as to plan the routing path that makes the mobile Sink move path shorter.The simulation results show that compared with Leach-TSP,the cluster size of this algorithm is more uniform,and the moving path of the Sink node is shortened by 18.87%,and the network delay is reduced by 37.59%.In summary,in this paper,by studying the wireless sensor network clustering problem,multipath routing problem and mobile Sink node path planning problem,we can achieve the purpose of balancing node energy consumption,shortening Sink node movement distance and extending network life cycle.By studying the amount of data forwarded by nodes,the network was non-uniformly clustered to balance the energy consumption of nodes.The Yen algorithm and ant colony algorithm are improved to generate multiple routing paths to enhance the robustness of the network.By considering the communication range of cluster head nodes,the moving distance of Sink node is shortened.