CN111182510A - Industrial Internet of things node consensus method based on block chain - Google Patents
Industrial Internet of things node consensus method based on block chain Download PDFInfo
- Publication number
- CN111182510A CN111182510A CN202010023446.1A CN202010023446A CN111182510A CN 111182510 A CN111182510 A CN 111182510A CN 202010023446 A CN202010023446 A CN 202010023446A CN 111182510 A CN111182510 A CN 111182510A
- Authority
- CN
- China
- Prior art keywords
- node
- block
- nodes
- things
- industrial internet
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/06—Authentication
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The invention relates to a block chain-based industrial Internet of things node consensus method, and belongs to the technical field of industrial Internet of things safety. The method comprises the following steps: the accounting node election method comprises the steps of comprehensively evaluating node behaviors through forwarding rate, packet loss rate and node processing delay, monitoring the behaviors of the common nodes and cluster head nodes in a bidirectional mode, mutually monitoring the behaviors of the common nodes and the cluster head nodes, selecting node domains managed by the first 21 cluster head nodes in a cluster head node credit score ranking table, and electing accounting nodes according to node residual energy, credit scores and token numbers in the node domains; the block confirmation method is characterized in that when a common node verifies a block, if the block passes verification, the result is returned to a sink node, a certain token can be bet, if the final consensus result is consistent with the bet result, the total bet token number can be obtained in proportion, and the sink node has the final decision-making right and determines whether consensus succeeds. The method can be well suitable for the application scene of the industrial Internet of things and meets certain throughput performance requirements.
Description
Technical Field
The invention belongs to the technical field of industrial Internet of things safety, and relates to a block chain-based industrial Internet of things node consensus method.
Background
The industrial internet of things is widely applied, so that while the industrial production efficiency and decision intelligence are improved, severe information security risks are faced, for example, a large amount of malicious network attack activities are suffered, an attacker utilizes unsafe industrial internet of things equipment and weak internal control mechanisms to invade and destroy the industrial internet of things, the invasion comprises illegal behaviors or malicious attacks, for example, equipment data or instructions are tampered, forged and the like, the industrial equipment can not normally operate, even the product quality is damaged due to wrong instructions and the like, and therefore, the industrial internet of things security has important significance.
The block chain is a distributed database which connects blocks containing data in a chain structure in a time sequence and ensures the blocks to be unchangeable and unforgeable by a cryptographic algorithm. The industrial Internet of things system using the block chain technology records data recognized by most of nodes in a distributed database through participation consensus of the nodes, so that the industrial Internet of things data can be effectively prevented from being tampered, and the existing block chain consensus mechanisms comprise POS (entitlement certification mechanism), POW (workload certification mechanism), PBFT (practical Byzantine fault-tolerant mechanism) and the like, which have the problems of low performance and are limited by factors such as energy and computing power of the nodes. The data volume of the industrial Internet of things is large at the present stage, the data integrity is difficult to guarantee, and the data security of the industrial Internet of things is well guaranteed by utilizing the non-tampering performance of the block chain; the existing consensus algorithm cannot be directly applied to specific scenes of the industrial internet of things, mainly because of different performance bottlenecks and applicable scenes, and therefore a block chain consensus algorithm applicable to the industrial internet of things needs to be constructed urgently.
Disclosure of Invention
In view of the above, the present invention provides a block chain-based node consensus method for an industrial internet of things, which solves the problem that the conventional block chain consensus algorithm cannot be directly applied to the industrial internet of things, and simultaneously meets a certain throughput performance requirement.
In order to achieve the purpose, the invention provides the following technical scheme:
an industrial Internet of things node consensus method based on a block chain comprises a light-weight block chain accounting node election method and a block confirmation method which are applicable to the industrial Internet of things;
the accounting node election method specifically comprises the following steps:
s1: layering and clustering through a LEACH algorithm;
s2: in the data stable transmission stage, node behaviors are comprehensively judged through the forwarding rate, the packet loss rate and the node processing delay, the common node and the cluster head node supervise the behaviors of the other side in a two-way mode, and the cluster head nodes supervise the behaviors of each other;
s3: in a block chaining block time interval, a sink node performs ranking from large to small through credit scores of cluster head nodes to generate a candidate node domain list, the first 21 candidate node domains are selected, the residual energy, the node credit scores and the node token numbers of the nodes managed by the cluster head nodes are considered in each node domain, one node is selected as an accounting node, after an accounting node set is selected, one node is selected from the 21 accounting nodes as a block-out node which is commonly identified in the current round through generating random numbers which are 1-21, and finally, the accounting node selection result is recorded in a block chain network as a transaction issue;
the block confirmation method specifically comprises the following steps:
s4: the accounting node packs the collected data and puts the data into blocks according to the time stamps in an ordering mode, the blocks are issued to adjacent common nodes, the blocks are mutually transmitted among the common nodes, the common nodes verify the legality of the blocks, and if the blocks are legal, a message of 'affirmation | | block ID | | | affirmation node ID' is replied to the aggregation node;
s5: if the sink node receives the reply message which exceeds 2/3 of the total number of the common nodes, the sink node independently verifies the validity of the block, and if the block passes the verification of the sink node, the sink node broadcasts a 'receiving block + block ID' message to the whole network;
s6: each node records the message broadcasted to the whole network by the aggregation node into a local log, and the nodes in the accounting node set connect the block into a block chain.
Further, the step S1 specifically includes:
s11: randomly selecting 5% of total nodes as temporary cluster heads, and selecting the nearest cluster heads for adding by the rest nodes according to the distance from the cluster heads;
s12: after the initial clustering is completed, each cluster obtains a cluster head threshold of the node according to the residual energy of the nodes in the cluster, the nodes with the random numbers smaller than the cluster head threshold generated by the nodes in the cluster are cluster head nodes by generating random numbers, and the data stable transmission stage is started after the clustering is completed.
Further, in step S2, in the data stable transmission phase, the normal node can directly refer to the aggregation node for the abnormal communication of the cluster head node, and the credit score of the node is reduced by 1 every time the abnormal communication is found.
Further, the step S2 specifically includes:
the communication quality is defined as:
Q＝α*DT+(1-FR)*λ+β*Rs。
wherein Q represents communication quality, DT, FR, Rsrespectively representing the processing delay, the forwarding rate and the packet loss rate of the nodes of the industrial Internet of things, wherein α, lambda and β are weight proportions of the processing delay, the forwarding rate and the packet loss rate of the nodes of the industrial Internet of things, necessary adjustment can be carried out according to specific scenes of the industrial Internet of things, a threshold value F is set, and the number of times of high-quality communication is defined as CsThe number of failed communications is CfWhen Q < F, CsIncrease by 1, otherwise CfIncreasing by 1; defining node quality from Beta distribution
if eta is smaller than a certain threshold value, the node is judged to be an abnormal node, and the credit score is reduced by 1.
Further, in step S3, the selected billing node does not participate in the election in the next 3 rounds.
Further, in the step S3, a section is definedThe point residual energy is E, the credit score of the node is nu, the number of tokens is n, and the comprehensive quality of the node of the industrial Internet of things is defined as
Wherein, kappa,
Mu respectively represents the weight proportion of the node residual energy, the node credit score and the node owned token number, and can be properly adjusted according to the specific scene of the industrial Internet of things; the higher the comprehensive quality of the node is, the higher the probability of being elected to enter the accounting node set is.
Further, in step S4, when the regular node replies a "confirm | | block ID | | | confirm node ID" message to the sink node, the regular node may bet whether the verification of the token number bet block of the regular node is successful, if the block passes the verification of the sink node, the regular node may divide the total token number bet according to the ratio of the bet token to the passing verification, and vice versa.
Further, in step S5, the verifying the tile includes the following steps:
1) checking whether the ID of the block is legal, namely, the ID of the block is arranged from front to back in sequence;
2) checking whether the hash value of the previous block in the block header is the same as the hash value of the previous block;
3) check if the timestamp is legal, i.e. the current blockchain UNIX timestamp must be strictly greater than the median of the first n blocktimestamps.
The invention has the beneficial effects that: the method combines the characteristics that the wireless sensor network hierarchical routing in the industrial Internet of things is combined and each node is organized into a cluster, and the block chain technology is combined with the industrial Internet of things, so that the method can be better suitable for the application scene of the industrial Internet of things and meet the requirements of the industrial Internet of things on the throughput performance.
Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objectives and other advantages of the invention may be realized and attained by the means of the instrumentalities and combinations particularly pointed out hereinafter.
Drawings
For the purposes of promoting a better understanding of the objects, aspects and advantages of the invention, reference will now be made to the following detailed description taken in conjunction with the accompanying drawings in which:
FIG. 1 is a structural diagram of an industrial Internet of things wireless sensor network;
FIG. 2 is a flow chart of an industrial Internet of things node consensus method according to the invention;
fig. 3 is a flowchart of a node block confirmation method applied to the industrial internet of things.
Detailed Description
The embodiments of the present invention are described below with reference to specific embodiments, and other advantages and effects of the present invention will be easily understood by those skilled in the art from the disclosure of the present specification. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention. It should be noted that the drawings provided in the following embodiments are only for illustrating the basic idea of the present invention in a schematic way, and the features in the following embodiments and examples may be combined with each other without conflict.
Referring to fig. 1 to 3, fig. 2 is a block chain-based method for electing an accounting node of the internet of things in industry, which specifically includes the following steps:
step 1: layering and clustering through an LEACH algorithm, specifically:
(1) firstly, randomly selecting 5% of total nodes as temporary cluster heads, and selecting the nearest cluster head from the rest nodes according to the distance from the cluster head.
(2) After the initial clustering is completed, each cluster obtains a cluster head threshold value of a node according to the residual energy of the nodes in the cluster, and the nodes with the random numbers smaller than the cluster head threshold value generated by the nodes in the cluster are cluster head nodes by generating random numbers, and enter a stable data transmission stage after the clustering is completed;
step 2: setting the initial credit score of each node as 100 in the stable data transmission stage, comprehensively judging the node behaviors through the forwarding rate, the packet loss rate and the node processing delay, bidirectionally supervising the behaviors of the other party by the common node and the cluster head node, mutually supervising the behaviors by the cluster head node, directly checking the abnormal communication of the cluster head node from the sink node by the common node, and subtracting 1 from the credit score of the node when the abnormal communication is found once.
Specifically, the method comprises the following steps: (1) defining a processing delay:
in the formula, DT represents the processing delay of the nodes of the industrial Internet of things, Tsensor_idSensor ID at TLTime taken for the time interval from reception of data to transmission, TLIndicating a certain time interval.
(2) Defining a forwarding rate:
in the formula, FR represents the forwarding rate of the nodes of the industrial internet of things, SdIndicating the amount of data, T, sent by the nodedIndicating that the node received the total amount of data.
(3) Defining packet loss rate
In the formula, RsRepresents the packet loss rate, P, of the nodes of the industrial Internet of thingssIndicates the sum of data packets, P, successfully received by the nodeaAre packets sent to the node by other neighbors.
The communication quality is defined as:
Q＝α*DT+(1-FR)*λ+β*Rs
wherein Q represents communication quality, DT, FR, RsRespectively represent industrial objectsprocessing delay, forwarding rate and packet loss rate of the networking nodes, wherein α, lambda and β are weight proportions of the processing delay, the forwarding rate and the packet loss rate of the nodes of the industrial Internet of things respectively, necessary adjustment can be carried out according to specific scenes of the industrial Internet of things, a threshold value F is set, and the number of times of high-quality communication is defined as CsThe number of failed communications is CfWhen Q < F, CsIncrease by 1, otherwise CfAnd increased by 1. Defining node quality from Beta distribution
if eta is smaller than a certain threshold value, the node is judged to be an abnormal node, and the credit score is reduced by 1.
And step 3: in a block chaining block time interval, the sink node performs ranking from large to small through credit scores of cluster head nodes to generate a candidate node domain list, the first 21 candidate node domains are selected, residual energy of the nodes managed by the cluster head nodes, node credit scores and node token numbers are considered in each node domain, and one node is selected as an accounting node (namely, the larger the node residual energy is, the higher the node credit score is, the more the token number is, and the higher the probability of electing the accounting node is). After the accounting node set is elected, one node is randomly selected from 21 accounting nodes as a piece-out node of the round of consensus by generating random numbers of 1-21, the elected accounting node does not participate in election in the next 3 rounds, and finally, the election result of the accounting node is recorded in a block chain as a transaction issue.
Specifically, the node residual energy is defined as E, the node credit score is nu, the token number is n, and the comprehensive quality of the industrial Internet of things node is defined as
Wherein, kappa,
Mu respectively represents the weight proportion of the node residual energy, the node credit score and the node owned token number, and can be properly adjusted according to the specific scene of the industrial Internet of things; the higher the comprehensive quality of the node is, the higher the comprehensive quality of the node is selected to enterThe greater the probability of the set of billing nodes.
Fig. 3 is a block chain-based industrial internet of things node block confirmation method, which specifically includes the following steps:
step 1: the accounting node packs and sorts the collected data into blocks, the blocks are issued to adjacent common nodes, the blocks are mutually transmitted among the common nodes, the common nodes verify the validity of the blocks, if the blocks are legal, a message of 'confirm | | | block ID | | | confirm node ID' is replied to the sink node, at the moment, the common nodes can bet a certain token number of the common nodes, whether the verification of the bet blocks succeeds or not can be determined, if the blocks pass the verification of the sink node, the common nodes can bet the total token number according to the proportion of the bet tokens to the token number passing the verification at the moment, and vice versa.
Step 2: if the sink node receives the reply message which exceeds 2/3 of the total number of the common nodes, the sink node independently verifies the validity of the block, except for basic block verification, the sink node preferentially selects the block with the highest credit score and the highest timestamp and the front timestamp of the block alternative area (the credit score of the node has higher priority), and the sink node has a negative power, and if the block passes the verification of the sink node, the sink node broadcasts a 'receiving block + block ID' message to the whole network. The verification of the block mainly comprises the following steps:
(1) checking whether the block ID is legal (i.e. the block IDs are arranged from front to back in order);
(2) checking whether the hash value of the previous block in the block header is the same as the hash value of the previous block;
(3) checking whether the timestamp is legal (i.e. the current blockchain UNIX timestamp must be strictly greater than the median of the first n blocktimestamps);
and step 3: each node records this information in a local log and nodes in the set of accounting nodes connect the block into a block chain.
Finally, the above embodiments are only intended to illustrate the technical solutions of the present invention and not to limit the present invention, and although the present invention has been described in detail with reference to the preferred embodiments, it will be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions, and all of them should be covered by the claims of the present invention.
Claims (8)
1. A block chain-based industrial Internet of things node consensus method is characterized by comprising a light-weight block chain bookkeeping node election method and a block confirmation method which are applicable to industrial Internet of things;
the accounting node election method specifically comprises the following steps:
s1: layering and clustering through a LEACH algorithm;
s2: in the data stable transmission stage, node behaviors are comprehensively judged through the forwarding rate, the packet loss rate and the node processing delay, the common node and the cluster head node supervise the behaviors of the other side in a two-way mode, and the cluster head nodes supervise the behaviors of each other;
s3: in a block chaining block time interval, a sink node performs ranking from large to small through credit scores of cluster head nodes to generate a candidate node domain list, the first 21 candidate node domains are selected, the residual energy, the node credit scores and the node token numbers of the nodes managed by the cluster head nodes are considered in each node domain, one node is selected as an accounting node, after an accounting node set is selected, one node is selected from the 21 accounting nodes as a block-out node which is commonly identified in the current round through generating random numbers which are 1-21, and finally, the accounting node selection result is recorded in a block chain network as a transaction issue;
the block confirmation method specifically comprises the following steps:
s4: the accounting node packs the collected data and puts the data into blocks according to the time stamps in an ordering mode, the blocks are issued to adjacent common nodes, the blocks are mutually transmitted among the common nodes, the common nodes verify the legality of the blocks, and if the blocks are legal, a message of 'affirmation | | block ID | | | affirmation node ID' is replied to the aggregation node;
s5: if the sink node receives the reply message which exceeds 2/3 of the total number of the common nodes, the sink node independently verifies the validity of the block, and if the block passes the verification of the sink node, the sink node broadcasts a 'receiving block + block ID' message to the whole network;
s6: each node records the message broadcasted to the whole network by the aggregation node into a local log, and the nodes in the accounting node set connect the block into a block chain.
2. The industrial internet of things node consensus method based on a blockchain as claimed in claim 1, wherein the step S1 specifically comprises:
s11: randomly selecting 5% of total nodes as temporary cluster heads, and selecting the nearest cluster heads for adding by the rest nodes according to the distance from the cluster heads;
s12: after the initial clustering is completed, each cluster obtains a cluster head threshold of the node according to the residual energy of the nodes in the cluster, the nodes with the random numbers smaller than the cluster head threshold generated by the nodes in the cluster are cluster head nodes by generating random numbers, and the data stable transmission stage is started after the clustering is completed.
3. The method as claimed in claim 1, wherein in step S2, in the stable data transmission phase, the common node can directly check the aggregation node for abnormal communication of the cluster head node, and the credit score of the node is reduced by 1 each time an abnormal communication is found.
4. The industrial internet of things node consensus method based on a blockchain as claimed in claim 1, wherein the step S2 specifically comprises: the communication quality is defined as:
Q＝α*DT+(1-FR)*λ+β*Rs
wherein Q represents communication quality, DT, FR, Rsrespectively representing the processing delay, the forwarding rate and the packet loss rate of the nodes of the industrial Internet of things, setting a threshold value F, and defining the number of times of high-quality communication as C, wherein α, lambda and beta are weight proportions of the processing delay, the forwarding rate and the packet loss rate of the nodes of the industrial Internet of things respectivelysThe number of failed communications is CfWhen Q < F, CsIncrease by 1, otherwise CfIncreasing by 1; defining node quality from Beta distribution
if eta is smaller than a certain threshold value, the node is judged to be an abnormal node, and the credit score is reduced by 1.
5. The block chain-based industrial internet of things node consensus method as claimed in claim 1, wherein in step S3, the selected billing node does not participate in the election in the next 3 rounds.
6. The block chain-based industrial internet of things node consensus method as claimed in claim 1, wherein in step S3, node residual energy is defined as E, node credit score is v, token number is n, and comprehensive quality of industrial internet of things node is defined as
Wherein, kappa,
Mu respectively represents the weight proportion occupied by the node residual energy, the node credit score and the node owned token number; the higher the comprehensive quality of the node is, the higher the probability of being elected to enter the accounting node set is.
7. The block chain-based industrial internet of things node consensus method as claimed in claim 1, wherein in step S4, when the regular node replies a "confirm | | block ID | | | confirm node ID" message to the sink node, the regular node bets whether the validation of the token number bet block is successful or not, if the block passes the validation of the sink node, the regular node scores the total number of tokens bet according to a ratio of the bet token to the passing validation at that time, and vice versa.
8. The block chain-based industrial internet of things node consensus method according to claim 1, wherein the verifying the block in step S5 comprises the following steps:
1) checking whether the ID of the block is legal, namely, the ID of the block is arranged from front to back in sequence;
2) checking whether the hash value of the previous block in the block header is the same as the hash value of the previous block;
3) check if the timestamp is legal, i.e. the current blockchain UNIX timestamp must be strictly greater than the median of the first n blocktimestamps.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010023446.1A CN111182510B (en) | 2020-01-09 | 2020-01-09 | Industrial Internet of things node consensus method based on block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010023446.1A CN111182510B (en) | 2020-01-09 | 2020-01-09 | Industrial Internet of things node consensus method based on block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111182510A true CN111182510A (en) | 2020-05-19 |
| CN111182510B CN111182510B (en) | 2022-05-20 |
Family
ID=70650908
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010023446.1A Active CN111182510B (en) | 2020-01-09 | 2020-01-09 | Industrial Internet of things node consensus method based on block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111182510B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111770017A (en) * | 2020-06-22 | 2020-10-13 | 国网冀北电力有限公司电力科学研究院 | Power distribution Internet of things cluster management system and method based on trusted block chain |
| CN111800758A (en) * | 2020-06-30 | 2020-10-20 | 中国科学技术大学 | Unmanned aerial vehicle swarm layered consensus method based on block chain |
| CN111866162A (en) * | 2020-07-28 | 2020-10-30 | 中国联合网络通信集团有限公司 | Service distribution method and device |
| CN112163856A (en) * | 2020-10-09 | 2021-01-01 | 北京邮电大学 | Consensus method and system for block chain and Internet of things fusion scene |
| CN114189522A (en) * | 2021-10-15 | 2022-03-15 | 敏博科技(武汉)有限公司 | Block chain consensus method and system based on priority in Internet of vehicles |
| US11411743B2 (en) * | 2019-10-01 | 2022-08-09 | Tyson York Winarski | Birthday attack prevention system based on multiple hash digests to avoid collisions |
| CN117081861A (en) * | 2023-10-16 | 2023-11-17 | 北京亚大通讯网络有限责任公司 | Intelligent contract data management system based on block chain |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107395403A (en) * | 2017-07-07 | 2017-11-24 | 北京区块链云科技有限公司 | A kind of fiduciary block chain common recognition method suitable for extensive ecommerce |
| WO2019140555A1 (en) * | 2018-01-16 | 2019-07-25 | 华为技术有限公司 | Blockchain construction method and blockchain node |
| CN110138597A (en) * | 2019-04-17 | 2019-08-16 | 上海大学 | Based on the block chain DPOS of credit score and node clustering common recognition mechanism improved method |
| CN110278091A (en) * | 2018-03-13 | 2019-09-24 | 焦臻桢 | A kind of Internet of Things block chain common recognition method |
| US20190318338A1 (en) * | 2018-04-13 | 2019-10-17 | International Business Machines Corporation | Network node management on a blockchain |
| CN110535836A (en) * | 2019-08-12 | 2019-12-03 | 安徽师范大学 | A kind of trust block chain common recognition method of based role classification |
| WO2019232789A1 (en) * | 2018-06-08 | 2019-12-12 | 北京大学深圳研究生院 | Voting-based consensus method |
| CN110602117A (en) * | 2019-09-20 | 2019-12-20 | 浙江树人学院（浙江树人大学） | Vehicle networking node consistency consensus method based on block chain |
-
2020
- 2020-01-09 CN CN202010023446.1A patent/CN111182510B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107395403A (en) * | 2017-07-07 | 2017-11-24 | 北京区块链云科技有限公司 | A kind of fiduciary block chain common recognition method suitable for extensive ecommerce |
| WO2019140555A1 (en) * | 2018-01-16 | 2019-07-25 | 华为技术有限公司 | Blockchain construction method and blockchain node |
| CN110278091A (en) * | 2018-03-13 | 2019-09-24 | 焦臻桢 | A kind of Internet of Things block chain common recognition method |
| US20190318338A1 (en) * | 2018-04-13 | 2019-10-17 | International Business Machines Corporation | Network node management on a blockchain |
| WO2019232789A1 (en) * | 2018-06-08 | 2019-12-12 | 北京大学深圳研究生院 | Voting-based consensus method |
| CN110138597A (en) * | 2019-04-17 | 2019-08-16 | 上海大学 | Based on the block chain DPOS of credit score and node clustering common recognition mechanism improved method |
| CN110535836A (en) * | 2019-08-12 | 2019-12-03 | 安徽师范大学 | A kind of trust block chain common recognition method of based role classification |
| CN110602117A (en) * | 2019-09-20 | 2019-12-20 | 浙江树人学院（浙江树人大学） | Vehicle networking node consistency consensus method based on block chain |
Non-Patent Citations (3)
| Title |
|---|
| LI KEJIAO: "Proof of vote: a high-performance consensus protocol based on vote mechanism & consortium blockchain", 《PROC OF IEEE 19TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS》 * |
| 万新宇: "浅谈区块链共识机制在物联网的应用", 《第十三届中国(国际)城市智能交通论坛 》 * |
| 孔越峰: "区块链与物联网技术在溯源系统的运用分析", 《 数码设计（上）》 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11411743B2 (en) * | 2019-10-01 | 2022-08-09 | Tyson York Winarski | Birthday attack prevention system based on multiple hash digests to avoid collisions |
| CN111770017A (en) * | 2020-06-22 | 2020-10-13 | 国网冀北电力有限公司电力科学研究院 | Power distribution Internet of things cluster management system and method based on trusted block chain |
| CN111770017B (en) * | 2020-06-22 | 2022-06-10 | 国网冀北电力有限公司电力科学研究院 | Power distribution Internet of things cluster management system and method based on trusted block chain |
| CN111800758A (en) * | 2020-06-30 | 2020-10-20 | 中国科学技术大学 | Unmanned aerial vehicle swarm layered consensus method based on block chain |
| CN111800758B (en) * | 2020-06-30 | 2021-10-01 | 中国科学技术大学 | Unmanned aerial vehicle swarm layered consensus method based on block chain |
| CN111866162A (en) * | 2020-07-28 | 2020-10-30 | 中国联合网络通信集团有限公司 | Service distribution method and device |
| CN111866162B (en) * | 2020-07-28 | 2022-02-18 | 中国联合网络通信集团有限公司 | Service distribution method and device |
| CN112163856A (en) * | 2020-10-09 | 2021-01-01 | 北京邮电大学 | Consensus method and system for block chain and Internet of things fusion scene |
| CN114189522A (en) * | 2021-10-15 | 2022-03-15 | 敏博科技(武汉)有限公司 | Block chain consensus method and system based on priority in Internet of vehicles |
| CN114189522B (en) * | 2021-10-15 | 2024-04-16 | 敏博科技(武汉)有限公司 | Priority-based blockchain consensus method and system in Internet of vehicles |
| CN117081861A (en) * | 2023-10-16 | 2023-11-17 | 北京亚大通讯网络有限责任公司 | Intelligent contract data management system based on block chain |
| CN117081861B (en) * | 2023-10-16 | 2023-12-26 | 北京亚大通讯网络有限责任公司 | Intelligent contract data management system based on block chain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111182510B (en) | 2022-05-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111182510B (en) | Industrial Internet of things node consensus method based on block chain | |
| CN112039964B (en) | Node reputation consensus method based on block chain | |
| CN108880863B (en) | Smart power grid equipment safety diagnosis service system based on block chain technology | |
| CN112907252B (en) | Block chain transaction method and system based on multi-person chain lower channel | |
| CN112541758A (en) | Multi-round voting type fault-tolerant sequencing consensus mechanism and method based on block chain | |
| CN112163856A (en) | Consensus method and system for block chain and Internet of things fusion scene | |
| Yun et al. | Trust-based shard distribution scheme for fault-tolerant shard blockchain networks | |
| Mišić et al. | Adapting PBFT for use with blockchain-enabled IoT systems | |
| CN113570357B (en) | Dynamic layered efficient PBFT algorithm | |
| WO2021135934A1 (en) | Blockchain accounting method and apparatus, node and storage medium | |
| CN113098694A (en) | Hybrid cross-chain consensus method | |
| CN110445795B (en) | Block chain authentication uniqueness confirmation method | |
| Le et al. | A lightweight block validation method for resource-constrained iot devices in blockchain-based applications | |
| CN113014635A (en) | Node type division method and device of block chain system and block chain system | |
| CN114615281B (en) | Block chaining and block outputting method based on small-scale committee and PoS protocol confirmation method | |
| Wang et al. | A fast and secured vehicle-to-vehicle energy trading based on blockchain consensus in the internet of electric vehicles | |
| CN115499129A (en) | Multimode trust cross-chain consensus method, system, medium, equipment and terminal | |
| Asfia et al. | A blockchain construct for energy trading against sybil attacks | |
| CN115796261A (en) | Block chain-based lightweight group consensus federated learning method | |
| Qushtom et al. | A two-stage PBFT architecture with trust and reward incentive mechanism | |
| Prabhakar et al. | TCON-A lightweight Trust-dependent Consensus framework for blockchain | |
| CN111669277A (en) | Consensus method based on vrf and practical Byzantine algorithm on block chain | |
| CN116527684A (en) | Multi-chain information interaction method based on 1+1+N relay consensus committee | |
| CN109120437B (en) | Artificial intelligence block cloud ecosystem based on DABFT consensus mechanism | |
| CN114861233B (en) | Fragmenting asynchronous Bayesian family fault-tolerant consensus method and device without trusted third party |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |