A Hybrid Machine Learning Intrusion Detection System for Wireless Sensor Networks
Bibliographic record
Abstract
Federated Learning (FL) has emerged as a novel distributed Machine Learning (ML) approach, to tackle the challenges associated with data privacy and overload in MLbased intrusion detection systems (IDSs). Drawing inspiration from the FL architecture, we have introduced a hybrid ML IDS tailored for Wireless Sensor Networks (WSNs). This system is crafted to leverage ML for achieving a two-layer intrusion detection mechanism in WSNs free from constraints posed by specific attack types. The architecture follows a server-client model compatible with the configuration of sensor nodes, sink nodes, and gateways in WSNs. In this setup, client models located at sink nodes undergo training using sensing data while the server model at the gateway is trained using network traffic data. This two-layer training approach amplifies the efficiency of intrusion detection and ensures comprehensive network coverage. The results derived from our simulation experiments corroborate the effectiveness of the proposed hybrid ML IDS. It generates precise aggregation predictions and leads to a substantial reduction in redundant data transmissions. Furthermore, the system exhibits efficacy in detecting intrusions through a dual validation process.
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.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
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".