# A Blockchain-Based Microgrid Data Disaster Backup Scheme in Edge Computing

Authors: Lihua Zhang; Yu Cao; Ganzhe Zhang; Yang Huang; Chen Zheng
Journal: Security and Communication Networks
 (2021)

---

## Abstract

In view of the problems of low security, poor reliability, inability to backup automatically, and overreliance on the third party in traditional microgrid data disaster backup schemes based on cloud backup, the edge computing is used to preprocess power big data, and a microgrid data disaster backup scheme based on blockchain in edge computing environment is proposed in this paper. First, the honey encryption (HE) technology and advanced encryption standard (AES) are combined to propose a new encryption algorithm HE-AES, which is used to encrypt the preprocessed data. Second, the Kademlia algorithm is embedded in the edge server to realize the distributed storage and automatic recovery of microgrid data. Finally, the traditional proof of authority (PoA) consensus mechanism is improved partially, and the improved PoA is used to make each node reach consensus and pack blocks on the chain. The scheme can not only realize the data disaster backup automatically but also has high efficiency of data processing, which can provide a new idea for improving the current data disaster backup schemes.


---

## Body

## 1. Introduction

It is an important development direction of the world energy technology to promote the proportion of distributed energy system in the energy system and to improve the permeability of new energy with the maturation and perfection of distributed clean energy resources related technology equipment [1]. With the development of the microgrid in recent years, a large number of power data was produced. These power data have a great scientific research value and are of great significance for the optimization of microgrid. However, in the face of natural disasters or disasters caused by improper human operation, it will cause data loss and affect the safe and stable operation of microgrid [2]. Therefore, how to guarantee the safe and reliable disaster backup of microgrid data is difficult.A large number of temporary data can be processed by edge computing at the edge, and its server is closer to the data source, which can become a feasible choice to process the big data of microgrid [3]. However, the massive data are stored in the local edge intelligent terminal with the introduction of edge computing, which will bring serious security risks [4].Blockchain technology has been one of the research hotspots of experts and scholars in recent years due to its characteristics of decentralization, anonymity, data transparency, and traceability [5]. However, the further development of blockchain is restricted because of its limited storage capacity [6].Therefore, combining edge computing with blockchain, the edge computing is used to process big data of microgrid and reduce data scale, and the blockchain technology is used to ensure the security of edge computing equipment. A blockchain-based microgrid data disaster backup scheme is proposed in edge computing environment, which can solve the problem that data loss is difficult to recover and realize distributed data storage and automatic disaster backup. Compared with other traditional disaster backup schemes, the characteristics of this scheme are as follows.(1)
A new HE-AES algorithm is used to encrypt data, which can not only enhance the security of data but also resist violent attacks [7].(2)
The Kademlia algorithm is used to realize distributed storage and disaster backup of data automatically [8], which can greatly improve the routing query speed compared with other distributed technologies [9].(3)
The PoA is adopted on the blockchain to enable each node to reach consensus and pack the blocks to improve transaction efficiency [10].(4)
In order to solve the problem that the node information of traditional PoA is easy to be disclosed after multiple rounds of consensus and cannot adapt to Byzantine fault tolerance (BFT) [11], the following three improvements are made to PoA:(a)
The verifiable random function (VRF) is used to introduce committee-endorsing mechanism to improve the selection process of authorized nodes [12],(b)
The PageRank algorithm and Pareto distribution are used to improve the selection process of leader node [13],(c)
The HotStuff is used to reach the framework of finality, which is integrated into the PoA so as to introduce the block finality mechanism to ensure the absolute security of the block [14].The contributions of this paper are as follows.(1)
Some typical application schemes of blockchain technology, edge computing, and traditional data disaster backup are traced back, and their technical characteristics and shortcomings are analyzed.(2)
Combining HE technology with AES, a new HE-AES encryption algorithm is proposed. Compared with traditional encryption algorithms, it can not only greatly improve the encryption and decryption speed but also resist violent cracking of the adversary.(3)
The Kademlia algorithm is embedded in the edge server. In the edge computing environment, a microgrid data disaster backup scheme based on blockchain is designed, which can realize the distributed storage and the disaster backup of data automatically.(4)
The traditional PoA is improved to a certain extent, which can solve the problem that the node information is easy to be disclosed after multiple rounds of consensus and cannot adapt to BFT.(5)
The security analysis can show that the scheme is safe and reliable.(6)
The performance evaluation shows the reliability, efficiency, and practicability of this scheme.


## 2. Related Work

At present, most of the disaster backup schemes of data are based on a centralized technology or cloud backup. The security of these schemes depends on the third party platform. Once the third party platform is attacked, the data will be stolen or lost. There are a few of data disaster backup schemes based on blockchain technology and edge computing, so the related research mainly focuses on blockchain technology, edge computing, and their applications in data disaster backup schemes.As far as the application of blockchain technology is concerned, Liu et al. [15] proposed a security scheme based on blockchain to protect vehicle interaction in electric vehicle cloud computing and edge computing based on distributed consensus. Electric vehicles were equipped with a variety of intelligent applications in the network. At the same time, there were a lot of information and energy interactions between electric vehicles and between electric vehicles and infrastructure. The introduction of blockchain can enhance security and privacy. However, the delay was long and the connection was unstable due to the long distance between the cloud center and the vehicle. Kang et al. [16] designed a data sharing scheme based on reputation in vehicle edge network by using blockchain and smart contract. The triple subjective logic model was used to manage the reputation of vehicles accurately, which can realize accurate reputation management of high-quality data sharing among vehicles. However, the mining task was needed in the process of block generation, that was Proof of Work (PoW), which needed a lot of computing resources and energy, so it was difficult to widely promote blockchain in wireless networks. Ma et al. [17] proposed a trusted data management scheme based on blockchain in edge computing to protect sensitive data. Before the transaction payload was stored in the blockchain system, the user-defined encryption of sensitive data was designed, and the conditional access and decryption query of protected transactions were realized by using smart contract. However, it is difficult to estimate the computing overhead due to the complexity of encryption and decryption of sensitive data.As far as the application of edge computing is concerned, Guan et al. [18] proposed an energy Internet data exchange architecture considering the efficiency of edge computing and data security. The edge computing was applied to solve the challenges related to data exchange and data security at the same time. However, the model cannot reflect the actual structural characteristics of the system due to the lack of topological structure caused by complete formulation. Han and Xiao [19] proposed a nontechnical loss (NTL) detection scheme based on edge computing and big data analysis tools to solve the problem of big data NTL fraud detection in smart grid, which provided experience for the development of big data security schemes in smart grid. However, it only focused on the topological connection relationship, and the data interaction relationship was too conceptual to correspond with the actual system components. Rahman et al. [20] proposed an AI-based edge service composition model for edge networks, which was used to find AI rules of functional relationships between edge services dynamically and construct a set of possible composite service plans. In addition, based on the service selection of Skyline optimization method, an AI service composition framework based on privacy protection was proposed, which used Skyline optimization technology and encrypted data to find the best composite service. However, the default edge device was static in the edge service composition model, but in the practical application process, the mobility of edge devices in the synthesis period needed to be considered, so the practical application of the model was still difficult.With regard to the application of blockchain technology and edge computing in data disaster backup scheme, Bae and Shin [21] proposed an automatic recovery system using blockchain, assuming that the copy file was created and managed as a block successfully. If the copy was destroyed, the disaster recovery system would check the authenticity of the copy file by pointing to the blockchain and then continue to recover. However, the PoW was adopted in the system, so the transaction processing efficiency was low, which cannot meet the real application scenarios. Su et al. [22] proposed a secure content caching scheme for disaster backup of mobile social networks based on fog computing, which introduced scrambling and partitioning methods to encrypt the content, delivered and stored the encrypted content in multiple cloud servers, and developed an auction game model to select the optimal cloud server. The edge node and the selected server can achieve the largest utility. However, the plaintext was only scrambled without any encryption or hiding in this scheme, so its security needed to be improved. Lao et al. [23] proposed a disaster backup scheme of power data based on blockchain technology, which can guarantee the consistency, nontampering, and confidentiality of backup data effectively by using all or nothing transform technology and threshold secret sharing algorithm and greatly avoid the risk of single point failure and enhance scalability. However, the original data cannot be recovered when the number of fault nodes exceeded a certain number in the scheme. Liang et al. [24] proposed a secure data backup and recovery scheme in the industrial blockchain network environment, which realized the recovery code with high precision and maintainability in industrial network 4.0. In addition, a unique and relevant backup structure including data consensus and smart contract can be used for fast local code backup of adjacent data backed up in blockchain-based networks. However, the performance of data backup and recovery of multiple nodes was not high, and the real-time and security of data backup and recovery were improved at the expense of data backup rate.In summary, although the current research on data disaster backup schemes is very extensive, there are some shortcomings more or less. These problems mainly focus on centralized backup, low transaction efficiency, poor security, and so on. Therefore, in view of the inability of automatic disaster backup of data, low data processing efficiency, and poor security in microgrid, a blockchain-based microgrid data disaster backup scheme is designed in the edge computing environment. While automatic disaster backup of data is realized, the efficiency of data processing is ensured, and the security of the data processing is improved at the same time.


## 3. Scheme Framework

The scheme is mainly composed of microgrid node, registration center, edge server, and blockchain. Therefore, it can be divided into four layers, which are data layer, supervision layer, storage layer, and consensus layer. The architecture of the scheme is shown in Figure1. The main symbols used are shown in Table 1. The functions of each part are as follows.(1)
The microgrid nodes are mainly included in data layer, which are the source of data, and mainly complete the collection and upload of data.(2)
The registration center is mainly included in supervision layer, which is responsible for generating and distributing passwords and keys for microgrid nodes and edge servers during the initialization. In addition, a node ID is assigned for each edge server randomly by registration center.(3)
The edge servers are mainly included in storage layer, which are the key of the scheme. The edge server is used to clean, compress, and encrypt the data. Then, the encrypted data block is stored in the edge server. Finally, the hash summary of the encrypted data block is calculated. The hash summary and other information are uploaded to the blockchain for storage.(4)
The blockchain is mainly included in consensus layer, which is mainly responsible for receiving and storing the effective information uploaded by the edge server. When data recovery is needed, the hash summary of the encrypted data block is transmitted to the edge server.Figure 1
Scheme framework.Table 1
Description of main symbols.
NumberSymbolsDescription1IDThe identity of the edge server2kPassword3KSeed key4mThe number of other nodes contained in each K-bucket5nThe number of edge servers6MPlaintext7sSeed8RRandom string9CCiphertext10NThe number of consensus nodes11KpuPublic key12KprPrivate key13xRandom input14yRandom output15πZero-knowledge proof16typeThe type of node17roundThe consensus stage18τThe number of node winning sortition19wWeight20WTotal weight21jThe result of sortition22dDamping coefficient23aThe number of incoming links for the node24bThe number of outgoing links for the node25cThe total number of links to the node26IThe incoming link reputation of the node27QThe outgoing link reputation of the node28PBGThe block generation probability of the node29lThe size of the seed space30pmThe distribution of the message space31ηMessage space32λThe maximum message probability33pkThe distribution of the password


## 4. Scheme Design

The blockchain can be divided into public chain, consortium chain, and private chain according to its degree of decentralization [25]. When the blockchain is applied to the microgrid, each node needs to be authorized to join or exit. Otherwise, the excessively open system allows each node to join or exit freely, which will bring chaos to the system and make the management more difficult. Thus, it is more appropriate to choose consortium chain to build the system.With the development of quantum computing, both symmetric and asymmetric encryption algorithms cannot resist violent cracking, and they are no longer secure absolutely. Consequently, the HE technology is introduced in this scheme, and combining it with the AES, a new algorithm HE-AES is proposed that can resist the violent attack. The plaintext is mapped to seed space through distribution transforming encoder (DTE) to get seed by using HE technology, exclusive-or the seed and password, and symmetric encryption algorithm is used to get ciphertext [26]. When the attacker uses the wrong key to decrypt, the traditional encryption algorithm will return a string of messy codes. It is easy for the attacker to determine the key is wrong. If the HE technology is used, the attacker will obtain seemingly reasonable plaintext in order to deceive the attacker [27]. Therefore, the attacker will fall into the dead cycle of trying the key to obtain the fake message constantly, so that the plaintext cannot be recovered.


### 4.1. Initialization

Four tasks are mainly completed by the system during the initialization, which are the registration of microgrid nodes, distribution of passwords and keys, access of microgrid nodes to the edge server, and distribution of ID for the edge server. The initialization sequence diagram is shown in Figure2. The specific flow of the process is as follows:(1)
The user’s private information (ID number, mobile phone number, house number, etc.) is sent to the registration center by microgrid node.(2)
The validity of the node information is verified by registration center. If it is legal, a pair of passwordsk and a pair of seed keys K will be generated. Otherwise, an error will be returned.(3)
A passwordk and a seed key K are returned to the microgrid node by the registration center, and the user can create an account with them.(4)
The user sends the account information to the adjacent edge server and downloads the latest information from the edge server to connect the microgrid node to the edge server.(5)
The received information of microgrid node account is uploaded to the registration center by the edge sever.(6)
The information of microgrid node account is searched and verified by the registration center. If it is accurate, the ID will be assigned to the edge server. Otherwise, an error will be returned. Since the Kademlia algorithm is embedded in the edge server, the length of ID is 160 bits [28].(7)
The passwordk and seed key K that match the microgrid node and edge server ID are sent to the edge server by the registration center.Figure 2
Initialization sequence diagram.


### 4.2. Data Backup

In order to solve the problems of poor security and vulnerability to data leakage caused by traditional centralized data backup, the Kademlia algorithm is embedded in the edge server, which can realize the distributed backup of data. The hash value of 160 bits on encrypted data is taken as the key, and the encrypted data is taken as the value in the algorithm. Then, the encrypted data is backed up in the form of key-value pairs on multiple edge servers close to the ID. The Kademlia network can accommodate up to2160 nodes [29], and its backup capacity is much larger than the number of devices in the actual network. Therefore, it can meet the scalability requirements of large-scale microgrid applications [30].In the Kademlia network, only a part of encrypted data is backed up in each edge server. For the calculation of node distance, the Kademlia algorithm is realized by exclusive-or operation of two node IDs, and then, the operation result is converted into decimal, which is the distance between two nodes, such as(1)01010000⊕01010110=00000110.Converting the result of (1) to decimal is 6, which means that the distance between two nodes is 6. There are 160 layers of K-bucket list in each edge server, which can back up the node information within the range 2i,2i+1i∈0,160 of its distance. m other nodes information is backed up in each K-bucket. This backup method can make n edge servers need lgn queries at most to find the required information. The distributed backup structure in edge computing is shown in Figure 3.Figure 3
Distributed backup structure in edge computing.In the Kademlia algorithm, there are four instructions in each node as follows:(1)
PING: verification. Check whether the remote node is online.(2)
STORE: storage. Store resources in the form of key-value pairs on a node.(3)
FIND_NODE: search node. Searchm nodes near the target node.(4)
FIND_VALUE: search resources. Search the value of ID node close to the key according to the given key.When a new node joins the Kademlia network, a seed node is needed as an intermediary. The process of new node joining the network is shown in Figure4, and the specific steps are as follows.Step 1. The seed node is joined into the K-bucket of the new node to make it the seed node of the new node.Step 2. A query request FIND_NODE is sent to the seed node, which can indicate that more nodes are searched through the seed node cluster by the new node. Moreover, more other nodes are searched with similar ID to the new node quickly.Step 3. After receiving the query request from the new node, the new node is added to the K-bucket of the seed node. Then, the information of at most m other nodes closest is returned to the new node.Step 4. After receiving the response from the seed node, the received node information is added to the K-bucket of the new node.Step 5. Steps 2, 3, and 4 are repeated by the new node for other new nodes until a detailed routing table is established.Figure 4
New nodes join the network.After a series of tasks were completed during the initialization, the microgrid node joined the system and entered the data backup successfully. The pseudocode of data backup algorithm is shown in Algorithm1, and the specific process of data backup stage is as follows.(1)
The transaction data is uploaded to the edge server by microgrid node.(2)
The edge computing is used to preprocess data, remove redundant data, reduce data size, and improve data quality by edge servers.(3)
The HE-AES algorithm is used to encrypt the preprocessed data. The encryption process is shown in Figure5, and the pseudocode of encryption algorithm is shown in Algorithm 2. The specific encryption process is as follows:(a)
The plaintextM is mapped to the seed space by DTE to obtain the seed s(b)
The hash functionH and random string R are used to hash and salt the original password k to obtain the password k′(c)
The ciphertextC∗ is obtained by exclusive-or operation of the processed password k′ and seed s(d)
The AES is used to encrypt the ciphertextC∗ again to get the ciphertext C(4)
The hash value of encrypted data is calculated and the encrypted data is stored inm edge servers, whose node ID is close to its hash value.(5)
The hash value of the encrypted data, timestamp, and the information of microgrid node are uploaded to the blockchain for storage.Algorithm 1:Data backup.
(1)
Data_ID=hashEncdata(2)
Block_data←Microgrid_account, Microgrid node_address, Data_timestamp, Data_ID(3)
for each i∈0,m do(4)
Storage Node←FIND_NODEData_ID(5)
if PING Storage Node==True then(6)
STORE (Block_data,Encdata)(7)
end if(8)
Data_ID+=1(9)
end forFigure 5
HE-AES encryption process.Algorithm 2:HE-AES encryption.
(1)
s←EncodeM(2)
R←0,1n(3)
k′←HR,k(4)
C∗←k′⊕s(5)
C←EncKC∗


### 4.3. Improvement of PoA

For the storage process of data on the chain, in view of the low efficiency of data processing, easy bifurcation, and fast performance degradation of the traditional consensus mechanism used in the blockchain consensus stage, a new and efficient consensus mechanism PoA is adopted to make the nodes reach consensus in the blockchain network. The PoA mainly depends on a group of authorized nodes. For any transaction of unauthorized nodes, the authorized node will implement consensus, that is, the authorized node proposes a new block, and other verification nodes vote to verify it. When the proposed block is confirmed by at leastN/2+1 verification node, the block is finally confirmed, and the whole system reaches consensus [31]. The rotation mode is adopted by the traditional PoA, and the authorized and leader nodes are selected from the consensus nodes through the redundancy method [32]. Although this method is simple and efficient, the information of the authorized node is easy to be disclosed after multiple rounds of consensus, which will cause certain security problems and even lead to a sharp decline in the efficiency of consensus. Therefore, on the basis of the traditional PoA, the following three improvements are made to the PoA.(1)
The committee-endorsing mechanism is introduced to improve the selection process of authorized nodes. The VRF is used to select authorized nodes from consensus nodes to form a committee.(2)
PageRank algorithm and Pareto distribution are introduced to improve the selection process of leader node. PageRank algorithm and Pareto distribution are used to select the leader node from the committee.(3)
The block finality mechanism is introduced to ensure the absolute security of the block. In order to make blocks confirmed by BFT consensus, the status information of blocks in the process of reaching finality is added in each block based on HotStuff consensus framework.For the selection of authorized nodes, the committee-endorsing mechanism is introduced. The VRF is used to select authorized nodes from consensus nodes to form a committee. The committee-endorsing mechanism is a way to change the existing generation of new blocks essentially. In the process of block generation, committee members need to verify the new block proposal issued by the leader node. After verification, committee members will sign the proposal as their official endorsement. The leader node is required to collect enough endorsements from committee members and then add relevant information to the new block by the consensus algorithm. The VRF is used to ensure that committee members are selected from consensus nodes randomly. The VRF comes with a key generation algorithm, which can generate public keyKpu and private key Kpr. The private key is used to hash an input x to get a random output y; that is,(2)y=hashVRFKpr,x.In addition, its private key can also be used to construct a zero-knowledge proofπ to prove that the y is correct output; that is,(3)π=ProveVRFKpr,x.Anyone can useπ to obtain y by the following calculation:(4)y=hashProveVRFπ.The verifier holding the public keyKpu can verify whether the output y is equal to the output based on the input x of the private key.A sortition selection algorithm based on VRF is designed in this scheme. Each selection of the authorized node will not be disclosed, which can ensure the unpredictability and randomness of the authorized node. At the same time, the identity of the authorized node can be verified by the verifying sortition algorithm. By inputting the private key and related parameters, the consensus node can obtain the random hash value and the winning result of this round of VRF after calculation. The pseudocode of the sortition selection algorithm is shown in Algorithm3.Algorithm 3:Sortition selection.
(1)
hash,π←VRFKprxtyperound(2)
p←τ/W(3)
j←0(4)
whileπ/2leny∉∑q=0jBq;w,p,∑q=0j+1Bq;w,pdo(5)
j++(6)
end while(7)
returnhash,π,jAfter a node has won the sortition, the sortition message will be broadcast, and other nodes will call the verifying sortition algorithm to verify it after receiving the message. The zero-knowledge proofπ is first verified, and then, the number of selected child nodes is obtained similar to the sortition process. If the result is 0, it means that it has not been selected, so it is compared with the j broadcast by the node to verify its correctness. The pseudocode of verifying sortition algorithm is shown in Algorithm 4.Algorithm 4:Verifying sortition.
(1)
ifVerifyVRFKpuhash,π,xtyperound==0then(2)
return 0(3)
else(4)
p←τ/W(5)
j←0(6)
whileπ/2leny∉∑q=0jBq;w,p,∑q=0j+1Bq;w,pdo(7)
j++(8)
end while(9)
returnjFor the selection of leader node, the PageRank algorithm is introduced to calculate the reputation for each node in the blockchain network, and the leader node is determined according to the reputation. The PageRank algorithm originated from the Google browser calculating the ranking of web pages based on the number of outbound and inbound links [33], and its mathematical model is as follows:(5)PRA=1−dN+d∑i=1nPRBiCBi,where PRA is the link probability of web page A, PRBi is the link probability of web page Bi linked to web page A, CBi is the number of outbound links of web page Bi, N is the total number of all web pages in the network, d is the damping coefficient, d∈0,1, and the general value is 0.85.The P2P network of blockchain is similar to the network. The node is equivalent to a web page, the reputation of the node is equivalent to the link probability of the web page, and the outgoing and incoming link of each node are equivalent to the outbound and inbound link of the web page. Each node in the P2P network of the blockchain can establish up to eight outgoing links and 117 incoming links [34]. Therefore, it is appropriate to apply the PageRank algorithm to the P2P network of the blockchain to calculate the reputation for each node. However, it is unrealistic to only rely on the introduction of the PageRank algorithm to select leader node, because, in the P2P local small network of the blockchain, there may be two or more nodes with the same number of outgoing links and incoming links. Therefore, the calculated reputation of the node will be the same.In order to solve the problem, on the basis of obtaining the reputation, a block generation probability for each node is allocated by introducing the Pareto distribution in the power-law distribution in this scheme. The multiplication of the reputation and block generation probability is used as the actual reputation of each node, which can avoid the appearance of nodes with the same reputation in the local small network successfully. Both normal distribution and power-law distribution are two common data distribution patterns [35], in which one of the typical distributions of the former is the height distribution of human beings, while one of the typical distributions of the latter is the distribution of social wealth. In the P2P network of the blockchain, a small number of nodes occupy the vast majority of the computing power of the entire network, which is similar to the fact that a small number of people own the vast majority of the wealth of the society. Therefore, it is appropriate to introduce Pareto distribution to solve this problem.Before introducing Pareto distribution, the reputation of incoming links and outgoing links of each node is quantified by (6) and (7), where a is the number of incoming links of node A, b is the number of outgoing links of node A, and c is the sum of the number of links established by node A, c=a+b.(6)PRA1=acA,(7)PRA0=bcPRA.Suppose that the incoming link reputation of a node isI1,I2,…,In, outgoing link reputation is O1,O2,…,On, the former obeys the Pareto distribution of parameters γ and α, and the latter obeys the Pareto distribution of parameters γ and β. The probability distribution functions of the incoming link reputation I and the outgoing link reputation O are expressed as(8)F¯i=PI>i=iα−γ,i≥α≥γ,F¯o=PO>o=oβ−γ,o≥α≥γ.Then, the probability of node block generationPBG is expressed as(9)PBG=F¯iF¯o=ioαβ−γ.Therefore, the mathematical model for calculating the reputation of each node in the blockchain P2P network can be expressed as(10)PRA=1−dN+d∑i=1nPRBiCBiioαβ−γ.When the transaction data is stored on the chain, the reputation for each node is calculated in the current network by using (10), and the blocks are packed and organized by the node with high reputation.The absolute security guarantee is given to legal blocks by the block finality mechanism. Once a block has been finally achieved, the consensus algorithm can ensure that it cannot be modified, replaced, or removed in the ledger. Even when the system encounters extremely asynchronous network conditions, the consensus algorithm can also guarantee its security.In order to achieve finality, a block must be confirmed by BFT consensus. The HotStuff consensus mechanism is used to reach a final framework. The framework divides the BFT consensus process into three consecutive stages, and each stage requires more than 2/3 of the nodes to reach consensus. In order to integrate the framework into PoA, the state information of the block in the process of achieving finality is added to each block. When a committee member endorses a block, the member also confirms the relevant information contained in the block. Therefore, when the subsequent blockchain of a block contains more than 2/3 consensus nodes (as leader node or committee members), the block completes a stage of BFT consensus. In the process of achieving BFT, more than 2/3 nodes to respond online at the same time will not be required, but only the leader node and committee members can respond in time. Such a mechanism can reduce the service delay or temporary unavailability caused by the node’s failure to respond in time. The improved PoA consensus process is shown in Figure6, including the following four stages:(1)
Leader Selection. First, (2) and (3) are used to perform five rounds of calculation. At the same time, the sortition selection algorithm is used to select five authorized nodes to form the committee, and the verifying sortition algorithm is used to verify the result of sortition by other consensus nodes. Then, (11) is used to calculate the reputation for the authorized nodes in the current committee. The node with high reputation is selected as the leader node. Other nodes are named as validate node 1, validate node 2, validate node 3, and validate node 4, respectively.(2)
Block Proposal. The leader node packages the new transaction request, constructs a new block, signs the block data and hash, and then broadcasts the block and signature to all authorized nodes in the network.(3)
Block Acceptance. After receiving the message from the leader node, the validate node verifies the validity of the block, signs the block, and returns the signature to the leader node.(4)
Block Confirmed. The leader node can submit the block only after receiving at least 2/3 of the valid signatures of the nodes and broadcast the new block in the network finally.Figure 6
Improved PoA consensus process.


### 4.4. Data Recovery

When the microgrid node is damaged by human factors or irresistible natural factors resulting in data loss, a data recovery request can be sent to the nearest edge server by the microgrid node. The pseudocode of data recovery algorithm is shown in Algorithm5, and the recovery process is shown in Figure 7. The specific data recovery steps are as follows.Step 1. The data recovery request including account information and timestamp is sent to the nearest edge server by the microgrid node.Step 2. The data recovery request information submitted by the microgrid node is used to query the microgrid node information on the blockchain by the edge server.Step 3. The microgrid node information is verified by the blockchain. If the verification fails, an error is returned. Otherwise, Step 4 will be executed.Step 4. The hash value of the required data is searched and returned to the edge server by the blockchain.Step 5. The hash value of the data is used as the key by the edge server, and the Kademlia algorithm is used to search for the matching encrypted data automatically.Step 6. The hash value of the encrypted data is calculated and compared with the hash value returned from the blockchain by the edge server. If the two values are different, it will return the warning of data damage to the microgrid node. Otherwise, Step 7 will be executed.Step 7. The encrypted data is returned to the microgrid node.Step 8. The HE-AES algorithm is used to decrypt the data to obtain the required data by the microgrid node. The pseudocode of the HE-AES decryption algorithm is shown in Algorithm 6, and the decryption process is shown in Figure 8. The specific decryption process is as follows:(a)
The AES is used to decrypt the ciphertextC to obtain C∗(b)
The hash functionH and random string R are used to hash and salt the original password k to obtain the password k′(c)
The seeds is obtained by exclusive-or operation of the processed password k′ and ciphertext C∗(d)
The reverse sampling of DTE is used to decode the seeds to obtain plaintext MAlgorithm 5:Data recovery.
(1)
key_Data_key(2)
for each i∈0,m do(3)
Search Node←FIND_VALUEkey(4)
if PING Search Node==Truethen(5)
GETData_ID(6)
end if(7)
end for(8)
Block_data←MapData_ID(9)
find (Block_data,Encdata)(10)
ifData_ID==Block_data.Data_IDthen(11)
returnEncdata(12)
else(13)
returnWarning(14)
end ifFigure 7
Data recovery process.Algorithm 6:HE-AES decryption.
(1)
C∗←DecKC(2)
R←0,1n(3)
k′←HR,k(4)
s←k′⊕C∗(5)
M_DecodesFigure 8
HE-AES decryption process.


## 4.1. Initialization

Four tasks are mainly completed by the system during the initialization, which are the registration of microgrid nodes, distribution of passwords and keys, access of microgrid nodes to the edge server, and distribution of ID for the edge server. The initialization sequence diagram is shown in Figure2. The specific flow of the process is as follows:(1)
The user’s private information (ID number, mobile phone number, house number, etc.) is sent to the registration center by microgrid node.(2)
The validity of the node information is verified by registration center. If it is legal, a pair of passwordsk and a pair of seed keys K will be generated. Otherwise, an error will be returned.(3)
A passwordk and a seed key K are returned to the microgrid node by the registration center, and the user can create an account with them.(4)
The user sends the account information to the adjacent edge server and downloads the latest information from the edge server to connect the microgrid node to the edge server.(5)
The received information of microgrid node account is uploaded to the registration center by the edge sever.(6)
The information of microgrid node account is searched and verified by the registration center. If it is accurate, the ID will be assigned to the edge server. Otherwise, an error will be returned. Since the Kademlia algorithm is embedded in the edge server, the length of ID is 160 bits [28].(7)
The passwordk and seed key K that match the microgrid node and edge server ID are sent to the edge server by the registration center.Figure 2
Initialization sequence diagram.


## 4.2. Data Backup

In order to solve the problems of poor security and vulnerability to data leakage caused by traditional centralized data backup, the Kademlia algorithm is embedded in the edge server, which can realize the distributed backup of data. The hash value of 160 bits on encrypted data is taken as the key, and the encrypted data is taken as the value in the algorithm. Then, the encrypted data is backed up in the form of key-value pairs on multiple edge servers close to the ID. The Kademlia network can accommodate up to2160 nodes [29], and its backup capacity is much larger than the number of devices in the actual network. Therefore, it can meet the scalability requirements of large-scale microgrid applications [30].In the Kademlia network, only a part of encrypted data is backed up in each edge server. For the calculation of node distance, the Kademlia algorithm is realized by exclusive-or operation of two node IDs, and then, the operation result is converted into decimal, which is the distance between two nodes, such as(1)01010000⊕01010110=00000110.Converting the result of (1) to decimal is 6, which means that the distance between two nodes is 6. There are 160 layers of K-bucket list in each edge server, which can back up the node information within the range 2i,2i+1i∈0,160 of its distance. m other nodes information is backed up in each K-bucket. This backup method can make n edge servers need lgn queries at most to find the required information. The distributed backup structure in edge computing is shown in Figure 3.Figure 3
Distributed backup structure in edge computing.In the Kademlia algorithm, there are four instructions in each node as follows:(1)
PING: verification. Check whether the remote node is online.(2)
STORE: storage. Store resources in the form of key-value pairs on a node.(3)
FIND_NODE: search node. Searchm nodes near the target node.(4)
FIND_VALUE: search resources. Search the value of ID node close to the key according to the given key.When a new node joins the Kademlia network, a seed node is needed as an intermediary. The process of new node joining the network is shown in Figure4, and the specific steps are as follows.Step 1. The seed node is joined into the K-bucket of the new node to make it the seed node of the new node.Step 2. A query request FIND_NODE is sent to the seed node, which can indicate that more nodes are searched through the seed node cluster by the new node. Moreover, more other nodes are searched with similar ID to the new node quickly.Step 3. After receiving the query request from the new node, the new node is added to the K-bucket of the seed node. Then, the information of at most m other nodes closest is returned to the new node.Step 4. After receiving the response from the seed node, the received node information is added to the K-bucket of the new node.Step 5. Steps 2, 3, and 4 are repeated by the new node for other new nodes until a detailed routing table is established.Figure 4
New nodes join the network.After a series of tasks were completed during the initialization, the microgrid node joined the system and entered the data backup successfully. The pseudocode of data backup algorithm is shown in Algorithm1, and the specific process of data backup stage is as follows.(1)
The transaction data is uploaded to the edge server by microgrid node.(2)
The edge computing is used to preprocess data, remove redundant data, reduce data size, and improve data quality by edge servers.(3)
The HE-AES algorithm is used to encrypt the preprocessed data. The encryption process is shown in Figure5, and the pseudocode of encryption algorithm is shown in Algorithm 2. The specific encryption process is as follows:(a)
The plaintextM is mapped to the seed space by DTE to obtain the seed s(b)
The hash functionH and random string R are used to hash and salt the original password k to obtain the password k′(c)
The ciphertextC∗ is obtained by exclusive-or operation of the processed password k′ and seed s(d)
The AES is used to encrypt the ciphertextC∗ again to get the ciphertext C(4)
The hash value of encrypted data is calculated and the encrypted data is stored inm edge servers, whose node ID is close to its hash value.(5)
The hash value of the encrypted data, timestamp, and the information of microgrid node are uploaded to the blockchain for storage.Algorithm 1:Data backup.
(1)
Data_ID=hashEncdata(2)
Block_data←Microgrid_account, Microgrid node_address, Data_timestamp, Data_ID(3)
for each i∈0,m do(4)
Storage Node←FIND_NODEData_ID(5)
if PING Storage Node==True then(6)
STORE (Block_data,Encdata)(7)
end if(8)
Data_ID+=1(9)
end forFigure 5
HE-AES encryption process.Algorithm 2:HE-AES encryption.
(1)
s←EncodeM(2)
R←0,1n(3)
k′←HR,k(4)
C∗←k′⊕s(5)
C←EncKC∗


## 4.3. Improvement of PoA

For the storage process of data on the chain, in view of the low efficiency of data processing, easy bifurcation, and fast performance degradation of the traditional consensus mechanism used in the blockchain consensus stage, a new and efficient consensus mechanism PoA is adopted to make the nodes reach consensus in the blockchain network. The PoA mainly depends on a group of authorized nodes. For any transaction of unauthorized nodes, the authorized node will implement consensus, that is, the authorized node proposes a new block, and other verification nodes vote to verify it. When the proposed block is confirmed by at leastN/2+1 verification node, the block is finally confirmed, and the whole system reaches consensus [31]. The rotation mode is adopted by the traditional PoA, and the authorized and leader nodes are selected from the consensus nodes through the redundancy method [32]. Although this method is simple and efficient, the information of the authorized node is easy to be disclosed after multiple rounds of consensus, which will cause certain security problems and even lead to a sharp decline in the efficiency of consensus. Therefore, on the basis of the traditional PoA, the following three improvements are made to the PoA.(1)
The committee-endorsing mechanism is introduced to improve the selection process of authorized nodes. The VRF is used to select authorized nodes from consensus nodes to form a committee.(2)
PageRank algorithm and Pareto distribution are introduced to improve the selection process of leader node. PageRank algorithm and Pareto distribution are used to select the leader node from the committee.(3)
The block finality mechanism is introduced to ensure the absolute security of the block. In order to make blocks confirmed by BFT consensus, the status information of blocks in the process of reaching finality is added in each block based on HotStuff consensus framework.For the selection of authorized nodes, the committee-endorsing mechanism is introduced. The VRF is used to select authorized nodes from consensus nodes to form a committee. The committee-endorsing mechanism is a way to change the existing generation of new blocks essentially. In the process of block generation, committee members need to verify the new block proposal issued by the leader node. After verification, committee members will sign the proposal as their official endorsement. The leader node is required to collect enough endorsements from committee members and then add relevant information to the new block by the consensus algorithm. The VRF is used to ensure that committee members are selected from consensus nodes randomly. The VRF comes with a key generation algorithm, which can generate public keyKpu and private key Kpr. The private key is used to hash an input x to get a random output y; that is,(2)y=hashVRFKpr,x.In addition, its private key can also be used to construct a zero-knowledge proofπ to prove that the y is correct output; that is,(3)π=ProveVRFKpr,x.Anyone can useπ to obtain y by the following calculation:(4)y=hashProveVRFπ.The verifier holding the public keyKpu can verify whether the output y is equal to the output based on the input x of the private key.A sortition selection algorithm based on VRF is designed in this scheme. Each selection of the authorized node will not be disclosed, which can ensure the unpredictability and randomness of the authorized node. At the same time, the identity of the authorized node can be verified by the verifying sortition algorithm. By inputting the private key and related parameters, the consensus node can obtain the random hash value and the winning result of this round of VRF after calculation. The pseudocode of the sortition selection algorithm is shown in Algorithm3.Algorithm 3:Sortition selection.
(1)
hash,π←VRFKprxtyperound(2)
p←τ/W(3)
j←0(4)
whileπ/2leny∉∑q=0jBq;w,p,∑q=0j+1Bq;w,pdo(5)
j++(6)
end while(7)
returnhash,π,jAfter a node has won the sortition, the sortition message will be broadcast, and other nodes will call the verifying sortition algorithm to verify it after receiving the message. The zero-knowledge proofπ is first verified, and then, the number of selected child nodes is obtained similar to the sortition process. If the result is 0, it means that it has not been selected, so it is compared with the j broadcast by the node to verify its correctness. The pseudocode of verifying sortition algorithm is shown in Algorithm 4.Algorithm 4:Verifying sortition.
(1)
ifVerifyVRFKpuhash,π,xtyperound==0then(2)
return 0(3)
else(4)
p←τ/W(5)
j←0(6)
whileπ/2leny∉∑q=0jBq;w,p,∑q=0j+1Bq;w,pdo(7)
j++(8)
end while(9)
returnjFor the selection of leader node, the PageRank algorithm is introduced to calculate the reputation for each node in the blockchain network, and the leader node is determined according to the reputation. The PageRank algorithm originated from the Google browser calculating the ranking of web pages based on the number of outbound and inbound links [33], and its mathematical model is as follows:(5)PRA=1−dN+d∑i=1nPRBiCBi,where PRA is the link probability of web page A, PRBi is the link probability of web page Bi linked to web page A, CBi is the number of outbound links of web page Bi, N is the total number of all web pages in the network, d is the damping coefficient, d∈0,1, and the general value is 0.85.The P2P network of blockchain is similar to the network. The node is equivalent to a web page, the reputation of the node is equivalent to the link probability of the web page, and the outgoing and incoming link of each node are equivalent to the outbound and inbound link of the web page. Each node in the P2P network of the blockchain can establish up to eight outgoing links and 117 incoming links [34]. Therefore, it is appropriate to apply the PageRank algorithm to the P2P network of the blockchain to calculate the reputation for each node. However, it is unrealistic to only rely on the introduction of the PageRank algorithm to select leader node, because, in the P2P local small network of the blockchain, there may be two or more nodes with the same number of outgoing links and incoming links. Therefore, the calculated reputation of the node will be the same.In order to solve the problem, on the basis of obtaining the reputation, a block generation probability for each node is allocated by introducing the Pareto distribution in the power-law distribution in this scheme. The multiplication of the reputation and block generation probability is used as the actual reputation of each node, which can avoid the appearance of nodes with the same reputation in the local small network successfully. Both normal distribution and power-law distribution are two common data distribution patterns [35], in which one of the typical distributions of the former is the height distribution of human beings, while one of the typical distributions of the latter is the distribution of social wealth. In the P2P network of the blockchain, a small number of nodes occupy the vast majority of the computing power of the entire network, which is similar to the fact that a small number of people own the vast majority of the wealth of the society. Therefore, it is appropriate to introduce Pareto distribution to solve this problem.Before introducing Pareto distribution, the reputation of incoming links and outgoing links of each node is quantified by (6) and (7), where a is the number of incoming links of node A, b is the number of outgoing links of node A, and c is the sum of the number of links established by node A, c=a+b.(6)PRA1=acA,(7)PRA0=bcPRA.Suppose that the incoming link reputation of a node isI1,I2,…,In, outgoing link reputation is O1,O2,…,On, the former obeys the Pareto distribution of parameters γ and α, and the latter obeys the Pareto distribution of parameters γ and β. The probability distribution functions of the incoming link reputation I and the outgoing link reputation O are expressed as(8)F¯i=PI>i=iα−γ,i≥α≥γ,F¯o=PO>o=oβ−γ,o≥α≥γ.Then, the probability of node block generationPBG is expressed as(9)PBG=F¯iF¯o=ioαβ−γ.Therefore, the mathematical model for calculating the reputation of each node in the blockchain P2P network can be expressed as(10)PRA=1−dN+d∑i=1nPRBiCBiioαβ−γ.When the transaction data is stored on the chain, the reputation for each node is calculated in the current network by using (10), and the blocks are packed and organized by the node with high reputation.The absolute security guarantee is given to legal blocks by the block finality mechanism. Once a block has been finally achieved, the consensus algorithm can ensure that it cannot be modified, replaced, or removed in the ledger. Even when the system encounters extremely asynchronous network conditions, the consensus algorithm can also guarantee its security.In order to achieve finality, a block must be confirmed by BFT consensus. The HotStuff consensus mechanism is used to reach a final framework. The framework divides the BFT consensus process into three consecutive stages, and each stage requires more than 2/3 of the nodes to reach consensus. In order to integrate the framework into PoA, the state information of the block in the process of achieving finality is added to each block. When a committee member endorses a block, the member also confirms the relevant information contained in the block. Therefore, when the subsequent blockchain of a block contains more than 2/3 consensus nodes (as leader node or committee members), the block completes a stage of BFT consensus. In the process of achieving BFT, more than 2/3 nodes to respond online at the same time will not be required, but only the leader node and committee members can respond in time. Such a mechanism can reduce the service delay or temporary unavailability caused by the node’s failure to respond in time. The improved PoA consensus process is shown in Figure6, including the following four stages:(1)
Leader Selection. First, (2) and (3) are used to perform five rounds of calculation. At the same time, the sortition selection algorithm is used to select five authorized nodes to form the committee, and the verifying sortition algorithm is used to verify the result of sortition by other consensus nodes. Then, (11) is used to calculate the reputation for the authorized nodes in the current committee. The node with high reputation is selected as the leader node. Other nodes are named as validate node 1, validate node 2, validate node 3, and validate node 4, respectively.(2)
Block Proposal. The leader node packages the new transaction request, constructs a new block, signs the block data and hash, and then broadcasts the block and signature to all authorized nodes in the network.(3)
Block Acceptance. After receiving the message from the leader node, the validate node verifies the validity of the block, signs the block, and returns the signature to the leader node.(4)
Block Confirmed. The leader node can submit the block only after receiving at least 2/3 of the valid signatures of the nodes and broadcast the new block in the network finally.Figure 6
Improved PoA consensus process.


## 4.4. Data Recovery

When the microgrid node is damaged by human factors or irresistible natural factors resulting in data loss, a data recovery request can be sent to the nearest edge server by the microgrid node. The pseudocode of data recovery algorithm is shown in Algorithm5, and the recovery process is shown in Figure 7. The specific data recovery steps are as follows.Step 1. The data recovery request including account information and timestamp is sent to the nearest edge server by the microgrid node.Step 2. The data recovery request information submitted by the microgrid node is used to query the microgrid node information on the blockchain by the edge server.Step 3. The microgrid node information is verified by the blockchain. If the verification fails, an error is returned. Otherwise, Step 4 will be executed.Step 4. The hash value of the required data is searched and returned to the edge server by the blockchain.Step 5. The hash value of the data is used as the key by the edge server, and the Kademlia algorithm is used to search for the matching encrypted data automatically.Step 6. The hash value of the encrypted data is calculated and compared with the hash value returned from the blockchain by the edge server. If the two values are different, it will return the warning of data damage to the microgrid node. Otherwise, Step 7 will be executed.Step 7. The encrypted data is returned to the microgrid node.Step 8. The HE-AES algorithm is used to decrypt the data to obtain the required data by the microgrid node. The pseudocode of the HE-AES decryption algorithm is shown in Algorithm 6, and the decryption process is shown in Figure 8. The specific decryption process is as follows:(a)
The AES is used to decrypt the ciphertextC to obtain C∗(b)
The hash functionH and random string R are used to hash and salt the original password k to obtain the password k′(c)
The seeds is obtained by exclusive-or operation of the processed password k′ and ciphertext C∗(d)
The reverse sampling of DTE is used to decode the seeds to obtain plaintext MAlgorithm 5:Data recovery.
(1)
key_Data_key(2)
for each i∈0,m do(3)
Search Node←FIND_VALUEkey(4)
if PING Search Node==Truethen(5)
GETData_ID(6)
end if(7)
end for(8)
Block_data←MapData_ID(9)
find (Block_data,Encdata)(10)
ifData_ID==Block_data.Data_IDthen(11)
returnEncdata(12)
else(13)
returnWarning(14)
end ifFigure 7
Data recovery process.Algorithm 6:HE-AES decryption.
(1)
C∗←DecKC(2)
R←0,1n(3)
k′←HR,k(4)
s←k′⊕C∗(5)
M_DecodesFigure 8
HE-AES decryption process.


## 5. Security Analysis

Combining HE technology with AES, a new HE-AES algorithm is proposed, which is used to encrypt data, so as to ensure the security of data.Suppose that, for an attackerA who tries to recover a message, if the output message is consistent with the original message through violent cracking, the attacker wins. The advantage AdvHE−AESMR of the attacker A in cracking the HE-AES algorithm can be expressed as(11)AdvHE−AESMRA=PrMRHE−AESA⇒True,where PrMRHE−AESA⇒True, is the probability that attacker A recovers the message successfully.Suppose the seed space size of DTE islbit, pm is the distribution of message space η, the maximum message probability is λ, pk is the distribution of passwords, and the maximum weight is ω, and then, the following can be proved:(12)AdvHE−AESMRA≤ω1+ε+δ,δ=1+μ2l,μ=1ω,where(13)ε=μ022η0+eμ0427η02−eμ02,μ0=3ω,η0=2λ.Normally,η0≫μ02, so ε will be very small. When the size of the seed space l is very large, δ will approach 0. Therefore, AdvHE−AESMRA is close to 0, so the probability of attacker A cracking the algorithm successfully is close to 0, which means that the algorithm is safe.


## 6. Performance Evaluation

In order to further verify the performance of the scheme, a series of experiments are designed to further illustrate the efficiency of the scheme by comparing with other schemes in terms of backup delay and recovery delay, backup time and recovery time, recovery rate, integrity rate, block propagation delay, computing overhead, block generation time, and transaction throughput. Since these indexes can also show excellent results in some schemes in the small data sample environment, in order to fully explain the data processing efficiency of this scheme, big data is selected as the sample. The data samples are increased from 500 MB to 2500 MB by 500 steps. The automatic recovery system based on blockchain (ARS) [21], disaster backup scheme of mobile social network content supporting fog computing (DBMSN) [22], power data disaster backup scheme based on blockchain (PDDB) [23], and industrial blockchain environment data disaster backup scheme (IBEDB) [24] are mainly selected as comparison scheme. In order to reduce the influence of unstable factors on the experiment, 20 measurements were carried out for each selected data sample, and then, the average value was taken as the index data of the sample.


### 6.1. Experiment Setup

In this scheme, one host is used as the microgrid node, which is named microgrid node, and the other three hosts are used as edge server nodes, which are named edge node 1, edge node 2, and edge node 3, respectively. The specific setup information of each device is shown in Table2.Table 2
Experimental equipment configuration information.
DeviceCPURAM (GB)OSMicrogrid nodeIntel Core i7-6870HQ (2.7 GHz)32Ubuntu 20.04.1 LTSEdge node 1Intel Xeon E3-1220 (3.0 GHz)32Ubuntu 20.04.1 LTSEdge node 2Intel Xeon E5-2609 (2.4 GHz)24Ubuntu 20.04.1 LTSEdge node 3Intel Xeon E5-2620 (2.1 GHz)24Ubuntu 20.04.1 LTS


### 6.2. Logic Realization Based on Smart Contract

The smart contract on the blockchain is an executable program in a sandbox environment [36]. After triggering preset conditions, it can execute and complete the set goals automatically. The smart contract is used to realize the information interaction between the edge server and the blockchain in the scheme. The initialization parameters, data preprocessing, data encryption, ciphertext storage, data block storage, query of microgrid node information, authority verification, hash value verification, and data recovery are included in the process of disaster backup scheme. The pseudocode of smart contract is shown in Algorithm 7.Algorithm 7:Smart contract.
(1)
Initialized parameters(2)
Data preprocessing using edge computing(3)
C←EncHE−AESdata(4)
StoreC in edge server(5)
Select authorized nodes using Algorithm3(6)
Verify authorized nodes using Algorithm4(7)
Calculate the reputation using (10) for each node(8)
Select leader node to generate block according the reputation(9)
Block_hash=hashC(10)
Microgrid node_address=Microgrid node_account.address(11)
Block_data←Microgrid_account, Microgrid node_address,data_timestamp, Block_hash(12)
Send theBlock_data to blockchain for storage(13)
Send thedata_request to the closest edge server(14)
Integrate thedata_information of the data_request into the data_name(15)
Microgrid noderequest_address=GetMicrogrid node_addressdata_name(16)
ifMicrogrid noderequest_address=Microgrid node_addressthen(17)
hash_input=hashC(18)
end if(19)
ifBlock_data.Block_hash==hash_inputthen(20)
SendC to the Microgrid noderequest(21)
else(22)
return False(23)
end if(24)
data←DecHE−AESC


### 6.3. Evaluation Results

The safe and efficient disaster backup of microgrid data is realized in the edge computing environment. Therefore, the typical disaster backup schemes in recent years (including ARS, DBMSN, PDDB, and IBEDB) are selected as the reference in the experiment and compared with this scheme to further illustrate the data processing efficiency.


#### 6.3.1. Backup and Recovery Delays

The change of backup delay and recovery delay is observed by adjusting the data size in the experiment. The experimental results of backup delay and recovery delay are shown in Figure9.Figure 9
Experimental results of backup delay and recovery delay. (a) Backup delay. (b) Recovery delay.
(a)(b)The backup delay and recovery delay of all schemes are increased with the increase of data size. When the data size is up to 2500 MB, the ARS has the worst effect in dealing with big data, and this scheme has the best effect. The backup delay and recovery delay of the former exceed 1000 ms, while the backup delay and recovery delay of the latter do not exceed 250 ms. The best performance of other three schemes is the DBMSN, and the worst is the PDDB, which is because the fog computing is introduced in DBMSN and its function is similar to edge computing. However, edge computing devices are closer to the data source than fog computing, so edge computing performs better when processing big data. Therefore, the PDDB is not as good as this scheme. The IBEDB is integrated into the cloud storage technology, and the blockchain technology is simply used in PDDB. Cloud storage technology also has certain advantages in processing big data. Therefore, the IBEDB is better than PDDB.


#### 6.3.2. Backup and Recovery Times

The data size is set to 500 MB in this experiment. Under this premise, the backup time (including data encryption and storage) and recovery time (including data download and decryption) of each scheme are tested. The experimental results are shown in Figure10.Figure 10
Experimental results of backup time and recovery time. (a) Backup time. (b) Recovery time.
(a)(b)The backup time and recovery time of the ARS is the longest, and the time of this scheme is the shortest. Compared with other comparison schemes, the backup and recovery times of this scheme are reduced by at least 11.1% and 23.2%, respectively. The backup and recovery times of the PDDB are almost the same, because the symmetric encryption algorithm is adopted, and the size of ciphertext and plaintext is the same [37]. The recovery time of the DBMSN and IBEDB is longer than the backup time, because the decryption time is longer than the encryption time. In Figure 10(a), the proposed scheme in DBMSN is the best except this scheme, but in Figure 10(b), the scheme proposed in PDDB is the best except this scheme, which is because the AES is adopted in PDDB, and the encryption time and decryption time are similar, while the partition scrambling method is used to encrypt data in DBMSN, and the decryption time is greater than that of encryption time.


#### 6.3.3. Recovery Rate

Recovery rate refers to the proportion of recovered data in the original data, which can reflect the practicability. In this experiment, the change of recovery rate is observed by adjusting the data size. The experimental results of recovery rate are shown in Figure11.Figure 11
Experimental results of recovery rate.The recovery rate of all schemes is decreased with the increase of data size, but the decline rate of this scheme is the slowest. When processing the data below 1000 MB, the advantage of this scheme is not obvious compared with other schemes. However, when dealing with the big data above 1000 MB, the recovery rate of this scheme is obviously higher than that of other schemes. Specifically, when processing 1500 MB, 2000 MB, and 2500 MB data, the recovery rate of this scheme is at least 7.5%, 12.2%, and 15.2% higher than other schemes. When the data size is up to 2500 MB, the data recovery rate of the scheme can reach 52%.


#### 6.3.4. Integrity Rate

Integrity rate refers to the proportion of the recovered complete data in the recovered data when the distributed data storage system is attacked illegally. This index can reflect the integrity of the recovered data. In this experiment, the change of integrity rate is observed by adjusting the data size. The experimental results of integrity rate are shown in Figure12.Figure 12
Experimental results of integrity rate.When the distributed data storage system is attacked illegally, the integrity rate of all schemes is decreased with the increase of data size. The integrity rate of the DBMSN drops the fastest because the traditional centralized backup method is adopted. The performance of ARS and PDDB is similar, the performance of this scheme is the best, and the performance of IBEDB is second only to this scheme, which is because not only does the traditional centralized storage structure change by blockchain technology, but also the automatic backup and recovery of data is realized by the Kademlia algorithm in this scheme. Therefore, when the data size is up to 2500 MB, in the face of illegal attacks, the recovery rate can reach 62.5%.


#### 6.3.5. Block Propagation Delay

The block transmission delay, block verification delay, and node information exchange delay are included in the block propagation delay [38]. The block propagation delay is not only related to the reputation of incoming link and outgoing link but also affected by parameter γ. Therefore, this experiment synthesizes three factors to analyze the influence of incoming link reputation, outgoing link reputation, and parameter γ on block propagation delay. The experimental results of block propagation delay are shown in Figure 13.Figure 13
Experimental results of block propagation delay. (a) Influence of incoming link reputation and parameterγ on block propagation delay. (b) Influence of outgoing link reputation and parameter γ on block propagation delay.
(a)(b)In the case of constant parameterγ, the block propagation delay will be decreased with the increase of the reputation on the incoming link and the outgoing link, which is because whether the reputation of the incoming link or the outgoing link increases, the number of nodes will be decreased, and the block verification delay will also be decreased. Therefore, the block propagation delay will be decreased. When the reputation of the incoming link or the outgoing link is constant, the block propagation delay will be decreased with the increase of parameter γ, which is because both the reputation of the incoming link and the outgoing link obey the Pareto distribution of parameter γ, and the reputation will be increased with the increase of parameter γ. According to the previously mentioned analysis, the block propagation delay will be decreased when the reputation increases.


#### 6.3.6. Computing Overhead

In this experiment, the data size is set to 500 MB. Under this premise, the storage time of data is used to measure the computing cost of the system. The experimental results of computing overhead are shown in Figure14.Figure 14
Experimental results of computing overhead.The computing overhead of the ARS is the largest, and the storage time is up to 235 ms. The computing overhead of this scheme is the smallest, and the storage time is only 36 ms. Compared with the ARS, DBMSN, PDDB, and IBEDB, the computing overhead of this scheme is reduced by 84.7%, 30.8%, 64.4%, and 56.1%, respectively. This is because the ARS and PDDB both use the traditional Ethereum platform to build the blockchain, while the fragmentation technology is used to realize the distributed storage of data in IBEDB, which can reduce the computing overhead. The fog computing is used to process big data in the DBMSN, and the computing overhead is greatly reduced. The edge computing is used in this scheme, which is more efficient than fog computing, so the computing overhead is minimal.


#### 6.3.7. Block Generation Time

The block size is set to 8 MB in the experiment. Under this condition, the block generation time can be observed by changing the number of blocks, which can reflect the block speed of different schemes directly. Since the DBMSN does not use blockchain technology, it needs to be replaced. Similar to the disaster backup process, two stages of data storage and download are included in the process of data sharing [39]. Therefore, a data sharing scheme is selected as an alternative scheme in this experiment, that is, the Internet of Things data sharing scheme (DSIoT) [40].The experimental results of block generation time are shown in Figure 15.Figure 15
Experimental results of block generation time.The block generation time of all schemes are increased with the increase of the number of blocks, which is because when the number of nodes is constant, the number of packed blocks is increased, and the block generation time will be increased naturally. The ARS and PDDB have the fastest growth, which is due to the blockchain built on the traditional Ethereum platform. The DSIoT has been improved greatly compared with the previous schemes, because a new consensus mechanism Proof of Concept (PoC) is adopted. This scheme has the shortest block generation time and the highest block generation rate, which is because a more efficient PoA than PoC is adopted.


#### 6.3.8. Transaction Throughput

The transaction throughput of blockchain refers to the number of transactions completed per unit time, which is one of the typical evaluation indexes of blockchain [41]. In this experiment, the block size is set to 8 MB, and the throughput is observed by changing the block generation time. The DSIoT is used as the alternative comparison scheme to replace the DBMSN, and the other comparison schemes remain unchanged. The experimental results of throughput are shown in Figure 16.Figure 16
Experimental results of throughput.The throughput of all schemes is decreased with the increase of block generation time, because the increase of block generation time means that the number of transactions processed decreases at the same time. The throughput of the ARS and PDDB is the lowest, both below 1500 tps, which is because the traditional Ethereum platform is used to build the blockchain without any optimization. The throughput of this scheme is the highest and can be close to 15000 tps, which is because not only the Kademlia algorithm is used to realize the distributed storage of data automatically, but also the consensus mechanism is changed in this scheme, which is the decisive factor affecting the throughput [42]. The efficient PoA is adopted, which can greatly improve the efficiency of data processing. The throughput of the IBEDB is fluctuated in the range of (1000, 10000), which is because the fragmentation processing technology is adopted to optimize the transaction verification, which can improve the throughput slightly. The throughput of the DSIoT is fluctuated in the range of (1500, 15000), and its maximum throughput can be close to 13500 tps, which is because the traditional blockchain building platform is changed and the improved permissionless Ethereum platform is adopted to build the blockchain, which can improve the throughput greatly.


## 6.1. Experiment Setup

In this scheme, one host is used as the microgrid node, which is named microgrid node, and the other three hosts are used as edge server nodes, which are named edge node 1, edge node 2, and edge node 3, respectively. The specific setup information of each device is shown in Table2.Table 2
Experimental equipment configuration information.
DeviceCPURAM (GB)OSMicrogrid nodeIntel Core i7-6870HQ (2.7 GHz)32Ubuntu 20.04.1 LTSEdge node 1Intel Xeon E3-1220 (3.0 GHz)32Ubuntu 20.04.1 LTSEdge node 2Intel Xeon E5-2609 (2.4 GHz)24Ubuntu 20.04.1 LTSEdge node 3Intel Xeon E5-2620 (2.1 GHz)24Ubuntu 20.04.1 LTS


## 6.2. Logic Realization Based on Smart Contract

The smart contract on the blockchain is an executable program in a sandbox environment [36]. After triggering preset conditions, it can execute and complete the set goals automatically. The smart contract is used to realize the information interaction between the edge server and the blockchain in the scheme. The initialization parameters, data preprocessing, data encryption, ciphertext storage, data block storage, query of microgrid node information, authority verification, hash value verification, and data recovery are included in the process of disaster backup scheme. The pseudocode of smart contract is shown in Algorithm 7.Algorithm 7:Smart contract.
(1)
Initialized parameters(2)
Data preprocessing using edge computing(3)
C←EncHE−AESdata(4)
StoreC in edge server(5)
Select authorized nodes using Algorithm3(6)
Verify authorized nodes using Algorithm4(7)
Calculate the reputation using (10) for each node(8)
Select leader node to generate block according the reputation(9)
Block_hash=hashC(10)
Microgrid node_address=Microgrid node_account.address(11)
Block_data←Microgrid_account, Microgrid node_address,data_timestamp, Block_hash(12)
Send theBlock_data to blockchain for storage(13)
Send thedata_request to the closest edge server(14)
Integrate thedata_information of the data_request into the data_name(15)
Microgrid noderequest_address=GetMicrogrid node_addressdata_name(16)
ifMicrogrid noderequest_address=Microgrid node_addressthen(17)
hash_input=hashC(18)
end if(19)
ifBlock_data.Block_hash==hash_inputthen(20)
SendC to the Microgrid noderequest(21)
else(22)
return False(23)
end if(24)
data←DecHE−AESC


## 6.3. Evaluation Results

The safe and efficient disaster backup of microgrid data is realized in the edge computing environment. Therefore, the typical disaster backup schemes in recent years (including ARS, DBMSN, PDDB, and IBEDB) are selected as the reference in the experiment and compared with this scheme to further illustrate the data processing efficiency.


### 6.3.1. Backup and Recovery Delays

The change of backup delay and recovery delay is observed by adjusting the data size in the experiment. The experimental results of backup delay and recovery delay are shown in Figure9.Figure 9
Experimental results of backup delay and recovery delay. (a) Backup delay. (b) Recovery delay.
(a)(b)The backup delay and recovery delay of all schemes are increased with the increase of data size. When the data size is up to 2500 MB, the ARS has the worst effect in dealing with big data, and this scheme has the best effect. The backup delay and recovery delay of the former exceed 1000 ms, while the backup delay and recovery delay of the latter do not exceed 250 ms. The best performance of other three schemes is the DBMSN, and the worst is the PDDB, which is because the fog computing is introduced in DBMSN and its function is similar to edge computing. However, edge computing devices are closer to the data source than fog computing, so edge computing performs better when processing big data. Therefore, the PDDB is not as good as this scheme. The IBEDB is integrated into the cloud storage technology, and the blockchain technology is simply used in PDDB. Cloud storage technology also has certain advantages in processing big data. Therefore, the IBEDB is better than PDDB.


### 6.3.2. Backup and Recovery Times

The data size is set to 500 MB in this experiment. Under this premise, the backup time (including data encryption and storage) and recovery time (including data download and decryption) of each scheme are tested. The experimental results are shown in Figure10.Figure 10
Experimental results of backup time and recovery time. (a) Backup time. (b) Recovery time.
(a)(b)The backup time and recovery time of the ARS is the longest, and the time of this scheme is the shortest. Compared with other comparison schemes, the backup and recovery times of this scheme are reduced by at least 11.1% and 23.2%, respectively. The backup and recovery times of the PDDB are almost the same, because the symmetric encryption algorithm is adopted, and the size of ciphertext and plaintext is the same [37]. The recovery time of the DBMSN and IBEDB is longer than the backup time, because the decryption time is longer than the encryption time. In Figure 10(a), the proposed scheme in DBMSN is the best except this scheme, but in Figure 10(b), the scheme proposed in PDDB is the best except this scheme, which is because the AES is adopted in PDDB, and the encryption time and decryption time are similar, while the partition scrambling method is used to encrypt data in DBMSN, and the decryption time is greater than that of encryption time.


### 6.3.3. Recovery Rate

Recovery rate refers to the proportion of recovered data in the original data, which can reflect the practicability. In this experiment, the change of recovery rate is observed by adjusting the data size. The experimental results of recovery rate are shown in Figure11.Figure 11
Experimental results of recovery rate.The recovery rate of all schemes is decreased with the increase of data size, but the decline rate of this scheme is the slowest. When processing the data below 1000 MB, the advantage of this scheme is not obvious compared with other schemes. However, when dealing with the big data above 1000 MB, the recovery rate of this scheme is obviously higher than that of other schemes. Specifically, when processing 1500 MB, 2000 MB, and 2500 MB data, the recovery rate of this scheme is at least 7.5%, 12.2%, and 15.2% higher than other schemes. When the data size is up to 2500 MB, the data recovery rate of the scheme can reach 52%.


### 6.3.4. Integrity Rate

Integrity rate refers to the proportion of the recovered complete data in the recovered data when the distributed data storage system is attacked illegally. This index can reflect the integrity of the recovered data. In this experiment, the change of integrity rate is observed by adjusting the data size. The experimental results of integrity rate are shown in Figure12.Figure 12
Experimental results of integrity rate.When the distributed data storage system is attacked illegally, the integrity rate of all schemes is decreased with the increase of data size. The integrity rate of the DBMSN drops the fastest because the traditional centralized backup method is adopted. The performance of ARS and PDDB is similar, the performance of this scheme is the best, and the performance of IBEDB is second only to this scheme, which is because not only does the traditional centralized storage structure change by blockchain technology, but also the automatic backup and recovery of data is realized by the Kademlia algorithm in this scheme. Therefore, when the data size is up to 2500 MB, in the face of illegal attacks, the recovery rate can reach 62.5%.


### 6.3.5. Block Propagation Delay

The block transmission delay, block verification delay, and node information exchange delay are included in the block propagation delay [38]. The block propagation delay is not only related to the reputation of incoming link and outgoing link but also affected by parameter γ. Therefore, this experiment synthesizes three factors to analyze the influence of incoming link reputation, outgoing link reputation, and parameter γ on block propagation delay. The experimental results of block propagation delay are shown in Figure 13.Figure 13
Experimental results of block propagation delay. (a) Influence of incoming link reputation and parameterγ on block propagation delay. (b) Influence of outgoing link reputation and parameter γ on block propagation delay.
(a)(b)In the case of constant parameterγ, the block propagation delay will be decreased with the increase of the reputation on the incoming link and the outgoing link, which is because whether the reputation of the incoming link or the outgoing link increases, the number of nodes will be decreased, and the block verification delay will also be decreased. Therefore, the block propagation delay will be decreased. When the reputation of the incoming link or the outgoing link is constant, the block propagation delay will be decreased with the increase of parameter γ, which is because both the reputation of the incoming link and the outgoing link obey the Pareto distribution of parameter γ, and the reputation will be increased with the increase of parameter γ. According to the previously mentioned analysis, the block propagation delay will be decreased when the reputation increases.


### 6.3.6. Computing Overhead

In this experiment, the data size is set to 500 MB. Under this premise, the storage time of data is used to measure the computing cost of the system. The experimental results of computing overhead are shown in Figure14.Figure 14
Experimental results of computing overhead.The computing overhead of the ARS is the largest, and the storage time is up to 235 ms. The computing overhead of this scheme is the smallest, and the storage time is only 36 ms. Compared with the ARS, DBMSN, PDDB, and IBEDB, the computing overhead of this scheme is reduced by 84.7%, 30.8%, 64.4%, and 56.1%, respectively. This is because the ARS and PDDB both use the traditional Ethereum platform to build the blockchain, while the fragmentation technology is used to realize the distributed storage of data in IBEDB, which can reduce the computing overhead. The fog computing is used to process big data in the DBMSN, and the computing overhead is greatly reduced. The edge computing is used in this scheme, which is more efficient than fog computing, so the computing overhead is minimal.


### 6.3.7. Block Generation Time

The block size is set to 8 MB in the experiment. Under this condition, the block generation time can be observed by changing the number of blocks, which can reflect the block speed of different schemes directly. Since the DBMSN does not use blockchain technology, it needs to be replaced. Similar to the disaster backup process, two stages of data storage and download are included in the process of data sharing [39]. Therefore, a data sharing scheme is selected as an alternative scheme in this experiment, that is, the Internet of Things data sharing scheme (DSIoT) [40].The experimental results of block generation time are shown in Figure 15.Figure 15
Experimental results of block generation time.The block generation time of all schemes are increased with the increase of the number of blocks, which is because when the number of nodes is constant, the number of packed blocks is increased, and the block generation time will be increased naturally. The ARS and PDDB have the fastest growth, which is due to the blockchain built on the traditional Ethereum platform. The DSIoT has been improved greatly compared with the previous schemes, because a new consensus mechanism Proof of Concept (PoC) is adopted. This scheme has the shortest block generation time and the highest block generation rate, which is because a more efficient PoA than PoC is adopted.


### 6.3.8. Transaction Throughput

The transaction throughput of blockchain refers to the number of transactions completed per unit time, which is one of the typical evaluation indexes of blockchain [41]. In this experiment, the block size is set to 8 MB, and the throughput is observed by changing the block generation time. The DSIoT is used as the alternative comparison scheme to replace the DBMSN, and the other comparison schemes remain unchanged. The experimental results of throughput are shown in Figure 16.Figure 16
Experimental results of throughput.The throughput of all schemes is decreased with the increase of block generation time, because the increase of block generation time means that the number of transactions processed decreases at the same time. The throughput of the ARS and PDDB is the lowest, both below 1500 tps, which is because the traditional Ethereum platform is used to build the blockchain without any optimization. The throughput of this scheme is the highest and can be close to 15000 tps, which is because not only the Kademlia algorithm is used to realize the distributed storage of data automatically, but also the consensus mechanism is changed in this scheme, which is the decisive factor affecting the throughput [42]. The efficient PoA is adopted, which can greatly improve the efficiency of data processing. The throughput of the IBEDB is fluctuated in the range of (1000, 10000), which is because the fragmentation processing technology is adopted to optimize the transaction verification, which can improve the throughput slightly. The throughput of the DSIoT is fluctuated in the range of (1500, 15000), and its maximum throughput can be close to 13500 tps, which is because the traditional blockchain building platform is changed and the improved permissionless Ethereum platform is adopted to build the blockchain, which can improve the throughput greatly.


## 6.3.1. Backup and Recovery Delays

The change of backup delay and recovery delay is observed by adjusting the data size in the experiment. The experimental results of backup delay and recovery delay are shown in Figure9.Figure 9
Experimental results of backup delay and recovery delay. (a) Backup delay. (b) Recovery delay.
(a)(b)The backup delay and recovery delay of all schemes are increased with the increase of data size. When the data size is up to 2500 MB, the ARS has the worst effect in dealing with big data, and this scheme has the best effect. The backup delay and recovery delay of the former exceed 1000 ms, while the backup delay and recovery delay of the latter do not exceed 250 ms. The best performance of other three schemes is the DBMSN, and the worst is the PDDB, which is because the fog computing is introduced in DBMSN and its function is similar to edge computing. However, edge computing devices are closer to the data source than fog computing, so edge computing performs better when processing big data. Therefore, the PDDB is not as good as this scheme. The IBEDB is integrated into the cloud storage technology, and the blockchain technology is simply used in PDDB. Cloud storage technology also has certain advantages in processing big data. Therefore, the IBEDB is better than PDDB.


## 6.3.2. Backup and Recovery Times

The data size is set to 500 MB in this experiment. Under this premise, the backup time (including data encryption and storage) and recovery time (including data download and decryption) of each scheme are tested. The experimental results are shown in Figure10.Figure 10
Experimental results of backup time and recovery time. (a) Backup time. (b) Recovery time.
(a)(b)The backup time and recovery time of the ARS is the longest, and the time of this scheme is the shortest. Compared with other comparison schemes, the backup and recovery times of this scheme are reduced by at least 11.1% and 23.2%, respectively. The backup and recovery times of the PDDB are almost the same, because the symmetric encryption algorithm is adopted, and the size of ciphertext and plaintext is the same [37]. The recovery time of the DBMSN and IBEDB is longer than the backup time, because the decryption time is longer than the encryption time. In Figure 10(a), the proposed scheme in DBMSN is the best except this scheme, but in Figure 10(b), the scheme proposed in PDDB is the best except this scheme, which is because the AES is adopted in PDDB, and the encryption time and decryption time are similar, while the partition scrambling method is used to encrypt data in DBMSN, and the decryption time is greater than that of encryption time.


## 6.3.3. Recovery Rate

Recovery rate refers to the proportion of recovered data in the original data, which can reflect the practicability. In this experiment, the change of recovery rate is observed by adjusting the data size. The experimental results of recovery rate are shown in Figure11.Figure 11
Experimental results of recovery rate.The recovery rate of all schemes is decreased with the increase of data size, but the decline rate of this scheme is the slowest. When processing the data below 1000 MB, the advantage of this scheme is not obvious compared with other schemes. However, when dealing with the big data above 1000 MB, the recovery rate of this scheme is obviously higher than that of other schemes. Specifically, when processing 1500 MB, 2000 MB, and 2500 MB data, the recovery rate of this scheme is at least 7.5%, 12.2%, and 15.2% higher than other schemes. When the data size is up to 2500 MB, the data recovery rate of the scheme can reach 52%.


## 6.3.4. Integrity Rate

Integrity rate refers to the proportion of the recovered complete data in the recovered data when the distributed data storage system is attacked illegally. This index can reflect the integrity of the recovered data. In this experiment, the change of integrity rate is observed by adjusting the data size. The experimental results of integrity rate are shown in Figure12.Figure 12
Experimental results of integrity rate.When the distributed data storage system is attacked illegally, the integrity rate of all schemes is decreased with the increase of data size. The integrity rate of the DBMSN drops the fastest because the traditional centralized backup method is adopted. The performance of ARS and PDDB is similar, the performance of this scheme is the best, and the performance of IBEDB is second only to this scheme, which is because not only does the traditional centralized storage structure change by blockchain technology, but also the automatic backup and recovery of data is realized by the Kademlia algorithm in this scheme. Therefore, when the data size is up to 2500 MB, in the face of illegal attacks, the recovery rate can reach 62.5%.


## 6.3.5. Block Propagation Delay

The block transmission delay, block verification delay, and node information exchange delay are included in the block propagation delay [38]. The block propagation delay is not only related to the reputation of incoming link and outgoing link but also affected by parameter γ. Therefore, this experiment synthesizes three factors to analyze the influence of incoming link reputation, outgoing link reputation, and parameter γ on block propagation delay. The experimental results of block propagation delay are shown in Figure 13.Figure 13
Experimental results of block propagation delay. (a) Influence of incoming link reputation and parameterγ on block propagation delay. (b) Influence of outgoing link reputation and parameter γ on block propagation delay.
(a)(b)In the case of constant parameterγ, the block propagation delay will be decreased with the increase of the reputation on the incoming link and the outgoing link, which is because whether the reputation of the incoming link or the outgoing link increases, the number of nodes will be decreased, and the block verification delay will also be decreased. Therefore, the block propagation delay will be decreased. When the reputation of the incoming link or the outgoing link is constant, the block propagation delay will be decreased with the increase of parameter γ, which is because both the reputation of the incoming link and the outgoing link obey the Pareto distribution of parameter γ, and the reputation will be increased with the increase of parameter γ. According to the previously mentioned analysis, the block propagation delay will be decreased when the reputation increases.


## 6.3.6. Computing Overhead

In this experiment, the data size is set to 500 MB. Under this premise, the storage time of data is used to measure the computing cost of the system. The experimental results of computing overhead are shown in Figure14.Figure 14
Experimental results of computing overhead.The computing overhead of the ARS is the largest, and the storage time is up to 235 ms. The computing overhead of this scheme is the smallest, and the storage time is only 36 ms. Compared with the ARS, DBMSN, PDDB, and IBEDB, the computing overhead of this scheme is reduced by 84.7%, 30.8%, 64.4%, and 56.1%, respectively. This is because the ARS and PDDB both use the traditional Ethereum platform to build the blockchain, while the fragmentation technology is used to realize the distributed storage of data in IBEDB, which can reduce the computing overhead. The fog computing is used to process big data in the DBMSN, and the computing overhead is greatly reduced. The edge computing is used in this scheme, which is more efficient than fog computing, so the computing overhead is minimal.


## 6.3.7. Block Generation Time

The block size is set to 8 MB in the experiment. Under this condition, the block generation time can be observed by changing the number of blocks, which can reflect the block speed of different schemes directly. Since the DBMSN does not use blockchain technology, it needs to be replaced. Similar to the disaster backup process, two stages of data storage and download are included in the process of data sharing [39]. Therefore, a data sharing scheme is selected as an alternative scheme in this experiment, that is, the Internet of Things data sharing scheme (DSIoT) [40].The experimental results of block generation time are shown in Figure 15.Figure 15
Experimental results of block generation time.The block generation time of all schemes are increased with the increase of the number of blocks, which is because when the number of nodes is constant, the number of packed blocks is increased, and the block generation time will be increased naturally. The ARS and PDDB have the fastest growth, which is due to the blockchain built on the traditional Ethereum platform. The DSIoT has been improved greatly compared with the previous schemes, because a new consensus mechanism Proof of Concept (PoC) is adopted. This scheme has the shortest block generation time and the highest block generation rate, which is because a more efficient PoA than PoC is adopted.


## 6.3.8. Transaction Throughput

The transaction throughput of blockchain refers to the number of transactions completed per unit time, which is one of the typical evaluation indexes of blockchain [41]. In this experiment, the block size is set to 8 MB, and the throughput is observed by changing the block generation time. The DSIoT is used as the alternative comparison scheme to replace the DBMSN, and the other comparison schemes remain unchanged. The experimental results of throughput are shown in Figure 16.Figure 16
Experimental results of throughput.The throughput of all schemes is decreased with the increase of block generation time, because the increase of block generation time means that the number of transactions processed decreases at the same time. The throughput of the ARS and PDDB is the lowest, both below 1500 tps, which is because the traditional Ethereum platform is used to build the blockchain without any optimization. The throughput of this scheme is the highest and can be close to 15000 tps, which is because not only the Kademlia algorithm is used to realize the distributed storage of data automatically, but also the consensus mechanism is changed in this scheme, which is the decisive factor affecting the throughput [42]. The efficient PoA is adopted, which can greatly improve the efficiency of data processing. The throughput of the IBEDB is fluctuated in the range of (1000, 10000), which is because the fragmentation processing technology is adopted to optimize the transaction verification, which can improve the throughput slightly. The throughput of the DSIoT is fluctuated in the range of (1500, 15000), and its maximum throughput can be close to 13500 tps, which is because the traditional blockchain building platform is changed and the improved permissionless Ethereum platform is adopted to build the blockchain, which can improve the throughput greatly.


## 7. Conclusion

In view of the problems of traditional data disaster backup schemes, such as overreliance on the third party, inability to implement disaster backup automatically, low security, poor reliability, and low efficiency of data processing, a microgrid data disaster backup scheme based on blockchain is designed in the edge computing environment, which can realize data disaster backup automatically by using Kademlia algorithm. The improved PoA is used to improve the efficiency of data processing greatly, which can solve the problem of traditional centralized disaster backup and improve the security and reliability of the system.At the same time, the Internet of Things (IoT), Internet of Vehicles (IoV), and Industrial Internet of Things (IIoT) are also facing data security problems. Because its structure is similar to the microgrid, the architecture of this scheme can be integrated into it. Specifically, edge devices can be sunk to the data source, and edge computing is used to process the big data. The Kademlia algorithm is embedded in the edge server to realize the distributed storage and automatic recovery of data, and the improved PoA is adopted to make each node reach consensus and pack the blocks, which can improve the efficiency of data processing. Therefore, a new idea to solve the problem of data disaster backup in the field of IoT, IoV, and IIoT is provided by this scheme.Although edge computing is used to preprocess the big data of microgrid and reduce the data size in the scheme, the power consumption of the server is increased undoubtedly by encrypting and storing the preprocessed data in the local edge server. Therefore, the future research direction is to reduce the power consumption of the edge server as much as possible on the premise of ensuring the security and efficiency of the scheme. We can consider storing the encrypted data in the distributed database or using cloud storage technology to store it in the cloud.



---

*Source: 9121571-2021-08-03.xml*