MétaCan
Menu
Back to cohort
Record W4412768330 · doi:10.18280/jesa.580608

Multi Cyber Attacks Detection System in Interet of Things Based on Machine Learning

2025· article· en· W4412768330 on OpenAlexvenueno aff
Rand Nabeel Dawood, Neamet Akeel Fawzi, Hind Ali abdul Hassan

Bibliographic record

VenueJournal Européen des Systèmes Automatisés · 2025
Typearticle
Languageen
FieldComputer Science
TopicNetwork Security and Intrusion Detection
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceInternet of ThingsComputer securityArtificial intelligenceMachine learning

Abstract

fetched live from OpenAlex

In this work, we propose a machine learning-based approach to improvement in cybersecurity in sensor networks (SNs).Indeed, SNs are vital to a wide range from environmental monitoring and military surveillance to underwater exploration.Due to their open and distributed nature, they inherently remain much more vulnerable to cyberattacks.Because of unique constraints about the bandwidth, latency, and energy, traditional security approaches remain inappropriate for them.In our proposed approach, we have used a Random Forest Classifier (RFC) and Supported Vector Machine Classifier (SVM) for detecting and mitigating various kinds of network attacks.The dataset used in this work is wireless sensor network dataset (WSN-DS), which contains SN-relevant features such as attack types like normal, flooding, time division multiple access (TDMA), Grayhole, and Blackhole.Preprocessing will be done by dropping the irrelevant columns, scaling the features, and encoding the target variable.Our model worked well using the RFC approach compared to SVM, yielding an accuracy of 99.66%, with precision at 99.69%, recall at 99.66%, and an F1-score of 99.67%.Besides, we also tested our Random Forest-based IDS on the Network Security Lab-Knowledge Discovery and Data Mining (NSL-KDD) dataset that includes a number of features relevant to network traffic and intrusion detection.The obtained results for the "NSL-KDD" test set are as follows: accuracy-1.00,precision-0.87,recall-0.87,F1-score-0.87.We can understand from the confusion matrix that this model correctly identified various attack types and normal behavior.Also, a classification report shows more about the performance of the model for each class.The high performances of our Random Forest models on both datasets confirm the potentiality of machine learnin-based solutions against intrusion detection in UWSNs.Indeed, robustness against imbalanced data and the ability tо capture complex interactions between features explain their success.In the future, other machine learning models can be explored, including deep learning approaches, as well as real-time deployment of IDS í ñ UWSNs.Besides, extending the datasets to more types of attacks and scenarios would improve the generalization capability of these models.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.000
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.014
GPT teacher head0.248
Teacher spread0.234 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueJournal Européen des Systèmes AutomatisésSame topicNetwork Security and Intrusion DetectionFrench-language works237,207