Exploiting External Interference for Clock Synchronization
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
Many wireless sensor network (WSN) applications require the synchronization of the network's independent node clocks. That synchronization is a challenging problem that often requires energy-constrained devices to exchange many messages.This paper introduces the Interference-based Clock Synchronization (ICS) protocol, an approach suitable for dense WSNs located in urban environments. ICS uses external interference to synchronize the network's nodes to either a network-local internal or global (e.g., UTC) external time. All of the network's nodes observe interference at roughly the same time, and the node possessing the common time transmits its observed pattern to the network. The network nodes then compare and align the received and locally-observed patterns, and subsequently, they update their clocks to the common time.The protocol is evaluated using both a simulator and hardware. Using this approach, the number of transmitted messages scales linearly with the network size. In the simulator, ICS-synchronized clocks had a mean time difference of 0.3635 ms when compared with the common time. Using hardware, the difference was larger at 4.9388 ms, but much of that difference can likely be attributed to the experimental setup.
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.001 |
| 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