Graph-Neural-Network-Based Intermittent Fault Diagnosis for Reliability of Symbiotic Internet of Things
Bibliographic record
Abstract
Rapid iterations and updates in both software and hardware, along with significant advancements in communication technology, have given rise to the concepts of symbiotic Internet of Things (IoT) and ubiquitous interconnectivity, providing strong evidence for the flourishing development of the Internet of Things. However, the limited resources and computing capabilities, along with the heterogeneity of deployment environments, make symbiotic IoT devices more susceptible to security threats and operational issues. Intermittent failures are especially prevalent in the symbiotic IoT, leading to more significant risks for devices. In this paper, we present an IFDGAT-LSTM (Intermittent Fault Diagnosis Based on Long Short-Term Memory and Graph Attention Network) framework for diagnosing intermittent failures in wireless sensing devices within the symbiotic IoT. The framework is based on a graph neural network and takes into account not only the time series characteristics of symbiotic IoT devices but also their deployment topology. By incorporating both aspects, we achieve more accurate diagnostics of intermittent failures in the symbiotic IoT, thus enhancing its reliability. Firstly, we propose the concept of a quasi-dynamic graph based on the variations in the topology within the symbiotic IoT. Subsequently, we introduce an intermittent failure diagnosis framework that combines a graph neural network to identify intermittent failure nodes within the quasi-dynamic graph. Finally, we performed experiments on the WADI symbiotic IoT dataset to evaluate the performance of our model in diagnosing intermittent failure nodes. We used the precision, recall, and F1 score metrics for assessment. The experimental outcomes show that our proposed model, IFDGAT-LSTM, achieves an Precision of 99.58% in diagnosing intermittent failure nodes. This highlights the strong performance and efficacy of the IFDGAT-LSTM model.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| 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.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".