A Blockchain Dynamic Sharding Scheme Based on Hidden Markov Model in Collaborative IoT

40Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Sharded blockchain offers scalability, decentralization, immutability, and linear improvement, making it a promising solution for addressing the trust problem in large-scale collaborative IoT. However, a high proportion of cross-shard transactions (CSTs) can severely limit the performance of decentralized blockchain. Furthermore, the dynamic assemblage characteristic of collaborative sensing in sharded blockchain is often ignored. To overcome these limitations, we propose HMMDShard, a dynamic blockchain sharding scheme based on the hidden Markov model (HMM). HMMDShard leverages fine-grained blockchain sharding and fully embraces the dynamic assemblage characteristic of IoT collaborative sensing. By integrating the HMM, we achieve adaptive dynamic incremental updating of blockchain shards, effectively reducing CSTs across all shards. We conduct a comprehensive analysis of the security issues and properties of HMMDShard, and evaluate its performance through the implementation of a system prototype. The results demonstrate that HMMDShard significantly reduces the proportion of CSTs and outperforms other baselines in terms of system throughput and transaction confirmation latency.

Cite

CITATION STYLE

APA

Xi, J., Xu, G., Zou, S., Lu, Y., Li, G., Xu, J., & Wang, R. (2023). A Blockchain Dynamic Sharding Scheme Based on Hidden Markov Model in Collaborative IoT. IEEE Internet of Things Journal, 10(16), 14896–14907. https://doi.org/10.1109/JIOT.2023.3294234

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free