Novel communication mechanism based on block chain technology and wireless Mesh network

By adopting a new communication mechanism based on blockchain technology in wireless Mesh networks, combining the national cryptographic encryption algorithm and Raft algorithm, the shortcomings of wireless Mesh network in Byzantine errors and bandwidth consumption are solved, and high-destruction and secure communication are achieved system.

CN119030988APending Publication Date: 2024-11-26ZHONGKE QUANWEI TECH (SUZHOU) CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411040593.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-31
Publication Date
2024-11-26

AI Technical Summary

Technical Problem

The existing wireless Mesh network has shortcomings in the face of Byzantine errors and bandwidth consumption. Traditional fault-tolerant algorithms cannot take into account both, and are prone to being attacked by malicious nodes, causing the network to be paralyzed.

Method used

Using a new communication mechanism based on blockchain technology, the encryption algorithm of the blockchain network is transformed into the state-owned secrets, combined with the wireless Mesh network, and a multi-round message sending and confirmation mechanism is adopted to elect candidate nodes and Leader nodes, and the Raft algorithm is used to perform the election. Voting elections, using the National Secret SM2, SM3 and SM4 algorithms to replace traditional algorithms, ensuring the system's Byzantine fault tolerance and bandwidth efficiency.

Benefits of technology

It realizes high resistance to destruction and traceability in wireless Mesh networks, ensures the stability and security of the communication system, and reduces bandwidth consumption and effectively screens out malicious and faulty nodes.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119030988A_ABST
    Figure CN119030988A_ABST
Patent Text Reader

Abstract

The invention discloses a novel communication mechanism based on a block chain technology and a wireless Mesh network, solves the problems that a conventional Byzantine fault-tolerant algorithm and a fault-tolerant algorithm cannot meet fault-tolerant malicious nodes at the same time and the communication consumption bandwidth is small, and adopts the main technical scheme that the block chain technology is added to a Mesh network architecture, and under the communication mechanism, the Byzantine fault-tolerant algorithm and the Byzantine fault-tolerant algorithm cannot meet the fault-tolerant malicious nodes at the same time. A novel consensus algorithm BLPBFT + Raft algorithm is provided, an influence shadow i of each node in each organization is calculated and compared, i is obtained by combining bandwidth evaluation of all nodes and a time error between sending of a dynamic secret order and standard time, the node with the maximum i is finally selected as a candidate node, a leader node is elected from the candidate node in a unified conventional voting mode, and the leader node is selected as a leader node. The algorithm combines the advantages of a BFT (Byzantine Fault-tolerant Algorithm) and a CFT (Fault Fault-tolerant Algorithm) algorithm, and not only can fault-tolerant Byzantine error nodes, but also reduces the consumption of communication bandwidth compared with the traditional BFT algorithm.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of Mesh network architecture communication technology, and more specifically, to a novel communication mechanism based on blockchain technology and wireless Mesh network. Background Art

[0002] With the advent of the information warfare era, battlefield communications serve as a basic means of combat command. Due to the complex battlefield environment, it is impossible to build a communication network using fixed communication facilities. Therefore, to ensure the vertical and horizontal transmission of information on the battlefield, the system is required to have high mobility and flexibility, dynamic self-organization performance, and high anti-interference and anti-destruction capabilities.

[0003] Wireless Mesh Network is a new type of broadband wireless network structure, that is, a high-capacity, high-speed distributed network. It is different from traditional networks in that it has the advantages of dynamic and multi-hop. The way they process messages is to pass information packets from one node to another. Each node of the wireless mesh network can be used as an access terminal, and can also have routing and information forwarding functions, with extremely high networking freedom.

[0004] The traditional Byzantine fault-tolerant algorithm BFT can tolerate Byzantine fault nodes, but each consensus proposal requires a large amount of bandwidth consumption. The traditional fault-tolerant algorithm CFT, although it consumes less bandwidth, does not have the Byzantine fault-tolerant function (it only has a certain ability to tolerate downtime and faulty nodes), and is easily attacked by malicious nodes, causing the entire network to be paralyzed. The new consensus algorithm BL_PBFT+Raft algorithm designed in this mechanism can well take into account the advantages of Byzantine fault tolerance and low bandwidth consumption. Summary of the invention

[0005] In order to overcome the above shortcomings, the purpose of the present invention is to provide a new communication mechanism based on blockchain technology and wireless Mesh network that can take into account Byzantine fault tolerance and low bandwidth consumption.

[0006] In order to achieve the above objectives, the technical solution adopted by the present invention is a new communication mechanism based on blockchain technology and wireless Mesh network, which is characterized by transforming the encryption algorithm involved in the blockchain network into a national secret, allocating Mesh routers and nodes to the organized clients, and includes the following steps:

[0007] S1. Nodes in the organization prepare to reach consensus by sending and confirming multiple rounds of messages in sequence. The sending nodes of messages in two adjacent rounds are independent of each other, and other nodes other than the sending nodes in each round confirm and feedback the messages in the current round.

[0008] S2, nodes in the organization conduct an election phase, repeating multiple rounds of message sending and confirmation steps in S1. The first round of messages also includes the influence factor i, and the point with the largest i is confirmed as the candidate node of this organization, where the influencing factors of i include T and AVG(B) confirmed by 2f other nodes, T is the error time between the time when the node sends the dynamic secret command to other nodes after confirmation in the first round of messages in the preparation phase and the standard time, AVG(B) is the average value of b of all other nodes' evaluation of their own node bandwidth in the first round of messages in the preparation phase, and f is the maximum number of Byzantine error nodes that this organization can accommodate;

[0009] S3. All organizations repeat steps S1-S2 to select all candidate nodes and conduct a final election using the regular voting method of the Raft algorithm to determine the Leader node.

[0010] Furthermore, each organization includes a master node and several slave nodes, and the master node sends a pre-prepare message to all slave nodes.<PRE-PREPARE,v,n,d> , b>, where v is the view number, n is the message sequence number, and d is the hash value generated based on b. All slave nodes in the organization verify n, v, and d. After the verification, the slave nodes send b and T to other nodes respectively;

[0011] Any slave node a that passes the verification sends a preparation message to all other nodes in the organization

[0012] <PREPARE,v,n,d,ad> , where ad is the address of node a, and nodes other than node a verify n, v, and d in the prepare message;

[0013] After verification, nodes other than node a will confirm the message<COMMIT,v,n,d> It is sent to all other nodes in the organization respectively, and other nodes verify n, v, and d. When each node receives confirmation messages from 2f other nodes, it obtains the bandwidth evaluation table of other nodes and the bandwidth average AVG(B), and thus obtains the influence factor of each node i=AVG(B)*p / T*q, where p and q are weights. If T is 0, it is discarded.

[0014] Furthermore, the national encryption transformation includes replacing the RSA algorithm with the national encryption SM2 algorithm, replacing the hash algorithm with SM3, replacing the symmetric encryption algorithm with SM4, and parsing the national encryption certificate by rewriting the x509 file or redefining the x509 certificate generation and parsing method.

[0015] Furthermore, the voting final election in step S3 includes: all candidate nodes perform the following operations:

[0016] Add 1 to your term number;

[0017] Vote for yourself to elect a new Leader node;

[0018] Reset the local timer;

[0019] Send voting requests to other servers in the network,

[0020] All other nodes follow the following voting rules:

[0021] Each node can only cast one vote in one term, and can only vote for the first qualified node that sends a request to itself;

[0022] The message requesting a vote needs to include the current term number of the requester;

[0023] Voters will only vote for servers whose term numbers are greater than or equal to their current term numbers.

[0024] Furthermore, the node may interact with an external terminal, and the external terminal may be authenticated by an administrator.

[0025] The beneficial effects of the present invention are:

[0026] 1. By using the wireless mesh network as the network framework, the communication system can have multi-hop communication characteristics, which has higher networking freedom and stronger anti-destruction capability than ordinary wired communication systems;

[0027] 2. Add blockchain technology to the Mesh network architecture to ensure the traceability and tamper-proof security of communication information;

[0028] 3. By comparing the impact factor i of each node, malicious nodes and faulty nodes can be screened out while ensuring that the communication between the selected candidate nodes and leader nodes is more stable. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] Figure 1 A schematic diagram of the mutual inspection process of the node preparation process within an organization according to a preferred embodiment of the present invention;

[0031] Figure 2 It is a schematic diagram of the overall process of a preferred embodiment of the present invention; DETAILED DESCRIPTION

[0032] The preferred embodiments of the present invention are described in detail below in conjunction with the accompanying drawings so that the advantages and features of the present invention can be more easily understood by those skilled in the art, thereby making a clearer and more definite definition of the protection scope of the present invention.

[0033] See attached Figure 1-Figure 2As shown, the novel communication mechanism based on blockchain technology and wireless Mesh network in this embodiment includes the following steps: performing national encryption transformation on the encryption algorithm involved in the blockchain network, allocating Mesh routers and nodes to the organized clients, and including the following steps:

[0034] S1. Nodes in the organization prepare to reach consensus by sending and confirming multiple rounds of messages in sequence. The sending nodes of messages in two adjacent rounds are independent of each other, and other nodes other than the sending nodes in each round confirm and feedback the messages in the current round.

[0035] S2, nodes in the organization conduct an election phase, repeating multiple rounds of message sending and confirmation steps in S1. The first round of messages also includes the influence factor i, and the point with the largest i is confirmed as the candidate node of this organization, where the influencing factors of i include T and AVG(B) confirmed by 2f other nodes, T is the error time between the time when the node sends the dynamic secret command to other nodes after confirmation in the first round of messages in the preparation phase and the standard time, AVG(B) is the average value of b of all other nodes' evaluation of their own node bandwidth in the first round of messages in the preparation phase, and f is the maximum number of Byzantine error nodes that this organization can accommodate;

[0036] S3. All organizations repeat steps S1-S2 to select all candidate nodes and conduct a final election using the regular voting method of the Raft algorithm to determine the Leader node.

[0037] For the national encryption transformation, the algorithm is transformed from two aspects. One is to start from BCCSP (blockchain cryptographic service provider), by transforming the sw and pkcs11 parts in BCCSP to provide software and hardware support. Among them, sw provides a set of cryptographic algorithms, and adds national encryption algorithm interface support in the middle. Specifically, the national encryption SM2 algorithm replaces the RSA asymmetric encryption algorithm, the national encryption SM3 replaces the hash algorithms such as MD5 / SHA-1 / SHA-256, and the national encryption SM4 replaces the international symmetric encryption algorithms such as DES / AES. The transformed communication system is more suitable for domestic security applications. In addition, the certificate parsing problem of national encryption is solved by rewriting the x509 file or redefining the x509 certificate generation and parsing method in Fabric.

[0038] For steps S1-S2, this solution first divides all application terminals into several identical large organizations in a fixed-size honeycomb shape. The large organization is composed of several small organizations. In each small organization, a master node is customized to send a pre-prepared message to all other slave nodes.<PRE-PREPARE,v,n,d> ,b>, in this message, the evaluation b is not included to ensure that the message is small enough and to minimize bandwidth consumption. After all slave nodes in the area receive the pre-prepared message, they will perform the first verification. The slave nodes that have completed the verification of n, v, and d will send the corresponding bandwidth evaluation b and the error time T between the dynamic secret command and the standard time to the remaining nodes (including the master node). If not sent, T is 0. At this time, it is equivalent to all nodes maintaining an evaluation information table based on b, and each node can obtain its own bandwidth evaluation information from b.

[0039] After the first check is completed, the custom slave node a (a can be all other slave nodes excluding the master node) sends a preparation message to all other nodes in the organization (including the master node)

[0040] <PREPARE,v,n,d,ad> , other nodes start the second check to see if the number v matches their local view Figure 1 The preparation phase is now completed, which ensures that all normal nodes in step S1 agree on the request sequence number n in the same view v, and then the system enters the confirmation phase.

[0041] All nodes except node a (including the master node) send confirmation messages to other nodes except themselves<COMMIT,v,n,d> , other nodes in the organization perform a third check. After the n, v, and d checks are completed, when the current node receives 2f+1 (f is the maximum number of Byzantine error nodes that this organization can accommodate) identical confirmation messages, including itself, the current node derives and maintains a consensus bandwidth evaluation table, from which other nodes' evaluations of their own bandwidth can be obtained. For example, node X obtains the evaluations of itself by Y, Z...N (n-1) nodes, namely Byx, Bzx...Bnx, and obtains the average bandwidth value.

[0042] AVG(Bx)=(Byx+Bzx+...Bnx) / (n-1)

[0043] Then, combined with the T value in step S2, the time when each node issues the dynamic secret command is automatically recorded by the device and broadcast to other nodes during the election process, thereby obtaining the T value, that is, the calculation method of the influence factor i that affects each node is finally obtained in step S5:

[0044] i=AVG(B)*p / T*q

[0045] Where p and q are weights, if T is 0, the proposal is discarded.

[0046] So far, all nodes in this organization have completed three mutual checks. The malicious nodes are screened out based on the maximum number of Byzantine error nodes. The intact nodes left after the screening can obtain an impact factor i based on the average value AVG(B) evaluated based on the bandwidth of the remaining nodes and the error time T between sending dynamic secret commands and the standard time, which is convenient for the subsequent election of candidate nodes.

[0047] When electing candidate nodes, as in step S3, the above three mutual verification processes are repeated, and 2f+1 (including itself) confirmation messages are used as the evaluation criteria. The evaluation process adds the impact factor i for further evaluation. i is proportional to the value of the bandwidth evaluation average value AVG(B) divided by the error time T. Therefore, the larger i is, the larger the bandwidth of the current node is, the smaller the error time is, and the more suitable it is to be used as a candidate node for communication. The specific operation can be as follows:

[0048] Customize a proxy node to send a pre-prepare message to all nodes in the region except itself

[0049] <<PRE-PREPARE,v,n,d,> m,i>, where v is the view number, n is the sequence number, d is the hash value generated based on m, and i is the impact factor. Candidate nodes are selected by calculating and comparing the size of the impact factor. When v, n, d pass a check, the custom node a will send a preparation message to all other nodes in the organization.<PREPARE,v,n,d,a> ,After the second verification, (m,v,n,a,i) is recorded in its message log, and all nodes send proposals to other nodes<COMMIT,v,n,d> After receiving the same confirmation message from 2f other nodes, the replica node writes the final election result into the message log, and the candidate node (Candidate) of this organization is selected.

[0050] For step S3, after all organizations repeat steps S1-S2, all the candidate nodes that are elected conduct a Raft algorithm regular voting final election to obtain the Leader node. The Raft regular voting final election includes: all candidate nodes perform the following operations:

[0051] Add 1 to your term number;

[0052] Vote for yourself to elect a new Leader node;

[0053] Reset the local timer;

[0054] Send voting requests to other servers in the network,

[0055] All other nodes follow the following voting rules:

[0056] Each node can only cast one vote in one term, and can only vote for the first qualified node that sends a request to itself;

[0057] The message requesting a vote needs to include the current term number of the requester;

[0058] Voters will only vote for servers whose term numbers are greater than or equal to their current term numbers.

[0059] After receiving votes from the majority of nodes, this candidate node becomes the Leader node. When a proposal is made, it can be submitted to the Leader node after it is endorsed by the majority of endorsing nodes. The Leader node sorts, packages, and distributes blocks for transactions to update the data ledger. The subsequent channel creation, channel configuration update, and client response are all completed by the Leader node, and other nodes are responsible for responding to requests from the Leader node.

[0060] When the outside world needs to add a new device node, the administrator will issue a certificate of a node to a terminal user who has passed reliable authentication. The terminal can then use this certificate to interact with the node to which the certificate belongs, and then participate in the operation of the blockchain network and realize the function of sending and receiving information on this communication system.

[0061] The above implementation modes are only for illustrating the technical concept and features of the present invention, and their purpose is to enable people familiar with this technology to understand the content of the present invention and implement it, and they cannot be used to limit the protection scope of the present invention. Any equivalent changes or modifications made according to the spirit of the present invention should be included in the protection scope of the present invention.

Claims

1. A new communication mechanism based on blockchain technology and wireless Mesh network, characterized by The encryption algorithm involved in the blockchain network is transformed into a national secret, and Mesh routers and nodes are allocated to the organized clients, including the following steps: S1. Nodes in the organization prepare to reach consensus by sending and confirming multiple rounds of messages in sequence. The sending nodes of messages in two adjacent rounds are independent of each other, and other nodes other than the sending nodes in each round confirm and feedback the messages in the current round. S2, nodes in the organization conduct an election phase, repeating multiple rounds of message sending and confirmation steps in S1. The first round of messages also includes the influence factor i, and the point with the largest i is confirmed as the candidate node of this organization, where the influencing factors of i include T and AVG(B) confirmed by 2f other nodes, T is the error time between the time when the node sends the dynamic secret command to other nodes after confirmation in the first round of messages in the preparation phase and the standard time, AVG(B) is the average value of b of all other nodes' evaluation of their own node bandwidth in the first round of messages in the preparation phase, and f is the maximum number of Byzantine error nodes that this organization can accommodate; S3. All organizations repeat steps S1-S2 to select all candidate nodes and conduct a final election using the regular voting method of the Raft algorithm to determine the Leader node.

2. The novel communication mechanism based on blockchain technology and wireless Mesh network according to claim 1 is characterized in that The specific steps of sending and confirming multiple rounds of messages in the S1-S2 steps are as follows: Each organization includes a master node and several slave nodes. The master node sends a pre-preparation message to all slave nodes.<PRE-PREPARE,v,n,d> , b>, where v is the view number, n is the message sequence number, and d is the hash value generated based on b. All slave nodes in the organization verify n, v, and d. After the verification, the slave nodes send b and T to other nodes respectively; Any slave node a that passes the verification sends a preparation message to all other nodes in the organization<PREPARE,v,n,d,ad> , where ad is the address of node a, and nodes other than node a verify n, v, and d in the prepare message; After verification, nodes other than node a will confirm the message<COMMIT,v,n,d> It is sent to all other nodes in the organization respectively, and other nodes verify n, v, and d. When each node receives confirmation messages from 2f other nodes, it obtains the bandwidth evaluation table of other nodes and the bandwidth average AVG(B), and thus obtains the influence factor of each node i=AVG(B)*p / T*q, where p and q are weights. If T is 0, it is discarded.

3. According to claim 1, the novel communication mechanism based on blockchain technology and wireless Mesh network is characterized by: The national secret transformation includes replacing the RSA algorithm with the national secret SM2 algorithm, replacing the hash algorithm with SM3, replacing the symmetric encryption algorithm with SM4, and parsing the national secret encryption certificate by rewriting the x509 file or redefining the x509 certificate generation and parsing method.

4. The novel communication mechanism based on blockchain technology and wireless mesh network according to claim 1 is characterized in that The voting final election in step S3 includes: all candidate nodes perform the following operations: Add 1 to your term number; Vote for yourself to elect a new Leader node; Reset the local timer; Send voting requests to other servers in the network, All other nodes follow the following voting rules: Each node can only cast one vote in one term, and can only vote for the first qualified node that sends a request to itself; The message requesting a vote needs to include the current term number of the requester; Voters will only vote for servers whose term numbers are greater than or equal to their current term numbers.

5. According to claim 1, the novel communication mechanism based on blockchain technology and wireless mesh network is characterized by: The node can interact with an external terminal, and the external terminal is authenticated by an administrator.