Optimizing IoT Network Intrusion Detection: A Deep Learning Approach
Bibliographic record
Abstract
Network Intrusion Detection System (NIDS) serves as a essential component in data protection by monitoring computer networks for threats that can bypass conventional defenses such as malware and hackers. Deep learning (DL) techniques provide a promising approach for analyzing raw IoT network data to identify subtle patterns indicative of intrusion attempts. This study addresses a crucial research gap by developing a Deep Convolutional Neural Network (DCNN) model specifically designed for the efficient detection of stealthy and polymorphic variants while reducing false positives. Utilizing the NF-ToN-IoT dataset, the proposed model achieves outstanding performance metrics on test data, with an accuracy of 0.9923, precision of 0.9925, recall of 0.9979, and F1 score of 0.9952. To comprehensively evaluate the robustness of the model, a multi-dataset validation strategy is employed. The model is retrained and assessed on established benchmark datasets on IoT Networks, including NF-UNSW-NB15, NF-UNSW-NB15-v2 and NF-BoTIoT, demonstrating exceptional performance. Furthermore, the significance of the contribution is validated by comparing the proposed model against previously established architectures such as CNN+BiLSTM, DNN, GRU+RNN, and CNN+LSTM using the NF-ToN-IoT dataset. The proposed model consistently outperforms these prior models, highlighting its efficacy and advancements in the field. Additionally, an ablation study is conducted to analyze the individual components of the Deep CNN model, providing insights into their contributions towards detecting malware traffic and offering guidance for optimizing future NIDS models in the cybersecurity domain. Making our work available open-source on https://github.com/codewithkhurshed/IDSIUB can enhance its accessibility and promote future research opportunities in Network Intrusion Detection.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".