Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
IJSREM52337
Volume:
9 |
8 |
Aug 2025
Pages:
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.
Blockchain networks face significant scalability challenges due to limited transaction throughput and increased latency as network size grows. Traditional sharding approaches employ static partitioning mechanisms that fail to adapt to dynamic network conditions, leading to uneven transaction distribution and excessive cross-shard communication overhead. This paper presents a novel dynamic sharding framework that integrates artificial intelligence-driven load balancing to optimize blockchain performance. Our proposed methodology employs reinforcement learning algorithms, specifically Deep Q-Network (DQN) and Proximal Policy Optimization (PPO), to dynamically allocate transactions across shards based on real-time network conditions, transaction patterns, and shard capacity utilization. The AI-driven approach continuously monitors network metrics including transaction arrival rates, processing latencies, and cross-shard dependencies to make intelligent sharding decisions. Experimental results demonstrate that our dynamic sharding mechanism achieves 2.7x improvement in transaction throughput compared to static sharding approaches, while reducing cross-shard transactions by 43\% and overall network latency by 38\%. The proposed framework maintains decentralization principles while significantly enhancing scalability, making it suitable for enterprise-grade blockchain applications requiring high-performance transaction processing.
KEYWORDS
Publication Date
1/8/2025
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
0
Total views since publication
PDF Downloads
2
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...