Skip to content

Mecury: Integrating Account Allocation and Scheduling for Enhancing Blockchain Sharding Performance

2026 · IEEE Transactions on Networking · Vol 34, pp. 7031-7046 · 0 citations · 41 references

Abstract

Existing sharded blockchain systems suffer from excessive cross-shard communication overhead and workload imbalance. Although state-of-the-art account allocation schemes partially alleviate these problems, they still fail to simultaneously achieve effective cross-shard transaction reduction and balanced workload distribution, while also lacking adaptability to dynamic workloads. In particular, current methods lack mechanisms for efficient incremental allocation of newly joined accounts and cannot dynamically adjust workloads during surges, resulting in performance degradation until the next account allocation occurs. To address these limitations, we propose Mecury, the first scheme to realize account allocation and scheduling that span entire blockchain epochs. We propose a Fine-Grained Label Propagation Algorithm combined with a Workload-Aware Incremental Allocation Algorithm to achieve high-quality allocation of both historical and newly joined accounts. Furthermore, Mecury introduces an account proxy mechanism equipped with a dynamic proxy algorithm that reduces cross-shard transactions by establishing temporary proxy relationships, thereby adaptively mitigating workload surges. In addition, we design a secure cross-shard state migration protocol to ensure the liveness and consistency of state migration between accounts involved in the proxy relationship. By integrating these mechanisms, Mecury effectively addresses the challenges of excessive cross-shard transactions and workload imbalance inherent in sharded blockchains during consensus. Experimental evaluations on real Ethereum data demonstrate that Mecury consistently delivers superior performance, achieving up to 72% higher throughput and 53% lower latency compared to state-of-the-art baselines.

View source

Similar papers

Open access Sep 2026

A Mathematical Framework for Performance Multi-Objective Optimization of Blockchain Sharding with MongoDB Distributed Storage

Blockchain sharding partitions network state and transaction load across multiple parallel subchains (shards) in order to overcome the throughput ceiling of monolithic consensus protocols. In this study, we develop a mathematical performance model for blockchain sharding in which the underlying persistence layer is rea...

Divyesh Bhatnagar, Anil Gupta · 0 citations
Open access Sep 2026

Benchmarking Consensus Protocols for High-Performance Permissioned Blockchain Systems

This study presents a comparative evaluation of four Hyperledger Besu consensus algorithms, namely Ethash, Clique, QBFT, and IBFT 2.0, executed under identical hardware, network topology, and genesis configurations to quantify latency, throughput, and system overhead.

Muhammet Furkan Ozara, A. Akbulut, Mustafa Kara et al. · 0 citations
Open access Sep 2026

LB-Louvain: Balancing Transaction Locality and Shard Load in Account-Based State Sharding

LB-Louvain is presented, a coarse-to-fine account-partitioning heuristic in which standard Louvain first extracts logical communities, followed by load-aware community-to-shard assignment and restricted boundary-account refinement, and component-wise ablation confirms complementary roles for load-aware assignment and b...

Zhen-Xing Luan, Jia-Hui Du, Kuan Fan · 0 citations
2026

TCAA: An Efficient Blockchain Consensus Based on Transaction Collector and Address Aggregation for UAV Ad Hoc Networks

Blockchain technology provides a promising solution to data security and trust challenges in uncrewed aerial vehicle (UAV) ad hoc networks. However, conventional consensus mechanisms suffer from notable inefficiencies in resource-constrained environments, characterized by high computational and communication overhead,...

Wei Zhang, Shi-Yun Xiong, Yi-Xin Li et al. · 0 citations
Aug 2026

A Blockchain Framework to Enhance Optimization using Honey Bee Algorithm for Load Balancing in Collaborative Environment

In recent years, distributed computing systems have gained significant popularity due to their ability to handle vast computational resources and data processing in real time. Collaborative environments, such as cloud computing and decentralized networks, require efficient mechanisms for managing resources and distribu...

Kiran Kumar · 0 citations
Preprint Sep 2026

Blockchain-based Proportional Fair Scheduling for Multi-Operator O-RAN

This work proposes the blockchain-based proportional fair scheduling (BC-PFS) that enables trustworthy inter-network coordination and resource pooling across operators in O-RAN and designs four core smart contracts including registration, status reporting, scheduling, and settlement contracts with corresponding Solidit...

Kun Huang, Xintong Ling, Mei-Ning Wu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.