Toward Scalable and Secure Blockchain in Internet of Things: A Preference-Driven Committee Member Auction Consensus Approach
Bibliographic record
Abstract
Blockchain technology is acclaimed for eliminating the need for a central authority while ensuring stability, security, and immutability. However, its integration into Internet of Things (IoT) environments is hampered by the limited computational resources of IoT devices. Consensus algorithms, vital for blockchain safety and efficiency, often require substantial computational power and face challenges related to security, scalability, and resource demands. To address these critical issues, we propose a novel model that significantly enhances the security and performance of blockchain in IoT environments. Our model introduces three key innovations: (1) a bidirectional-linked blockchain system that strengthens security against long-range attacks by exploiting dual reference points for block validation; (2) the integration of user preferences into the Committee Member Auction (CMA) consensus algorithm, optimizing miner selection to balance resource efficiency with security; and (3) a comprehensive performance and frequency analysis that demonstrates the system’s resilience against double-spend, long-range, and eclipse attacks. The proposed model not only reduces block validation delays but also enhances overall system performance, as evidenced by simulations comparing its effectiveness with existing CMA algorithms. These advancements have the potential to significantly impact the deployment of blockchain in resource-constrained IoT environments, offering a more secure and efficient solution.
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.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.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".