Design of sensor networks with guaranteed connectivity and lifetime
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
Nodes in sensor networks are often prone to failure, particularly when deployed in hostile territories, where chances of damage/destruction are significantly higher. In many applications it is necessary to have some guarantees on the coverage, connectivity and lifetime of the sensor network. The network should also be able to adapt to single and/or multiple node failures as well as disruptions due to the inherent limitations of the wireless communication medium. In hierarchical sensor networks using relay nodes, sensor nodes are arranged in clusters and higher-powered relay nodes can be used as cluster heads. In this paper, we propose an integer linear program (ILP) for determining the minimum number of relay nodes, along with their locations and a suitable communication strategy such that the network is able to meet specified performance guarantees with respect to coverage, connectivity and lifetime. To the best of our knowledge, this is the first formulation that jointly optimizes energy-aware placement and routing of relay nodes in two-tiered sensor networks.
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.000 | 0.000 |
| 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 it