Optimized Clustering Routing Algorithm Based on Deviation Maximization Method and the BFS

Energy efficient routing algorithm is an important measure to balance energy consumption in wireless sensor networks. An optimized clustering routing algorithm based on deviation maximization method and the best priority search method BFS (ORADB) is proposed in this paper. Firstly, the distance from the nodes to the base station, the residual energy of the nodes and the density of the neighbor nodes are considered comprehensively, and adopt the deviation maximization method to objectively weight the influence factors, so as to realize the optimization of cluster head selection. Secondly, the BFS algorithm, which takes the link cost calculated by node energy consumption and the distance from node to base station as heuristic function is used to select the shortest multi-hop path between cluster heads with the lowest link cost to optimize the data transmission path. Finally, simulation experiments show that compared with LEACH and LEACH-C, the ORADB algorithm can optimize cluster heads selection and multi-hop transmission path between cluster heads. The number of surviving nodes decreases slowly, the total energy consumption of the network is more balanced, and the life cycle of the network is prolonged.