Scientific research information data security management method based on blockchain
By combining node coordinates and performance evaluation indicators to optimize the CE-PBFT algorithm, the problem of cluster load imbalance is solved, and the communication performance and data security management efficiency of the blockchain system are improved.
Patent Information
- Application Number
- CN202411231899.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-04
- Publication Date
- 2024-11-15
- Estimated Expiration
- 2044-09-04
AI Technical Summary
The existing CE-PBFT algorithm fails to effectively consider node location distribution in the blockchain consensus mechanism, resulting in unbalanced cluster communication load and affecting the overall communication performance of the system.
By obtaining the reputation value, performance evaluation indicators and coordinates of the nodes, the top-down hierarchical clustering method is used to divide the nodes into clusters, calculate the communication difficulty coefficient and total load, build a hybrid network topology, and optimize the consensus mechanism to reduce communication Consumption and load imbalance.
It improves the overall communication performance of the system, ensures cluster load balancing, reduces communication consumption, and improves the efficiency of blockchain data security management.
Smart Images

Figure CN118734345B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the technical field of scientific research information data security management, and specifically to a scientific research information data security management method based on blockchain. Background Art
[0002] Blockchain is a method for securely storing distributed data. Using blockchain for data management in scientific research information data management can effectively ensure data security. When updating the blockchain, all blocks need to reach a consensus before completing the data update. The current blockchain consensus mechanism mainly uses PBFT (Practical Byzantine Fault Tolerance), but it has the disadvantage of high communication overhead, which makes PBFT difficult to apply to large-scale networks.
[0003] The CE-PBFT algorithm (improved practical Byzantine fault tolerance based on comprehensive evaluation) is an improved algorithm of PBFT. It divides nodes into different clusters according to their reputation and communication performance, calculates the intra-cluster consensus first, and then calculates the inter-cluster consensus to reduce communication overhead. However, when clustering multiple clusters, the CE-PBFT algorithm directly selects nodes with high reputation and performance evaluation as master nodes without considering the location distribution of nodes. This may cause the communication load of some clusters to far exceed the load of other clusters, resulting in an unbalanced communication load, which in turn leads to the problem of decreased overall communication performance of the system when the CE-PBFT algorithm is running. Summary of the invention
[0004] In order to solve the above technical problems, this application provides a blockchain-based scientific research information data security management method to solve existing problems.
[0005] The blockchain-based scientific research information data security management method of this application adopts the following technical solutions:
[0006] An embodiment of the present application provides a scientific research information data security management method based on blockchain, which includes the following steps:
[0007] Obtain the reputation value, performance evaluation index and coordinates of each node that stores scientific research information data in the blockchain at each moment;
[0008] The inter-class distance is used as the cluster distance, and a top-down hierarchical clustering method is used to cluster all nodes at each moment to obtain multiple classes;
[0009] Each class is regarded as a cluster, the central node of the cluster is regarded as a full node, and other nodes in the cluster are regarded as slave nodes of the full node, so as to construct a hybrid network topology structure at each time.
[0010] A consensus mechanism is used for the hybrid network topology to obtain the consensus results of all nodes in the blockchain, and the consensus results are used to manage scientific research information data securely;
[0011] The method for determining the distance between classes is:
[0012] Based on the coordinate distance between any two nodes and the performance evaluation index, the communication difficulty coefficient between any two nodes is determined; the total load of each class is determined by using the communication difficulty coefficient between each node in the class and the central node;
[0013] The class to be split is recorded as the target class. Based on the total load difference between the two classes pre-split in the target class, as well as the reputation values and performance evaluation indicators of the central nodes of the two classes, the inter-class distance between the two classes is determined.
[0014] Preferably, the method for determining the communication difficulty coefficient includes:
[0015] Get the sum of the performance evaluation indicators of any two nodes;
[0016] The ratio of the coordinate distance between any two nodes to the sum value is used as the communication difficulty coefficient.
[0017] Preferably, the central node is a node with the highest sum of reputation value and performance evaluation index in its class.
[0018] Preferably, the method for determining the total load includes:
[0019] Calculate the average of the communication difficulty coefficients between all nodes in the class except the central node and the central node as the total load of the corresponding class.
[0020] Preferably, the target class is split in such a way that the target class is split using the two classes that are split when the inter-class distance is the largest.
[0021] Preferably, the number of nodes in the two classes after the target class is split is the same or differs by one node.
[0022] Preferably, the hybrid network topology is a star-mesh hybrid network topology; the specific construction process is: all full nodes form a main cluster, each cluster is recorded as a sub-cluster, and the hybrid network topology is constructed using the main cluster and the sub-clusters.
[0023] Preferably, the method for determining the inter-class distance includes: recording the two classes pre-split in the target class as the first class and the second class respectively;
[0024] The expression of the inter-class distance between the first class and the second class is: ; In the formula, is the inter-class distance between the first class and the second class at time t, , are the total loads of the first and second categories at time t, , They are the central nodes of the first and second categories respectively. , They are respectively , The reputation value, , They are respectively , is a performance evaluation indicator, where z is a preset constant to prevent the denominator from being zero.
[0025] Preferably, the consensus mechanism is calculated using the CE-PBFT algorithm.
[0026] Preferably, the scientific research information data is securely managed using the consensus results, specifically: when the consensus results are consistent, the scientific research information data is stored on the blockchain; otherwise, the scientific research information data is not stored on the blockchain.
[0027] This application has at least the following beneficial effects:
[0028] The present application proposes a scientific research information data security management method based on blockchain for the problem of uneven cluster load caused by not considering the node distribution characteristics when the existing CE-PBFT algorithm is clustered, including: obtaining a communication difficulty coefficient by combining the coordinate distance of the node and the performance evaluation index, which is used to characterize the difficulty of communication between nodes, and taking the coordinate distribution of the node as a consideration factor for subsequent full node selection, thereby reducing the communication consumption of the entire system when communicating; calculating the total load by analyzing the difference in communication difficulty coefficients between nodes within the class and the central node, which is used to estimate the communication load size of a class, which can reflect the time required for communication, thereby making the method of class division more reasonable and ensuring that the total load difference between classes is small; calculating the inter-class distance by reputation value, performance evaluation index, and total load difference, which is used to evaluate the distance between classes, and taking the inter-class distance as the clustering distance of the hierarchical clustering algorithm. Since the total load difference of the two classes is considered when calculating the inter-class distance, and the coordinate distribution of the nodes is also considered, when the hierarchical clustering algorithm is split, it tends to split a class into two classes with similar loads, thereby avoiding the problem of subsequent cluster load imbalance and improving the overall communication performance of the system when the existing CE-PBFT algorithm is running. BRIEF DESCRIPTION OF THE DRAWINGS
[0029] In order to more clearly illustrate the technical solutions and advantages in the embodiments of the present application or the prior art, the drawings required for use in the embodiments or the prior art descriptions are briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.
[0030] Figure 1 A flowchart of a blockchain-based scientific research information data security management method provided for one embodiment of the present application;
[0031] Figure 2 A flow chart of a method for determining inter-class distance provided in one embodiment of the present application;
[0032] Figure 3 A flow chart of a method for determining a communication difficulty coefficient provided in one embodiment of the present application;
[0033] Figure 4 A schematic diagram of a hybrid network topology structure provided for one embodiment of the present application. DETAILED DESCRIPTION
[0034] In order to further explain the technical means and effects adopted by this application to achieve the predetermined invention purpose, the following is a detailed description of the specific implementation method, structure, features and effects of the blockchain-based scientific research information data security management method proposed in this application in combination with the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" does not necessarily refer to the same embodiment. In addition, specific features, structures or characteristics in one or more embodiments may be combined in any suitable form.
[0035] Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs.
[0036] The specific scheme of the blockchain-based scientific research information data security management method provided by this application is explained in detail below with reference to the accompanying drawings.
[0037] An embodiment of the present application provides a blockchain-based scientific research information data security management method.
[0038] Specifically, the following blockchain-based scientific research information data security management method is provided, please refer to Figure 1 , the method comprises the following steps:
[0039] The first step is to obtain the reputation value, performance evaluation index and coordinates of each node that stores scientific research information data in the blockchain at each moment.
[0040] Blockchain is a distributed data storage method that records a distributed data storage device as a node. In this embodiment, when managing the security of scientific research information data, the scientific research information data is stored in multiple data storage devices in the blockchain, and the data storage devices include but are not limited to: data storage centers, personal computers, and cloud storage servers; one storage device corresponds to a node, and a total of N=40 nodes are set in the embodiment of this application.
[0041] Furthermore, according to the existing CE-PBFT algorithm, the operating parameters of the node are obtained from the control system of the node, and the reputation value of the nth node is calculated at time t through the operating parameters. and performance evaluation indicators .
[0042] Among them, the method of calculating the reputation value and performance evaluation index through running parameters is the content of the CE-PBFT algorithm, which is a commonly used technology in the blockchain field; the larger the reputation value, the more trustworthy the nth node is at the tth moment; the larger the performance evaluation index, the more communication resources the nth node has at the tth moment, and the better the performance.
[0043] In the security management of scientific research information data, wireless network positioning technology can be used to display each node in a two-dimensional space in the form of horizontal and vertical coordinates, so as to obtain the wireless network coordinates of the node. Obtaining the wireless network coordinates of the node through wireless network positioning technology is a common technology in the communication field. The coordinates of the nth node are marked as .
[0044] At this point, the above method can be used to obtain the reputation value, performance evaluation index and coordinates of each node that stores scientific research information data in the blockchain at each time. Among them, N nodes are obtained at time t, and the attribute data contained in the nth node is: reputation value , performance evaluation indicators ,coordinate .
[0045] In the second step, the inter-class distance is used as the cluster distance, and a top-down hierarchical clustering method is used to cluster all nodes at each moment to obtain multiple classes.
[0046] In the existing CE-PBFT algorithm, nodes with high reputation values and performance evaluation indicators are directly selected as full nodes, and the remaining nodes participating in consensus voting are used as slave nodes. Then, a unique full node is assigned to each slave node according to the K-means algorithm to form a cluster. Since the location distribution of nodes is not taken into account when selecting full nodes, the coordinate distribution of nodes in the cluster may be relatively scattered in the final clustering results, resulting in a large communication overhead.
[0047] Therefore, this embodiment takes the coordinate distribution of the nodes into consideration when selecting all nodes, so that the final cluster division result is more reasonable.
[0048] This application uses the inter-class distance as the clustering distance, and adopts a top-down hierarchical clustering method to divide N nodes into multiple classes, each class corresponds to a cluster, and selects the nodes with high reputation values and performance evaluation indicators in the cluster as full nodes; when dividing the cluster, the coordinate distribution and reputation value distribution are included in the calculation process of the inter-class distance to obtain a more reasonable cluster division effect.
[0049] When performing cluster division, the communication load of different clusters should be balanced to avoid the degradation of the overall system performance due to excessive communication load of a few clusters; therefore, when calculating the inter-class distance, the difference in communication load of the two classes should be considered; if the difference in communication load of the two classes is smaller, the inter-class distance of the two classes should be set shorter, so that the communication load of each cluster can be balanced in the final cluster division result.
[0050] In the embodiment of the present application, the flow chart of the method for determining the distance between classes is as shown in the attached figure. Figure 2 shown.
[0051] The method for determining the inter-class distance is as follows:
[0052] The first small step is to determine the communication difficulty coefficient between any two nodes based on the coordinate distance between any two nodes and the performance evaluation index.
[0053] The purpose of selecting a full node is to reduce the communication consumption of the entire system. In addition to the node distance, the node's own communication performance also affects the node's communication effect. Therefore, when considering the node's coordinate distribution as a factor in the selection of a full node, it is necessary to consider the node's own communication performance.
[0054] For any two nodes n and m, according to their coordinates and Get the distance between two nodes , further calculate the communication difficulty coefficient , the expression is: ; In the formula, is the communication difficulty coefficient between node n and node m at time t, is the distance between node n and node m at time t, , They are the performance evaluation indicators of node n and node m at time t respectively.
[0055] The distance between two nodes is calculated by calculating the Euclidean distance between their corresponding coordinates. The calculation of the Euclidean distance is a well-known technique and will not be described in detail.
[0056] It should be understood that the greater the sum of the performance evaluation indicators of the two nodes, that is, the more communication resources the two nodes have at time t, the easier the communication is when the distance between the two nodes is the same, and the smaller the communication difficulty coefficient is; the greater the distance between the two nodes, the more difficult the communication is, and the greater the communication difficulty coefficient is. Finally, the communication difficulty coefficient is obtained, and the greater the value is, the more difficult it is for the two nodes to communicate with each other.
[0057] In the embodiment of the present application, the flow chart of the method for determining the communication difficulty coefficient is as shown in the attached Figure 3 shown.
[0058] In the second small step, the total load of each class is determined using the communication difficulty coefficient between each node in the class and the central node.
[0059] Assume that there are K nodes in a class, get the reputation value of the K nodes and performance evaluation indicators The node with the highest sum is recorded as the central node o. If a node has the highest reputation and the best performance in the cluster, it is most likely to be used as a full node of the cluster. The full node is responsible for collecting the consensus voting results of all nodes in the cluster and is the communication center of the cluster. It has the largest communication burden. Therefore, the node is recorded as the central node, and its communication load represents the communication load of the entire cluster.
[0060] Based on the communication difficulty coefficient between other nodes in the class and the central node, the total load of the class is calculated, and the expression is: ; In the formula, is the total load of the class at time t, K is the number of nodes in the class, It is the communication difficulty coefficient from the central node o to the node k at time t.
[0061] It should be understood that the communication difficulty coefficient from the central node to other nodes is averaged and recorded as the total load of the class; the larger the average value, the more time is required for communication within the class, and the greater the total load.
[0062] In the third small step, the class to be split is recorded as the target class, and the inter-class distance between the two classes is determined based on the total load difference between the two classes pre-split in the target class, as well as the reputation value and performance evaluation index of the central nodes of the two classes.
[0063] The embodiment of the present application adopts a top-down hierarchical clustering algorithm. Therefore, assuming that there are T nodes in the class that needs to be split, the T nodes are divided into two classes, which are respectively recorded as the first class and the second class.
[0064] In this embodiment, the class to be split is recorded as the target class, and the first class and the second class to be split into the target class are analyzed, specifically:
[0065] Calculate the total load for the first category , get the central node of the first category ; By calculating the total load for the second category , get the central node of the second category .
[0066] According to the reputation value and performance evaluation index of the central node of the two classes, as well as the total load difference between the two classes, the inter-class distance between the first class and the second class is constructed. The specific expression is: ; In the formula, is the inter-class distance between the first class and the second class at time t, , are the total loads of the first and second categories at time t, , They are the central nodes of the first and second categories respectively. , They are respectively , The reputation value, , They are respectively , is a performance evaluation index, z is a preset constant to prevent the denominator from being 0, and in this embodiment, the value is 1.
[0067] It should be understood that the greater the difference in total load between the two classes, the more likely the entire system will experience load imbalance after splitting the target class into such two classes. That is, if the total loads of the two classes are not similar, after one class completes consensus, the other class is still forming consensus, resulting in a decrease in the efficiency of the entire system. Therefore, the greater the difference in total load between the two classes, the smaller the inter-class distance between the two classes is set, making it less likely that the clustering method of splitting the target class into the first class and the second class will be called the final division result.
[0068] Since the center node of a class is the node with the largest reputation value and performance evaluation index, the center node of the class will be used as the full node after the final classification. Therefore, the larger the sum of the reputation value and performance evaluation index of the center node, the better the full node performance after splitting the target class into two classes, which can make the entire blockchain more efficient when running the consensus mechanism. Therefore, the larger the sum of the reputation value and performance evaluation index of the center node, the larger the distance between classes, making it easier for the first and second classes to become the final cluster classification results.
[0069] Finally, N nodes are used as input and clustering is performed using a top-down hierarchical clustering method; the cluster distance is calculated using the inter-class distance calculation method in this application to obtain multiple classes, and each class is recorded as a cluster.
[0070] It should be noted that in the top-down hierarchical clustering method, the target class that does not meet the stopping condition will be split. During the splitting, multiple nodes in the target class will be divided into two classes, and the inter-class distance will be used as the criterion for judging the quality of the current splitting method. The larger the inter-class distance, the better the current splitting method. The top-down hierarchical clustering method will try a variety of different splitting methods, and select the two classes that are split when the inter-class distance is the largest as the final splitting method to split the target class.
[0071] The stopping condition of the target class is: the number of nodes in the target class is less than or equal to 5. In other implementations of the embodiment of the present application, the number of nodes in the target class in the stopping condition may be set to other values, which are not limited in the present embodiment.
[0072] At the same time, the splitting rule adopts uniform splitting, that is, when there are T nodes in the target class to be split, if T is an even number, the number of nodes in the two split classes is the same; if T is an odd number, the number of nodes between the two split classes differs by one node.
[0073] At this point, a top-down hierarchical clustering algorithm is used to divide all nodes in the blockchain into multiple classes, and the number of classes in this embodiment of the application is set to V.
[0074] The third step is to treat each class as a cluster, the central node of the cluster as the full node, and other nodes in the cluster as slave nodes of the full node, to build a hybrid network topology structure at each moment.
[0075] The V classes obtained by the division are recorded as clusters. Furthermore, for the vth cluster, its central node is obtained as the full node, and the other nodes in the cluster are the slave nodes of the full node.
[0076] This completes the division of full nodes and slave nodes in each cluster, and this division is recorded as the network topology at time t, as shown in the attached figure. Figure 4 shown.
[0077] In the attached Figure 4 In the embodiment of the present application, a total of 20 nodes are set, which are divided into 4 clusters according to the method in the embodiment of the present application, and are respectively recorded as sub-clusters, wherein each sub-cluster has a full node, and the other nodes except the full node are slave nodes; all full nodes are further combined to form a main cluster; the main cluster and the sub-clusters together form a hybrid network topology structure. The hybrid network topology structure is a network topology structure that is a hybrid of star and mesh topology.
[0078] The fourth step is to adopt a consensus mechanism for the hybrid network topology structure, obtain the consensus results of all nodes in the blockchain, and use the consensus results to securely manage scientific research information data.
[0079] At time t, according to the hybrid network topology structure obtained in the embodiment of the present application, the CE-PBFT algorithm is used to run the consensus mechanism to complete the consensus formation of each node of the blockchain and obtain the consensus result. Among them, using the network topology structure as input and using the CE-PBFT algorithm to obtain the consensus result is a common technology in the blockchain field and will not be repeated.
[0080] Finally, the improved CE-PBFT algorithm is used as the consensus mechanism of the blockchain, and blockchain technology is used to securely manage scientific research information data. Specifically, at time t, a consensus result is obtained according to the consensus mechanism running between N nodes according to the embodiment of the present application. When the consensus results are inconsistent, it is considered that the communication environment at this time is unsafe, and the scientific research information data is not stored on the blockchain; when the consensus results are consistent, the scientific research information data is securely stored on the blockchain to complete the security management of the scientific research information data.
[0081] The various embodiments in the present application are described in a progressive manner, and the same or similar parts between the various embodiments can be referenced to each other, and each embodiment focuses on the differences from other embodiments.
[0082] It should be noted that, unless otherwise specified and limited, terms such as "include", "comprises" or any other variants thereof are intended to cover non-exclusive inclusion, so that a circuit structure, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such article or device. In the absence of further restrictions, an element defined by the sentence "including one..." does not exclude the existence of other identical elements in the article or device including the element. In addition, the term "and\or" used herein includes any and all combinations of one or more related listed items.
[0083] Those skilled in the art will readily appreciate other embodiments of the present application after considering the specification and practicing the invention herein. The present application is intended to cover any variations, uses or adaptations of the present application, which follow the general principles of the present application and include common knowledge or customary technical means in the art that are not invented by the present application.
[0084] It should be understood that the present application is not limited to the exact construction that has been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof.
Claims
1. A scientific research information data security management method based on blockchain, It is characterized in that The method comprises the following steps: Obtain the reputation value, performance evaluation index and coordinates of each node that stores scientific research information data in the blockchain at each moment; The inter-class distance is used as the cluster distance, and a top-down hierarchical clustering method is used to cluster all nodes at each moment to obtain multiple classes; Each class is regarded as a cluster, the central node of the cluster is regarded as a full node, and other nodes in the cluster are regarded as slave nodes of the full node, so as to construct a hybrid network topology structure at each time. A consensus mechanism is used for the hybrid network topology to obtain the consensus results of all nodes in the blockchain, and the consensus results are used to manage scientific research information data securely; The method for determining the distance between classes is: Based on the coordinate distance between any two nodes and the performance evaluation index, the communication difficulty coefficient between any two nodes is determined; the total load of each class is determined by using the communication difficulty coefficient between each node in the class and the central node; The class to be split is recorded as the target class, and the inter-class distance between the two classes is determined based on the total load difference between the two classes pre-split in the target class, as well as the reputation values and performance evaluation indicators of the central nodes of the two classes; The method for determining the inter-class distance includes: recording the two classes pre-split in the target class as the first class and the second class respectively; The expression of the inter-class distance between the first class and the second class is: ; In the formula, is the inter-class distance between the first class and the second class at time t, , are the total loads of the first and second categories at time t, , They are the central nodes of the first and second categories respectively. , They are respectively , The reputation value, , They are respectively , is a performance evaluation indicator, where z is a preset constant to prevent the denominator from being zero.
2. The scientific research information data security management method based on blockchain as claimed in claim 1, It is characterized in that The method for determining the communication difficulty coefficient includes: Get the sum of the performance evaluation indicators of any two nodes; The ratio of the coordinate distance between any two nodes to the sum value is used as the communication difficulty coefficient.
3. The scientific research information data security management method based on blockchain as claimed in claim 1, It is characterized in that The central node is a node with the highest sum of reputation value and performance evaluation index in its class.
4. The scientific research information data security management method based on blockchain as claimed in claim 1, It is characterized in that The method for determining the total load includes: Calculate the average of the communication difficulty coefficients between all nodes in the class except the central node and the central node as the total load of the corresponding class.
5. The scientific research information data security management method based on blockchain as claimed in claim 1, It is characterized in that The target class is split in the following way: the target class is split into two classes when the inter-class distance is the largest.
6. The scientific research information data security management method based on blockchain as claimed in claim 5, It is characterized in that After the target class is split, the number of nodes in the two classes is the same or differs by one node.
7. The scientific research information data security management method based on blockchain as claimed in claim 1, It is characterized in that The hybrid network topology is a network topology that is a hybrid of star and mesh topologies. The specific construction process is: all full nodes form a main cluster, each cluster is recorded as a subcluster, and the hybrid network topology is constructed using the main cluster and the subcluster.
8. The scientific research information data security management method based on blockchain as claimed in claim 1, It is characterized in that The consensus mechanism is calculated using the CE-PBFT algorithm.
9. The scientific research information data security management method based on blockchain as claimed in claim 1, It is characterized in that The use of consensus results to securely manage scientific research information data is specifically: when the consensus results are consistent, the scientific research information data is stored on the blockchain; otherwise, the scientific research information data is not stored on the blockchain.
