2026· IEEE Transactions on Network and Service Management· Vol 23, pp. 5815-5831· 0 citations· 46 references
Computer Science
Abstract
Effective scaling of blockchain-enabled Industrial Internet of Things (IIoT) requires sharding that simultaneously ensures transaction locality, strict committee-size feasibility, and robustness against malicious node concentration. Existing methods often fail to balance this trilemma, risking either infeasible deployments or increased shard-takeover vulnerabilities. To address this, we propose GNN-OSS, a deployable sharding framework that decouples topology-aware preference learning from hard constraint enforcement. It first employs a trust-repulsion graph neural network to learn locality-aware preferences while discouraging low-trust nodes from collapsing into the same representation region. A Post-Hoc Capacity-Constrained Projection (PH-CCP) then maps these soft preferences into strictly feasible shard assignments. Finally, an entropy-driven Overlapping Sparse Scheme (OSS) selectively replicates boundary nodes to reduce residual cross-shard overhead without altering primary consensus membership. Evaluations demonstrate that, under the evaluated settings, GNN-OSS achieves a favorable performance–security trade-off. Against 20% malicious nodes, it substantially mitigates shard-takeover risks. Furthermore, it improves throughput by up to 33% over strictly feasible baselines and lowers the cross-shard ratio from 6.4% to 4.4% with minimal per-epoch overhead. Overall, GNN-OSS provides a practical sharding framework for open or hybrid blockchain-enabled IIoT environments.
Blockchain technology enables decentralized trust, yet traditional blockchain networks face critical scalability limitations under large-scale deployments. Sharding improves throughput through parallel processing, but existing sharded BFT architectures still suffer from severe hierarchical coupling between shards and t...
Ji-Qiang Liu, Li-Jun Sun, Xiao Chen et al.· 2026 International Conferenc...· 0 citations
Sharding technology divides the blockchain network into multiple parallel-processing subnetworks, achieving high throughput and scalability. However, it also faces challenges, including the risk of 51% attack caused by malicious node clustering and systemic load imbalances. While reputation mechanisms are widely employ...
Jie Li, Zhihao Guo, Yibing Li et al.· Annual International Compute...· 0 citations
Simulation results show that compared with standard PBFT, Q-PBFT, and APBFT, H-PBFT exhibits significant advantages in consensus latency, throughput, and view switching recovery time, and maintains high system robustness even in complex network environments with malicious nodes.
Zhen-Hua Wang, Jiangang Hu, Xinmeng Wang et al.· Future Internet· 0 citations
Elastic Proof-of-Location Byzantine Fault Tolerance is proposed, a privacy-preserving and location-aware blockchain consensus framework for IoT systems that reduces communication overhead and improves consensus efficiency compared with conventional PBFT-based approaches while strengthening resilience against location-b...
Yunus Kareem, D. Djenouri, Essam Ghadafi· Future Internet· 0 citations
Federated Learning (FL) enables collaborative model training while preserving data privacy by keeping data decentralized. However, traditional FL architectures suffer from critical trust issues, including vulnerability to model poisoning attacks, a lack of incentives for honest participation, and the inability to verif...
Giovanni Maria Cristiano, Salvatore D’Antonio, Giovanni Mazzeo· Annual International Compute...· 0 citations
This paper investigates a blockchain-assisted, trust-aware FL framework for privacy-aware distributed intelligence in resource-constrained IoT systems, where the blockchain layer is used to support trust coordination, auditability, traceability, and tamper-resistant metadata recording rather than to directly improve pr...
M. Reis, Carlos Serôdio, Frederico Branco· Electronics· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.