LAUSR

When checking and sensing external communication data, wireless sensor networks are susceptible to interfering signals with different frequencies. In order to track the location of the jamming attack point and deploy security defense mechanism, a minimum covered circle jamming attack localization algorithm based on the improved beetle antennae search algorithm is proposed. By comparing the different nodes, the relative coordinates of jamming points which are taken as the initial position of the beetle are determined, judging the fitness values of left and right antennae. Meanwhile, by introducing adaptive step size strategy and adjusting the flight distance, the position of beetle is updated to avoid falling into local extremum. Combining with the characteristics of fast convergence of beetle antennae search algorithm, the optimal solution is found. Using this algorithm, the minimum radius of the circle covered by the jammed nodes and the position of the center of the circle are solved, and the location of the jammer is realized. Simulation results show that, the proposed algorithm is more efficient than the existing algorithm with regard to runtime complexity. The proposed algorithm also excels at lowering the error rate and increasing position performance in different distribution types of networks with different nodes densities and other external factors, the proposed algorithm has lower error rate, better positioning performance in different distribution types of networks with different node densities and other external factors. The runtime complexity of the algorithm is small and the error range is uniform, proving the effectiveness of the algorithm.