Intrusion Detection for Flooding-Based Denial-of-Service Attacks in Wireless Sensor Networks Using a Long Short-Term Memory Deep Learning Model
Bibliographic record
Abstract
The need for deep learning (DL) approaches as effective and practical models for attaining security in wireless sensor networks (WSNs) has grown with the rise of artificial intelligence applications.With the capacity to identify threats and guarantee data integrity, DL models improve security efficacy and lower the total risks of different assaults.Intelligent detection and protection systems are essential for the security of information transfer since wireless computer networks are vulnerable to several incursions, including malware, intrusion flows, and security flaws.In order to identify and stop distributed denial of service (DDoS) assaults, this study will categorize and analyze data transferred across the virtual computer network using a DL approach known as long short-term memory (LSTM).In this study, a deep learning (LSTM) algorithm model has been employed for a virtual cloud WSN and proposed to check security using the UNSW-NB15 dataset and detect/stop the DDoS cyber-attacks flood type.The proposed LSTM deep learning model has been designed to analyze and classify the flood of the transmitted dataset inside the WSN by training the internal weights and adjusting their parameter variations.According to the simulation results, a high training efficiency was recorded, reaching 99.96% with a very low error rate of 0.04% in training the proposed LSTM model according to the employed dataset.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".