An anomaly node detection method for distributed time synchronization algorithm in cognitive radio 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
In wireless sensor networks, time synchronization is an important issue for all nodes to have a unified time. The wireless sensor network nodes should cooperatively adjust their local time according to certain distributed synchronization algorithms to achieve global time synchronization. Conventionally, it is assumed that all nodes in the network are cooperative and well-functioned in the synchronization process. However, in cognitive radio wireless sensor networks, the global time synchronization process among secondary users is prone to fail because the communication process for exchanging synchronization reference may be frequently interrupted by the primary users. The anomaly nodes that failed to synchronize will significantly affect the global convergence performance of the synchronization algorithm. This article proposes an anomaly node detection method for distributed time synchronization algorithm in cognitive radio sensor networks. The proposed method adopts the statistical linear correlation analysis approach to detect anomaly nodes through the historical time synchronization information stored in local nodes. Simulation results show that the proposed method can effectively improve the robustness of the synchronization algorithm in distributed cognitive radio 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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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