Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index; 15 of the 39 sources its claims cite were checked for support.

Digital Twins at the Edge: A High-Availability Framework for Resilient Data Processing in IoT Sensor Networks

Open access
Neagu, Madalin, Serban, Codruta Maria, Hangan, Anca, Sebestyen, Gheorghe · 2026 · Future Internet

Abstract

This paper introduces the Operational Digital Twin, a live state-synchronized standby system for node-level failover in resource-constrained edge environments.

Overview

CoChat Summary

TL;DR

The paper introduces the Operational Digital Twin (ODT), a state-synchronized standby edge node that assumes the primary node's role on failure, and validates it on a two-node Raspberry Pi 5 testbed. Fault-injection experiments show ~1.35 s VIP failover, 100% success across 500 cycles, and 10.81% message loss during transitions.

Key findings

  • Mean VIP failover latency was 1.353 s (200 tests) and 1.335 s (500 tests), with 95% of failovers completed within 2.5 s; 100% success rate across 500 consecutive cycles with no degradation.
  • Data-processing service recovered in a mean of 0.271 s (200 tests), while MQTT broker recovery was the bottleneck and highly variable (range 0.012–7.630 s, mean 1.339 s).
  • Average message loss during failover was 10.81% (delivery rate 89.19%), consistent with the 1.345 s vulnerability window at a 10 Hz publication rate.
  • Resource overhead was very low: CPU below 3% and memory below 10% during a 6 h campaign; split-brain was detected in ≈6 s and resolved in ≈12 s via an external witness device.

Methods

  • Design: a three-layer architecture (ESP8266 sensing layer, primary–backup Raspberry Pi 5 edge layer, Virtual IP virtualization layer) using MQTT/Mosquitto, keepalived/VRRP for VIP failover, rsync over SSH for 30 s configuration synchronization, and a custom vip-monitor service.
  • Data/sample: two Raspberry Pi 5 nodes (8 GB RAM) plus ESP8266 NodeMCU sensors (DHT22, MQ-7) on a dual-band router; baseline round-trip latency below 2 ms; an additional Raspberry Pi 5 served as a witness for partition tests.
  • Analysis: automated fault injection (stopping keepalived or applying iptables rules) across campaigns of 10, 200, and 500 cycles, measuring failover latency, service-recovery time, reliability, MQTT throughput/latency/loss, resource utilization, and partition tolerance, plus sensitivity analysis over payload size, test duration, and partition length.

Limitations

  • Stated: the two-node homogeneous testbed does not reflect real-world heterogeneity or complexity; scaling to larger clusters would introduce leader-election contention, quorum logic, state-propagation scalability, and cascading failures; hardware heterogeneity may create capacity asymmetries; network conditions in the lab are less variable than operational settings; the 10 Hz periodic workload does not capture bursty or stateful IoT traffic; and six hours/500 cycles cannot reveal long-term drift, resource exhaustion, or hardware degradation.
  • Evident from the text: the 10.81% message loss requires application-layer mitigation (buffering, retries, QoS), and the consistency-over-availability partition policy introduces a deliberate window of service unavailability; the state-of-the-art comparison (Table 12) draws on independent testbeds with different hardware and workloads, which the authors themselves caution against comparing directly.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.3390/fi18030137

Cites

38 of 38 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

13 Valid · 1 Not valid · 9 Not checked · 96 Own results and interpretations

53 more claims · 2 with their cited sources checked

Create a free account to see all 119 claims and every source verdict.

See all claims — free account
  • Probably not a substantial claim. 31
  • It may state two separate claims as one. 35

Create a free account to see these claims.

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

5 of 5

Citations

Cites

Show all 35 references

Research works printed but not linked: 1

  1. Du, 2020, Fault-Tolerating Edge Computing with Server Redundancy Based on a Variant of Group Degree Centrality, Proceedings of the International Conference on Service-Oriented Computing (ICSOC 2020); Lecture Notes in Computer Science, Volume 12571, 198

Cited by

See all 3

Metadata

Authors
Neagu, M., Serban, C. M., Hangan, A., & Sebestyen, G.
Affiliations
  • Department of Computer Science, Faculty of Automation and Computer Science, Technical University of Cluj-Napoca, 400027 Cluj-Napoca, Romania
  • Technical University of Cluj-Napoca (RO)
Venue
Future Internet
Publisher
MDPI AG
Published
2026-03-06
Volume
18
Issue
3
Pages
137
ISSN
1999-5903 (ISSN-L)
OpenAlex
W7134065245
Cited by
3
References
35
Citations by year
2026: 3
FWCI
7.11
Type
journal article
Language
en
Open access
Locations
  • Future Internet (publishedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
  • “Disponibilitate, confidențialitate și detecție de anomalii în sisteme IoT-DeCiD”
  • Competition-GNaC ARUT 2023
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Distributed systems and fault tolerance
  • Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
  • Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Digital Transformation in Industry
Keywords
edge computing, IoT sensor networks, high availability, redundancy, state synchronization, fault tolerance, single point of failure, resource-constrained devices, fault injection

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-10-12, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-12 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Digital Twins at the Edge: A High-Availability Framework for Resilient Data Processing in IoT Sensor Networks. https://app.cochat.ai/papers/10.3390/fi18030137
The paper
Neagu, M., Serban, C. M., Hangan, A., & Sebestyen, G. (2026). Digital Twins at the Edge: A High-Availability Framework for Resilient Data Processing in IoT Sensor Networks. Future Internet. https://doi.org/10.3390/fi18030137

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.