Virtual power plant master-slave multi-chain transaction matching mechanism based on improved consensus algorithm

In the future new power system, the multi-agent trusted transaction and information security in the virtual power plant (VPP) will be complex and challenging. The features of blockchain technology, such as information security, distribution decision, smart contract and tamper-proof, provide a new idea for VPP multi-subject trusted transaction. This paper focuses on the benefits maximization formed by multi-aggregator inside VPPs and the efficiency of trusted transaction matching. Firstly, according to the different demands of transaction subjects, a master and multi-slave hierarchical interactive control architecture is established to integrate blockchain technology with multi-agent system. Secondly, a credible transaction matching mechanism is designed under the demand of multi-aggregator peer to peer transaction, and non-cooperative game model is introduced to ensure the interests of multi-aggregator subjects. Then, the blockchain-based distributed particle swarm optimization algorithm proposes a consensus algorithm improved by delegated proof-of-authority (DPoA) to improve the security of the transaction. Finally, the rationality and feasibility of the strategy proposed in this paper are verified by an example analysis, which effectively enhances the matching efficiency and security of multi-agent transactions.

Institutions

Publication Details

Journal
SHILAP Revista de lepidopterología
Published
2024-09-01
DOI
https://doi.org/10.12158/j.2096-3203.2024.05.007
Primary Topic
Plant pathogens and resistance mechanisms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Virtual power plant master-slave multi-chain transaction matching mechanism based on improved consensus algorithm

SHILAP Revista de lepidopterología
Plant pathogens and resistance mechanisms
article

Virtual power plant master-slave multi-chain transaction matching mechanism based on improved consensus algorithm

article en

Abstract

In the future new power system, the multi-agent trusted transaction and information security in the virtual power plant (VPP) will be complex and challenging. The features of blockchain technology, such as information security, distribution decision, smart contract and tamper-proof, provide a new idea for VPP multi-subject trusted transaction. This paper focuses on the benefits maximization formed by multi-aggregator inside VPPs and the efficiency of trusted transaction matching. Firstly, according to the different demands of transaction subjects, a master and multi-slave hierarchical interactive control architecture is established to integrate blockchain technology with multi-agent system. Secondly, a credible transaction matching mechanism is designed under the demand of multi-aggregator peer to peer transaction, and non-cooperative game model is introduced to ensure the interests of multi-aggregator subjects. Then, the blockchain-based distributed particle swarm optimization algorithm proposes a consensus algorithm improved by delegated proof-of-authority (DPoA) to improve the security of the transaction. Finally, the rationality and feasibility of the strategy proposed in this paper are verified by an example analysis, which effectively enhances the matching efficiency and security of multi-agent transactions.

SHILAP Revista de lepidopterología
Shanghai Jiao Tong University (CN), Shanghai University of Electric Power (CN)
Openalex Percentile: Top 39%
Plant pathogens and resistance mechanisms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.