ArticleScientific reports2025
Efficient data consensus algorithm integrating FL and blockchain dynamic partition protocol PBFT.
Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
1 author.
Funding
Abstract
With the rapid development of Internet of Things (IoT) technology, the demand for distributed data sharing has surged. Privacy breaches, a single point of failure, and high communication overhead have become core challenges. Existing privacy protection based on single federated learning lacks reliable collaboration mechanisms and fault tolerance capabilities. The traditional PBFT algorithm also faces communication complexity and is incompatible with high concurrency scenarios. To address the limitations of these single technologies, a multi-layer data sharing framework is proposed. It integrates federated learning and blockchain technology is proposed to deal with the security and efficiency issues of privacy data transmission in the IoT environment. The framework uses differential privacy to ensure data privacy and solves server single-point failures using the Proof of Quality (PoQ) consensus algorithm. A reputation mechanism supervises node behavior. Meanwhile, an improved PBFT consensus algorithm based on dynamic region partitioning is designed to handle fast data transmission and improve consensus efficiency in the IoT. By integrating these two solutions, an overall architecture is constructed to achieve efficient IoT data transmission. Experimental verification showed that the differential privacy mechanism only reduced data transmission accuracy by 3.5% after introducing Gaussian noise. In terms of fault tolerance, the PoQ algorithm had a fault rate of 14.3% for fault-tolerant nodes. Dynamic partitioning PBFT optimization, reduced communication frequency by 44% compared to single-layer PBFT, and transaction latency by 63%. These results indicate that the designed solution has significant advantages in high-concurrency IoT scenarios and can effectively meet real-time security demands.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.