Research And Simulation Of Wireless Sensor Networkclustering Routing Algorithm Based On Ant Colonyoptimization

Wireless sensor network(WSN) technology as one of the core technology of Internet of things, because of some of its own characteristics such as mass?ad-hoc network and robustness, so that it can become a convenient channel for people to obtain information from the physical world, and be widely used in many fields of information monitoring. But the biggest problem that WSN has encountered is that its nodes are not free to replace the power supply, Energy deficiency affects the life of the network. This paper is mainly to optimize the routing protocol to reduce power consumption.On the basis of studying the existing routing algorithm, in this paper we put forward the dynamic clustering method based on Voronoi polygon clumping, the protocol can reduce the cost of energy in the process of nodes to join the cluster of internode communication by using geometrical relations to clustering. On the basis of the selected cluster head of Voronoi, Basising on Ant colony algorithm is used to search the optimal multi hop path between cluster head node and sink node to transmiss data between clusters head.And improve the probability of ant colony algorithm selection and the pheromone updating rule, considering of node in the search process in the residual energy, and the search direction restriction factors,considering of node energy factors in the process of updating, while adding a non optimal path of the negative feedback condition, thus speeding up the optimal path search process, good planning the inter cluster routing path.At last,Through the simulation of the algorithms proposed in this paper, simulation results show that the improved algorithm has a certain improvement in energy efficiency and convergence speed, and the energy balance of the WSN network is optimized. The practical application of WSN has a positive impact.