Hierarchical classified storage and incentive consensus scheme for building IoT under blockchain

Abstract

With the advancements of IoT and blockchain, a novel era has emerged in the domain of smart building systems. At the same time, it also brings some problems and challenges. Most traditional solutions typically utilize the fully-replicated storage strategy that results in high storage costs, while recent solutions like coded blockchain may compromise query efficiency. Moreover, traditional reputation-based consensus schemes do not consider dynamic situations, limiting scalability. To handle these problems, we propose a novel hierarchical message aggregation scheme and a classified storage method under Reed–Solomon (RS) coding to minimize storage overhead while ensuring data recoverability and query performance. Additionally, we introduce a dynamic incentive reputation consensus mechanism to tackle scalability challenges such as preventing node monopolies, promoting new node integration, and enhancing fault tolerance. Through theoretical analysis and experimental simulation, the proposed scheme demonstrates a high degree of decentralization and scalability. Our scheme achieves a 20% reduction in the Gini coefficient compared to other approaches. Furthermore, our scheme can save $\frac{1}{9}$ of storage overhead compared to traditional solutions while maintaining high query performance.