Blockchain-Based Software-Defined Industrial Internet of Things: A Dueling Deep ${Q}$ -Learning Approach
Bibliographic record
Abstract
With the developments of communication technologies and smart manufacturing, Industrial Internet of Things (IIoT) has emerged. Software-defined networking (SDN), a promising paradigm shift, has provided a viable way to manage IIoT dynamically, called software-defined IIoT (SDIIoT). In SDIIoT, lots of data and flows are generated by industrial devices, where a physically distributed but logically centralized control plane is necessary. However, one of the most intractable problems is how to reach consensus among multiple controllers under complex industrial environments. In this paper, we propose a blockchain (BC)-based consensus protocol in SDIIoT, along with detailed consensus steps and theoretical analysis, where BC works as a trusted third party to collect and synchronize network-wide views between different SDN controllers. Specially, it is a permissioned BC. In order to improve the throughput of this BC-based SDIIoT, we jointly consider the trust features of BC nodes and controllers, as well as the computational capability of the BC system. Accordingly, we formulate view change, access selection, and computational resources allocation as a joint optimization problem. We describe this problem as a Markov decision process by defining state space, action space, and reward function. Due to the fact that it is difficult to solve this joint problem by traditional methods, we propose a novel dueling deep Q-learning approach. Simulation results are presented to show the effectiveness of our proposed scheme.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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 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".