Application-Oriented Block Generation for Consortium Blockchain-Based IoT Systems With Dynamic Device Management
Bibliographic record
Abstract
Due to its salient features, such as immutability and auditability, blockchain is becoming more integrated into the Internet of Things (IoT) for enhancing security and developing a decentralized IoT framework. However, different IoT applications require different transaction processing performance, which brings challenges to the convergence of blockchains in IoT. Moreover, the membership of a distributed IoT system may fluctuate when an IoT device joins or leaves the system. The dynamic nature of IoT systems also introduces new challenges for device management. Accordingly, we propose an application-oriented block generation (AOBG) scheme for blockchain-enabled IoT with dynamic device management and conditional traceability. Specifically, we first construct a framework for a consortium blockchain-based IoT system, including structures for application-oriented transactions and blocks, and consensus mechanism. We present different miners, respectively, for processing urgent and ordinary transactions adaptively with applications. Then, an AOBG protocol is proposed for this framework based on group signature. The group signature is used to achieve anonymity, traceability, and nonframeability. Combining time-bound keys in group signature with node accounts in blockchain, the proposed scheme can realize efficient transaction verification, dynamic device management, conditional traceability with data security, and privacy preservation. Extensive experiments demonstrate high efficiency of the 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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| 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.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".