Guarding an area of interest in sensor grids with unreliable nodes
Bibliographic record
Abstract
We consider Wireless Sensor Networks (WSNs) deployed in the plane to guard against intrusion events aiming to access a specified area of interest. Sensor nodes of the network are assumed to be unreliable with known failure probabilities. In such an environment, system dependability is of prime importance. To aid in analyzing dependability, we formalize a network wide reliability measure that quantifies the likelihood that the network provides simultaneous detection and reporting of intrusion events. We refer to the problem of computing the defined measure as the breach path to target area reliability (BPTA-REL) problem. We show that the problem admits polynomial time solution on grid networks employing diagonal links where the width of a grid is limited but the length can be arbitrarily large. Such grid topologies are useful for border area protection applications. The result is notable since the BPTA-REL problem is #P-hard in general. We present numerical results that show the potential use of our devised algorithm as a network design tool.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 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".