ASPG Menu
search

American Scientific Publishing Group

verified Journal

International Journal of Wireless and Ad Hoc Communication

ISSN
Online: 2692-4056
Frequency

Continuous publication

Publication Model

Open access · Articles freely available online · No author fees or charges

International Journal of Wireless and Ad Hoc Communication
Full Length Article

Volume 10 • Issue 1 • PP: 43–52 • 2026

Time-Forward Evaluation of Denial-of-Service Detection in LEACH-Based Wireless Sensor Networks: Drift, Feature Budgets and Decision Costs

Firas Zobary 1*
1School of Computer Science and Artificial Intelligence, Wuhan University of Technology, Wuhan, Hubei, China
* Corresponding Author.
verified

Open Access & Copyright

© 2026 The Author(s). Published by ASPG. This article is licensed under the Creative Commons Attribution 4.0 International License (CC BY 4.0).

Received: February 04, 2026 Revised: March 11, 2026 Accepted: April 22, 2026

Abstract

Intrusion detectors for cluster-based wireless sensor networks are scored on shuffled records, although a deployed detector is trained on the early rounds of a network and consulted for the rest of its life. This paper re-examines denial-of-service detection on the WSN-DS benchmark under four protocols, the strictest of which trains on the first part of the simulation and tests on what follows. Five classifiers are compared, class-conditional drift is measured with the Kolmogorov–Smirnov distance, and a feature budget is chosen by forward selection on a validation window. Random and block-grouped folds agree to within half a point of macro-F1. The time-forward split does not: with all fifteen behavioural features a random forest falls from 0.974 to between 0.833 and 0.946 depending on its seed, because most late Blackhole and Grayhole records lie outside the training range. A six-feature forest restores 0.959 with negligible seed variance and cuts the report payload by 60%. Isotonic calibration followed by expectation-maximisation prior correction tracks the rising attack share to within one point and lowers the balanced decision cost by 38%, yet raises it at high miss penalties. Validation scores near the training period could not tell the fragile configuration from the stable one.

Keywords

Wireless sensor networks LEACH Denial-of-service detection Dataset shift Probability calibration

References

[1] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless sensor networks: a survey,” Com-puter Networks, vol. 38, no. 4, pp. 393-422, 2002.

[2] W. B. Heinzelman, A. P. Chandrakasan, and H. Balakr-ishnan, “An application-specific protocol architecture for wireless microsensor networks,” IEEE Transactions on Wireless Communications, vol. 1, no. 4, pp. 660-670, 2002.

[3] C. Karlof and D. Wagner, “Secure routing in wireless sensor networks: attacks and countermeasures,” Ad Hoc Networks, vol. 1, no. 2-3, pp. 293-315, 2003.

[4] A. D. Wood and J. A. Stankovic, “Denial of service insensor networks,” Computer, vol. 35, no. 10, pp. 54-62, 2002.

[5] D. R. Raymond and S. F. Midkiff, “Denial-of-service in wireless sensor networks: attacks and defenses,” IEEE Pervasive Computing, vol. 7, no. 1, pp. 74-81, 2008.

[6] I. Butun, S. D. Morgera, and R. Sankar, “A survey of intrusion detection systems in wireless sensor networks,” IEEE Communications Surveys & Tutorials, vol. 16, no. 1, pp. 266-282, 2014.

[7] I. Almomani, B. Al-Kasasbeh, and M. Al-Akhras, “WSN-DS: a dataset for intrusion detection systems in wireless sensor networks,” Journal of Sensors, vol. 2016, Art. no. 4731953, 2016.

[8] L. Alsulaiman and S. Al-Ahmadi, “Performance evalua-tion of machine learning techniques for DOS detection in wireless sensor network,” International Journal of Network Security & Its Applications, vol. 13, no. 2, 2021, doi: 10.5121/ijnsa.2021.13202.

[9] S. Salmi and L. Oughdir, “Performance evaluation of deep learning techniques for DoS attacks detection in wireless sensor network,” Journal of Big Data, vol. 10, Art. no. 17, 2023.

[10] M. A. Talukder, S. Sharmin, M. A. Uddin, M. M. Islam, and S. Aryal, “MLSTL-WSN: machine learning-based intrusion detection using SMOTETomek in WSNs,” In-ternational Journal of Information Security, vol. 23, pp. 2139-2158, 2024.

[11] R. Sommer and V. Paxson, “Outside the closed world: on using machine learning for network intrusion de-tection,” in Proc. IEEE Symposium on Security and Privacy, pp. 305-316, 2010.

[12] A. L. Buczak and E. Guven, “A survey of data min-ing and machine learning methods for cyber security intrusion detection,” IEEE Communications Surveys & Tutorials, vol. 18, no. 2, pp. 1153-1176, 2016.

[13] D. Arp, E. Quiring, F. Pendlebury, A. Warnecke, F. Pier-azzi, C. Wressnegger, L. Cavallaro, and K. Rieck, “Dos and don’ts of machine learning in computer security,” in Proc. 31st USENIX Security Symposium, pp. 3971-3988, 2022.

[14] F. Pendlebury, F. Pierazzi, R. Jordaney, J. Kinder, and L. Cavallaro, “TESSERACT: eliminating experimental bias in malware classification across space and time,” in Proc. 28th USENIX Security Symposium, pp. 729-746, 2019.

[15] S. Kapoor and A. Narayanan, “Leakage and the repro-ducibility crisis in machine-learning-based science,” Pat-terns, vol. 4, no. 9, Art. no. 100804, 2023.

[16] D. R. Roberts et al., “Cross-validation strategies for data with temporal, spatial, hierarchical, or phylogenetic structure,” Ecography, vol. 40, no. 8, pp. 913-929, 2017.

[17] J. G. Moreno-Torres, T. Raeder, R. Alaiz-Rodríguez, N. V. Chawla, and F. Herrera, “A unifying view on dataset shift in classification,” Pattern Recognition, vol. 45, no. 1, pp. 521-530, 2012.

[18] J. Gama, I. Žliobait˙e, A. Bifet, M. Pechenizkiy, and A. Bouchachia, “A survey on concept drift adaptation,” ACM Computing Surveys, vol. 46, no. 4, Art. no. 44, 2014.

[19] M. Saerens, P. Latinne, and C. Decaestecker, “Adjusting the outputs of a classifier to new a priori probabilities: a simple procedure,” Neural Computation, vol. 14, no. 1, pp. 21-41, 2002.

[20] Z. C. Lipton, Y.-X. Wang, and A. J. Smola, “Detecting and correcting for label shift with black box predic-tors,” in Proc. 35th International Conference on Ma-chine Learning, PMLR vol. 80, pp. 3122-3130, 2018.

[21] A. D’Amour et al., “Underspecification presents chal-lenges for credibility in modern machine learning,” Jour-nal of Machine Learning Research, vol. 23, no. 226, pp.

1- 61, 2022.

[22] F. Pedregosa et al., “Scikit-learn: machine learning in Python,” Journal of Machine Learning Research, vol. 12, pp. 2825-2830, 2011.

[23] L. Breiman, “Random forests,” Machine Learning, vol. 45, no. 1, pp. 5-32, 2001.

[24] J. H. Friedman, “Greedy function approximation: a gradient boosting machine,” The Annals of Statistics, vol. 29, no. 5, pp. 1189-1232, 2001.

[25] G. Ke, Q. Meng, T. Finley, T. Wang, W. Chen, W. Ma,

Q. Ye, and T.-Y. Liu, “LightGBM: a highly efficient gra-dient boosting decision tree,” in Advances in Neural In-formation Processing Systems, vol. 30, pp. 3146-3154, 2017.

[26] H. He and E. A. Garcia, “Learning from imbalanced data,” IEEE Transactions on Knowledge and Data Engi-neering, vol. 21, no. 9, pp. 1263-1284, 2009.

[27] M. Sokolova and G. Lapalme, “A systematic analysis of performance measures for classification tasks,” Infor-mation Processing & Management, vol. 45, no. 4, pp.

427- 437, 2009.

[28] D. Chicco and G. Jurman, “The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation,” BMC Genomics, vol. 21, Art. no. 6, 2020.

[29] B. Efron and R. J. Tibshirani, An Introduction to the Bootstrap. New York, NY, USA: Chapman & Hall, 1993.

[30] F. J. Massey Jr., “The Kolmogorov-Smirnov test for goodness of fit,” Journal of the American Statistical Association, vol. 46, no. 253, pp. 68-78, 1951.

[31] I. Guyon and A. Elisseeff, “An introduction to variable and feature selection,” Journal of Machine Learning Research, vol. 3, pp. 1157-1182, 2003.

[32] B. Zadrozny and C. Elkan, “Transforming classifier scores into accurate multiclass probability estimates,” in Proc. 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 694-699, 2002.

[33] A. Niculescu-Mizil and R. Caruana, “Predicting good probabilities with supervised learning,” in Proc. 22nd International Conference on Machine Learning, pp. 625-632, 2005.

[34] C. Elkan, “The foundations of cost-sensitive learning,” in Proc. 17th International Joint Conference on Artificial Intelligence, pp. 973-978, 2001.

[35] G. W. Brier, “Verification of forecasts expressed in terms of probability,” Monthly Weather Review, vol. 78, no. 1, pp. 1-3, 1950.

[36] C. Guo, G. Pleiss, Y. Sun, and K. Q. Weinberger, “Oncalibration of modern neural networks,” in Proc. 34th International Conference on Machine Learning, PMLR vol. 70, pp. 1321-1330, 2017.

Cite This Article

Choose your preferred format

format_quote
Zobary, Firas . "Time-Forward Evaluation of Denial-of-Service Detection in LEACH-Based Wireless Sensor Networks: Drift, Feature Budgets and Decision Costs." International Journal of Wireless and Ad Hoc Communication, vol. 10, no. 1, 2026, pp. 43–52. DOI: https://doi.org/10.54216/IJWAC.100107
Zobary, F. (2026). Time-Forward Evaluation of Denial-of-Service Detection in LEACH-Based Wireless Sensor Networks: Drift, Feature Budgets and Decision Costs. International Journal of Wireless and Ad Hoc Communication, Volume 10(Issue 1), 43–52. DOI: https://doi.org/10.54216/IJWAC.100107
Zobary, Firas . "Time-Forward Evaluation of Denial-of-Service Detection in LEACH-Based Wireless Sensor Networks: Drift, Feature Budgets and Decision Costs." International Journal of Wireless and Ad Hoc Communication Volume 10, no. Issue 1 (2026): 43–52. DOI: https://doi.org/10.54216/IJWAC.100107
Zobary, F. (2026) 'Time-Forward Evaluation of Denial-of-Service Detection in LEACH-Based Wireless Sensor Networks: Drift, Feature Budgets and Decision Costs', International Journal of Wireless and Ad Hoc Communication, Volume 10(Issue 1), pp. 43–52. DOI: https://doi.org/10.54216/IJWAC.100107
Zobary F. Time-Forward Evaluation of Denial-of-Service Detection in LEACH-Based Wireless Sensor Networks: Drift, Feature Budgets and Decision Costs. International Journal of Wireless and Ad Hoc Communication. 2026;Volume 10(Issue 1):43–52. DOI: https://doi.org/10.54216/IJWAC.100107
F. Zobary, "Time-Forward Evaluation of Denial-of-Service Detection in LEACH-Based Wireless Sensor Networks: Drift, Feature Budgets and Decision Costs," International Journal of Wireless and Ad Hoc Communication, vol. Volume 10, no. Issue 1, pp. 43–52, 2026. DOI: https://doi.org/10.54216/IJWAC.100107
policy

Publisher's Note

The statements, opinions, and data presented in this article are solely those of the author(s) and do not necessarily represent those of ASPG, the journal, or its editors. ASPG and the editors disclaim responsibility for any harm arising from the use of any ideas, methods, instructions, or products described in this article, to the fullest extent permitted by applicable law.

Digital Archive Ready