An improved beetle antennae search algorithm and its application in coverage of wireless sensor networks

Abstract

This manuscript presents ABSAS-CS-GSA, an improved iteration of the beetle antennae search (BAS) algorithm, tailored to address the shortcoming of the BAS with low convergence accuracy and easily falling into local optima. The improvements are structured into three principal components: first, dynamic step-size adjustment predicated on initial population to bolster solution accuracy and expedite convergence; second, position update mechanism integrating golden sine algorithm to diversify search patterns and expedite convergence; and third, population disturbance based on vertical and horizontal cross strategy to avoid falling into local optima. Experimental results on 12 benchmark functions demonstrate ABSAS-CS-GSA's superiority over the standard BAS and its four variants, as well as over two classic swarm intelligence algorithms. The simulation results of the algorithm applied to coverage optimization of wireless sensor networks with 30 nodes and 50 nodes reveal a marked improvement in both optimal and average coverage metrics relative to seven alternative algorithms. The refined algorithm exhibits excellent performance and is well-suited for tackling the coverage issue within wireless sensor networks.