Dong Wang
Research Subjects
Dong Wang has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Ao Xiong
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China
3 shared publications - Da Li
State Grid Blockchain Technology (Beijing) Co., Ltd,Beijing,China,100032
3 shared publications - Yu Song
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China
3 shared publications - Qinglei Guo
State Grid Blockchain Technology (Beijing) Co., Ltd,Beijing,China,100032
2 shared publications Aosen Zhu
State Grid Digital Technology Holding Co., Ltd Beijing China
1 shared publication- Desheng Bai
State Grid Blockchain Technology (Beijing) Co., Ltd,Beijing,China,100032
1 shared publication
Latest Publications
- 1 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 34 (2) , 600-611
Asynchronous Consensus Algorithm Integrating Dynamic Weight Sharding Strategy
Blockchain technology has broad application prospects in many fields due to its unique characteristics such as decentralization, traceability, and tamper-proofing, and has become a research hotspot in recent years. As a key component of blockchain technology, the consensus algorithm is one of the important factors affecting blockchain performance. Many consensus algorithms currently used in consortium chains are based on timing assumptions and lack horizontal scalability. That is to say, these algorithms cannot reach an agreement in an asynchronous network where the receiving time of network packets is uncertain, and their efficiency decreases as the number of nodes increases, which hinders the large-scale application of the consortium chain. In order to solve the above problems, this paper proposes the dynamic sharding Dumbo (DS-Dumbo) algorithm, an asynchronous consensus algorithm that integrates dynamic sharding strategies, based on the currently excellent Dumbo Byzantine fault tolerance (DumboBFT) asynchronous consensus algorithm. The main work of this paper revolves around how to fragment and optimize the consensus process. This paper designs a node asynchronous sharding model based on multi-dimensional weights, so that the re-sharding work of each blockchain node can be executed concurrently with the asynchronous consensus algorithm, reducing the conflict between blockchain sharding and asynchronous consensus algorithms. We also designed an intelligent transaction placement strategy, which calculates the relevance score of each transaction for all shards to determine which shard the transaction is processed in order to reduce the number of complex cross-shard transactions. We optimized the execution process of the DumboBFT algorithm, converted its internal synchronous working mode to an asynchronous working mode, and reduced the consumption of consensus work to a certain extent. The experimental evaluation shows that the DS-Dumbo algorithm has higher throughput and lower delay than the DumboBFT algorithm, can increase the throughput with the increase of nodes, and has the ability of horizontal expansion.
- 1 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 34 (2) , 600-611
Asynchronous Consensus Algorithm Integrating Dynamic Weight Sharding Strategy
Blockchain technology has broad application prospects in many fields due to its unique characteristics such as decentralization, traceability, and tamper-proofing, and has become a research hotspot in recent years. As a key component of blockchain technology, the consensus algorithm is one of the important factors affecting blockchain performance. Many consensus algorithms currently used in consortium chains are based on timing assumptions and lack horizontal scalability. That is to say, these algorithms cannot reach an agreement in an asynchronous network where the receiving time of network packets is uncertain, and their efficiency decreases as the number of nodes increases, which hinders the large-scale application of the consortium chain. In order to solve the above problems, this paper proposes the dynamic sharding Dumbo (DS-Dumbo) algorithm, an asynchronous consensus algorithm that integrates dynamic sharding strategies, based on the currently excellent Dumbo Byzantine fault tolerance (DumboBFT) asynchronous consensus algorithm. The main work of this paper revolves around how to fragment and optimize the consensus process. This paper designs a node asynchronous sharding model based on multi-dimensional weights, so that the re-sharding work of each blockchain node can be executed concurrently with the asynchronous consensus algorithm, reducing the conflict between blockchain sharding and asynchronous consensus algorithms. We also designed an intelligent transaction placement strategy, which calculates the relevance score of each transaction for all shards to determine which shard the transaction is processed in order to reduce the number of complex cross-shard transactions. We optimized the execution process of the DumboBFT algorithm, converted its internal synchronous working mode to an asynchronous working mode, and reduced the consumption of consensus work to a certain extent. The experimental evaluation shows that the DS-Dumbo algorithm has higher throughput and lower delay than the DumboBFT algorithm, can increase the throughput with the increase of nodes, and has the ability of horizontal expansion.
- 13 November 2024
- Published by Springer Nature
- p. 136-147
A Double Layer Consensus Optimization Mechanism in DAG-Based Blockchain for Carbon Trading
- 13 November 2024
- Published by Springer Nature
- p. 136-147
A Double Layer Consensus Optimization Mechanism in DAG-Based Blockchain for Carbon Trading
- Open Access
- 26 July 2023
- Published by Atlantis Press SARL
- p. 446-456
A Study on the Mechanisms and Risk Challenges of Fintech-Driven Financial Business Innovation
- 26 July 2023
- Published by Atlantis Press SARL
- p. 446-456
Open AccessA Study on the Mechanisms and Risk Challenges of Fintech-Driven Financial Business Innovation
- Open Access
- 8 June 2023
- Published by MDPI AG in Electronics
- Vol. 12 (12) , 2586
A Blockchain-Based Method for Optimizing the Routing of High-Frequency Carbon-Trading Payment Channels
Carbon trading is an effective way to achieve carbon neutrality. It is a market mechanism aimed at reducing global greenhouse gas emissions and carbon dioxide emissions. Blockchain technology can be applied to the carbon-trading scenario using characteristics that guarantee the security, decentralization, data immutability, and data traceability of the carbon-trading process. It would be difficult to implement carbon trading on blockchains for all enterprises and individuals, as the current performance of blockchains does not meet the requirements. There has been extensive research conducted on blockchain performance optimization, and the off-chain payment channel is one of the more mature solutions. This approach involves the transfer of transactions to off-chain transactions, thus avoiding high transaction fees. Existing research has addressed the problem of routing security and efficiency, with less emphasis on factors such as routing transaction costs, node reputation, and routing path considerations. This paper researches the optimization of payment routing in Payment Channel Networks (PCNs) and proposes the Multi-Factor Routing Payment Scheme (MFPS), which integrates factors such as the node reputation, transaction fee cost, and distance to select the route for payment transactions. In order to improve the success ratio of routing transactions, the transaction-splitting algorithm is proposed. To ensure the security and privacy of the transaction process, the Asymmetric Time-Lock Contract (ATLC) protocol is proposed. The results of extensive experimental simulations show that the MFPS proposed in this paper outperforms the ShortestPath, Cheapest, and SplitDistance algorithms. It achieves an approximately 13.8%∼49% improvement in the transaction success ratio and reduces the average transaction processing cost. The security and privacy measures can defend against wormhole and double-flower attacks and exhibit better performance in terms of computational verification and message overhead.
- 8 June 2023
- Published by MDPI AG in Electronics
- Vol. 12 (12) , 2586
Open AccessA Blockchain-Based Method for Optimizing the Routing of High-Frequency Carbon-Trading Payment Channels
Carbon trading is an effective way to achieve carbon neutrality. It is a market mechanism aimed at reducing global greenhouse gas emissions and carbon dioxide emissions. Blockchain technology can be applied to the carbon-trading scenario using characteristics that guarantee the security, decentralization, data immutability, and data traceability of the carbon-trading process. It would be difficult to implement carbon trading on blockchains for all enterprises and individuals, as the current performance of blockchains does not meet the requirements. There has been extensive research conducted on blockchain performance optimization, and the off-chain payment channel is one of the more mature solutions. This approach involves the transfer of transactions to off-chain transactions, thus avoiding high transaction fees. Existing research has addressed the problem of routing security and efficiency, with less emphasis on factors such as routing transaction costs, node reputation, and routing path considerations. This paper researches the optimization of payment routing in Payment Channel Networks (PCNs) and proposes the Multi-Factor Routing Payment Scheme (MFPS), which integrates factors such as the node reputation, transaction fee cost, and distance to select the route for payment transactions. In order to improve the success ratio of routing transactions, the transaction-splitting algorithm is proposed. To ensure the security and privacy of the transaction process, the Asymmetric Time-Lock Contract (ATLC) protocol is proposed. The results of extensive experimental simulations show that the MFPS proposed in this paper outperforms the ShortestPath, Cheapest, and SplitDistance algorithms. It achieves an approximately 13.8%∼49% improvement in the transaction success ratio and reduces the average transaction processing cost. The security and privacy measures can defend against wormhole and double-flower attacks and exhibit better performance in terms of computational verification and message overhead.