Context-Based Collaborative Self-Test for Autonomous Wireless Sensor Networks
Bibliographic record
Abstract
Reliability is a major concern in autonomous wireless sensor networks. Current approaches to maintaining high overall system availability concentrate on pseudo-random test scheduling and test vector generation based on a probabilistic approach to failure prediction. In the case of wireless sensor networks though, most of device failures can be directly associated with specific events. Furthermore, these events can often be identified using the sensors already present on the nodes and used to trigger self test of the affected devices with test vectors specifically crafted to match the possible failures. In this paper, we discuss an approach to wireless sensor node self-testing using sensor data gathered by the device itself and by the neighboring nodes. We analyze possible impact of this approach on the Mean Time To Detect (MTTD) and the overall system availability. Also, the proposed approach can help decrease energy consumption of the system through avoiding unnecessary data communication and extensive hardware testing. We also discuss advantages arising from installation of additional dedicated sensors on the nodes that help to more accurately detect and classify an event and thus the possible failure and its severity. Finally, we present a test system that implements the proposed approach.
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 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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".