Design of network self-organization-based energy-optimized routing algorithm for large-scale wireless sensor networks

Abstract

Routing algorithms not only help the wireless sensor networks to accomplish their tasks but also help the nodes to select an optimal path among the many paths for the transmission of data packets. However, due to the limited energy and inadequate hardware conditions of wireless sensor networks, it is prone to data transmission delays and shortened life cycle due to insufficient energy of the nodes. For this reason, the article proposes the EAODV routing protocol based on energy optimization, based on the in-depth analysis of the existing routing protocols, establishes the mathematical model of network node characteristics, and proposes the energy-optimized routing algorithm E-EEABR with the improvement of the ant colony for solving. The next-hop route is precisely selected by considering three factors: distance band, search angle and distance factor, the transmission task of overloaded “hot” nodes is balanced by incentive strategy, and the probability transfer function is optimized by pseudo-random scaling rule to enhance the algorithm's optimization ability. Finally, the article verifies the effect of energy optimization of the routing algorithm through simulation experiments. From the results of simulation experiments, it can be seen that the average energy consumption of cluster head of E-EABR algorithm is lower than that of SEP algorithm, and its maximum energy consumption is about 2.35×10-3 J, while the maximum average energy consumption of cluster head of SEP algorithm is about 8.7×10-3 J. It can be concluded that the performance of cluster head energy consumption is better than that of the comparative algorithms, and the algorithm of this paper effectively reduces the average energy consumption of the cluster head and equalizes the energy consumption of the network.