Soil element monitoring wireless sensor networks (SEMWSNs) are widely used in soil element monitoring agricultural activities. SEMWSNs monitor changes in soil elemental content during agriculture products growing through nodes. Based on the feedback from the nodes, farmers adjust irrigation and fertilization strategies on time, thus promoting the economic growth of crops. The critical issue in SEMWSNs coverage studies is to achieve maximum coverage of the entire monitoring field by adopting a smaller number of sensor nodes. In this study, a unique adaptive chaotic Gaussian variant snake optimization algorithm (ACGSOA) is proposed for solving the above problem, which also has the advantages of solid robustness, low algorithmic complexity, and fast convergence. A new chaotic operator is proposed in this paper to optimize the position parameters of individuals, enhancing the convergence speed of the algorithm. Moreover, an adaptive Gaussian variant operator is also designed in this paper to effectively avoid SEMWSNs from falling into local optima during the deployment process. Simulation experiments are designed to compare ACGSOA with other widely used metaheuristics, namely snake optimizer (SO), whale optimization algorithm (WOA), artificial bee colony algorithm (ABC), and fruit fly optimization algorithm (FOA). The simulation results show that the performance of ACGSOA has been dramatically improved. On the one hand, ACGSOA outperforms other methods in terms of convergence speed, and on the other hand, the coverage rate is improved by 7.20%, 7.32%, 7.96%, and 11.03% compared with SO, WOA, ABC, and FOA, respectively.
Keywords: Gaussian variant; chaotic operator; coverage optimization; power consumption; snake optimizer.