A weighted consensus method for blockchain in dynamic heterogeneous environments of 6G

Abstract

This invention discloses a weighted consensus method for blockchain in a dynamic heterogeneous 6G environment. The method includes the following steps: constructing a multi-dimensional node weight dynamic evaluation model, and performing a comprehensive capability evaluation of nodes based on the model to calculate their consensus weights; constructing a set of consensus nodes entitled to participate in weighted voting and a set of candidate nodes that only participate in verification to accumulate reputation, managing the candidate node set and the consensus node set based on the accumulated behavioral reputation value of the nodes to obtain a real-time updated consensus node set; and executing proposals, weighted voting, and final confirmation based on the node consensus weights and the real-time updated consensus node set to obtain a weighted consensus result for the blockchain. This invention can optimize the allocation of consensus weights, reduce consensus reconfiguration overhead, and maintain efficient weighted consensus in a 6G dynamic heterogeneous environment by constructing a multi-dimensional node weight dynamic evaluation model.

Description

Technical Field

[0001] This invention relates to the field of blockchain consensus technology, and specifically to a weighted consensus method for blockchain in a dynamic heterogeneous 6G environment. Background Technology

[0002] As 6G networks evolve and network architecture becomes more distributed, traditional centralized security systems face problems such as single points of failure and poor scalability. Blockchain technology, with its decentralized and tamper-proof characteristics, has become a key technology for building the security foundation of 6G.

[0003] However, existing blockchain consensus methods such as PBFT (Practical Byzantine Fault Tolerance) and the HotStuff consensus protocol assume a static network topology and homogeneous nodes, making them ill-suited for the highly heterogeneous capabilities and frequent dynamic joining and leaving of nodes in 6G environments. Furthermore, existing weighted consensus methods suffer from a single weight dimension and delayed updates, failing to reflect real-time node state changes, resulting in a trade-off between consensus efficiency and security. Summary of the Invention

[0004] To address the aforementioned shortcomings in existing technologies, this invention provides a blockchain-based weighted consensus method for 6G dynamic heterogeneous environments.

[0005] To achieve the above-mentioned objectives, the technical solution adopted by this invention is as follows: A blockchain-based weighted consensus method for 6G dynamic heterogeneous environments includes the following steps: A multi-dimensional node weight dynamic evaluation model is constructed, and a comprehensive capability evaluation of nodes is performed based on the multi-dimensional node weight dynamic evaluation model to calculate the consensus weight of the nodes. Construct a consensus node set that is entitled to participate in weighted voting and a candidate node set that only participates in verification to accumulate reputation. Manage the candidate node set and the consensus node set based on the accumulated reputation value of the node's behavior to obtain a consensus node set that is updated in real time. Based on the consensus weights of nodes and the real-time updated consensus node set, proposals are executed, weighted voting is performed, and final confirmation is achieved to obtain a weighted consensus result on the blockchain.

[0006] Furthermore, the multi-dimensional node weight dynamic evaluation model includes basic capability indicators, network capability indicators, behavioral reputation indicators, and anti-monopoly factor indicators.

[0007] Furthermore, a comprehensive capability assessment of nodes is performed based on a multi-dimensional node weight dynamic evaluation model to obtain the consensus weight of the nodes. The specific process is as follows: Collect and normalize the inherent resource indicators of nodes, including energy level, computing power, geographical stability and continuous online capability, and calculate the basic capability index value of nodes by weighted summation; The system monitors the communication reliability and transmission latency between nodes in real time, normalizes them, and then performs coupled aggregation using the Choquet integral method to calculate the network capability index value of the nodes. Based on the historical voting behavior of nodes, a reputation accumulation model with time decay is adopted, and the behavior reputation index value of nodes is calculated by combining the initial credibility parameter. The anti-monopoly factor index value of a node is calculated based on the number of times it participates in consensus within the sliding window. The consensus weight of a node is calculated by combining its basic capability index, network capability index, behavioral reputation index, and anti-monopoly factor index through power weighting and product.

[0008] Furthermore, the expression for the network capability metric value of a computing node is as follows: in: For nodes Network capability metrics, For communication reliability fuzzy measure function, For nodes Communication reliability, For transmission delay fuzzy measure function, For nodes Transmission delay, For communication reliability With transmission delay fuzzy measure function, This is a function that takes the minimum value.

[0009] Furthermore, the behavioral reputation index value of the calculated node is expressed as follows: in: For nodes At the current block height Behavioral credit index value, For nodes At the current block height The successful component, if the master node receives the node Valid votes, accumulated nodes At the current block height The weight of success , The initial parameters for the credibility of the first identity. For nodes At the current block height The weight of failure, These are the initial parameters for the credibility of the second identity. It is a natural constant. To participate in the consensus vote, This is the growth control coefficient.

[0010] Furthermore, the consensus weight of the calculated node is expressed as follows: in: For nodes At the current block height consensus weight, For nodes Network capability metrics, As the first weighted adjustment index, For nodes At the current block height Behavioral credit index value, As the second weighted adjustment index, For nodes Basic capability index values, As the third weighted adjustment index, For nodes At the current block height The anti-monopoly factor index value.

[0011] Furthermore, the candidate node set and consensus node set are managed based on the cumulative behavioral reputation value of the nodes to obtain a real-time updated consensus node set. The specific process is as follows: In the consensus node set, the master node is determined by rotating according to the consensus weight of the nodes. The verifiable random function of the master node is used to sample candidate nodes from the candidate node set to participate in block verification in order to obtain the cumulative value of the node’s behavior reputation. After a fixed period ends, it is determined whether the accumulated reputation value of the sampled candidate nodes has reached a preset threshold. If so, the node is migrated from the candidate node set to the consensus node set. Otherwise, the node is not migrated from the candidate node set to the consensus node set. At the same time, consensus nodes with accumulated reputation values ​​below the preset threshold in the existing consensus node set are removed to obtain a real-time updated consensus node set.

[0012] Furthermore, based on the consensus weights of the nodes and the real-time updated consensus node set, proposals are executed, weighted voting is performed, and final confirmation is achieved to obtain a weighted consensus result on the blockchain. The specific process is as follows: The master node is used to package new blocks and attach security proofs from history, forming a proposal that is broadcast to the entire network; The nodes in the consensus node set receive proposals, perform multiple legality checks, and sign the proposal block hash with their own private key after the verification is passed, generate a vote and send it back to the master node; After collecting votes using the master node, the signatures are verified and weighted according to the consensus weight of the nodes. It is then determined whether the accumulated weight exceeds the preset proportion of the total weight of the entire network. If so, the collected signatures are aggregated into a quorum certificate using the master node's aggregate signature technology and broadcast to the entire network. We continuously track the latest quorum certificates and make a final commit to the grandfather block according to the three-chain rules, writing it into the immutable ledger to obtain the blockchain's weighted consensus result.

[0013] The beneficial effects of this invention are as follows: (1) This invention constructs a multi-dimensional node weight dynamic evaluation model and conducts a comprehensive capability evaluation of nodes based on the multi-dimensional node weight dynamic evaluation model to obtain the consensus weight of nodes. This process integrates the multi-dimensional attributes of the physical layer (network capability), resource layer (basic capability), behavior layer (reputation) and mechanism layer (anti-monopoly), making the weight allocation more in line with the actual contribution and trust status of nodes, and avoiding the security blind spot caused by relying solely on the number of tokens or static reputation for weight allocation; (2) This invention constructs a consensus node set that is entitled to participate in weighted voting and a candidate node set that only participates in verification to accumulate reputation. It manages the candidate node set and the consensus node set based on the accumulated reputation value of the node's behavior to obtain a consensus node set that is updated in real time. This allows new nodes to accumulate reputation without interfering with the main consensus process. Furthermore, after a fixed period, it processes the membership changes caused by the addition / exit of nodes in batches, avoiding the high communication overhead and consensus oscillation caused by frequent view switching and real-time reconfiguration. This significantly enhances the stability of the system under high frequency node changes. (3) This invention manages the consensus node set based on the cumulative value of the node’s behavior reputation and updates the consensus node set in real time. This process can quickly respond to malicious behavior or performance degradation of nodes and remove them in time, effectively defending against attacks from high-weight corrupt nodes and enhancing the dynamic security defense capability of the system. Attached Figure Description

[0014] Figure 1 A schematic diagram of a blockchain-based weighted consensus method for 6G dynamic heterogeneous environments; Figure 2 This is a comparison chart showing the performance of the present invention's solution with the HotStuff consensus protocol in static and dynamic environments. Detailed Implementation

[0015] The specific embodiments of the present invention are described below to enable those skilled in the art to understand the present invention. However, it should be understood that the present invention is not limited to the scope of the specific embodiments. For those skilled in the art, various changes are obvious as long as they are within the spirit and scope of the present invention as defined and determined by the appended claims. All inventions utilizing the concept of the present invention are protected.

[0016] like Figure 1 As shown, a blockchain-based weighted consensus method for 6G dynamic heterogeneous environments includes steps S1-S3, as detailed below: S1. Construct a multi-dimensional node weight dynamic evaluation model, and conduct a comprehensive capability evaluation of nodes based on the multi-dimensional node weight dynamic evaluation model to calculate the consensus weight of the nodes.

[0017] In an optional embodiment of the present invention, the multi-dimensional node weight dynamic evaluation model includes basic capability indicators, network capability indicators, behavioral reputation indicators, and anti-monopoly factor indicators.

[0018] This invention uses a multi-dimensional node weight dynamic evaluation model to comprehensively evaluate the capabilities of nodes in order to obtain the consensus weight of the nodes. The specific process is as follows: The inherent resource indicators of nodes are collected and normalized, including energy level, computing power, geographical stability, and continuous online capability. These indicators are then weighted and summed to calculate the node's basic capability index value, expressed as: in: For nodes Basic capability index values, For nodes energy levels, For nodes computing power For nodes Geographical stability, For nodes The ability to stay online , , , These are the weighting coefficients for energy level, computing power, geographical stability, and continuous online capability, respectively.

[0019] The communication reliability and transmission latency between nodes are monitored in real time, normalized, and then coupled and aggregated using the Choquet integral method to calculate the network capability index value of the node. The expression is as follows: in: For nodes Network capability metrics, For communication reliability The fuzzy measure function in this invention is used to adjust the emphasis on a single indicator or a synergistic indicator. For nodes Communication reliability, For transmission delay fuzzy measure function, For nodes Transmission delay, For communication reliability With transmission delay fuzzy measure function, This is a function that takes the minimum value.

[0020] Specifically, the computing node of the present invention The communication reliability and transmission delay are expressed as follows: , , , in: For nodes For nodes in the network The normalized value of communication reliability, For nodes For nodes in the network The normalized value of transmission delay, This represents the total number of consensus nodes in the network. To find the maximum value function, For nodes For nodes in the network Communication reliability, To ensure basic communication reliability in 6G dynamic heterogeneous environments, To ensure target communication reliability in 6G dynamic heterogeneous environments, For the target transmission latency in a 6G dynamic heterogeneous environment, For point For nodes in the network Transmission delay, This provides the basic transmission latency for 6G dynamic heterogeneous environments.

[0021] Based on the historical voting behavior of nodes, a reputation accumulation model with time decay is adopted, and the behavioral reputation index value of nodes is calculated by combining the initial credibility parameter. The expression is as follows: in: For nodes At the current block height Behavioral credit index value, For nodes At the current block height The successful component, if the master node receives the node Valid votes, accumulated nodes At the current block height The weight of success , The initial parameters for the credibility of the first identity. For nodes At the current block height The weight of failure, These are the initial parameters for the credibility of the second identity. It is a natural constant. To participate in the consensus vote, This is the growth control coefficient. The larger the value, the slower the growth, meaning the slower the reputation metric value of new nodes increases.

[0022] Specifically, the computing node of the present invention At block height The success and failure components are expressed as follows: , in: For nodes At block height The weight of success The current block height, For block window size, This is the attenuation coefficient, with a value greater than or equal to 0. For nodes At block height The weight of failure, For nodes At the current block height The reputation score is received by the primary node from the secondary node. When voting The value is 1, indicating that the master node has not received a message from the slave node. When voting The value is -2, and the master node When a signature aggregation is completed The value of is 2.

[0023] The anti-monopoly factor index value of a node is calculated based on the number of times it participates in consensus within the sliding window. Its expression is as follows: in: For nodes At the current block height The anti-monopoly factor index value, The penalty intensity coefficient, The larger the value of , the better. The faster the growth, The smaller the size, the stronger the antitrust suppression. To penalize the sensitivity coefficient, When it is greater than 1, Rapid growth will suppress nodes that participate in consensus voting frequently. For nodes At the current block height The number of times participants reached a consensus.

[0024] The consensus weight of a node is obtained by combining its basic capability index, network capability index, behavioral reputation index, and anti-monopoly factor index through a power-weighted multiplication. The expression for this weight is as follows: in: For nodes At the current block height consensus weight, For nodes Network capability metrics, As the first weighted adjustment index, For nodes At the current block height Behavioral credit index value, As the second weighted adjustment index, For nodes Basic capability index values, As the third weighted adjustment index, For nodes At the current block height The anti-monopoly factor index value.

[0025] S2. Construct a consensus node set that is entitled to participate in weighted voting and a candidate node set that only participates in verification to accumulate reputation. Manage the candidate node set and the consensus node set based on the accumulated reputation value of the node's behavior to obtain a consensus node set that is updated in real time.

[0026] In an optional embodiment of the present invention, the present invention manages the candidate node set and the consensus node set based on the cumulative behavioral reputation value of nodes to obtain a consensus node set that is updated in real time. The specific process is as follows: The master node is determined by rotating the nodes in the consensus node set according to their consensus weights. The verifiable random function of the master node is used to sample candidate nodes from the candidate node set to participate in block verification in order to obtain the cumulative value of the node’s behavior reputation.

[0027] Specifically, this invention utilizes a verifiable random function of the master node to sample candidate nodes from the candidate node set, and the expression for calculating the number of sampled candidate nodes is as follows: in: This represents the number of candidate nodes in the sampling. The number of basic sampling nodes The value of is greater than or equal to 1. The growth coefficient, Greater than 0, This represents the number of nodes in the candidate node set.

[0028] After a fixed period ends, it is determined whether the accumulated reputation value of the sampled candidate nodes has reached a preset threshold. If so, the node is migrated from the candidate node set to the consensus node set. Otherwise, the node is not migrated from the candidate node set to the consensus node set. At the same time, consensus nodes with accumulated reputation values ​​below the preset threshold in the existing consensus node set are removed to obtain a real-time updated consensus node set.

[0029] Specifically, the fixed period in this invention is 80 blocks.

[0030] S3, based on the consensus weight of nodes and the real-time updated consensus node set, executes proposals, weighted voting, and final confirmation to obtain a weighted consensus result on the blockchain.

[0031] In an optional embodiment of the present invention, the present invention executes proposal, weighted voting, and final confirmation based on the consensus weights of nodes and a real-time updated consensus node set to obtain a weighted consensus result of the blockchain. The specific process is as follows: The master node is used to package a new block and attach a security proof from history, forming a proposal that is broadcast to the entire network.

[0032] Specifically, the master node packages and generates new blocks. The block header must include at least Epoch, View, and justifyQC. Epoch is a fixed period. View is the view itself. justifyQC is a security proof from history, pointing to a parent block or an ancestor block, used to provide security proof for this proposal.

[0033] The nodes in the consensus node set receive proposals, perform multiple legality checks, and after verification, sign the proposal block hash with their own private key, generate a vote, and send it back to the master node.

[0034] Specifically, the multiple validity checks include block structure, signature, transaction validity, validity of justifyQC signature aggregation, validity of justifyQC signer set, and whether the master node identity matches the master node of the current round.

[0035] After collecting votes using the master node, the signatures are verified and weighted according to the consensus weight of the nodes. It is then determined whether the accumulated weight exceeds the preset proportion of the total weight of the entire network. If so, the multiple collected signatures are aggregated into a quorum certificate using the master node's aggregate signature technology and broadcast to the entire network.

[0036] Specifically, the master node receives votes from different nodes and verifies the correctness of the signatures; then, based on the weight table, it calculates the cumulative weight of the nodes that have received votes. When the cumulative weight Exceeding the total weight of the system The weighted threshold, i.e. At that time, the master node uses aggregate signature technology to combine the individual signatures into a quorum certificate (QC). Finally, the master node uses the quorum certificate as the justifyQC for subsequent view proposals and broadcasts the quorum certificate to the entire network.

[0037] We continuously track the latest quorum certificates and make a final commit to the grandfather block according to the three-chain rules, writing it into the immutable ledger to obtain the blockchain's weighted consensus result.

[0038] Specifically, in the three-chain rule, the blocks generated by each view form a continuous chain with the quorum certificate; when each node receives any new quorum certificate, it updates justifyQC=max(justifyQC, QC( Then, each node submits a block when the following three-chain rules are met: three blocks G, P, and C have a continuous parent-child relationship, where P is a child block of G and C is a child block of P; both QC(P) and QC(C) are valid. Finally, when the three-chain rules are met, the node determines the grandparent block G as the final commit, that is, the grandparent block G is the weighted consensus result of the blockchain, and writes it into the local ledger, executes transactions, and updates the state.

[0039] Simulation experiment: As shown in Figure 2, this invention compares the consensus latency of its proposed solution with the HotStuff consensus protocol under different node sizes (10-60 nodes) in static and dynamic environments. The dynamic environment refers to a network where nodes join and leave, while the consensus committee remains unchanged in the static environment. Under different node sizes, the network performance distribution of the nodes is as follows: 30% high-performance nodes, such as base stations and edge servers, have a latency of approximately 10ms and a reliability of 97%, i.e., a 3% packet loss rate; 40% medium-performance nodes, such as mobile terminals and phones, have a latency of approximately 35ms and a reliability of 90%; 30% low-performance nodes, such as IoT devices and sensors, have a latency of approximately 80ms and a reliability of 75%. Experimental results show that the consensus latency of this invention is lower than that of the HotStuff consensus protocol in both static and dynamic environments, with an average performance improvement of approximately 5.0% in the static environment and approximately 3.7% in the dynamic environment.

[0040] Those skilled in the art will recognize that the embodiments described herein are intended to help the reader understand the principles of the invention, and should be understood that the scope of protection of the invention is not limited to such specific statements and embodiments. Those skilled in the art can make various other specific modifications and combinations based on the technical teachings disclosed in this invention without departing from the spirit of the invention, and these modifications and combinations are still within the scope of protection of this invention.

Claims

1. A blockchain-based weighted consensus method for 6G dynamic heterogeneous environments, characterized in that, Includes the following steps: A multi-dimensional node weight dynamic evaluation model is constructed, and a comprehensive capability evaluation of nodes is performed based on the multi-dimensional node weight dynamic evaluation model to calculate the consensus weight of the nodes. Construct a consensus node set that is entitled to participate in weighted voting and a candidate node set that only participates in verification to accumulate reputation. Manage the candidate node set and the consensus node set based on the accumulated reputation value of the node's behavior to obtain a consensus node set that is updated in real time. Based on the consensus weights of nodes and the real-time updated consensus node set, proposals are executed, weighted voting is performed, and final confirmation is achieved to obtain a weighted consensus result on the blockchain.

2. The blockchain weighted consensus method for 6G dynamic heterogeneous environments according to claim 1, characterized in that, The multidimensional node weight dynamic evaluation model includes basic capability indicators, network capability indicators, behavioral reputation indicators, and anti-monopoly factor indicators.

3. The blockchain weighted consensus method for 6G dynamic heterogeneous environments according to claim 2, characterized in that, A multi-dimensional node weight dynamic evaluation model is used to comprehensively evaluate the capabilities of nodes in order to obtain their consensus weights. The specific process is as follows: Collect and normalize the inherent resource indicators of nodes, including energy level, computing power, geographical stability and continuous online capability, and calculate the basic capability index value of nodes by weighted summation; The system monitors the communication reliability and transmission latency between nodes in real time, normalizes them, and then performs coupled aggregation using the Choquet integral method to calculate the network capability index value of the nodes. Based on the historical voting behavior of nodes, a reputation accumulation model with time decay is adopted, and the behavior reputation index value of nodes is calculated by combining the initial credibility parameter. The anti-monopoly factor index value of a node is calculated based on the number of times it participates in consensus within the sliding window. The consensus weight of a node is calculated by combining its basic capability index, network capability index, behavioral reputation index, and anti-monopoly factor index through power weighting and product.

4. The blockchain weighted consensus method for 6G dynamic heterogeneous environments according to claim 3, characterized in that, The network capability metric value of a computing node is expressed as follows: in: For nodes Network capability metrics, For communication reliability fuzzy measure function, For nodes Communication reliability, For transmission delay fuzzy measure function, For nodes Transmission delay, For communication reliability With transmission delay fuzzy measure function, This is a function that takes the minimum value.

5. The blockchain weighted consensus method for 6G dynamic heterogeneous environments according to claim 3, characterized in that, The expression for the behavioral reputation metric value of a computing node is as follows: in: For nodes At the current block height Behavioral credit index value, For nodes At the current block height The successful component, if the master node receives the node Valid votes, accumulated nodes At the current block height The weight of success , The initial parameters for the credibility of the first identity. For nodes At the current block height The weight of failure, These are the initial parameters for the credibility of the second identity. It is a natural constant. To participate in the consensus vote, This is the growth control coefficient.

6. The blockchain weighted consensus method for 6G dynamic heterogeneous environments according to claim 3, characterized in that, The consensus weight of the compute nodes is expressed as follows: in: For nodes At the current block height consensus weight, For nodes Network capability metrics, As the first weighted adjustment index, For nodes At the current block height Behavioral credit index value, As the second weighted adjustment index, For nodes Basic capability index values, As the third weighted adjustment index, For nodes At the current block height The anti-monopoly factor index value.

7. The blockchain weighted consensus method for 6G dynamic heterogeneous environments according to claim 1, characterized in that, The candidate node set and consensus node set are managed based on the cumulative behavioral reputation value of nodes to obtain a consensus node set that is updated in real time. The specific process is as follows: In the consensus node set, the master node is determined by rotating according to the consensus weight of the nodes. The verifiable random function of the master node is used to sample candidate nodes from the candidate node set to participate in block verification in order to obtain the cumulative value of the node’s behavior reputation. After a fixed period ends, it is determined whether the accumulated reputation value of the sampled candidate nodes has reached a preset threshold. If so, the node is migrated from the candidate node set to the consensus node set. Otherwise, the node is not migrated from the candidate node set to the consensus node set. At the same time, consensus nodes with accumulated reputation values ​​below the preset threshold in the existing consensus node set are removed to obtain a real-time updated consensus node set.

8. The blockchain weighted consensus method for 6G dynamic heterogeneous environments according to claim 1, characterized in that, Based on the consensus weights of nodes and the real-time updated consensus node set, the process of proposing, weighted voting, and final confirmation is executed to obtain a weighted consensus result on the blockchain. The specific process is as follows: The master node is used to package new blocks and attach security proofs from history, forming a proposal that is broadcast to the entire network; The nodes in the consensus node set receive proposals, perform multiple legality checks, and sign the proposal block hash with their own private key after the verification is passed, generate a vote and send it back to the master node; After collecting votes using the master node, the signatures are verified and weighted according to the consensus weight of the nodes. It is then determined whether the accumulated weight exceeds the preset proportion of the total weight of the entire network. If so, the collected signatures are aggregated into a quorum certificate using the master node's aggregate signature technology and broadcast to the entire network. We continuously track the latest quorum certificates and make a final commit to the grandfather block according to the three-chain rules, writing it into the immutable ledger to obtain the blockchain's weighted consensus result.

Images