ST-IAOA-XGBoost: An Efficient Data-Balanced Intrusion Detection Method for WSN

To address the limitations of traditional machine learning method in the detection of minortiy class samples and the overall detection accuracy in wireless sensor networks (WSNs) intrusion detection (ID), this article proposes an ID method for WSN-based SMOTE-Tomek (ST)-improved arithmetic optimization algorithm (IAOA)-extreme gradient boosting tree (XGBoost). A synthetic minority oversampling technique, Tomek Link (SMOTE-Tomek), is used to reduce the impact of data imbalance on detection performance. In the proposed IAOA, logistic-tent chaos mapping and opposition-based learning (LTOBL) is incorporated to generate an efficient and even distribution initial population during the optimization process. Nonlinear inertia weights and Gaussian distribution are introduced to enhance the global and local search capabilities. Lévy flight is incorporated to randomly perturb the optimal individuals, enhancing population diversity and preventing the search from falling into the local optimal solution. To verify the effectiveness of the proposed method, we use 11 benchmark test functions and make simulation experiments through the WSN-DS dataset and KDDCUP 99 dataset. Simulation results show that, compared with reference algorithms, the proposed IAOA performs well in the benchmark function test, the ST-IAOA-XGBoost achieved significant improvements in terms of Accuracy, Precision, Recall, and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${F}1$ </tex-math></inline-formula> score on the WSN-DS dataset, with increases of up to 17%, 12%, 17%, and 27%, respectively. Similarly, on the KDDCUP 99 dataset, the enhancements were up to 22%, 23%, 22%, and 23% for Accuracy, Precision, Recall, and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${F}1$ </tex-math></inline-formula> score, respectively.