Enhancing IEEE 1588 PTP security for IIoT networks: A lightweight attack detection and mitigation framework
Bibliographic record
Abstract
Highly precise clock synchronization is an important aspect of the Industrial Internet of Things (IIoT) network because desynchronized clocks among nodes in IIoT can degrade system performance and even lead to system failure. IEEE 1588 Precision Time Protocol (PTP) is widely used in such time-sensitive networks. Resource efficiency and security have become the most important concerns in designing PTP for IIoT applications. PTP provides unified and high-precision time, whereas it is resource inefficient and insecure in its current form, particularly for resource-constrained IoT devices, such as battery powered sensing nodes. To this end, this paper aims to advance the existing PTP to improve security for IIoT networks without involving complex and power-consuming cryptographic algorithms. We study and analyze the potential cyber-attacks that can affect the security and synchronization of the PTP network. Considering the limitations of the PTP security defined by IEEE 1588 in its Annex K, we propose a security extension to the PTP algorithm. This security model covers the full PTP attack surface and allows the detection of attacks on all the PTP nodes in a timely manner. Along with the attack detection, we establish an attack mitigation model to mitigate the attack effects on Master PTP nodes. The proposed secure PTP model was evaluated under different network conditions and with varying important parameters. It was observed that newly introduced functions do not compromise synchronization accuracy. All the experimental evaluations demonstrate that the proposed approach is more secure and robust to cyber-attacks and does not affect the operation of PTP devices in all considered network configurations.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".