CN112434343A - Virtual power plant safety scheduling and transaction method based on dual block chain technology - Google Patents

Abstract

A virtual power plant safe scheduling and transaction method based on a dual block chain technology comprises a scheduling private chain for scheduling and a transaction alliance chain for transaction, a hybrid proxy re-encryption algorithm based on a ciphertext strategy is adopted, the hybrid proxy re-encryption algorithm is formed by combining an identity-based encryption algorithm and an attribute proxy re-encryption algorithm based on a ciphertext strategy, and an agent converts a ciphertext encrypted based on an attribute into a ciphertext encrypted based on an identity, so that the decryption cost of a data visitor is reduced, and the non-repudiation and the reliability of production information are guaranteed. In the transaction process, a continuous bilateral auction mechanism based on reputation is adopted, participants can continuously adjust self quotation according to the current electric quantity into the transaction price, benefit maximization is realized, transaction information and reputation value are recorded in a alliance chain, and the non-tamper-proof property and transparency of the information are guaranteed. The information and transaction platform which is low in cost, public and transparent is provided for the virtual power plant, and the safety, the anti-tampering property, the non-repudiation property, the integrity and the like of data are guaranteed.

Description

Virtual power plant safety scheduling and transaction method based on dual block chain technology

Technical Field

The invention belongs to the safe scheduling and transaction of Virtual Power Plant (VPP) energy, and relates to a block chain technology and an identity-based encryption and proxy re-encryption technology in the field of information security.

Background

According to the 2010 global greenhouse gas emission data, the emission amount generated by power, industrial energy and other energy production accounts for about 76% of the total annual global emission amount. Considering the influence of greenhouse gas emissions on climate change and the cost and supply of fossil fuels, the traditional single form of thermal power generation no longer meets the people's living needs. With the development of the Energy internet, a future power supply model may be slowly changed to a Distributed Energy Resources (DER) as a main primary Energy source.

The DER mainly comprises a distributed power supply, distributed energy storage, a controllable load and an electric automobile, and has two operation modes of independent operation and grid-connected operation. When the distributed power supply with the advantages of cleanness and high efficiency represented by wind energy, water energy and light energy is incorporated into a power grid, the problem of greenhouse gas emission can be effectively relieved. Statistics show that about 25% of the power worldwide comes from DER by 2016, while the DER power generation percentage in 2022 can reach about 30%, and the percentage in 2050 can even exceed 60%. Despite the wide-spread look of DER, there are still a number of problems. Firstly, the distributed power supply has small capacity and uneven distribution, and the generated energy has intermittence and randomness, so that the reliability of the energy is reduced; secondly, for the power system, when the electricity generated by the DER is directly connected to the power grid, namely grid connection, the electricity is invisible and uncontrollable, if the grid connection quantity is too large, the load fluctuation of the electricity utilization end is easily caused, and the transient power failure condition occurs, so that the safety and reliability of the power system are lost; finally, the supply and demand relationship of the electricity market can also limit and hinder the further development of DER.

In order to solve the problems caused by DER Grid connection, two different DER Grid connection technologies of a Micro Grid (MG) and a Virtual Power Plant (VPP) are provided in the industry. The VPP is not restricted by the geographical position, and can coordinate and manage the market operation of centralized energy and distributed energy through an advanced coordination control technology, an intelligent metering technology and an information communication technology under the condition of not changing the original grid-connected mode of the DER. Currently, research and use of virtual power plants is mainly focused on developed countries such as europe and north america. In order to solve the Bidding Strategy of VPPs, E.Mashhour et al uses a unit combination model based on deterministic price in IEEE Transactions on Power Systems 2010,26(2) double rules of Virtual Power Plant for partitioning in Energy and scientific resources marks-Part I, Problem Formulation, and the model considers the constraint conditions of VPPs and solves the Bidding result by using a genetic algorithm, thereby providing a feasible DER integration method. Shabanzadeh et al provide a new idea for a transaction strategy between adjacent VPPs in the "Iet Generation Transmission & Distribution" 2017,11(2) "Risk-based medium-term mapping strategy for a virtual power plant with first-order stored timing constraints", and solve the benefit problem of different transaction layers by establishing a medium-term self-scheduling decision layer for VPPs, wherein the decision correctness is ensured by an effective Risk management method based on first-order random advantage constraint. Baringo et al, in IEEE Transactions on Power Systems 2017,32(5) A storage Adaptive routing Optimization Approach for the routing Strategy of a Virtual Power Plant, propose a new Virtual Power Plant quotation Strategy to participate in the day-ahead and real-time energy markets, the supply problem is described here as a Stochastic Adaptive Robust Optimization model, and the case study results of the Optimization model demonstrate the applicability of the Strategy. The method shows the potential of the VPP in energy market trading and scheduling, and has reference significance for future further research, but the common problems of the existing VPP grid-connected technology still exist. The DER grid-connected behavior is highly free, and with the increase of the number of DER in a power grid, the VPP is difficult to meet the profit-by-profit demand and grid-connected behavior of a power market with mass DER under the drive of real-time electricity price, so that the design and implementation difficulty of the coordination control technology is increased. VPPs lack a publicly transparent transaction platform and information platform, and transactions between VPPs and with other users are often costly. Meanwhile, the information between the VPP and the DER is asymmetric, so that the aggressiveness of the DER in participating in the power transaction is not high. In the existing VPP system, a set of method or system for guaranteeing data information safety is lacked. Information required by scheduling is directly transmitted through a two-way communication technology, and if the scheduling information is subjected to malicious tampering in the transmission process, the safety and the stability of the current power market are seriously influenced.

In 2008, the inventor proposes a decentralized digital currency, namely a bitcoin, and a blockchain is a core technology for supporting the operation of the bitcoin, and after a period of running a fierce period of the digital currency, the blockchain becomes one of research hotspots of academia due to the characteristics of decentralization, distrust, openness and transparency and the like. With continuous research, the application range of the block chain is wider and wider, and the block chain is not limited to the financial field, so that a new solution for solving the problems can be provided by integrating the block chain into the energy industry. Unlike traditional centralized systems, each node on the blockchain is given the same authority, and even if a single point of failure occurs, the entire blockchain system is not affected. In 'electric appliance and energy efficiency management technology' 2017,3 'application scene of a block chain technology in a virtual power plant', hodelin et al analyze feasibility of the block chain technology in VPP and complementarity generated by fusion of the block chain technology and the VPP, and finally, the block chain technology is obtained and applied to the VPP to effectively improve the operation efficiency of the VPP. Galici et al, in the IEEE Milan PowerTech,2019 international conference, introduced a physical platform that simulates a local electricity market, which is mainly managed by an integrator playing the role of VPP, who needs to collect and distribute quote information of transaction participants, and then complete the commercial transactions of users using a block chain technique. In the national Intelligence 2020, "Smart contact for distributed energy transforming in virtual power plants based on block chain" by Lujian Wushu et al establishes a block chain-based VPP transaction model for energy Internet driven by electricity price in real time. In order to simplify the existing complex electric power transaction and settlement process, a VPP distributed energy transaction intelligent contract based on a block chain technology is provided. Most of the above documents focus on the VPP energy scheduling and transaction processes, and the specific use and analysis of the blockchain technology is less, and the function of the blockchain technology cannot be well highlighted.

Disclosure of Invention

The invention aims to provide a virtual power plant safety scheduling and transaction method based on a double block chain technology. The block chain technology is used for safely scheduling and trading the energy of the virtual power plant.

The invention relates to a virtual power plant safety scheduling and transaction method based on a dual block chain technology, which mainly comprises two types of block chains, namely a scheduling private chain for scheduling and a transaction alliance chain for transaction. Since a VPP can be divided into two modules according to its functional differences, a Technical VPP (TVPP) and a Commercial VPP (CVPP), the present invention defines a TVPP as a proprietary VPP in a scheduling private chain and a CVPP as a proprietary VPP in a trading federation chain. The dispatching private chain mainly comprises a TVPP, a power dispatching control center, a power trading center, a verification mechanism and a DER governed by the TVPP. In the safety scheduling process, the DER uploads encrypted production information to the private block chain to which the DER belongs in real time, when the VPP needs the production scheduling of the production information, the DER with the same weight is used for selecting an agent, the DER agent carries out re-encryption on the encrypted information, and the re-encrypted information is sent to the VPP. The proxy re-encryption algorithm is a mixed proxy re-encryption algorithm based on a ciphertext strategy, and is formed by combining an identity-based encryption algorithm and an attribute proxy re-encryption algorithm based on the ciphertext strategy, and an agent can convert a ciphertext encrypted based on an attribute into a ciphertext encrypted based on an identity, so that the decryption cost of a data visitor is reduced, and the undeniability and the reliability of production information are ensured. The nature of the private chain is such that its central node is at risk of tampering with the data, so we store the private chain's hash digest in a more secure federation chain. The trade union chain is mainly composed of CVPP, electric trade center, DER and power unit (house, factory, etc.) controlled by the CVPP. In the transaction process, a continuous bilateral auction mechanism based on reputation is adopted, and transaction participants can continuously adjust self quotations according to the current electric quantity bargaining price, so that benefit maximization is realized. And a market segmentation mechanism based on reputation is fused, the participants are divided according to the reputation value, the higher the reputation value is, the larger the advantages can be obtained in the auction process is, and finally, a good electric power market trading atmosphere is created. The transaction information of the transaction participants and the corresponding reputation values are recorded in the federation chain to ensure the non-tamper-ability and transparency of the information. In addition, for the convenience of trading in the electric power market, the customized energy currency is adopted as the only currency for trading in the system.

The invention relates to a virtual power plant safety scheduling and transaction method based on a dual block chain technology, which comprises the following steps:

(S01): before an energy scheduling or transaction participant joins a Virtual Power Plant (VPP) safety scheduling and transaction system, registration information needs to be registered in a verification mechanism, the verification mechanism verifies node information applied for joining, and a verified node generates an exclusive public and private key pair for the node by using an identity-based encryption algorithm. All the passing nodes form a business alliance chain together, and each VPP respectively constructs a self scheduling private chain block chain on the basis of the alliance chain;

(S02): distributed Energy Resources (DER) of the embedded anti-tampering smart metering device collects production information in real time, encrypts production data through an attribute-based encryption algorithm and uploads the production data to a scheduling private chain to which the production data belongs. When a TVPP in a scheduling private chain needs to start a new round of scheduling, the TVPP needs to send a data access application to DER agents released by DER with consistent ownership;

(S03): after receiving the access application from the TVPP, each DER agent needs to aggregate information uploaded by the managed DER in a period from the end of the last scheduling to the present from the scheduling private chain. And then, the DER agent generates a re-encryption key by using a hybrid agent re-encryption algorithm based on the ciphertext strategy, and re-encrypts the aggregated encryption information through the key. The re-encrypted information is sent to the TVPP by the DER proxy so that the TVPP can perform optimization calculation of the scheduling scheme. In addition, the DER agent also needs to continuously provide managed DER quotation information for the CVPP in the trade union chain so that the CVPP can execute the managed energy trade;

(S04): the CVPP needs to collect price quote information from electricity consuming units such as houses, factories, etc., in addition to price quote information from DER. After collecting the corresponding quotation information, the CVPP divides the participants according to a market segmentation mechanism based on reputation, then carries out transaction matching through a continuous bilateral auction mechanism, and continuously feeds back the matching information to each participating entity so as to carry out timely quotation modification on each participating entity. Once the transaction match is successful, the CVPP broadcasts transaction information in the transaction federation chain. After the auction is finished, the information which is not successfully matched is sent to the electric power trading center, and the electric power trading center takes charge of relevant trading. The CVPP and the TVPP are both parts of the VPP, so that the TVPP can know all transaction information issued by the CVPP through internal communication;

(S05): and integrating the production information from the DER and the economic parameter information from the CVPP, and starting to calculate an optimal global scheduling scheme by the TVPP, wherein the DER agent can share the calculation pressure for the TVPP in the calculation process. The global optimal scheme is distributed to subordinate DER agents by the TVPP only through the safety verification of the power dispatching control center. In addition, the TVPP supervises each DER to supply power according to transaction records of deals in the CVPP, and the power consumption unit pays the energy currency according to the auction price determined in advance after receiving the determined electric quantity;

(S06): and the accounting node on the scheduling private chain records the encrypted production information uploaded by each DER into a block, the verification node verifies the block, and the verified block is connected to the scheduling private chain. In addition, the verification node also needs to store the hash digest of the scheduling private chain onto the transaction federation chain. Similar to the scheduling private chain, the transaction information, the reputation value and the scheduling private chain hash digest are stored in the block by the preselected node in the transaction alliance chain, and only the verified block can be finally connected to the transaction alliance chain;

(S07): when data is packed into blocks and stored in a blockchain, other nodes on the chain can refer to the account through legal identities. Meanwhile, the data recorded in the blockchain is permanently stored thereon, and the data is hardly possible to be tampered, which has great significance to the storage and the source tracing of the data.

The Identity-based Encryption algorithm (IBE) in the step (S01) of the present invention includes the following specific contents:

(1) and (5) setting a system.

The verification mechanism executes the algorithm and inputs system safety parameters

Outputting specific system common parameter GP_IBEAnd master key MSK_IBE。

(2) And generating a key.

KGen_IBE(GP_IBE,MSK_IBE,ID)→(PK_ID,SK_ID): verification mechanism input system common parameter GP_IBEMaster key MSK_IBEAnd user ID e (0,1)^*And outputting corresponding public and private key Pair (PK)_ID,SK_ID)。

(3) And (4) encrypting.

Enc_IBE(GP_IBE,PK_ID,M)→CT_ID: information sender input system common parameter GP_IBEThe public key PK of the receiver_IDAnd plaintext information M, and outputs ciphertext CT_ID。

(4) And (6) decrypting.

Dec_IBE(GP_IBE,CT_ID,SK_ID) → M/. T: cipher textRecipient input System common parameters GP_IBEReceived ciphertext CT_IDAnd its own private key SK_ID. If the received cipher text is the public key PK of the receiver_IDAnd (4) obtaining the encrypted information, outputting the encrypted information as plaintext information M, and otherwise, obtaining an error symbol ^ T.

The attribute-based encryption algorithm described in step (S02) of the present invention includes the following specific contents:

the attribute-based encryption algorithm can be divided into an encryption algorithm based on a Ciphertext Policy (CP) and an encryption algorithm based on a Key Policy (KP), and the invention mainly uses the encryption algorithm based on the Ciphertext attribute.

(1) And (5) setting a system.

The verification mechanism executes the algorithm and inputs system safety parameters

And a system attribute set U for outputting specific system common parameters GP_CPAnd master key MSK_CP。

(2) And generating a key.

KGen_CP(GP_CP,MSK_CP,S)→SK_S: verification mechanism input system common parameter GP_CPMaster key MSK_CPAnd a user attribute set S, outputting a key SK of the user attribute set S_S。

(3) And (4) encrypting.

Enc_CP(GP_CP,(A,ρ),M)→CT_A: information sender input system common parameter GP_CPAttribute access structure (A, rho) and plaintext information M, and outputs ciphertext CT satisfying the access structure (A, rho)_A。

(4) And (6) decrypting.

Dec_CP(GP_CP,CT_A,SK_S) → M/. T: ciphertext receiver input system common parameter GP_CPReceived ciphertext CT_AAnd a private key SK_S. If the private key SK_SProperty set ofAnd S meets the access structure (A, rho) used in encryption, and the clear text information M is output, otherwise, the clear text information M is an error symbol.

The ciphertext-policy-based hybrid proxy re-encryption algorithm of the step (S03) of the present invention includes the following specific contents:

(1) and (5) setting a system.

The authentication mechanism executes the algorithm. Inputting system security parameters

And a system attribute set U for outputting a system public parameter GP and a master key MSK.

(2) And generating a key.

1) IBE key generation.

KGen_IBE(GP,MSK,ID)→SK_ID: inputting system public parameter GP, master key MSK and user ID E (0,1)^*And outputting a public and private key pair corresponding to the ID.

2) CP key generation.

KGen_CP(GP,MSK,S)→SK_S: inputting system public parameter GP, master key MSK and attribute set S, outputting CP key SK of attribute set S_S。

(3) And (4) encrypting.

Enc_CP(GP,(A,ρ),M)→CT_A: inputting system common parameters GP, attribute access structures (A, rho) and plaintext information M, and outputting ciphertext CT satisfying the access structures (A, rho)_A。

(4) And generating a re-encryption key.

RKGen(GP,SK_S,PK_ID)→RK_S→ID: inputting system public parameter GP, CP secret key SK of data owner_SAnd the public key PK of the data visitor_IDOutputting the re-encryption key RK_S→ID。

(5) And (5) re-encrypting.

ReEnc(GP,RK_S→ID,CT_A)→CT_ID: inputting system public parameter GP, re-encrypting keyRK_S→IDAnd ciphertext CT_A. If the attribute set S satisfies the access structure (A, rho), outputting the re-encrypted ciphertext CT_ID。

(6) And (6) digitally signing.

Sig(GP,CT'_ID,SK_proxy) → σ: inputting system common parameter GP, partially re-encrypting ciphertext CT'_IDAnd SK as a private key of a re-encryption agent_proxyAnd outputs the signature σ.

(7) And (6) decrypting the ciphertext.

Dec(GP,CT_A,SK_S) → M: inputting system common parameter GP, received cipher text CT_AAnd a private key SK_S. If the private key SK_SIf the attribute set S meets the access structure (A, rho) used in encryption, the plaintext information M is output, otherwise, an error symbol is reversed.

(8) And (5) re-encrypting the ciphertext and decrypting.

ReDec(GP,CT_ID,SK_ID,PK_IBE,PK_proxyσ) → M: inputting system common parameter GP, re-encrypting cipher text CT_IDReceiver's IBE private Key SK_IDThe IBE public key PK of the system_IBEIBE public key PK of re-encrypted proxy_proxyAnd a digital signature σ. And checking whether the digital signature is correct, if the digital signature is correct, outputting the digital signature as plaintext information M, and if the digital signature is not correct, giving up the decryption and requesting data access again.

The reputation based market segmentation mechanism described in step (S04) of the present invention is as follows:

the market dividing mechanism based on reputation divides the corresponding list according to reputation level, which aims to make the buyer or seller with high reputation value obtain more better quoted price, the market dividing mechanism adopted by the invention divides reputation into 3 levels, the reputation value range of the buyer (seller) at level 1 is 0,2, the reputation value range of the buyer (seller) at level 2 is (2, 4), the reputation value range of the buyer (seller) at level 3 is (4, 6), the matching ranges of different reputation levels are different, the buyer (seller) at level 3 can match with all the sellers (buyer), the buyer (seller) at level 2 can match with the seller (seller) at level 2/3, while the buyer (seller) at level 1 can only match the seller (buyer) at level 3.

The continuous bilateral auction mechanism of step (S04) of the present invention is as follows:

the continuous bilateral auction mechanism is an effective marketing mechanism to solve the problem of decentralized resource allocation. Decentralized resource allocation typically involves multiple participants, each of whom wants to maximize their own revenue, and a continuous bilateral auction mechanism improves overall efficiency by constantly matching the bids of trading participants. The continuous bilateral auction mechanism stores the received bids to the buyer's bid list and the seller's bid list, respectively, based on the identities of the participants submitting the bids. In the bidding list, the ordering rule is that prices are ordered from high to low (descending order); in contrast, the ordering rule in the quote list is that prices are ordered from low to high (ascending order). The highest price quoted by the buyer is called the optimal buying price, the lowest price quoted by the seller is called the optimal selling price, and the buying and selling parties can be successfully matched only if the optimal buying price is greater than or equal to the optimal selling price, so that the interest maximization of each participant is realized, and the bargaining price is the average value of the optimal buying price and the optimal selling price. It should be noted that the continuous bilateral auction mechanism matches according to the matching rule of "price first, time first", and when the prices are the same, matches with the participant with the offer submitting time earlier.

The selection of the type of the adopted block chain is not suitable from the aspects of the distribution condition of the network nodes of the virtual power plant and the data transmission efficiency by adopting a single block chain. The public chain is also called as an unlicensed chain, allows any user with a networked computer to freely join and read block information in the world, is a completely decentralized block chain in the true sense, but has too many network nodes, long data verification and node consensus time and large network delay; the private chain is a block chain in which the write permission of each node is completely controlled by a certain organization, and the read permission is selectively opened to the outside by the organization. Although the processes of the public recognition, the verification and the like of the private chain are strictly limited within a specific range by a private organization, the private chain still has a universal block chain structure with multiple nodes running, and is often taken as a public chain in a small-range system; the alliance chain is a multicenter block chain which is composed of a plurality of organizations or institutions and has the characteristics of common maintenance, admission mechanism and the like, and only the institutions authenticated by the alliance can join the alliance chain. The number of consensus nodes in the alliance chain is small, the data verification and consensus time is short, the block generation is accelerated, and the security level of the alliance chain is enough for daily use; for the transaction of the virtual power plant, because the transfer of digital property is involved, a block chain with higher security level is needed, while the public chain takes too much time, the private chain risks data tampering by a central node, and the block chain of the alliance naturally becomes the optimal choice. For scheduling of a virtual power plant, a DER uploads a large amount of data in real time, and a private chain is undoubtedly the best choice for meeting the problem of rapid storage of a large amount of data, but the data stored in the private chain has a safety risk. To solve the problem, the hash digest of the private chain is stored in a transaction alliance chain, and the security of the private chain data is guaranteed by means of the security of the alliance chain. In the dispatching private chain, the invention adopts a strong leading type Raft consensus mechanism which can ensure the rapid generation of the data block. In a trade union chain, the invention adopts a Byzantine fault-tolerant algorithm consensus mechanism, and the algorithm ensures that the final result cannot be influenced even if the system has some abnormal nodes.

The invention guarantees the information storage and communication problems in the safety scheduling and transaction of the virtual power plant by the double block chain technology, and provides a low-cost, open and transparent information and transaction platform for the virtual power plant. The mixed proxy re-encryption technology based on the ciphertext strategy is utilized to guarantee the authenticity and confidentiality of production information, and the signature algorithm based on the identity is adopted to guarantee the security, the tamper resistance, the non-repudiation, the integrity and the like of data. A continuous bilateral auction mechanism based on reputation is realized by using the intelligent contract, and the matching of transactions can be realized by calling the intelligent contract after the virtual power plant collects quotation information. Finally, a new type of electronic currency, energy currency, is proposed and used as the only transaction currency for the system, which will present a certain amount of energy currency to the user when the user first registers. The energy currency may be purchased from the electricity trading center or DER agency when the customer energy currency is insufficient. In addition, the users with good reputation have the opportunity to participate in the system consensus process, so that the energy coins awarded by the system are obtained, the enthusiasm of the participants for improving the self reputation is promoted, good market behaviors are facilitated to be formed, and meanwhile, the stability and the activity of the system can be improved.

Drawings

Fig. 1 is a diagram of three block chain models, wherein (a) is a public chain model, (b) is a federation chain model, and (c) is a private chain model.

FIG. 2 is a flow chart of virtual power plant information interaction and operation.

Fig. 3 is a diagram of a virtual power plant data storage and sharing model based on a dual block chain, wherein PV is photovoltaic power generation, WE is wind power generation, HE is hydro power generation, EV is an electric vehicle, and DES is a distributed energy storage device.

Fig. 4 is a diagram of a scheduling private chain data storage area model.

FIG. 5 is a diagram of a data storage area model of a trade union chain.

FIG. 6 is a diagram of a virtual plant safety scheduling model based on dual blockchains.

FIG. 7 is a diagram of a virtual power plant market trading model based on dual blockchain and reputation.

FIG. 8 is a simplified PBFT algorithm consensus flow diagram.

Detailed Description

The invention will be further explained with reference to the drawings and the specific embodiments.

The invention adopts double block chains to realize the safe scheduling and transaction of the virtual power plant, and the block chain model is shown in figure 1. The block chain technology can be divided into a public chain, a federation chain and a private chain according to the node participation mode. The public chain has the highest safety degree, but the consumed resources are very strong, so the public chain is not adopted in the invention. Compared with the public chain, although the safety degree of the alliance chain is reduced, the alliance chain has the advantages of high transaction rate, settable read-write permission and low resource consumption and is popular in the market. In addition, although the processes of consensus, verification and the like of the private chain are strictly limited within a specific range by the private organization, the private chain has great advantages in storing large-scale data. In conclusion, the operation benefit maximization of the virtual power plant can be realized by adopting a dual block chain technology of the alliance chain and the private chain. In order to better highlight the workflow on different types of block chains, the invention divides the virtual power plant into a Commercial Virtual Power Plant (CVPP) and a Technical Virtual Power Plant (TVPP) according to the functions of the virtual power plant, as shown in FIG. 2.

1. The model design of the invention.

Fig. 3 shows the overall structure of the present invention, and the specific parameters are defined as follows:

a power generation unit node: the power generation unit node is a DER node consisting of a distributed power supply, a distributed energy storage, a controllable load and an electric automobile, and the DER node is in a dispatching private chain and a transaction alliance chain. When the DER nodes play the role of private chain nodes, the DER nodes upload production information to the private chain in real time, so that the virtual power plant nodes can use real and reliable production information to calculate a scheduling optimization scheme. When DER nodes play the role of alliance link nodes, all that needs to be done is to continuously send transaction information such as energy quotation, credit value and the like to virtual power generation, and the aim is to achieve the maximization of own benefits.

The power utilization unit node: the power consumption unit nodes are demand side nodes of houses, factories and the like, are different from power generation unit nodes, only play the role of union link nodes, and mainly work for sending transaction information similar to the above to the virtual power plant nodes and performing transaction matching through the virtual power plant. And when the transaction matching is successful and the energy transportation is finished, the power utilization unit node takes the energy currency of the power generation unit node as the reward. The energy currency can be obtained by participating in the consensus process of the alliance chain besides being purchased from other users, but only the reputable nodes are possible to join the consensus process.

Virtual Power Plant (VPP) node: the virtual power plant node can be divided into two modules, namely a Technical Virtual Power Plant (TVPP) node and a Commercial Virtual Power Plant (CVPP) node according to the function difference. The TVPP node mainly acts on a private chain, and mainly acts on calculating information from the DER node and the CVPP node by adopting a mathematical algorithm or an intelligent heuristic algorithm so as to obtain an optimal global scheduling scheme. The CVPP node mainly acts on a alliance chain and is mainly used for calling a reputation-based continuous bilateral auction algorithm to conduct transaction matching between the power utilization unit node and the power generation unit node.

A trusted authority node: the node is considered most secure and trusted. In the present invention, it refers to the power dispatching control center, the power trading center and the verification mechanism, which is not shown here since the verification mechanism only functions in the initial registration phase, while fig. 3 shows the overall framework of nodes that have passed the verification. The power control center exists in all private chains constructed by the virtual power plant nodes and is present for verifying whether the optimal scheme generated by the virtual power plant nodes is safe or not. The electric power trading center exists in a alliance chain and mainly provides services for power utilization unit nodes and power generation unit nodes which fail to be matched.

The symbols used in the present invention are shown in table 1:

TABLE 1 symbols used in the invention

2. The block chain structure of the present invention.

In the proposed dual block chain structure, the private chain stores information with large scale, while the alliance chain stores information with high value. Aiming at respective characteristics of stored information, different block structures are adopted in a private chain and a alliance chain respectively. The private link block structure in step (S06) is shown in fig. 4, and the federation link block structure is shown in fig. 5.

Fig. 4 is a model of a scheduled private chain data storage area, similar to bitcoin, that a distributed node links to the longest legal blockchain when a new chunk is allowed to join the blockchain. The information recorded in the block chain exists in the blocks, and the blocks are divided into a block head part and a block body part. The block header is mainly used for storing information such as a version number, a previous block hash, a time stamp, a merkel root and a current block hash, wherein the merkel root represents a total hash value of all transaction combinations contained in the block. The specific information of the transaction is stored in the block body, and the transaction data is paired and hashed pairwise through the Merckel tree and finally points to the Merckel root in the block head.

Fig. 5 is a data storage area model of a trade alliance chain, which adopts a data storage mode of an ether house, wherein the ether house is improved in a storage mode of bitcoin, and a data storage mode based on an account is provided. Based on the storage mode of the Ether house, a bloom filter is additionally arranged in the block head, and the bloom filter is mainly used for judging whether the transaction of a certain block generates a log or not, so that the log information is prevented from being stored in the block, and the effect of saving space is achieved. In addition, what its block header stores is no longer the Merkel root, but the Merkel Patricia Tree (MPT) root. The MPT is composed of a mercker Tree and a Patricia Tree (PT), and the difference between the MPT and the PT is that a pointer of a connection node is a hash pointer, and a mercker root is finally stored. The PT is a variant of the prefix tree, the working principle is similar to the prefix tree, but the characters of the prefix tree are compressed, so that the function of saving the storage space is achieved. There are three types of MPTs in the etherhouse area: a status tree, a transaction tree, and a receipt tree. And the state tree is only one in the whole system, and records the account state of the whole block chain network, such as the account balance. In each block there is a transaction tree that records transaction information for the block and a receipt tree that records transaction receipts for the block. In order to ensure the security of data in the private chain, the transaction tree of the federation chain should store the private chain hash digest in addition to the transaction information.

3. The invention relates to a safe scheduling process.

The safety scheduling model provided by the invention is provided based on a technical module of virtual power plant information communication, and as the virtual power plant is driven by data, the damage to the authenticity of the data can cause serious influence on the stability of the whole scheduling system. Different from the traditional virtual power plant information interaction, the method and the system adopt the block chain technology to share the information. The data of the intelligent metering equipment is updated and uploaded in real time, and huge communication burden is caused if the data is directly transmitted to the VPP through the block chain technology. The data are aggregated once in 5 minutes or 15 minutes in a virtual power plant, and in order to ensure the authenticity and confidentiality of the data in the period of time, the intelligent metering equipment stores the data into a block chain in an encrypted mode. When data is encrypted, it is difficult to share it with other users who want to access the data. The proxy re-encryption can convert the encrypted file into a ciphertext which can be decrypted by a data requester by using a private key of the data requester through a semi-trusted proxy on the premise of not revealing the private key of an encryptor. The specific implementation method of the invention is to use the proposed ciphertext-policy-based hybrid proxy re-encryption algorithm, for example (S03).

Fig. 6 is a safety scheduling model of the present invention, wherein the details of the scheduling process are as follows:

(1) step 1:

the verification organization verifies the node applying for joining, and the verified node generates a private and public key Pair (PK) for the node by using an identity-based encryption algorithm_ID,SK_ID). In the scheduling process, the information uploaded by the DER is mainly analyzed and processed, and in order to ensure the confidentiality and the sharing of the uploaded information, the mixed proxy re-encryption technology based on the ciphertext is adopted. Therefore, the authentication agency needs to additionally generate an encryption key SK for DER_SThe key is generated by an attribute-based encryption algorithm KGen_CP(GP,MSK,S)→SK_SAnd generating, namely encrypting the uploaded information according to the attribute.

(2) Step 2:

DER of embedded anti-tampering smart metering device utilizes encryption key SK_SAnd encrypting the production data generated in real time according to the attributes, and then storing the encrypted data into the private chain. Meanwhile, DER continuously conducts energy transaction through CVPP, and transaction information of the DER is stored in a alliance chain. To ensure the security of the private chain data, the private chain hash will also be stored in the federation chain.

(3) And step 3:

under the hybrid control model, the DER agent shares the operating pressure of the TVPP, and the DER responsible by the DER agent belongs to the same right, so that the DER agent gives consideration to the role of an agent in the process of agent re-encryption. When the TVPP in the private chain needs to perform a new round of scheduling, a data access application needs to be issued to the DER agent.

(4) And 4, step 4:

after receiving the data access application from the TVPP, the DER agent aggregates the data CT uploaded by the DER encryption in the period from the last scheduling end to the present time from the private chain_A。

(5) And 5:

since the DER agent has the ownership of the managed DER, the agent of the system re-encrypts the key

Directly generated by the DER agent, without being forwarded to the DER agent after the DER is generated, and the encryption key SK required in the key generation algorithm is re-encrypted_SObtained by issuing from a certifying authority at an initial step. Generating a re-encryption key

Then use

For ciphertext CT_ARe-encrypting to obtain re-encrypted ciphertext

(6) Step 6:

re-encrypted ciphertext

After generation, the DER agent sends it to the TVPP immediately. TVPP obtains re-encrypted ciphertext

And by its own private key

And decrypting to obtain the data required by the schedule.

(7) And 7:

the CVPP based on the alliance chain collects quotation information within the jurisdiction and then facilitates electric energy transactions through a continuous bilateral auction mechanism based on reputation. And for the participants who do not successfully trade, handing the participants to the electric power trading center for processing. In the transaction process, the reputation value of the DER and the transaction volume and other related economic information realize information transfer in the internal communication of the virtual power plant. Note that the virtual plant internal communication is bidirectional, which means that the CVPP can also get messages from the TVPP delivery at this stage.

(8) And 8:

the method comprises the steps that production information from DER and economic parameter information from CVPP are integrated, the TVPP calculates an optimal global scheduling scheme by adopting a mathematical algorithm or an intelligent heuristic algorithm, and DER agents can share calculation pressure for the TVPP in the calculation process. Furthermore, the reputation value of DER may affect the final result to some extent, and a high reputation value may be appropriate for allocating more production credits.

(9) And step 9:

the TVPP firstly sends the calculated scheduling plan to the PDCC for safety verification, if the verification is passed, the TVPP sends the plan to all DER agents in the same private chain, and if the verification fails, the TVPP needs to recalculate a new optimal scheduling plan.

(10) Step 10:

the DER agent sends the received scheduling scheme to the managed DER and then prompts the DER to respond to the scheduling optimization scheme, and the reputation value evaluation is influenced by the response rate and the scheme completion degree.

4. The transaction flow of the present invention.

A reputation based continuous bilateral auction mechanism is employed in the present invention to conduct transactions for energy, e.g., S04. The continuous bilateral auction mechanism is one of centralized clearing ways, and is a unified transaction under the intermediary's optimized schedule, which allows both parties to modify their own bid during each auction. In order to ensure that two transaction parties have good market behaviors, the concept of reputation is introduced into a continuous bilateral auction mechanism, each user has a reputation score, the reputation of the two transaction parties can be reevaluated every certain period of time, the reputation score is directly hooked with the economic benefit of the user, and the goal of maximizing the benefits of the user can be realized by the user with the higher reputation score. A reputation based continuous bilateral auction process is shown in fig. 7, with details as follows:

(1) initialization:

similar to step 1 in the scheduling process, the initialization serves to verify the identity of the transactor and provide a public and private key Pair (PK) for the authenticated transactor_ID,SK_ID). Only users with accounts can communicate transactions on a federation chain, and a public-private key Pair (PK)_ID,SK_ID) Is a prerequisite for generating an account.

(2) Reputation based CDA auction phase:

the power generation unit and the power utilization unit send the quotation, the demand and the reputation of the CVPP to the CVPP, the CVPP conducts transaction matching according to a continuous bilateral auction mechanism based on the reputation, and continuously feeds matching information back to each participating entity so as to conduct timely quotation modification. Once the transaction match is successful, the CVPP broadcasts transaction information in the federation chain, which is not recorded in the block, and the transaction information is stored in the block only if all phases are completed. After the auction is finished, the information which is not successfully matched is sent to the electric power trading center, and the electric power trading center takes charge of relevant trading.

(3) Transaction and clearing stage:

and the successfully matched power generation units check the transaction information, and supply power to the corresponding power utilization units according to the determined transaction electric quantity after the transaction information is confirmed to be correct. And after receiving the determined electric quantity, the electricity utilization unit pays the energy money according to the price negotiated in advance. In this process, any party that is not completing a transaction as specified will be subject to the economic penalty of the system and deduct a certain amount of reputation value. The power generation units which are not successfully matched can choose to sell the redundant electric energy to the electric power trading center, so that a certain amount of energy currency feedback is obtained. Meanwhile, the power generation unit can also choose to store the electric energy in the own energy storage device and wait for the next round of auction. And directly purchasing electric energy from the electric power trading center by the power utilization unit which is not successfully matched.

5. The consensus process of the invention.

Because the invention uses two different block chains of a private chain and a federation chain, in order to better realize the advantages of the two chains, different consensus mechanisms are adopted on the different chains. On a scheduling private chain, a strong-leading-type Raft consensus algorithm is uniformly adopted. Three identities of a leader, a candidate and a follower exist in the Raft consensus algorithm, and under the normal working condition, only one leader exists, and all other nodes are followers. The candidates and followers differ in that a new leader will be selected from the candidates if the leader fails to function properly. Here, we briefly describe the workflow of generating new blocks by applying the Raft consensus algorithm to the scheduling private chain. Firstly, the leader node audits data from the DER, and if the audit is passed, the leader node sends the data to the DER agent for rechecking. Secondly, the DER agent conducts a double check on the data sent by the leader node, and returns the double check result to the leader node. And finally, the leader node packs the data passing both the examination and the re-examination into blocks, uploads the blocks to the private chain, and sends the hash digest of the blocks to the trade union chain.

PoW is a consensus algorithm generally adopted by a public chain, has the highest security, but has low working efficiency and large resource loss, and cannot meet the real-time requirement of a user. PoS reduces the resource consumption problem of pows to some extent, but has the problem of excessive concentration. Thus, the federation chain typically uses a PBFT consensus algorithm to complete the generation of new blocks. The invention adopts PBFT consensus algorithm on the trade union chain, and the consensus node in the invention is continuously changed. And according to the reputation value of the participating node, the system randomly selects a certain number of nodes to form a consensus committee. Before each transaction cycle in the system, a new consensus committee is generated, and the working time of the consensus committee is the transaction cycle time. After the transaction period is over, the system reconfigures a new consensus committee based on the current node reputation value. Note that the total number of nodes in the consensus committee is unchanged, except that the first configuration committee consensus nodes are all new nodes, and the subsequent reconfiguration is only to randomly replace a certain number of old nodes. After the consensus committee generated, the PBFT consensus algorithm was started. The consensus nodes in the PBFT algorithm are divided into two types, namely a leader node and a backup node, wherein only one leader node exists in the consensus process, and the other nodes are backup nodes. The simplified PBFT algorithm consensus process is shown in fig. 8, and its details are as follows:

(1) request (request): the consensus node that a client sends a request to any node, first activating a node service operation, is called a leader.

(2) Pre-preparation (pre-prepare): and after receiving the information request from the client, the leader node broadcasts the execution sequence of the transactions to each backup node.

(3) Preparation (prepare): when each backup node receives a message from the leader node, there may be two different options, the first one being to accept and propagate the message again, the second one being to not accept and refuse to make any reaction. Backup node 1 and backup node 2 in fig. 8 select the first option and backup node 3 selects the second option. At this point, the backup node 3 may be down or maliciously seized.

(4) Commitment (commit): if each consensus node receives (n-f) identical requests in the preparation stage, the promise stage is entered, and promise information is broadcasted all over the network. n is the total number of the consensus nodes, and f is the maximum number of the Byzantine nodes capable of being accommodated in the consensus nodes.

(5) Reply (reply): if the consensus node collects enough same promise information, the node feeds the promise information back to the client. If and only if f is less than or equal to (n-1)/3, the consensus result is reliable.

The verified information will be constructed as a new tile and then linked to the end of the current trade association chain, tile height + 1. In order to encourage the nodes to participate in the consensus process more actively, all the selected consensus nodes can obtain the energy currency issued by the system in the block generation process as the reward.

6. The invention analyzes safety.

The data security of the invention is of great importance to the whole virtual power plant system and meets the security requirements required by data transaction and data storage. The associated security is as follows:

(1) authenticity: a virtual power plant is a data-driven technology, and if the virtual power plant cannot obtain real data, all operations are meaningless afterwards. The current operations of the virtual power plant are mostly based on the theory that data on a block chain has reality. In fact, the blockchain technique can only guarantee the authenticity of the data on the chain, but cannot guarantee the authenticity of the input data. In order to ensure the authenticity of input data, the invention provides that the data acquisition work is carried out by adopting an anti-tampering intelligent metering device at a data end, and the acquired data is uploaded to a local block chain in real time. So far, all have the authenticity in the data under the chain on the chain, and virtual power plant can be relieved handles data.

(2) Confidentiality: the tamper-proof intelligent metering equipment uploads various data information of the DER in real time, and if the information is not encrypted before uploading, privacy of an owner of the DER is easily revealed. If the DER owner wants to share encrypted data with the virtual power plant, he needs to download the ciphertext CT_AAnd decrypted and then use the public key of the virtual power plant

And (4) encrypting. In this case, encrypting the data incurs a significant amount of additional overhead to the data owner, which does not seem worthwhile. To solve the problem, the invention adopts the proxy re-encryption technology to carry out the CT_ACarry out re-encryption to make CT_ACan be accessed by the virtual plant without decryption by the data owner. The method effectively reduces the expense of DER owners and protects the confidentiality of data.

(3) Transparency and traceability: the data stored on the blockchain is publicly transparent to all joining nodes, although to ensure confidentiality of the data, it may be ciphertext that is stored hereCT_ABut may be applied by the data owner to gain access. In addition, the public and Private Key (PK) of the present invention_ID,SK_ID) Is generated based on identity, and each piece of information on the blockchain is closely related to the respective public and private keys. It is noted that the blockchain links blocks containing the hash of the previous block by individual hash pointers, and the nature of the hash function is such that the information stored in the blockchain is not lost. Under the combined action of the conditions, the information stored on the block chain has traceability.

(4) Non-tamper-and non-repudiation: the non-tamper property on the block chain is related to the consensus mechanism employed. The dual block chain architecture adopted by the invention adopts a strong leader Raft consensus algorithm on a private chain, and adopts a PBFT consensus algorithm on a alliance chain. On the private chain, the leader may tamper with the data, and to avoid this, we store the hash of the private chain in the federation chain, relying on the non-tamper-resistance of the federation chain to ensure the non-tamper-resistance of the private chain. Because the consensus nodes of the federation chain are selected based on the reputation, the more benefits can be obtained by the nodes with higher reputations, and more than one third of the high-reputation consensus nodes attack the federation chain at the same time, which is against the benefits of the consensus nodes and is unlikely to happen. Thus, the non-tamper-ability of both the federation chains and the private chains can be guaranteed. Non-repudiation is realized by means of digital signatures, each transaction is generated by requiring a user to sign the transaction, and once the user is repudiated, the public key of the user can be used for verifying the correctness of the signature, so that the purpose of tracing responsibility is realized.

7. The invention will be further illustrated by the following two examples.

Example 1: and the power generation unit sends production related information to a virtual power plant for safety scheduling. Namely, the corresponding steps in fig. 6 are as follows:

(1) system setting:

the authentication mechanism executes the algorithm. Inputting system security parameters

And a system attribute set U, and then constructing two multiplication cyclic groups G and G with the order p_TAnd p is a prime number. g, g₁,g₂,g₃Are both generators of G, and G_TSatisfy bilinear mapping relationship e: GXG → G_T. Randomly selecting elements

And defines three hash functions H₁:(0,1)^*→G,H₂:G_T→G,H₃:

Finally, the system public parameter GP and the master key MSK are output.

GP＝(p,g,g₁,g₂,g₃,e(g,g)^α,H₁,H₂,H₃),MSK＝α (1)

It should be noted that the system public parameters and master keys of the IBE are already included in equation 1, and the specific IBE system public parameter GP_IBEAnd master key MSK_IBEAs follows.

GP_IBE＝(p,g₁,e(g,g)^α,H₁,H₃),MSK_IBE＝MSK＝α (2)

By master key MSK_IBEThe system public key can be obtained as

(2) And (3) key generation:

IBE key generation KGen_IBE(GP_IBE,MSK_IBE,ID)→SK_ID: inputting IBE system common parameter GP_IBEMaster key MSK_IBEAnd user ID e (0,1)^*And outputting a public and private key pair corresponding to the ID.

CP Key Generation KGen_CP(GP,MSK,S)→SK_S: inputting system public parameter GP, master key MSK and DER attribute set

| S | represents the cardinality of S. Random selection

Then calculate

The verification center outputs the key of the attribute set S as

(3) Encryption:

Enc_CP(GP,(A,ρ),M)→CT_A: inputting the system common parameters GP, accessing the structure (A, rho) (A is a matrix of l n, function rho: [ l]Mapping each row of the matrix a to an attribute) and plaintext information M e G_T. Selecting a random element

And form a vector

y₂,...y_nIs also from

Is obtained by random selection. For i rows A of A_iWe have

Randomly selecting l parameters

And calculates the following formula

CP-HAPRE offers two encryption options for DER: when the DER only wants to share data with the DER agent and does not want to re-encrypt the data, the output ciphertext is

When DER needs to re-encrypt data, it must be calculated

The final output ciphertext is

Since only the ciphertext referred to by equation 8 supports re-encryption, we focus on the ciphertext.

(4) Re-encryption key generation

The algorithm inputs the CP key of the system public parameter GP, DER

And the public key of VPP

DER Agents randomly select elements

Then calculate

Finally, the complete re-encryption key is shown as equation 10

(5) And (3) re-encryption:

inputting system public parameter GP, re-encrypting key

And ciphertext CT_A. If the attribute set S satisfies the access structure (a, ρ), let I ═ I:ρ (I) e S, then there is a coefficient

Make sigma_i∈Iω_iA_i1, (0, 0). The DER agent then calculates

J in equation 11 is an index of the attribute ρ (i) in S. After finding V, the DER agent sets the ciphertext

W'＝W/V,W'₀＝RK₃,W'₁＝RK₄,W'₂＝RK₅,W'₃＝W₄ (12)

The final output re-encrypted ciphertext of DER agent is

(6) Digital signature:

inputting a system public parameter GP, partially re-encrypting the ciphertext W' and a private key of the DER agent

DER agent randomly selects two random numbers

Then, calculating:

the DER agent last outputs a digital signature of σ ═ U, q.

(7) And (3) ciphertext decryption:

Dec(GP,CT_A,SK_S) → M: inputting system common parameter GP, cipher text CT_AAnd DER CP Key SK_S. If the attribute set S satisfies the access structure (a, ρ), for I ═ I:ρ (I) ∈ S }, there is a coefficient

Make sigma_i∈Iω_iA_i1, (0, 0). And (3) calculating a decryption algorithm:

j in equation 15 is an index of the attribute ρ (i) in S. The plaintext message is M ═ W/M'.

(8) And (3) re-encrypting the ciphertext and decrypting:

inputting system common parameter GP, re-encrypting cipher text

IBE private key of VPP

IBE public key PK of system_IBEIBE public Key of DER Broker

And re-encrypting the ciphertext signature. First, VPP needs to calculate H ═ H₃(W', q), then verified

If the request is not true, the data access request is sent to the DER proxy again, and if the request is true, the data access request is calculated

And

W'₀/H₂(e(g,g)^αs')＝g^t' (17)

finally, the VPP recovers DER encrypted plaintext information M ═ W' e (g)^t',W'₃)。

Example 2: the virtual power plant obtains transaction information and implements the auction specific implementation process. I.e. the corresponding steps in fig. 7 are as follows:

the reputation based CDA mechanism comprises three entities: buyers, sellers, and auctioneers. In the present invention, electricity using units such as houses and factories represent buyers, electricity generating units such as photovoltaic power plants and hydroelectric power plants represent sellers, and CVPP assumes the responsibility of auctioneers. At the beginning of a trading cycle, the electricity using unit and the electricity generating unit submit initial data to the CVPP respectively

And

indicating the transaction information that the electricity consuming unit i first submitted in the kth transaction period, and, similarly,

indicating generation of electricityThe transaction information submitted by the unit j for the first time in the kth transaction period comprises the following specific contents:

in the formula (I), the compound is shown in the specification,

indicating the power demand and the competitive price at the first round of transaction of the power consumption unit i,

the reputation score of the electricity consumption unit i in the k-th transaction period and the signature of the submitted information are respectively represented.

Representing the electricity supply and quoted price for the first round of trading for the power generation unit j,

the definition is similar to the above.

Upon receipt of submissions from electricity-consuming units and electricity-generating units

And

the CVPP then matches the buyer and seller according to the reputation based CDA mechanism. First, the CVPP constructs a matching list by checking the identity and reputation score of the information submitter. Unlike the traditional CDA mechanism, a reputation based market segment mechanism is introduced, according to which we further divide BL and OL into the following specific divisions as shown in equation 19:

can seeOut, BL and OL are each divided into three lists, where t represents the number of rounds of the transaction, RL_iThe reputation level of the electricity utilization unit i is shown, and the relationship between RL and RS is shown in table 1. Only some of the symbol definitions are explained here, other symbol definitions being similar to the explained symbols.

To represent

The transaction information of the electricity utilization unit only contains RL ═ 1;

to represent

The power generation unit transaction information including RL 1,2, and 3, that is, all the power generation unit transaction information is included. After the matching list is constructed, the CVPP performs matching between the lists according to Table 1, i.e.

All in one

Trade matching is performed (l ═ 1,2, 3).

At the beginning of the trading cycle, both the electricity using unit and the power generating unit would like to gain more benefit, so the initial purchase price of the electricity using unit would be the lowest and the initial sale price of the power generating unit would be the highest. In this case, the number of successful matches for round 1 transaction would be relatively small. In order to increase the number of successful matching times in subsequent transactions, the CVPP needs to do two things after each round of transaction is finished. The first thing, the electricity utilization unit i and the electricity generation unit j which are matched successfully are traded, and the trading information Tx is used_ijUpload into Block chain, Tx_ijThe following is included.

ID_iIndicating the identity of the electricity consuming unit i, E_ijRepresenting the amount of electricity exchanged between the electricity-consuming unit i and the electricity-generating unit j, P_ijThe amount of the transaction between the two is indicated.

Second, calculate the competitive equilibrium price E_pAnd publish it to the parties of the transaction who did not succeed in the match, E_pThe calculation method of (2) is as follows:

where A denotes the estimated starting transaction number, B denotes the ending transaction number, s denotes an increasing integer between A and B, p_sIndicates the transaction price, omega, of the s-th transaction_sA weight representing the transaction cost of the transaction. Omega_sIn the estimation range [ A, B]Is 1, omega_s+1＝βω_sAnd β represents a weight coefficient.

Before the next round of transaction begins, the electricity utilization unit and the electricity generation unit are based on E_pRecalculating respective bids

The calculation formula is as follows:

eta is in the range of [0,1 ]]From the above formula, it can be seen that

With the constraint of

With the constraint of

In addition to this, the present invention is,

should be greater than the cost of the power generation unit.

After the bid price of the next round of transaction is calculated, the two parties submit a new round of transaction information, which is specifically as follows:

the CVPP receives the transaction information and checks the sum T of the matching time of each current transaction_MIf T is_MT represents the total duration of each transaction period, and a new round of matching is performed. If T is_MIf the transaction information is more than or equal to T, the transaction period of the current round is ended, and the transaction information is submitted to the electric power transaction center. So far, the electric quantity required by the electricity consumption unit is directly provided by an electric network controlled by an electric power trading center. The power generation unit can choose to sell the residual power to the power trading center at a low price, or store the residual power in own storage equipment, and then trade in the next trading period. After each round of transaction period is finished, the system can perform a new round of reputation score evaluation according to the transaction performance of each participant in the period.

This will activate the trigger if some unexpected event occurs during the energy transaction. The CVPP then restarts Algorithm 1(Algorithm1) and re-initializes the parameters. Algorithm1 gives the overall flow of the reputation based CDA mechanism.

Claims (6)

1. A virtual power plant safety scheduling and transaction method based on a dual block chain technology is characterized by comprising the following steps:

(S01): an energy scheduling or transaction participant needs to register registration information with a verification mechanism before joining a virtual power plant safety scheduling and transaction system, the verification mechanism verifies the information of the node which applies for joining, and the verified node generates an exclusive public and private key pair for the node by using an identity-based encryption algorithm; all the passing nodes form a business alliance chain together, and each virtual power plant constructs a scheduling private chain block chain on the basis of the alliance chain;

(S02): the distributed energy resources embedded with the anti-tampering intelligent metering equipment collect production information in real time, encrypt production data through an attribute-based encryption algorithm and upload the production data to a dispatching private chain to which the production data belong; when a technical virtual power plant in a scheduling private chain needs to start a new round of scheduling, the technical virtual power plant needs to send a data access application to a distributed energy agent released by distributed energy with the same ownership;

(S03): after receiving an access application from a technical virtual power plant, each distributed energy agent needs to aggregate information uploaded by managed distributed energy in a period from the end of last scheduling to the present from a scheduling private chain; secondly, the distributed energy agent generates a re-encryption key by using a hybrid agent re-encryption algorithm based on a ciphertext strategy, and re-encrypts the aggregated encryption information through the key; the re-encrypted information is sent to the technical virtual power plant by the distributed energy agent so that the technical virtual power plant can perform optimal calculation of a scheduling scheme; in addition, the distributed energy agent continuously provides the managed distributed energy quotation information for the commercial virtual power plant in the commercial alliance chain, so that the commercial virtual power plant can execute the energy transaction in the managed range;

(S04): the commercial virtual power plant collects quotation information from distributed energy sources and quotation information from residential and factory power utilization units; after collecting corresponding quotation information, the commercial virtual power plant divides participants according to a market segmentation mechanism based on reputation, then carries out transaction matching through a continuous bilateral auction mechanism, and continuously feeds back matching information to each participating entity so as to carry out timely quotation modification on each participating entity; once the transaction matching is successful, the commercial virtual power plant broadcasts transaction information in a commercial alliance chain; after the auction is finished, information which is not successfully matched is sent to the electric power trading center, and the electric power trading center is responsible for relevant trading; the technical virtual power plant can know all transaction information issued by the commercial virtual power plant through internal communication;

(S05): the method comprises the steps that production information from distributed energy resources and economic parameter information from a commercial virtual power plant are integrated, a technical virtual power plant starts to calculate an optimal global scheduling scheme, and a distributed energy agent can share calculation pressure for the technical virtual power plant in the calculation process; the global optimal scheme is distributed to subordinate distributed energy agencies by the technical virtual power plant only through the safety verification of the power dispatching control center; in addition, the technical virtual power plant can supervise and urge each distributed energy source to supply power according to transaction records of deals in the commercial virtual power plant, and an electricity consumption unit pays energy coins according to a pre-determined auction price after receiving the determined electric quantity;

(S06): the accounting node on the scheduling private chain records the encrypted production information uploaded by each distributed energy source into a block, the verification node verifies the block, and the block passing the verification is connected to the scheduling private chain; in addition, the verification node stores the hash digest of the scheduling private chain onto the business alliance chain; similar to the scheduling private chain, the transaction information, the reputation value and the scheduling private chain hash digest are stored in the block by the preselected node in the business alliance chain, and only the verified block is finally connected to the business alliance chain;

(S07): when the data is packed into blocks and stored in the block chain, other nodes on the chain can look up the account book through legal identities; meanwhile, the data recorded in the blockchain will be permanently stored thereon.

2. The method for virtual power plant safety scheduling and transaction based on the dual blockchain technology of claim 1, wherein the identity-based encryption algorithm of the step (S01) comprises the following steps:

(1) system setup

Setup(1^l)→(GP_IBE,MSK_IBE): the verification mechanism executes the algorithm, inputs the system safety parameter l and outputs the specific system public parameter GP_IBEAnd master key MSK_IBE；

(2) Key generation

KGen_IBE(GP_IBE,MSK_IBE,ID)→(PK_ID,SK_ID): verification mechanism input system common parameter GP_IBEMaster key MSK_IBEAnd user ID e (0,1)^*And outputting corresponding public and private key Pair (PK)_ID,SK_ID)；

(3) Encryption

Enc_IBE(GP_IBE,PK_ID,M)→CT_ID: information sender input system common parameter GP_IBEThe public key PK of the receiver_IDAnd plaintext information M, and outputs ciphertext CT_ID；

(4) Decryption

Dec_IBE(GP_IBE,CT_ID,SK_ID) → M/. T: ciphertext receiver input system common parameter GP_IBEReceived ciphertext CT_IDAnd its own private key SK_ID(ii) a If the received cipher text is the public key PK of the receiver_IDAnd (4) obtaining the encrypted information, outputting the encrypted information as plaintext information M, and otherwise, obtaining an error symbol ^ T.

3. The method for virtual power plant safety scheduling and transaction based on the dual blockchain technology of claim 1, wherein the attribute-based encryption algorithm of the step (S02) comprises the following steps:

(1) system setup

Setup(1^l,U)→(GP_CP,MSK_CP): the verification mechanism executes the algorithm, inputs the system safety parameter l and the system attribute set U, and outputs the specific system public parameter GP_CPAnd master key MSK_CP；

(2) Key generation

KGen_CP(GP_CP,MSK_CP,S)→SK_S: verification mechanism input system common parameter GP_CPMaster key MSK_CPAnd a user attribute set S, outputting a key SK of the user attribute set S_S；

(3) Encryption

Enc_CP(GP_CP,(A,ρ),M)→CT_A: information sender input system common parameter GP_CPAttribute access structure (A, rho) and plaintext information M, and outputs ciphertext CT satisfying the access structure (A, rho)_A；

(4) Decryption

Dec_CP(GP_CP,CT_A,SK_S) → M/. T: ciphertext receiver input system common parameter GP_CPReceived ciphertext CT_AAnd a private key SK_S(ii) a If the private key SK_SIf the attribute set S meets the access structure (A, rho) used in encryption, the plaintext information M is output, otherwise, an error symbol is reversed.

4. The virtual power plant safety scheduling and transaction method based on the dual block chain technology as claimed in claim 1, wherein the hybrid proxy re-encryption algorithm based on the ciphertext strategy in the step (S03) comprises the following steps:

(1) system setup

Setup(1^lU) → (GP, MSK): the authentication mechanism executes the algorithm; inputting a system security parameter l and a system attribute set U, and outputting a system public parameter GP and a master key MSK;

(2) key generation

1) IBE key generation

KGen_IBE(GP,MSK,ID)→SK_ID: inputting system public parameter GP, master key MSK and user ID E (0,1)^*Outputting a public and private key pair corresponding to the ID;

2) CP Key Generation

KGen_CP(GP,MSK,S)→SK_S: inputting system public parameter GP, master key MSK and attribute set S, outputting CP key SK of attribute set S_S；

(3) Encryption

Enc_CP(GP,(A,ρ),M)→CT_A: inputting system common parameters GP, attribute access structures (A, rho) and plaintext information M, and outputting ciphertext CT satisfying the access structures (A, rho)_A；

(4) Re-encryption key generation

RKGen(GP,SK_S,PK_ID)→RK_S→ID: inputting system public parameter GP, CP secret key SK of data owner_SAnd the public key PK of the data visitor_IDOutputting the re-encryption key RK_S→ID；

(5) Re-encryption

ReEnc(GP,RK_S→ID,CT_A)→CT_ID: inputting system common parameter GP, re-encrypting key RK_S→IDAnd ciphertext CT_A(ii) a If the attribute set S satisfies the access structure (A, rho), outputting the re-encrypted ciphertext CT_ID；

(6) Digital signature

Sig(GP,CT′_ID,SK_proxy) → σ: inputting system common parameter GP, partially re-encrypting ciphertext CT'_IDAnd SK as a private key of a re-encryption agent_proxyOutputting a signature sigma;

(7) ciphertext decryption

Dec(GP,CT_A,SK_S) → M: inputting system common parameter GP, received cipher text CT_AAnd a private key SK_S(ii) a If the private key SK_SIf the attribute set S meets the access structure (A, rho) used in encryption, outputting the information M as plaintext information, otherwise, outputting the information M as an error symbol T;

(8) re-encrypted ciphertext decryption

ReDec(GP,CT_ID,SK_ID,PK_IBE,PK_proxyσ) → M: inputting system common parameter GP, re-encrypting cipher text CT_IDReceiver's IBE private Key SK_IDThe IBE public key PK of the system_IBEIBE public key PK of re-encrypted proxy_proxyAnd a digital signature σ; and checking whether the digital signature is correct, if the digital signature is correct, outputting the digital signature as plaintext information M, and if the digital signature is not correct, giving up the decryption and requesting data access again.

5. The method of claim 1, wherein the reputation-based market segmentation mechanism of step (S04) segments the corresponding lists according to reputation level to make buyers or sellers with high reputation value get more and better quotations; the reputation is divided into 3 levels, the reputation value range of the buyer or seller at the level 1 is [0,2], the reputation value range of the buyer or seller at the level 2 is (2,4], the reputation value range of the buyer or seller at the level 3 is (4,6], the matching ranges of different reputation levels are different, the buyer or seller at the level 3 can perform matching transaction with all levels of sellers or buyers, the buyer or seller at the level 2 can perform matching transaction with the seller or buyer at the level 2/3, and the buyer or seller at the level 1 can perform matching transaction only with the seller or buyer at the level 3.

6. The method according to claim 1, wherein the continuous bilateral auction mechanism of step (S04) stores the received bids in a bidding list of a buyer and a bidding list of a seller, respectively, according to the identities of participants submitting the bids; in the bidding list, the ordering rule is that prices are ordered from high to low; in contrast, the ordering rules in the quote list are that prices are ordered from low to high; the highest price quoted by the buyer is called the optimal buying price, the lowest price quoted by the seller is called the optimal selling price, when the optimal buying price is larger than or equal to the optimal selling price, the buyer and the seller are successfully matched, and in order to realize the benefit maximization of each participant, the bargaining price is the average value of the optimal buying price and the optimal selling price; and matching according to the matching rule of 'price first and time first', wherein when the prices are the same, the price is matched with the participant with the earlier quoted price submission time.

Images