Detection of Botnet in the loT Network
Bibliographic record
Abstract
The ubiquity of Internet of Things (IoT) devices has prompted security concerns, particularly in the face of evolving botnet attacks. This paper investigates the impact of botnet attacks on IoT devices and proposes a network-based detection and prevention system employing signature and anomaly-based mechanisms. Notably, our methodology extends beyond traditional detection, focusing on proactively impeding bot creation. Leveraging a Linux-based distributed system, Security Information and Event Management (SIEM) tools, and custom rules, our approach encompasses distinct phases Preprocessing, Network Security Monitoring, Rule-based IDS System, and Analysis. Experimental results with diverse PCAP files demonstrate the efficacy of custom rules, significantly enhancing alert counts for various security aspects, including network trojan detection and privacy violations. The significant finding is the substantial increase in alert counts after the integration of custom rules, exemplified in the 1.1 GB PCAP file scenario. Network trojan detection surged from 585 to 988, emphasizing the heightened efficacy of rule-based measures. Privacy breaches and bad traffic alerts also experienced significant increments, showcasing the system’s improved sensitivity and responsiveness. This finding reinforces the pivotal role of custom rules in fortifying IoT network security comprehensively.
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.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.002 | 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.000 | 0.000 |
| 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".