Research Of WSN's Route Based On Improved Ant Colony Algorithm

Wireless Sensor Network(WSN)is a new way to obtain and process data,and also a hot research technology at home and abroad.The WSN is made up of a large number of sensors,each of which has the ability to perform calculations independently and to perceive the surrounding environment.So it has a very wide range of applications in the civilian,commercial,industrial,and military fields.In WSN,the use of inappropriate routing protocols can lead to significant consumption of node energy in the network,and routing protocols cannot be blindly selected for different networks.In order to improve the overall performance of WSN,the main contents of this dissertation are as follows:1)The cluster-head election formula of the LEACH routing protocol is added to the residual energy of the node and the parameters of rotation times to form a feedback mechanism that does not exist in the original formula.Thus increasing the probability that nodes with more residual energy and many unsuccessful elections for become cluster heads,balancing the load of nodes in the network,and prolonging the network life cycle.In the improvement of ant colony algorithm,the magnitude of energy needed to access between nodes and the distance between nodes are combined to reduce the weight of distance in heuristic.2)In the formula of dynamic change ant colony algorithm,the pheromone exertion coefficient p,the pheromone heuristic factor ? and the distance heuristic factor ? make the algorithm do not rely too much on the distance between nodes in the early stage of the algorithm,and effectively prevent the local convergence of the algorithm and fall into the local optimum.Speed up the global convergence speed.3)By using the Voronoi map unit area division,the WSN area can be divided into several independent regions,and the cluster head election can be carried out in this area.The problem of excessive energy consumption caused by improper cluster head distribution in the original cluster head selection mechanism is optimized.Finally,an improved ant colony algorithm is used tosearch for a multi-hop shortest path between cluster head and convergence node to reduce the network energy cost.In this dissertation,MATLAB R2010 B is used to simulate,and the life cycle,the average energy consumption and the shortest path are taken as performance indicators to evaluate the improved LEACH-ANTNEW algorithm.And the feasibility of the improved algorithm is verified by experiments.