Performance enhancement in blockchain based IoT data sharing using lightweight consensus algorithm
Bibliographic record
Abstract
The proliferation of Internet of Things (IoT) devices generates vast amounts of data, traditionally stored, processed, and analyzed using centralized systems, making them susceptible to attacks. Blockchain offers a solution by storing and securing IoT data in a distributed manner. However, the low performance and poor scalability of blockchain technology pose significant challenges for its application in IoT networks. The primary obstacle is the distributed consensus protocol, while ensuring data transparency, integrity, and immutability in a decentralized and untrusted circumstances which often compromises scalability. To address this issue, this paper introduces the use of the Delegated Proof of Stake (DPoS) consensus algorithm and sharding techniques to enhance scalability in blockchain-based IoT networks. Experimental results indicate that system throughput increases synchronously with the test load. Our findings reveal a tradeoff between throughput, latency, and up-downstream time on the Inter Planetary File System (IPFS). Given the critical importance of latency and throughput in IoT networks, the results demonstrate that DPoS offers high throughput, parallel processing, and robust security while efficiently scaling the network. Furthermore, at a test load of 500 Transactions Per Second (TPS), the system achieves a maximum throughput of approximately 11.094 ms. However, when the test load exceeds 2000 TPS, the total processing time for transactions extends to 11.205 ms. This method is particularly suitable for constrained IoT networks. Compared to previous edge computing-based approaches, our scheme demonstrates superior throughput performance.
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.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".