Formal reliability analysis of wireless sensor network data transport protocols using HOL
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
In recent times, Wireless Sensor Networks (WSNs) have shown a great potential for monitoring physical or environmental conditions in a variety of safety and financial-critical applications, ranging from medicine to transportation and surveillance. Given the extreme conditions of most of the WSN environments, it is very important to make WSN communication resilient to network failures. Various data transport protocols have been proposed in the literature to serve this purpose. The reliability of these WSN data transport protocols is usually assessed by using Reliability Block Diagrams (RBDs). Traditionally, RBD-based reliability analyses of WSN data transport protocols is done using paper-and-pencil proofs or computer simulations, which cannot ascertain absolute correctness due to their inherent incompleteness. As a complementary approach, we propose to use the higher-order-logic theorem prover HOL to conduct the RBD-based reliability analysis of WSN data transport protocols. In particular, the paper provides a higher-order-logic formalization of series, parallel and parallel-series RBDs. These RBDs are then used to do the formal reliability analysis of the end-to-end (e2e) data transport mechanism, and the Event to Sink Reliable Transport (ESRT) and Reliable Multi-Segment Transport (RMST) data transport protocols.
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.004 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.002 |
| Open science | 0.002 | 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