Cloud-Edge-End Collaborative Computing-Enabled Intelligent Sharding Blockchain for Industrial IoT Based on PPO Approach
Bibliographic record
Abstract
The security and reliability risks of industrial data have constrained the advancement of the Industrial Internet of Things (IIoT). Although blockchain can protect the security and reliability of industrial data through hash verification mechanisms, there are numerous challenges in the existing blockchain-enabled IIoT systems, such as the trilemma of scalability, decentralization and security, high computational power consumption of consensus protocols and limited computational resources of industrial devices. To address these problems, an intelligent sharding blockchain-enabled IIoT framework is proposed, in which the intelligent sharding based on the reputation mechanism and the adaptive switching for multi-consensus protocols are utilized to enhance the decentralization, security and scalability of blockchain. Considering higher requirement of computational power of the sharding blockchain, a cloud-edge-end collaborative computing framework is introduced, in which the parallel computational offloading and the Terahertz communication technology are utilized to enhance the cooperation of the cloud-edge-end networks. Furthermore, due to the highly dynamic nature of industrial devices and industrial data, we consider and design the optimization problem as a Markov decision process (MDP), which is solved via the Proximal Policy Optimization (PPO) algorithm. Simulation results show that our proposed scheme can minimize total delay and maximize transaction throughput while guaranteeing the safety as well as decentralization of blockchain-enabled IIoT systems.
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 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.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.003 |
| Science and technology studies | 0.002 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".