A Routing Algorithm for Node Protection in Wireless Sensor Network Based on Clustering Ant Colony Strategy

Abstract

Thanks to the rapid development of wireless communication and electronic technology, wireless sensor networks have been increasingly used in military, medical and other fields. Because of the characteristics of wireless sensor networks, traditional network routing protocols are not applicable in wireless sensor networks. In recent research, many wireless sensor network routing algorithms have been proposed. Among these algorithms, the cluster routing algorithm performs well, but the cluster routing algorithm often has the problem that some nodes die prematurely due to too many communication tasks. Ant colony optimization algorithm can effectively solve the combinatorial optimization problem with NP-Hard characteristics, and is widely used in routing algorithms. Therefore, we propose a node protection routing algorithm for wireless sensor network based on clustering ant colony strategy (NPAWSN). This algorithm optimizes the clustering process, selects multiple cluster head nodes for clusters with high communication pressure, and at the same time, designs a new path probability selection model for ant movement, which fully considers the remaining energy of cluster head nodes close to the sink, effectively alleviating the problem of premature death of some nodes due to too many transmission tasks. The algorithm considers the sensor energy, communication efficiency and other factors. The use of adaptive ant colony algorithm improves the convergence speed and maintains the high performance of the routing algorithm.