Research On An Improved Ant Colony Optimization Routing Algorithm Based On WSN

The Wireless Sensor Network(WSN)which is the technical support of the Internet of Things is currently one of the hot research areas.It is widely used in industrial control,smart home,precision agriculture,intelligent transportation,environmental monitoring,logistics tracking,health management and many other scenarios.The WSN network consists of a large number of sensor nodes with specific functions and limited energy.It is used to monitor the environment of a certain area and collect the task data needed for uploading.Due to the limited energy of its nodes,reducing node energy consumption is still the main problem that effects the life cycle of WSN networks currently.Therefore,this thesis focuses on the effective routing design in the energy constrained wireless sensor network.Firstly,this thesis introduces WSN network routing transmission characteristics and the principle of ant colony algorithm.Then summarizes the advantages and disadvantages of ant colony algorithm applied in WSN route design.Aiming at the problem that the basic ant colony algorithm has poor convergence path and long execution time,the algorithm is improved.Secondly,we can achieve the algorithm test by constructing a network simulation model.Then,compared the proposed new algorithm with GPRSE algorithm based on energy and distance and ACO algorithm based on an improved heuristic information.The proposed algorithm performance is explained from end to end delay,network energy consumption and lifecycle.This thesis mainly aims at the problems of the energy consumption in WSN network routing transmission and the short life cycle of the nodes,and proposes an improved routing algorithm that integrates multiple factors such as direction,delay and energy consumption.The algorithm mainly improves from the following points:(1)In order to solve the problem of local optimal solution in ant colony algorithm,the algorithm adopts a local and global pheromone update strategy,and adds node communication energy consumption in the state transfer formula.Death of nodes can be avoided with frequently working,so as to achieve the goal of energy consumption and improve the optimal solution performance.(2)Aiming at the problem that the basic ant colony algorithm has a long convergence time,the algorithm adds a direction search factor during the construction of the path to reduce redundant path construction and improve the quality of routing and convergence speed in the global scope.The simulation results show that energy consumption is balanced better,networklifetime is extended and can be adapted to larger networks to the proposed algorithm.