SC-MLIDS: Fusion-based Machine Learning Framework for Intrusion Detection in Wireless Sensor Networks
Bibliographic record
Abstract
This paper proposes the Server–Client Machine Learning Intrusion Detection System (SC-MLIDS), a novel fusion framework designed to enhance security in Wireless Sensor Networks (WSNs), which are inherently vulnerable to various security threats due to their distributed nature and resource constraints . Traditional Intrusion Detection Systems (IDSs) often face challenges with high computational demands and privacy issues. SC-MLIDS addresses these problems by integrating Federated Learning (FL) with a multi-sensor fusion approach to implementing two layers of defence that operate independently of specific attack types. Moreover, this framework leverages a server–client architecture to efficiently manage and process data from sensor nodes , sink nodes, and gateways within the network. The core innovation of SC-MLIDS lies in its dual model aggregation algorithms at the gateway: one assesses model performance and weight, while the other uses majority voting to integrate predictions from both client and server models. As a result, this approach reduces redundant data transmissions and enhances detection accuracy, making it more effective than conventional methods in WSNs. Our proposed framework outperforms current state-of-the-art techniques, achieving F1-scores of 99.78% and 98.80% for the two aggregation algorithms, namely, Weighted Score and Majority Voting. This validation demonstrates the effectiveness of SC-MLIDS in providing accurate intrusion detection and robust data management.
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.003 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| 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".