MétaCan
Menu
Back to cohort
Record W2066300013 · doi:10.1109/inss.2007.4297432

Syncob: Collaborative Time Synchronization in Wireless Sensor Networks

2007· article· en· W2066300013 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNetwork Time Synchronization Technologies
Canadian institutionsInstitute of Particle Physics
Fundersnot available
KeywordsComputer scienceSynchronizingOverhead (engineering)Wireless sensor networkSynchronization (alternating current)Node (physics)Computer networkDistributed computingKey distribution in wireless sensor networksData synchronizationProtocol (science)WirelessWireless networkReal-time computingEmbedded systemChannel (broadcasting)Transmission (telecommunications)Engineering

Abstract

fetched live from OpenAlex

This paper analyses the problem of time-synchronization of distributed sensor nodes. We present a Syncob, a method for synchronizing an arbitrary number of nodes in a distributed setting without the requirements of an infrastructure, master node or time and resource consuming protocol overhead. Syncob is therefore also very good suited for highly mobile settings with ad-hoc communication. Syncob is implemented as a physical layer protocol and provides a time synchronization deviation of max. 4μs between any participating node. Our implementation on low-cost pPart sensor nodes shows that Syncob requires very low overhead and very low complexity for hardware and software.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.923
Threshold uncertainty score0.736

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.004
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.004
GPT teacher head0.212
Teacher spread0.208 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations18
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicNetwork Time Synchronization TechnologiesFrench-language works237,207