NIS01-1: An Efficient Key Management Scheme for Heterogeneous Sensor Networks
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
Security is critical for sensor networks deployed in hostile environments. Previous research on sensor network security mainly considers homogeneous sensor networks, i.e., all sensor nodes have the same capabilities. Many security schemes designed for homogeneous sensor networks suffer from high communication/computation overhead, and/or large storage requirement. We adopt a heterogeneous sensor network (HSN) model to overcome these problems. In this paper, we present an efficient asymmetric pre-distribution (AP) key management scheme that takes advantage of the powerful high-end sensors (H-sensors) in an HSN. The AP scheme utilizes the large storage of H-sensors and pre-load each H-sensor with a relatively large number of keys. The AP scheme dramatically reduces the total storage space for key pre-distribution. The performance evaluation and security analysis show that the AP scheme provides better security than existing key management schemes, while achieving significant reduction on sensor storage.
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.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.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