Detection of DDoS Cyberattack Using a Hybrid Trust-Based Technique for Smart Home Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
As Smart Home Internet of Things (SHIoT) continue to evolve, improving connectivity and security whilst offering convenience, ease, and efficiency is crucial. SHIoT networks are vulnerable to several cyberattacks, including Distributed Denial of Service (DDoS) attacks. The ever-changing landscape of Smart Home IoT threats presents many problems for current cybersecurity techniques. In response, we propose a hybrid Trust-based approach for DDoS attack detection and mitigation. Our proposed technique incorporates adaptive mechanisms and trust evaluation models to monitor device behaviour and identify malicious nodes dynamically. By leveraging real-time threat detection and secure routing protocols, the proposed trust-based mechanism ensures uninterrupted communication and minimizes the attack surface. Additionally, energy-efficient techniques are employed to safeguard communication without overburdening resource-constrained SHIoT devices. To evaluate the effectiveness of the proposed technique in efficiently detecting and mitigating DDoS attacks, we conducted several simulation experiments and compared the performance of the approach with other existing DDoS detection mechanisms. The results showed notable improvements in terms of energy efficiency, improved system resilience and enhanced computations. Our solution offers a targeted approach to securing Smart Home IoT environments against evolving cyber threats.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| 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.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it