Gaowei Shi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Gaowei Shi has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Keqiu Li
Tianjin University
4 shared publications - Xiulong Liu
Tianjin University, Tianjin, China
4 shared publications - Chenyu Zhang
College of Intelligence and Computing, Tianjin University, Tianjin, China
3 shared publications - Hao Xu
College of Intelligence and Computing, Tianjin University, Tianjin, China
3 shared publications - Liyuan Ma
Department of intelligence and Computing, Tianjin University, Tianjin, China
2 shared publications - Dengcheng Hu
College of Intelligence and Computing, Tianjin University, Tianjin, China
1 shared publication
Latest Publications
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 348-360
Orcas: A DAG-based Consensus Approach with Linear Communication Overhead
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 348-360
Open AccessOrcas: A DAG-based Consensus Approach with Linear Communication Overhead
- 5 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (15) , 29397-29410
HydraChain: A Cooperative MAPPO Architecture for Load Balancing in IoT Sharding Blockchain
Sharding has become a significant approach to enhance blockchain scalability. However, existing sharding techniques applied in IoT scenarios suffer from transaction congestion due to imbalanced distribution of transactions across shards, which hinders intra-shard transaction processing. To overcome the above problems, this article proposes HydraChain in IoT scenarios, the first multiagent reinforcement learning based sharding blockchain system with account graph, for a throughput improvement of shards under real-time load balancing. Agents collaborate by sharing information and jointly optimizing decisions, enhancing the accuracy and efficiency of the decision-making process. We first construct a sharding blockchain environment embedding with a graph encoder. Concurrently, we propose a multiagent model with decoder, which enables agents to cooperative learning to optimize account allocation strategies based on real-time shard load and global system information. When implementing HydraChain, we address two technical challenges: 1) to extract granular behavioral features from accounts with diverse and time-varying patterns, we construct a sharding blockchain that embeds a graph encoder to build a transaction graph; and 2) to ensure real-time load balancing under the constraints of dynamic transaction patterns, we propose SG-MAPPO, which matches graph encoding features within the environment. Our approach leverages the ability of multiagent model to collaborate and adapt to the changing environment, enabling efficient resource allocation and improved system performance. Moreover, we implement HydraChain and conduct experiments on a high-performance server equipped with 48 cores and 125 GB of memory. Our comprehensive experiments, comparing HydraChain with DQN-Based, SAC-Based and SPRING, reveal that our solution outperforms the state-of-the-art methods by achieving a notable 22% increase in transaction throughput and a 5.2% reduction in workload imbalance across shards.
- 5 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (15) , 29397-29410
HydraChain: A Cooperative MAPPO Architecture for Load Balancing in IoT Sharding Blockchain
Sharding has become a significant approach to enhance blockchain scalability. However, existing sharding techniques applied in IoT scenarios suffer from transaction congestion due to imbalanced distribution of transactions across shards, which hinders intra-shard transaction processing. To overcome the above problems, this article proposes HydraChain in IoT scenarios, the first multiagent reinforcement learning based sharding blockchain system with account graph, for a throughput improvement of shards under real-time load balancing. Agents collaborate by sharing information and jointly optimizing decisions, enhancing the accuracy and efficiency of the decision-making process. We first construct a sharding blockchain environment embedding with a graph encoder. Concurrently, we propose a multiagent model with decoder, which enables agents to cooperative learning to optimize account allocation strategies based on real-time shard load and global system information. When implementing HydraChain, we address two technical challenges: 1) to extract granular behavioral features from accounts with diverse and time-varying patterns, we construct a sharding blockchain that embeds a graph encoder to build a transaction graph; and 2) to ensure real-time load balancing under the constraints of dynamic transaction patterns, we propose SG-MAPPO, which matches graph encoding features within the environment. Our approach leverages the ability of multiagent model to collaborate and adapt to the changing environment, enabling efficient resource allocation and improved system performance. Moreover, we implement HydraChain and conduct experiments on a high-performance server equipped with 48 cores and 125 GB of memory. Our comprehensive experiments, comparing HydraChain with DQN-Based, SAC-Based and SPRING, reveal that our solution outperforms the state-of-the-art methods by achieving a notable 22% increase in transaction throughput and a 5.2% reduction in workload imbalance across shards.
- 11 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (6) , 2045-2057
Enabling Consistent Sensing Data Sharing Among IoT Edge Servers via Lightweight Consensus
Blockchain offers distinct advantages in terms of data credibility and provenance certification, and its fusion with Internet of Things (IoT) technology holds great promise. Nevertheless, IoT environments are marked by extensive node networks and intricate communication patterns, especially the sensing environment. The conventional blockchain consensus mechanism, hampered by its heavy reliance on computing resources and communication bandwidth, faces difficulties in ensuring seamless data exchange among IoT edge servers. The issues encountered by state-of-the-art Byzantine Fault Tolerance (BFT) consensus include: (i) high communication complexity between nodes; and (ii) the detrimental impact of Byzantine behavior on system performance. To overcome the above problems, we propose the lightweight blockchain consensus called AntB, firstly introducing the concept of sampling into the consensus and significantly reducing the number of participating consensus nodes from$N$ to$n$ , which lowers the consensus complexity to$\mathbf{2\cdot O(n)+O(N)}$ . We design a dynamic reputation mechanism so that Byzantine nodes cannot control the sampling set to affect the activity of the consensus in the long term. When implementing AntB, we address three significant technical challenges: (i) to determine the optimal sample size, we propose a sampling calculation method based on statistical confidence intervals, where the sample size is primarily determined by the chosen confidence level and margin of error; (ii) to prevent Byzantine behavior, we devise a weighted random sampling mechanism utilizing reputation coefficients based on edge servers’ behaviors; and (iii) to maintain consensus activity and consistency after sampling, we propose the consensus mechanism for partial sampling and global verification to avert potential issues. We implement AntB and conduct performance evaluations in a server with 32 cores and 64GB of memory. The evaluation results indicate that, the more nodes participating in the process of consensus, the better the performance of AntB will be. Especially, compared to HotStuff, AntB has a 24.94% higher success rate and Transactions Per Second (TPS) can improve by 102.10% when the number of nodes is 300.- 11 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (6) , 2045-2057
Enabling Consistent Sensing Data Sharing Among IoT Edge Servers via Lightweight Consensus
Blockchain offers distinct advantages in terms of data credibility and provenance certification, and its fusion with Internet of Things (IoT) technology holds great promise. Nevertheless, IoT environments are marked by extensive node networks and intricate communication patterns, especially the sensing environment. The conventional blockchain consensus mechanism, hampered by its heavy reliance on computing resources and communication bandwidth, faces difficulties in ensuring seamless data exchange among IoT edge servers. The issues encountered by state-of-the-art Byzantine Fault Tolerance (BFT) consensus include: (i) high communication complexity between nodes; and (ii) the detrimental impact of Byzantine behavior on system performance. To overcome the above problems, we propose the lightweight blockchain consensus called AntB, firstly introducing the concept of sampling into the consensus and significantly reducing the number of participating consensus nodes from$N$ to$n$ , which lowers the consensus complexity to$\mathbf{2\cdot O(n)+O(N)}$ . We design a dynamic reputation mechanism so that Byzantine nodes cannot control the sampling set to affect the activity of the consensus in the long term. When implementing AntB, we address three significant technical challenges: (i) to determine the optimal sample size, we propose a sampling calculation method based on statistical confidence intervals, where the sample size is primarily determined by the chosen confidence level and margin of error; (ii) to prevent Byzantine behavior, we devise a weighted random sampling mechanism utilizing reputation coefficients based on edge servers’ behaviors; and (iii) to maintain consensus activity and consistency after sampling, we propose the consensus mechanism for partial sampling and global verification to avert potential issues. We implement AntB and conduct performance evaluations in a server with 32 cores and 64GB of memory. The evaluation results indicate that, the more nodes participating in the process of consensus, the better the performance of AntB will be. Especially, compared to HotStuff, AntB has a 24.94% higher success rate and Transactions Per Second (TPS) can improve by 102.10% when the number of nodes is 300.- 8 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 73 (3) , 942-955
GFBE: A Generalized and Fine-Grained Blockchain Evaluation Framework
Multi-dimensional performance evaluation is crucial for blockchain systems as it enables appropriate blockchain choosing for a given scenario and helps to pinpoint the bottleneck module of a blockchain system to optimize its performance. However, the existing evaluation frameworks for blockchain suffer from low system generality, inefficient workload execution, and incomprehensible evaluation metrics. In order to overcome their limitations, we design and implement the Generalized and Fine-grained Blockchain Evaluation (GFBE) framework. Specifically, we abstract 3 types of Universal Evaluation Interface (UEI) via the dynamic proxying approach to enable generalized evaluation of heterogeneous blockchain systems. Through the design of Lua-based workloads plugin with high flexibility and reusability, GFBE improves the efficiency of workload execution. To achieve comprehensive measurement, we define 15 key performance metrics across hierarchical layers of blockchain architecture. We also implement and deploy GFBE on 16 machines each with 8 CPUs and 16GB RAM, and evaluate three open-source blockchain systems namely Ethereum, ChainMaker, and Haihe smart chain. The experimental results demonstrate that GFBE efficiently and accurately measure 15 key performance metrics such as Contract Execution Efficiency at the contract layer, Consensus Agreement Time Ratio at the consensus layer, and State Query Time at the data layer. Compared with state-of-the-art frameworks such as BLOCKBENCH, Log-based, and Caliper, GFBE distinguishes itself as the only framework that encompasses the appealing features of universal interface, reusable workload, and all-layer metrics.
- 8 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 73 (3) , 942-955
GFBE: A Generalized and Fine-Grained Blockchain Evaluation Framework
Multi-dimensional performance evaluation is crucial for blockchain systems as it enables appropriate blockchain choosing for a given scenario and helps to pinpoint the bottleneck module of a blockchain system to optimize its performance. However, the existing evaluation frameworks for blockchain suffer from low system generality, inefficient workload execution, and incomprehensible evaluation metrics. In order to overcome their limitations, we design and implement the Generalized and Fine-grained Blockchain Evaluation (GFBE) framework. Specifically, we abstract 3 types of Universal Evaluation Interface (UEI) via the dynamic proxying approach to enable generalized evaluation of heterogeneous blockchain systems. Through the design of Lua-based workloads plugin with high flexibility and reusability, GFBE improves the efficiency of workload execution. To achieve comprehensive measurement, we define 15 key performance metrics across hierarchical layers of blockchain architecture. We also implement and deploy GFBE on 16 machines each with 8 CPUs and 16GB RAM, and evaluate three open-source blockchain systems namely Ethereum, ChainMaker, and Haihe smart chain. The experimental results demonstrate that GFBE efficiently and accurately measure 15 key performance metrics such as Contract Execution Efficiency at the contract layer, Consensus Agreement Time Ratio at the consensus layer, and State Query Time at the data layer. Compared with state-of-the-art frameworks such as BLOCKBENCH, Log-based, and Caliper, GFBE distinguishes itself as the only framework that encompasses the appealing features of universal interface, reusable workload, and all-layer metrics.