<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">EE</journal-id>
<journal-id journal-id-type="nlm-ta">EE</journal-id>
<journal-id journal-id-type="publisher-id">EE</journal-id>
<journal-title-group>
<journal-title>Energy Engineering</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-0118</issn>
<issn pub-type="ppub">0199-8595</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">22479</article-id>
<article-id pub-id-type="doi">10.32604/ee.2023.022479</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Blockchain-Based Power Transaction Method for Active Distribution Network</article-title>
<alt-title alt-title-type="left-running-head">Blockchain-Based Power Transaction Method for Active Distribution Network</alt-title>
<alt-title alt-title-type="right-running-head">Blockchain-Based Power Transaction Method for Active Distribution Network</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Zeng</surname><given-names>Fei</given-names>
</name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Wei</surname><given-names>Zhinong</given-names>
</name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-3" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Han</surname><given-names>Haiteng</given-names>
</name><xref ref-type="aff" rid="aff-1">1</xref><email>hanht@hhu.edu.cn</email></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Chen</surname><given-names>Yang</given-names>
</name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<aff id="aff-1"><label>1</label><institution>College of Energy and Electrical Engineering, Hohai University</institution>, <addr-line>Nanjing</addr-line><addr-line>, 211100</addr-line>, <country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>School of Microelectronics and Control Engineering, Changzhou University</institution>, <addr-line>Changzhou</addr-line><addr-line>, 213164</addr-line>, <country>China</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Haiteng Han. Email: <email>hanht@hhu.edu.cn</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2023</year></pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>17</day>
<month>2</month>
<year>2023</year>
</pub-date>
<volume>120</volume>
<issue>5</issue>
<fpage>1067</fpage>
<lpage>1080</lpage>
<history>
<date date-type="received">
<day>12</day>
<month>3</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>29</day>
<month>7</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Zeng et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Zeng et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_EE_22479.pdf"></self-uri>
<abstract>
<p>A blockchain-based power transaction method is proposed for Active Distribution Network (ADN), considering the poor security and high cost of a centralized power trading system. Firstly, the decentralized blockchain structure of the ADN power transaction is built and the transaction information is kept in blocks. Secondly, considering the transaction needs between users and power suppliers in ADN, an energy request mechanism is proposed, and the optimization objective function is designed by integrating cost aware requests and storage aware requests. Finally, the particle swarm optimization algorithm is used for multi-objective optimal search to find the power trading scheme with the minimum power purchase cost of users and the maximum power sold by power suppliers. The experimental demonstration of the proposed method based on the experimental platform shows that when the number of participants is no more than 10, the transaction delay time is 0.2 s, and the transaction cost fluctuates at 200,000 yuan, which is better than other comparison methods.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Blockchain</kwd>
<kwd>active distribution network</kwd>
<kwd>power transaction</kwd>
<kwd>energy request mechanism</kwd>
<kwd>particle swarm optimization algorithm</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>With the wide promotion and application of new energy sources such as photovoltaics, wind power, and biomass energy, renewable energy is now being connected to the distribution network through microgrids with great penetration [<xref ref-type="bibr" rid="ref-1">1</xref>] and thus form an active distribution network (ADN) [<xref ref-type="bibr" rid="ref-2">2</xref>], which calls for an efficient and reliable energy trading and control mechanism to increase the energy utilization [<xref ref-type="bibr" rid="ref-3">3</xref>]. Most of the electricity transactions are affected in centralized trading centers and dominated by qualified organizations, which to some extent ensures that the power transactions are safe and reliable. However, congestion problems still exist, which calls for further optimization [<xref ref-type="bibr" rid="ref-4">4</xref>].</p>
<p>In recent years, extensive research has been conducted to address the energy transaction issues in AND [<xref ref-type="bibr" rid="ref-5">5</xref>,<xref ref-type="bibr" rid="ref-6">6</xref>]. Rui&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-6">6</xref>] proposed a Nash bargaining method for multi-microgrid energy trading to minimize the operation costs and designed the cooperative game model for MMG bargaining, reducing the MMG operation cost. However, the transaction efficiency of ADN needs to be improved. Hayes&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-7">7</xref>] designed a method for joint simulation of distribution network and local energy trading platform. The interface between the distribution system simulator and energy trading platform uses a distributed double auction transaction mechanism based on blockchain. Complicated transactions require greater computational costs and put greater pressure on the trading platform. Luo&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-8">8</xref>] proposed a two-layer distributed electricity trading system based on electricity sharing among prosumers. The bottom layer was a multi-agent system to support the transaction progress while the top layer was a blockchain-based transaction settlement mechanism, which made sure that the settlement was safe and reliable. However, the proposed system failed to consider the randomness of new energy output.</p>
<p>Blockchain is a newly emerging transaction method in recent years. During the transaction, all data is encrypted using a modern cryptographic algorithm to make that the data is complete and tamper-proof and this is how block provided a solution to the problems of the many transaction entities and low security in ADN. Besides, blockchain enables the energy trading between the ADN user and power supplier, which ensures the balance of production and consumption of renewable energy [<xref ref-type="bibr" rid="ref-9">9</xref>]. Che&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-10">10</xref>] proposed a blockchain-based distributed renewable energy trading authentication mechanism in which the transaction nodes had to go through the ID authentication process. The system provided nodes with access by controlling the public keys and private keys of trading participants for identity authentication. However, for complex heterogeneous systems containing various types of new energy and energy storage, their security performance needs to be verified. He&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-11">11</xref>] combined cross-chain trading and blockchain technology and proposed a joint operation mechanism for the energy market, which ensures that the mainchain and sidechain can share data and circulate value. However, the method proposed is too complicated for efficient electricity trading. In Chaudhary&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-12">12</xref>], a blockchain-based secure energy trading scheme for electric vehicles was suggested to verify the charging requests of electric vehicles. However, the evaluation of the communication and transaction costs needs to be improved. Li&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-13">13</xref>] designed a transaction system of a multi-energy system based on heterogeneous blockchain technology to enhance information security in coalition transactions. However, this work did not delve into the economy and applicability of the electricity trading process.</p>
<p>In this study, we propose a blockchain-based power transaction	 method for ADN considering the security and economy of the transactions. The novelty of the method lies with the following aspects:
<list list-type="simple">
<list-item><label>1)</label><p>In view of the shortcomings of centralized trading mode, such as low efficiency and high energy consumption, blockchain technology [<xref ref-type="bibr" rid="ref-14">14</xref>] is introduced to conduct power trading to ensure the security of trading information.</p></list-item>
<list-item><label>2)</label><p>In order to improve the economy of power trading, particle swarm optimization [<xref ref-type="bibr" rid="ref-15">15</xref>] is introduced to carry out multi-objective search optimization and find the optimal scheme.</p></list-item>
</list></p>
<p>Firstly, the blockchain structure of ADN power trading is designed by using the decentralized characteristics of blockchain; Then, the energy request mechanism is proposed to meet the transaction needs, and the cost aware and storage aware requests are integrated to design the optimization objective function; Finally, particle swarm optimization algorithm is used for multi-objective optimal search to obtain the optimal power trading scheme. The experimental results of the simulation platform show that the proposed method can increase the sales of new energy and reduce the amount of wind and light abandonment while ensuring the minimum cost of power purchase.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>System Modeling</title>
<sec id="s2_1">
<label>2.1</label>
<title>System Architecture</title>
<p>In the proposed ADNs, the energy trading between the power supplier and the user provides sufficient energy at a low rate without dependence on other power suppliers [<xref ref-type="bibr" rid="ref-16">16</xref>]. Therefore, the extra energy provided by the transaction nodes could be used for reliable power transactions via blockchain, which meets the economic demand of the power grid. Assuming that each group of transaction nodes could store the dispensable extra energy and have its energy storage capacity with the limitations set, and the transaction nodes could have different energy requests over a period of time, the ADN system architecture can be shown as <xref ref-type="fig" rid="fig-1">Fig. 1</xref>.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Architecture of the system</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_22479-fig-1.tif"/>
</fig>
<p>In which the decentralized blockchain architecture of ADN power transactions is designed. The transaction information is stored in blocks and each node is related to renewable energy sources like solar energy, hydropower, and wind power to meet the energy demand of corresponding areas [<xref ref-type="bibr" rid="ref-14">14</xref>]. The storage perception and storage perception processing requests are proposed to handle the energy requests of the nodes. Meanwhile, considering the costs and storage capacity, the multi-objective particle swarm algorithm is used to search for an economic and safe power transaction plan, which minimizes the purchase cost of the user and maximizes the sales of the power supplier.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Problems Formulation</title>
<p>The processing of the trading requests submitted by the users in the centralized trading system will bring up the heavy cost of data processing and computation [<xref ref-type="bibr" rid="ref-17">17</xref>]. Therefore, a decision variable <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is defined to map the transaction node id in the blockchain network to power generation (0) or request (1) within <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mi>t</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>T</mml:mi></mml:math></inline-formula>, which can be expressed as follows:</p>
<p><disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">d</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">m</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Whereas the variation of the dispensable energy storage in a generation cycle is:</p>
<p><disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="center left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mspace width="thinmathspace" /><mml:mi mathvariant="normal">&#x0026;</mml:mi><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mspace width="thinmathspace" /><mml:mi mathvariant="normal">&#x0026;</mml:mi><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>&#x003E;</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>In the equations, <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula> indicates that the amount of energy equal to the power generation rate <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> can be generated. If the additional energy <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> does not exceed the storage limit <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, it will be added to the energy storage unit <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. If the storage limit <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is exceeded, the storage unit will be filled directly to reach the upper limit <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> indicates a request for transaction. Since the request is randomly generated, the change of <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is also random [<xref ref-type="bibr" rid="ref-18">18</xref>].</p>
<p>If the internal storage unit <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> cannot satisfy the random request of the storage unit <italic>W</italic>, the request of the remaining storage units will be sent through the network, which is expressed as follows:</p>
<p><disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:mi mathvariant="italic">I</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">N</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">d</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>W</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mi>W</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mi>W</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mrow><mml:mi mathvariant="italic">R</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">q</mml:mi><mml:mi mathvariant="italic">u</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">t</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mi>W</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>W</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mi>W</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mi>W</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">d</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">m</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>200</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>The distance matrix <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>D</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi></mml:math></inline-formula>[&#x00B7;][&#x00B7;] is assumed to describe the distance between the storage unit and the transaction node, and it is used to obtain the cost of the request. Based on the distance between transaction nodes, the relatively smaller transmission cost per unit distance <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> will be added to the basic fee and thus request the cost of <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>n</mml:mi></mml:math></inline-formula> energy unit <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mi>C</mml:mi></mml:math></inline-formula> from transaction node <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>e</mml:mi></mml:math></inline-formula> to <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>f</mml:mi></mml:math></inline-formula> is:</p>
<p><disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mi>C</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>b</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>D</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mi>e</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mi>f</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>b</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the basic fee. This cost function requires a fair distribution of requests between users and power suppliers. The cost-benefit analysis also needs to be performed to analyze the economic feasibility of energy trading [<xref ref-type="bibr" rid="ref-19">19</xref>].</p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Blockchain-Based Power Trading Method</title>
<p>All power suppliers and users form the power transaction nodes in ADN. Newly added nodes to the network need to prepare their identity information, public key, and private key, etc. Authentication of identity information can be performed by a qualified third party. At the same time, the review and earnest money deposit will guarantee the authenticity of the identity information of the new nodes [<xref ref-type="bibr" rid="ref-20">20</xref>]. The public key and identity information of the new node will be sent to other transaction nodes, so the authenticity of the information can be verified by the public key. The private key will only be kept secret by its owner, which can testify to the authenticity of the power transaction blockchain. As other nodes cannot decrypt the private key, they cannot provide fake transactions.</p>
<p>When a transaction node joins an ADN power transaction, its identity information and public key will form the initial state of the blockchain for power transactions. The identity information and public key will be sent to other transaction nodes in the ADN for use. As the information recorded by the blockchain is immutable, it will be a security guarantee for the power transactions that follows. The electricity transaction flow based on blockchain is shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Blockchain-based power transaction flow</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_22479-fig-2.tif"/>
</fig>
<p>The key steps of power trading are as follows:
<list list-type="simple">
<list-item><label>1)</label><p>All ADN power transaction nodes monitor the blockchain data in the ADN communication network uninterruptedly. In case the power transaction request is put forward by a node, its transaction volume will be calculated via Hash algorithm and be encrypted by its private key, then it will be sent to the blockchain. The blockchain information of the transaction request will be broadcast across the ADN network to all transaction nodes.</p></list-item> 
<list-item><label>2)</label><p>Any transaction node receiving the blockchain data with the latest transaction request can then decrypt the Hash data using the public key and compare it with the received transaction demand hash. If the information matches, we could conclude that the blockchain information is real, and to same as the power transaction demand of the transaction node.</p></list-item> 
<list-item><label>3)</label><p>Following the energy request mechanism, the node will then search for an optimal power transaction plan using the particle swarm algorithm based on its power generation or power consumption. It will take this power trading request if all conditions are met. If not, it will ignore the information. Under the condition that the request is taken or the need to negotiate the price and volume arises, the transaction node will propose a new transaction plan, encrypt the blockchain data with the plan with its private key and broadcast it across the network.</p></list-item> 
<list-item><label>4)</label><p>The supply and demand parties who have reached the consensus on the power transaction will record the whole process in blockchain [<xref ref-type="bibr" rid="ref-21">21</xref>].</p></list-item>
</list></p>
<sec id="s3_1">
<label>3.1</label>
<title>Energy Request Mechanism</title>
<p>In the transaction process, the energy request is randomly made by the transaction node. If the transaction node can meet its requirements, it can be regarded as self-sufficient [<xref ref-type="bibr" rid="ref-22">22</xref>]. If the current energy of the node cannot meet the demand, the transaction node will request additional energy from the ADN. The energy request mechanism includes cost perception request and storage perception request, the flow of which is shown in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>The execution flow of the energy request mechanism</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_22479-fig-3.tif"/>
</fig>
<sec id="s3_1_1">
<label>3.1.1</label>
<title>Cost Perception Request</title>
<p>In the cost perception request plan, the transaction node is allowed to request energy supply from the nearest available transaction node in the network. It will attempt to increase the energy generated by its storage unit and use its internal storage to respond to the energy request (<inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>R</mml:mi></mml:math></inline-formula>). If it fails, the current storage will be exhausted, and the energy supply will be obtained from the neighboring transaction nodes. The flow of the cost perception request algorithm is shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Flow of cost perception request</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_22479-fig-4.tif"/>
</fig>
<p>The cost perception algorithm will go through the nearest transaction nodes in the ADN to provide energy to the requester. And detailed information of the transaction node provided with energy storage <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> will be collected. If the request can be met by <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, W takes the value <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mi>R</mml:mi></mml:math></inline-formula>. Otherwise, the available energy on the transaction node will be exhausted, so <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mrow><mml:mi>N</mml:mi><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:mo>[</mml:mo> <mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow> <mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo> <mml:mn>1</mml:mn> <mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> take the value. The request is placed on the task waiting list for the selection of other transaction nodes in the ADN.</p>
</sec>
<sec id="s3_1_2">
<label>3.1.2</label>
<title>Storage Perception Request</title>
<p>Similar to the case <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mi>R</mml:mi></mml:math></inline-formula> where the user stores the generated energy and satisfies the energy request through its storage, the storage perception request scheme ensures that the energy request is sent to the transaction node near its storage and locates the storage unit with sufficient storage energy in the ADN [<xref ref-type="bibr" rid="ref-23">23</xref>]. In addition, the request is placed on the task waiting list for other transaction nodes to verify. The flow of the storage perception request algorithm is shown in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Flow of the storage perception request algorithm</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_22479-fig-5.tif"/>
</fig>
</sec>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Power Transaction Scheme Optimization Based on Particle Swarm Algorithm</title>
<p>The blockchain technology solves the security problem of power transactions, shortens the time of authentication of the original trading platform, and improves the transaction efficiency [<xref ref-type="bibr" rid="ref-24">24</xref>]. Based on the blockchain technology, the power trading scheme uses the particle swarm algorithm for multi-objective optimization to optimize the power transaction, and introduces the power price formulation mode and power purchase strategy to the intelligent contract [<xref ref-type="bibr" rid="ref-25">25</xref>].</p>
<p>For the power supplier in the trading chain, under the constraints of price and transaction priority, multiple options for selling electricity in intelligent contracts are used to achieve the best benefit, and guarantee the transaction security at the same time. Because the spot trading is still in its infancy, big users&#x2019; direct power purchase is the main concern. The power supply focuses on making attractive power sales schemes to increase the power purchase of big users, thus improve the market competitiveness&#x00A0;[<xref ref-type="bibr" rid="ref-26">26</xref>].</p>
<p>Specific to the two energy request mechanisms of cost-perception request and storage perception request, particle swarm optimization algorithm is selected for the optimal power transaction scheme search [<xref ref-type="bibr" rid="ref-15">15</xref>]. By using particle swarm optimization mathematical modeling, process optimization, and generation of particle non-inferior solution set, it is applied to the power trading market, and generates the optimal real-time power trading scheme under the constraints of all parties to meet the minimum cost. Particle swarm optimization is the whole step of generating a non-inferior solution, which includes the initial screening of the non-inferior solution and updating of the non-inferior solution set. When the particle swarm is not updated, a random particle from the non-inferior solution set is selected as the optimal solution of the swarm. The particle update process is shown as:<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:msup><mml:mi>v</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03C9;</mml:mi><mml:msup><mml:mi>v</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mi>v</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>In the equation, <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mi>v</mml:mi></mml:math></inline-formula> is the particle velocity; <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mi>k</mml:mi></mml:math></inline-formula> is the current number of iterations; <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mi>&#x03C9;</mml:mi></mml:math></inline-formula> is the inertial weight; <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> is a constant value; <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> is a random number with the value of 0 and 1; <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is the individual or global optimal particle position, respectively; <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mi>x</mml:mi></mml:math></inline-formula> is the particle position.</p>
<p>Through the particle swarm multi-objective search algorithm, the power transaction scheme is optimized in the real-time power price transaction process of the power transaction node. Five types of power suppliers (thermal, photovoltaic, hydropower, wind, nuclear) are assumed to participate in transaction competition for the user power purchase, and their power transaction volume, on-grid price, and transmission costs are different. We use particle swarm optimization to model this transaction process and carry out the multi-objective search. Among them, the on-grid price of the power stations is <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula>; the power transaction volume is <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mi>E</mml:mi></mml:math></inline-formula>; the power transmission and power distribution mean value is <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mover><mml:mi>&#x03C8;</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover></mml:math></inline-formula>. Then the optimization objective function is:</p>
<p><disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:munderover><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mi>m</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:munderover><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mi>m</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>In the equation, <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the on-grid price and the power transaction volume of the final transacted power plant; <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mi>m</mml:mi></mml:math></inline-formula> is the selected power plant.</p>
<p>The associated constraint is:</p>
<p><disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mfrac><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:munderover><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mover><mml:mi>&#x03C8;</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:munderover><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>&#x2264;</mml:mo><mml:mn>0.5</mml:mn><mml:mspace width="thinmathspace" /><mml:mfrac><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:munderover><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mover><mml:mi>&#x03C8;</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:munderover><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>&#x2264;</mml:mo><mml:mn>0.5</mml:mn></mml:math></disp-formula></p>
<p>In the inequality, <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:msub><mml:mover><mml:mi>&#x03C8;</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the total cost of power transmission and distribution.</p>
<p>To simulate the randomness of the power trading market to the greatest extent, the particle swarm algorithm is modified. Specifically, the lowest cost is not to select the scheme with the lowest power for each purchaser, but to select the optimal power volume and power price combination scheme based on the overall transaction, so as to increase the power utilization rate of renewable energy source power plants and reduce the reliability of fossil fuel power plants. In the market constraint, the optimized particle swarm optimization algorithm is integrated into the intelligent contract and operated by the criteria of user purchase demand and low power price, so as to ensure the openness, transparency, and intelligence of the optimal power transaction scheme.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experimental Results and Analysis</title>
<p>In the experiment, an ADN power transaction platform based on block-chain is built, which includes six suppliers and five users. The suppliers include the large power grid, two photovoltaic power plants, and three wind power plants. Considering the actual power supply state of the existing ADN, the large power grid is the dominating power supply, and the photovoltaic and wind power these distributed power supplies are auxiliary. Because of the volatility and randomness of distributed power, ADN power transactions should be short-term, which can promote distributed energy to be integrated into the ADN in real-time and increase its utilization rate.</p>
<p>All transaction participants are connected to an Ethernet communication bus to exchange power transaction information based on block-chain. Each node has the same transaction opportunities and does not need to rely on third parties to carry out power transactions. Users with intelligent meters and the corresponding power control system, can control their power demand in real-time. Photovoltaic and wind these distributed power sources are equipped with a corresponding number of power storage devices and power control systems, so they have a certain power generation prediction ability.</p>
<sec id="s4_1">
<label>4.1</label>
<title>Power Transaction Analysis</title>
<p>Taking the power supply and demand of ADN within 24 h as an example, this paper analyzes the power transaction status based on block-chain. According to the experimental scenario, the power quantity of the traditional fossil fuel power plant is set to 250 MW. The new energy power plants which have great randomness and volatility due to the influence of the natural environment, are used as a supplement to the power supply. Between 0:00 and 6:00 a.m., photovoltaic and wind power plants are affected by the environment and generate limited electricity. Therefore, there are fewer new energy suppliers involved in the power transaction. After 7:00 a.m., users&#x2019; power consumption gradually rises and the demand for power increases, but the increase in new energy generation lags behind the user demand. Therefore, the power transaction market is in the seller&#x2019;s market, and the power price is high; new energy power providers can sell electricity at a relatively high price through block-chain announcements. The daily changes of power generation and transaction price are shown in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Power quantity transaction analysis</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_22479-fig-6.tif"/>
</fig>
<p>As can be seen from <xref ref-type="fig" rid="fig-6">Fig. 6</xref>, the output of the new energy supply is relatively random. About 9:00 a.m., its output is more and the power generation reaches a short-term peak. And the power supply and demand state is constantly displayed in the ADN power transaction based on block-chain. In this way, the new energy supplier can adjust its power sale price in real-time, improve the transaction rate, and reduce the amount of abandoned wind and light. With the normalization of new energy generation, the price of power transactions tends to stabilize. In addition, around 1:00 and 5:00 p.m., the power generated by new energies increases, and through the block-chain transaction process, the new energy power price reduces, resulting in the power transactions. Because the block-chain-based power transactions can be completed in a very short, new energy suppliers and users almost close the deal at the same time.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Balanced Behavior</title>
<p>Although the impact of balance constraints on power transactions in ADN is secondary, it is critical from the user&#x2019;s point of view. Both cost and storage are the key factors should be considered. The purchasing capacity cannot exceed the maximum storage capacity except the real-time supply load. Therefore, cost and storage need to achieve a balanced state to maximize the benefits of users. The energy balance change of transaction nodes in which cost perception and storage perception algorithms participate are shown in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Income balance change of participating transaction node (a) The node benefit distribution of cost perception request/%; (b) The node benefit distribution of storage perception request/%</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_22479-fig-7.tif"/>
</fig>
<p>As can be seen from <xref ref-type="fig" rid="fig-7">Fig. 7a</xref>, the available storage and income of transaction nodes in the network do not depend on the initial storage of transaction nodes. In addition, the cost perception algorithm allows the transaction node to buy electricity fairly for the user. Therefore, during any exchange period, transaction nodes will not incur high costs due to transmission. As can be seen in <xref ref-type="fig" rid="fig-7">Fig. 7b</xref>, significant equilibrium differences can be observed for transaction node 3. Because node 3 has a certain amount of energy storage, it has advantages in network transactions, which leads to differences in the distribution of income among transaction nodes.</p>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Comparative Analysis</title>
<sec id="s4_3_1">
<label>4.3.1</label>
<title>Transaction Delay Analysis</title>
<p>To demonstrate the advantages of the proposed method in terms of transaction delay, a comparative analysis of methods in literature Rui&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-6">6</xref>], Luo&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-8">8</xref>], and Li&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-13">13</xref>] is conducted, and the results are shown in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>. Among them, Rui&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-6">6</xref>], Luo&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-8">8</xref>] and Li&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-13">13</xref>] respectively adopt Nash equilibrium algorithm, double-layer blockchain technology and heterogeneous blockchain technology to realize reliable transactions, and the transaction time includes the final transaction contract reached by the transaction node in the system and the average calculation time to complete task negotiation.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Comparison of average delay of transactions</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_22479-fig-8.tif"/>
</fig>
<p>As can be seen from <xref ref-type="fig" rid="fig-7">Fig. 7</xref>, with the increase of power transaction participants, the delay time is also increasing. Because the participant increase produces more power transaction tasks, more power transaction contracts will be reached accordingly, and the average delay will also increase accordingly. However, compared with other methods, the average transaction delay time of the proposed method is the shortest. Rui&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-6">6</xref>] proposed a Nash bargaining method of multi-micron power transaction, taking the minimum transaction operating cost as the optimization goal, and designs the cooperative game model of multi-micron bargaining. Because the calculation process of the Nash equilibrium algorithm is complicated, it takes a long time. Luo&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-8">8</xref>] proposed a double-layer distributed power transaction system with power-sharing and combines the block-chain to realize the transaction settlement. However, the double-layer trading mode increases the communication complexity of the system, so the data has a certain communication delay. As the amount of data increases, transaction delays grow faster. Li&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-13">13</xref>] designed a multi-energy systems transaction system based on heterogeneous block-chain technology to solve the data security problem in joint transactions. This method takes into account the problems of various participants. However, the heterogeneous block-chain technology is complicated, and computational delay is large. Thus, the overall transaction delay is not ideal. The proposed method uses the block-chain technology to shorten the delay time of centralized transaction mode and the particle swarm algorithm for quick optimization. Therefore, the transaction delay is short; when the number of participants is not more than 10, the transaction delay time is about 0.2 s.</p>
</sec>
<sec id="s4_3_2">
<label>4.3.2</label>
<title>Economic Analysis of Power Transaction</title>
<p>The purpose of the power plant and user in power transaction is to achieve maximum economic benefit with one party buying the most electricity at the least cost and the other party selling the largest electricity. Taking into account the interests of both power transaction side, the obtained transaction volume in the ADN by using the proposed method and methods in [<xref ref-type="bibr" rid="ref-6">6</xref>,<xref ref-type="bibr" rid="ref-8">8</xref>,<xref ref-type="bibr" rid="ref-13">13</xref>] are shown in <xref ref-type="fig" rid="fig-9">Fig. 9</xref>.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>SDN turnover comparison</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_22479-fig-9.tif"/>
</fig>
<p>As can be seen from <xref ref-type="fig" rid="fig-9">Fig. 9</xref>, compared with other methods, the turnover of the proposed method is the least, fluctuating around 200,000 yuan. According to the analysis of <xref ref-type="fig" rid="fig-6">Fig. 6</xref>, the transaction price decreases with the increase of new energy supply, which urges users to use new energy to generate electricity more. Viewing the ADN as a whole, based on the transaction price fluctuation, the particle swarm algorithm is used to find the optimal transaction scheme, which further reduces the user&#x2019;s power purchasing cost and increases the power sales of new energy power plants to realize the win-win situation. Literature [<xref ref-type="bibr" rid="ref-6">6</xref>] used the Nash bargaining method to optimize the operating cost, but does not considers the electricity price fluctuation, so the overall turnover is the largest. Although the double layer distributed power transaction mode of power-sharing used in [<xref ref-type="bibr" rid="ref-8">8</xref>] can reduce the power purchase cost to a certain extent, it lacks the corresponding algorithm optimization, so the economic performance needs to be improved. Li&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-13">13</xref>] based on heterogeneous block-chain technology, achieves multi-energy system transactions, comprehensively considers multi-energy coordination optimization, and can make full use of new energy power supply. Around 10:00 a.m., the turnover is lower than the proposed method. But the optimization goal is single. Without a comprehensive analysis of the influencing factors, its economic performance still has room for improvement.</p>
</sec>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusions</title>
<p>In recent years, blockchain technology has developed rapidly, and its application in the field of power trading has good prospects. Because there is little research on the application of block-chain to the specific implementation in power transactions, an ADN power transaction method based on block-chain is proposed. Based on the characteristics of block-chain decentralization, the block-chain structure of ADN power transactions is designed. Based on this, the power request mechanism is proposed, including storage perception request and cost perception request, and multi-objective optimal search is carried out by particle swarm optimization algorithm to research for the optimal power transaction scheme, and minimize users&#x2019; power purchase cost while maximizes the power sales volume of power suppliers. In addition, based on the experimental platform, the experimental demonstration of the proposed method shows that the increase of new energy output will lead to the decrease of electricity price, thus reducing users&#x2019; power purchase cost and reducing the amount of abandoned light and wind. Meanwhile, compared with other methods, the transaction delay of the proposed method is the smallest, about 0.2 s, the economic value is the best, and the overall transaction volume of the system is the smallest. It provides a reference for further exploring the application of block-chain technology in the power trading market.</p>
<p>Because the proposed method only uses the particle swarm algorithm for optimization and does not involve the bidding of transaction participants, the game mechanism of electricity price trading under block-chain architecture is lacking, which is also the focus of future research.</p>
</sec>
</body>
<back>
<ack>
<p>The authors would like to thank the editor and anonymous reviewers for their valuable comments.</p>
</ack>
<sec><title>Funding Statement</title>
<p>This work was supported by the Postdoctoral Research Funding Program of <funding-source>Jiangsu Province</funding-source> under Grant <award-id>2021K622C</award-id>.</p>
</sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>1.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Huang</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Wen</surname>, <given-names>K. Z.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>X.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Power trading method based on consortium blockchain under ubiquitous power internet of things</article-title>. <source>Power System Protection and Control</source><italic>,</italic> <volume>48</volume><italic>(</italic><issue>3</issue><italic>),</italic> <fpage>22</fpage>&#x2013;<lpage>28</lpage>.</mixed-citation></ref>
<ref id="ref-2"><label>2.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lin</surname>, <given-names>X. N.</given-names></string-name>, <string-name><surname>Ma</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>Z. X.</given-names></string-name>, <string-name><surname>Sui</surname>, <given-names>Q.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>Z. T.</given-names></string-name></person-group> (<year>2021</year>). <article-title>A novel current amplitude differential protection for active distribution network considering the source-effect of IM-type unmeasurable load branches</article-title>. <source>International Journal of Electrical Power &#x0026; Energy Systems</source><italic>,</italic> <volume>129</volume><italic>,</italic> <fpage>1</fpage>&#x2013;<lpage>13</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.ijepes.2021.106780</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>3.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Capitanescu</surname>, <given-names>F.</given-names></string-name></person-group> (<year>2018</year>). <article-title>TSO-DSO interaction: Active distribution network power chart for TSO ancillary services provision</article-title>. <source>Electric Power Systems Research</source><italic>,</italic> <volume>163</volume><italic>(</italic><issue>5</issue><italic>),</italic> <fpage>226</fpage>&#x2013;<lpage>230</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.epsr.2018.06.009</pub-id>.</mixed-citation></ref>
<ref id="ref-4"><label>4.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Zhou</surname>, <given-names>N. C.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>Q. G.</given-names></string-name></person-group> (<year>2018</year>). <article-title>Electricity direct transaction mode and strategy in microgrid based on blockchain and continuous double auction</article-title>. <source>Proceedings of the CSEE</source><italic>,</italic> <volume>38</volume><italic>(</italic><issue>17</issue><italic>),</italic> <fpage>5072</fpage>&#x2013;<lpage>5084</lpage>.</mixed-citation></ref>
<ref id="ref-5"><label>5.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xie</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>S. N.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>Y. H.</given-names></string-name>, <string-name><surname>Cai</surname>, <given-names>Y. J.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2020</year>). <article-title>Application and prospect of blockchain technology in electricity trading</article-title>. <source>Automation of Electric Power Systems</source><italic>,</italic> <volume>44</volume><italic>(</italic><issue>19</issue><italic>),</italic> <fpage>19</fpage>&#x2013;<lpage>28</lpage>.</mixed-citation></ref>
<ref id="ref-6"><label>6.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Rui</surname>, <given-names>T.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>G. L.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>Q. J.</given-names></string-name>, <string-name><surname>Hu</surname>, <given-names>C. G.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>J.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2018</year>). <article-title>Nash bargaining method for multi-microgrid energy trading in distribution network</article-title>. <source>Power System Technology</source><italic>,</italic> <volume>43</volume><italic>(</italic><issue>7</issue><italic>),</italic> <fpage>2576</fpage>&#x2013;<lpage>2583</lpage>.</mixed-citation></ref>
<ref id="ref-7"><label>7.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hayes</surname>, <given-names>B. P.</given-names></string-name>, <string-name><surname>Thakur</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Breslin</surname>, <given-names>J. G.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Co-simulation of electricity distribution networks and peer to peer energy trading platforms</article-title>. <source>International Journal of Electrical Power &#x0026; Energy Systems</source><italic>,</italic> <volume>115</volume><italic>(</italic><issue>2</issue><italic>),</italic> <fpage>1</fpage>&#x2013;<lpage>10</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.ijepes.2019.105419</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>8.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Luo</surname>, <given-names>F. J.</given-names></string-name>, <string-name><surname>Dong</surname>, <given-names>Z. Y.</given-names></string-name>, <string-name><surname>Liang</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Murata</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Xu</surname>, <given-names>Z.</given-names></string-name></person-group> (<year>2017</year>). <article-title>A distributed electricity trading system in active distribution networks based on multi-agent coalition and blockchain</article-title>. <source>IEEE Transactions on Power Systems</source><italic>,</italic> <volume>34</volume><italic>(</italic><issue>3</issue><italic>),</italic> <fpage>4097</fpage>&#x2013;<lpage>4108</lpage>. DOI <pub-id pub-id-type="doi">10.1109/TPWRS.2018.2876612</pub-id>.</mixed-citation></ref>
<ref id="ref-9"><label>9.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhong</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Xie</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Xie</surname>, <given-names>S. L.</given-names></string-name></person-group> (<year>2019</year>). <article-title>Topology-aware vehicle-to-grid energy trading for active distribution systems</article-title>. <source>IEEE Transactions on Smart Grid</source><italic>,</italic> <volume>10</volume><italic>(</italic><issue>2</issue><italic>),</italic> <fpage>2137</fpage>&#x2013;<lpage>2147</lpage>. DOI <pub-id pub-id-type="doi">10.1109/TSG.2018.2789940</pub-id>.</mixed-citation></ref>
<ref id="ref-10"><label>10.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Che</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Zhao</surname>, <given-names>J. J.</given-names></string-name>, <string-name><surname>Qiang</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Ma</surname>, <given-names>Y.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2019</year>). <article-title>A distributed energy trading authentication mechanism based on a consortium blockchain</article-title>. <source>Energies</source><italic>,</italic> <volume>12</volume><italic>(</italic><issue>15</issue><italic>),</italic> <fpage>2878</fpage>.</mixed-citation></ref>
<ref id="ref-11"><label>11.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>He</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Luo</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>Q.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>M. X.</given-names></string-name>, <string-name><surname>He</surname>, <given-names>H. Q.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2020</year>). <article-title>Joint operation mechanism of distributed photovoltaic power generation market and carbon market based on cross-chain trading technology</article-title>. <source>IEEE Access</source><italic>,</italic> <volume>8</volume><italic>(</italic><issue>2</issue><italic>),</italic> <fpage>66116</fpage>&#x2013;<lpage>66130</lpage>. DOI <pub-id pub-id-type="doi">10.1109/ACCESS.2020.2985577</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>12.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chaudhary</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Jindal</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Aujla</surname>, <given-names>G. S.</given-names></string-name>, <string-name><surname>Aggarwal</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Kumar</surname>, <given-names>N.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2019</year>). <article-title>BEST: Blockchain-based secure energy trading in SDN-enabled intelligent transportation system</article-title>. <source>Computers &#x0026; Security</source><italic>,</italic> <volume>85</volume><italic>(</italic><issue>8</issue><italic>),</italic> <fpage>288</fpage>&#x2013;<lpage>299</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.cose.2019.05.006</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>13.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Cao</surname>, <given-names>W. Z.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2018</year>). <article-title>Transaction system and key technologies of multi-energy system based on heterogeneous blockchain</article-title>. <source>Automation of Electric Power Systems</source><italic>,</italic> <volume>42</volume><italic>(</italic><issue>4</issue><italic>),</italic> <fpage>183</fpage>&#x2013;<lpage>193</lpage>.</mixed-citation></ref>
<ref id="ref-14"><label>14.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yan</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Huang</surname>, <given-names>H. B.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>S. F.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Distributed authentication scheme for industry internet platform application based on consortium blockchain</article-title>. <source>Journal of Physics</source><italic>,</italic> <volume>1856</volume><italic>(</italic><issue>1</issue><italic>),</italic> <fpage>1</fpage>&#x2013;<lpage>7</lpage>. DOI <pub-id pub-id-type="doi">10.1088/1742-6596/1856/1/012032</pub-id>.</mixed-citation></ref>
<ref id="ref-15"><label>15.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Makhloufi</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Mekhilef</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Logarithmic PSO based global/local maximum power point tracker for partially shaded photovoltaic systems</article-title>. <source>IEEE Journal of Emerging and Selected Topics in Power Electronics</source><italic>,</italic> <volume>10</volume><italic>(</italic><issue>1</issue><italic>),</italic> <fpage>375</fpage>&#x2013;<lpage>386</lpage>.</mixed-citation></ref>
<ref id="ref-16"><label>16.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gong</surname>, <given-names>G. J.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>H. J.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>T.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>Z. M.</given-names></string-name>, <string-name><surname>Wei</surname>, <given-names>P. F.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2019</year>). <article-title>Research on intelligent trading and cooperative scheduling system of energy internet based on blockchain</article-title>. <source>Proceedings of the CSEE</source><italic>,</italic> <volume>39</volume><italic>(</italic><issue>5</issue><italic>),</italic> <fpage>1278</fpage>&#x2013;<lpage>1290</lpage>.</mixed-citation></ref>
<ref id="ref-17"><label>17.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Qaeini</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Nazar</surname>, <given-names>M. S.</given-names></string-name>, <string-name><surname>Yousefian</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Heidari</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Shafie-khahet</surname>, <given-names>M.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2019</year>). <article-title>Optimal expansion planning of active distribution system considering coordinated bidding of downward active microgrids and demand response providers</article-title>. <source>IET Renewable Power Generation</source><italic>,</italic> <volume>13</volume><italic>(</italic><issue>8</issue><italic>),</italic> <fpage>1291</fpage>&#x2013;<lpage>1303</lpage>. DOI <pub-id pub-id-type="doi">10.1049/iet-rpg.2018.6006</pub-id>.</mixed-citation></ref>
<ref id="ref-18"><label>18.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mao</surname>, <given-names>T. A.</given-names></string-name>, <string-name><surname>Zhou</surname>, <given-names>Y. Q.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Su</surname>, <given-names>Y. X.</given-names></string-name>, <string-name><surname>Duan</surname>, <given-names>B.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2021</year>). <article-title>Fair-efficient energy trading for microgrid cluster in an active distribution network</article-title>. <source>Sustainable Energy, Grids and Networks</source><italic>,</italic> <volume>26</volume><italic>,</italic> <fpage>1</fpage>&#x2013;<lpage>9</lpage>.</mixed-citation></ref>
<ref id="ref-19"><label>19.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xiao</surname>, <given-names>Q.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Zhu</surname>, <given-names>Z. Y.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>X. L.</given-names></string-name>, <string-name><surname>Kuang</surname>, <given-names>Y.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2020</year>). <article-title>Discussion on decentralized electricity market for distributed generation transactions</article-title>. <source>Automation of Electric Power Systems</source><italic>,</italic> <volume>44</volume><italic>(</italic><issue>1</issue><italic>),</italic> <fpage>208</fpage>&#x2013;<lpage>218</lpage>.</mixed-citation></ref>
<ref id="ref-20"><label>20.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Fan</surname>, <given-names>X. W.</given-names></string-name>, <string-name><surname>Cai</surname>, <given-names>Z. Y.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>B.</given-names></string-name></person-group> (<year>2018</year>). <article-title>Optimal active power dispatching of microgrid and distribution network based on model predictive control</article-title>. <source>Tsinghua Science and Technology</source><italic>,</italic> <volume>23</volume><italic>(</italic><issue>3</issue><italic>),</italic> <fpage>266</fpage>&#x2013;<lpage>276</lpage>. DOI <pub-id pub-id-type="doi">10.26599/TST.2018.9010083</pub-id>.</mixed-citation></ref>
<ref id="ref-21"><label>21.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ping</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Yan</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>S. J.</given-names></string-name>, <string-name><surname>Shen</surname>, <given-names>Z. Y.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2019</year>). <article-title>Credit risk management in distributed energy resource transactions based on blockchain</article-title>. <source>Proceedings of the CSEE</source><italic>,</italic> <volume>39</volume><italic>(</italic><issue>24</issue><italic>),</italic> <fpage>7137</fpage>&#x2013;<lpage>7145</lpage><comment>&#x002B;7487</comment>.</mixed-citation></ref>
<ref id="ref-22"><label>22.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gong</surname>, <given-names>G. J.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>H. J.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>T.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>Z.</given-names></string-name></person-group> (<year>2018</year>). <article-title>Research on electricity market about spot trading based on blockchain</article-title>. <source>Proceedings of the CSEE</source><italic>,</italic> <volume>38</volume><italic>(</italic><issue>23</issue><italic>),</italic> <fpage>6955</fpage>&#x2013;<lpage>6966</lpage>.</mixed-citation></ref>
<ref id="ref-23"><label>23.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Quijano</surname>, <given-names>D. A.</given-names></string-name>, <string-name><surname>Padilha-Feltrin</surname>, <given-names>A.</given-names></string-name></person-group> (<year>2019</year>). <article-title>Optimal integration of distributed generation and conservation voltage reduction in active distribution networks</article-title>. <source>International Journal of Electrical Power &#x0026; Energy Systems</source><italic>,</italic> <volume>113</volume><italic>(</italic><issue>12</issue><italic>),</italic> <fpage>197</fpage>&#x2013;<lpage>207</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.ijepes.2019.05.039</pub-id>.</mixed-citation></ref>
<ref id="ref-24"><label>24.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>She</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Gu</surname>, <given-names>Z. H.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>X. Y.</given-names></string-name>, <string-name><surname>Tian</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>J. S.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2019</year>). <article-title>A model of multi-energy complementation and safety transaction on heterogeneous energy blockchain</article-title>. <source>Power System Technology</source><italic>,</italic> <volume>43</volume><italic>(</italic><issue>9</issue><italic>),</italic> <fpage>3193</fpage>&#x2013;<lpage>3201</lpage>.</mixed-citation></ref>
<ref id="ref-25"><label>25.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Usman</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Coppo</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Bignucolo</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Turri</surname>, <given-names>R.</given-names></string-name></person-group> (<year>2018</year>). <article-title>Losses management strategies in active distribution networks: A review</article-title>. <source>Electric Power Systems Research</source><italic>,</italic> <volume>163</volume><italic>(</italic><issue>10</issue><italic>),</italic> <fpage>116</fpage>&#x2013;<lpage>132</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.epsr.2018.06.005</pub-id>.</mixed-citation></ref>
<ref id="ref-26"><label>26.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Huang</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Ge</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Hua</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2018</year>). <article-title>Day-ahead and real-time optimal scheduling for active distribution network based on probabilistic power flow</article-title>. <source>Automation of Electric Power Systems</source><italic>,</italic> <volume>42</volume><italic>(</italic><issue>12</issue><italic>),</italic> <fpage>51</fpage>&#x2013;<lpage>57</lpage><comment>&#x002B;105</comment>.</mixed-citation></ref>
</ref-list>
</back>
</article>