Font Size: a A A

Research On Routing Protocol Of Wireless Sensor Network Based On Particle Swarm Optimization And Ant Colony Algorithm

Posted on:2019-05-05Degree:MasterType:Thesis
Country:ChinaCandidate:S Q TianFull Text:PDF
GTID:2428330563499109Subject:Information and Communication Engineering
Abstract/Summary:PDF Full Text Request
The lifetime of wireless sensor networks is determined by the energy consumption rate of nodes.How to improve the energy utilization of nodes has become one of the key technologies of WSN's research.In the energy activity of nodes,the energy consumption of routing protocols is larger.Aiming at the problem of the existing cluster based routing algorithm,such as the unbalanced energy consumption and overload of the cluster heads,and shortening the life cycle of the network,we propose two clustering routing algorithms: A new clustering routing algorithm based on chaotic-quantum TSPSO(Two-Swarm Particle Swarm Optimization);clustering routing algorithm based on TSPSO-ACO(TSPSO and Ant colony algorithm).(1)In order to solve the problems of low convergence speed and sensitivity to local convergence for particle swarm optimization clustering routing algorithm.A new clustering routing algorithm based on chaotic-quantum TSPSO(Two-Swarm Particle Swarm Optimization)algorithm is proposed.The cost function of the optimal cluster head is chosen according to the energy of the cluster head,the distance between the cluster head and the convergence node and the distance structure of the cluster node.Among them,the main particle swarm is optimized by using the chaotic particle swarm optimization,making the particle swarm alternately transformed between the stable and chaotic states.The subgroups are optimized by quantum particle swarm optimization and the quantum wave theory make the algorithm has better global convergence.The concave function decreasing strategy to optimize the weight is adopted in the algorithm of TSPSO.The convergence speed is accelerated.The simulation results show that the proposed algorithm can balance the energy consumption of the wireless sensor network nodes and extend the network life cycle significantly,and compare with LEACH(Low-Energy Adaptive Clustering Hierarchy)and PSO-C(Cluster setup using Particle Swarm Optimization algorithm)respectively extend by 80.1% and 41.4%.(2)Aiming at the single hop mode of cluster head and base station,the optimization based TSPSO-ACO routing algorithm is proposed.On the basic of improved TSPSO routing algorithm,the transmission path of cluster head to base station is optimized.Since the information collected by the cluster head is finally transferred to the base station,the traditional TSP model is redefined.Base station is taken as the end point and the nearest cluster head of the base station is used as the starting point to select an optimal path based on the global cluster head.The heuristic function is improved by introducing the two factors of node energy and base station distance,so that the next cluster head of the ant colony visit has enough energy.The simulation results show that the TSPSO-ACO algorithm greatly reduces the loss energy of the cluster head because of the single jump to the base station.Compared with the LEACH protocol,the PSO-C protocol and the EBUCP protocol,the lifetime of the cluster is prolonged by 150%,44.5%,and 5.7% respectively.
Keywords/Search Tags:wireless sensor networks, clustering routing algorithm, particle swarm optimization algorithm, ant colony algorithm
PDF Full Text Request
Related items