CN111756546A - Block chain consensus method based on dynamic credit mechanism in Internet of vehicles environment - Google Patents
Block chain consensus method based on dynamic credit mechanism in Internet of vehicles environment Download PDFInfo
- Publication number
- CN111756546A CN111756546A CN202010542422.7A CN202010542422A CN111756546A CN 111756546 A CN111756546 A CN 111756546A CN 202010542422 A CN202010542422 A CN 202010542422A CN 111756546 A CN111756546 A CN 111756546A
- Authority
- CN
- China
- Prior art keywords
- node
- block
- rsu
- leader
- nodes
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 30
- 230000007246 mechanism Effects 0.000 title claims abstract description 18
- 238000012795 verification Methods 0.000 claims abstract description 33
- 230000006855 networking Effects 0.000 claims abstract description 9
- 230000006399 behavior Effects 0.000 claims description 12
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000012423 maintenance Methods 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 description 5
- 238000005065 mining Methods 0.000 description 2
- 238000004806 packaging method and process Methods 0.000 description 2
- 238000009412 basement excavation Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 230000008094 contradictory effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000007599 discharging Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 238000010200 validation analysis Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3297—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving time stamps, e.g. generation of time stamps
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
- G06F21/6245—Protecting personal data, e.g. for financial or medical purposes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
- H04L12/1854—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with non-centralised forwarding system, e.g. chaincast
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/84—Vehicles
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- General Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Bioethics (AREA)
- Health & Medical Sciences (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Medical Informatics (AREA)
- Databases & Information Systems (AREA)
- Computing Systems (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention relates to a block chain consensus method based on a dynamic credit mechanism in a car networking environment. In the internet of vehicles context, roadside unit RSU nodes serve as block chain consensus nodes to maintain smooth operation of the entire system. A dynamic credit mechanism related to the behavior of the identified node is adopted to reflect the credibility of the node in the block chain system, and the credibility of the node under different time stamps is directly related to the generation and block verification processes of the leader. The invention is suitable for the instantaneity and safety requirements of large-scale transactions in the Internet of vehicles, replaces the traditional energy-consuming ore digging by a lightweight leader establishing mode, improves the transaction throughput, reduces the consensus time delay, and ensures the safety of the system by adopting the improved PBFT algorithm.
Description
Technical Field
The invention relates to the technical field of block chains, in particular to a block chain consensus method based on a credit mechanism in a vehicle networking environment.
Background
In the car networking system, high-quality data can provide better service, but the data transmission burden is caused by mass data sharing (namely, the centralized transmission task is too heavy, the data transmission is easy to cause the problems of too slow data transmission and the like), and the storage and calculation capacity of the car is limited. In edge computing, roadside unit nodes (RSUs) can compute and share data near the vehicle, but privacy and security issues remain. In terms of security, the RSU does not have any strong security measures as a roadside unit, and data stored therein is easily stolen; in terms of privacy, vehicles may be reluctant to upload their data to the RSU for privacy concerns, or there may be unauthorized data access and security issues with p2p data transactions between vehicles.
Therefore, to solve these problems, the present invention introduces blockchain techniques to create a secure, trusted, decentralized intelligent transportation ecosystem. The blockchain can be regarded as a public ledger, and all submitted transactions are stored in one block, and the blockchain has key characteristics of decentralization, distrust, openness, anonymity, autonomy, tamper resistance and the like. The block chain technology is applied to a mobile edge computing framework in the Internet of vehicles, and the RSU node can be used as a consensus node to perform the work of block packaging, block verification and the like. The p2p transaction can be carried out between vehicles instead of the traditional cloud center scheduling mode. How to make the local chain of each RSU node agree is a problem that needs to be solved for consensus, but many current consensus mechanisms still have the following problems:
(1) instantaneity: the traditional resource-intensive consensus protocol (such as POW of bitcoin, POS protocol of Ethengfang and DPOS after improvement) has high computing capacity requirement on the consensus node, and the application of the consensus protocol to IOV not only faces the problem of high computing cost, but also has low system performance. For example, the POW algorithm in bitcoins can only make 7 transactions per second, which is contradictory to the high concurrency requirements of transactions in the IOV. To ensure high quality service of the IOV system, the immediacy of data sharing is important.
(2) Safety: the vulnerability of consensus protocols can lead to various security issues. For example, a double payment problem, i.e., one copy of money spends twice. And many consensus protocols exist that are based on the following assumptions: an attacker cannot possess more than 33% or 50% of the computational power at any time, but flash attacks can achieve temporarily more than 50% of the computational power by leasing the mining capability, thus breaking the ecological balance of the blockchain.
In addition, the traditional paxos and raft algorithms do not consider the condition of malicious nodes and cannot be used as a blockchain consensus algorithm, and the existing methods mentioned above are not suitable for the car networking system with large real-time transaction amount and high safety requirement.
Disclosure of Invention
The invention aims to provide a block chain consensus method based on a dynamic reputation mechanism aiming at the problems of instantaneity and safety of data sharing in the Internet of vehicles. The designed block chain consensus method avoids the defect of energy concentration, ensures the efficiency and the safety of the system at the same time, and is very suitable for the Internet of vehicles system in the edge computing environment.
The technical scheme adopted by the invention for solving the technical problem is as follows:
step 1) the RSU initiates a request to an authority (e.g., a government department) to apply for joining the blockchain network.
The authority acts as a supervisor, referring to various aspects of the RSU (e.g., whether it is an archival RSU node, whether it needs to be used in the slice area as a blockchain node, etc.).
If the RSU is allowed to access the network, the authority initiates a transaction related to the network access allowance in the blockchain system, and the RSU is not considered to enter the blockchain system until the transaction is packaged on the blockchain.
At this time, the authenticated RSU node, as a miner in the blockchain system, will perform operation and maintenance of the system together with other miners' nodes. Otherwise, the nodes of the whole network can not accept and trust the data packet sent by the RSU.
Step 2) determining the current credit deviation value of the node through the specific behavior of the consensus node, wherein the credit deviation value reflects the contribution of the node to the system in the current block-out time;
the leader with the right to pack the current block then packs the reputation deviation value into the block. Until the block is approved by the whole network, each miner calculates the credit value of the whole network miner in the local according to all credit deviation values in the block.
And 3) sorting all local miners from high to low according to reputation values, wherein the first p miners form a candidate committee for block generation and verification, and the first q nodes in the rest miners form a supervision committee for block verification.
And 4) selecting the optimal miner as the leader according to the hash values of the first m blocks, the ID and the credit value of each miner.
This method of establishing a leader has a certain randomness, and the result cannot be predicted, and the leader is likely to be established as the reputation value is larger, but the leader is not necessarily established as the reputation value is larger.
The determined cubic form of the leader replaces the traditional mode of energy-consuming excavation to obtain the block-discharging right, so that the effects of high efficiency and energy saving are achieved.
And step 5) the leader packs corresponding data into a block, wherein the data block comprises data such as a miner credit deviation value, node access network transaction, a public key of the next leader and the like.
The leader then broadcasts the packed blocks to the candidate committee and the supervisory committee.
And step 6) the candidate committee and the supervision committee jointly execute the process of verifying the validity of the block after receiving the block to be verified issued by the leader. The process uses a modified PBFT algorithm to achieve consistency of verification results. If the new block passes the verification, the new block is broadcasted to the whole network, otherwise, the update committee member reselects the leader.
And 7) if the received block has a legal mark, writing the block into a local main chain, and updating the local credit according to the credit deviation value in the block. I.e. jump to step 2 to recalculate the reputation value of the whole network node.
The invention has the beneficial effects that: by using the block chain consensus mechanism provided by the invention, the data transmission efficiency in the Internet of vehicles can be effectively improved on the premise of ensuring the security of the consensus system, and the service quality of the intelligent traffic ecosystem is remarkably improved.
Drawings
Fig. 1 is a flowchart of a block chain consensus method according to the present invention.
Fig. 2 is a block internal structure diagram in a block chain.
Detailed Description
The invention is further described with reference to the accompanying drawings, which refer to fig. 1; fig. 1 shows the general flow structure of the block chain consensus proposed by the present invention.
The following is a detailed description of the important structural components of the architecture of the present invention.
(1) leader election mode
Candidate committee and supervisory committee members are selected in the blockchain system according to the reputation value, wherein leader election occurs in the candidate committee. The specific election mode is that the optimal miner is selected as the leader according to the hash values of m blocks before the block chain under the current timestamp, the ID of each miner and the current credit value. Hash value D of the first m blocksiThe calculation is as follows:
Di＝H(H(Bi-m+1)||H(Bi-m+2)||…||H(Bi))
wherein i represents a block height; b isiRepresenting the ith block in the block chain; | | is a join operation; h () represents a hash operation on the block. The hash values of m blocks before the current timestamp can be obtained through the above method, and then the Score of the node under the current timestamp is calculated for each common node, wherein the specific calculation formula is as follows:
Scorej＝|Di-MinerIdj|-λ*Tj
wherein,j is the mine work number; t isjRepresents the reputation value of node j, λ is a positive number; MinerIdjThe ID representing miner j, e.g., the public key of miner j.
Thus, in a collection of n miners
Such that there is a minimum value of Scorej. At this time, the miners with sequence number j obtain the block-out right under the current timestamp, and become the leader. Hash values D of the first m blocks due to updating of the blocksiHas randomness and cannot be predicted. And the ID of the miners is determined to be stored as a transaction in the block chain and can not be tampered when the miners are connected to the network, so that the absolute value in the formula is a random number related to the fixed ID of the miners. However, the final result is also related to the reputation value of the miner, the greater the reputation value, the greater the possibility of becoming a leader, but the miner with the greater reputation value is not necessarily able to become a leader, because DiThe result of (c) is random. The determining formula of the leader replaces the traditional mode of acquiring the block weight by energy-consuming mining, and the overall performance of the block chain system is improved.
(2) Dynamic reputation mechanism
And determining the current reputation deviation value of the node through the specific behaviors of the consensus node, wherein the reputation deviation value reflects the contribution of the node to the system in the current block-out time, and the configuration of the specific reputation deviation value is shown in table 1. The nodes with malicious behaviors are listed in a blacklist, miners who find the malicious behaviors generate a blacklist transaction containing the malicious nodes and broadcast the blacklist transaction to the whole network, a leader packs the blacklist transaction into a new block after receiving the transaction, and the nodes are not approved by the nodes of the whole network after the block is linked.
Similarly, the leader packs the credit offset values into the blocks, and each miner calculates the credit values of the miners in the whole network according to all the credit offset values in the blocks until the blocks are approved by the whole network. Considering the dynamic extension of the main chain of the block chain system, and the value of the credit value is gradually reduced along with the time lapse, the invention introduces the credit influence factor to dynamically measure the importance of the behavior of the nodes in different periods. Since instantaneous behavior has a greater impact on reputation than historical behavior, the reputation impact factor will gradually become smaller as blocks accumulate. The reputation factor calculation formula of the invention is as follows:
wherein, mukRepresenting the reputation influencing factor of the k-th previous block. In the process of calculating the reputation value, the reputation value calculation method of the node i is as follows:
wherein, DevposAnd DevnegThe credit deviation of the node i in one block is taken as a unit to calculate the accumulated credit value of different behaviors of the node in all blocks on a chain, and the credit value dynamically changes along with the addition of a new block.
TABLE 1
(3) Verifying block legitimacy
When the leader packages the transaction into a new block, the block is broadcast to the verification node, which needs to verify the validity of the block, for example, check the validity of all transactions in the new block. A modified PBFT algorithm is used to achieve consistency of verification results. Considering the PBFT three-stage algorithm, the first two stages achieve system consensus and meet the requirement of the block chain for achieving the conformity of the validity of the verification block. Therefore, the invention eliminates the third stage, namely the confirmation stage, on the basis of the PBFT algorithm so as to accelerate the consensus process. The specific consensus process is described as follows:
1) broadcasting the block to a verification node;
2) the verification node broadcasts the own opinion after verifying the validity of the block;
3) comparing the opinions of the verification node with other nodes, and sending the final opinion to a leader after being determined;
4) the leader integrates all the opinions of the verification nodes and broadcasts the opinion if the block passes the verification.
According to the characteristic of the PBFT algorithm, the block verification in the consensus protocol provided by the invention simultaneously has the following two conditions when passing the block verification:
condition 1) at least 2f +1 feedback opinions need to be received, wherein f is the number of Byzantine nodes;
condition 2) the sum of the reputations of the 2f +1 feedback nodes received is greater than the sum of the reputations of all the verification nodes 2/3. Namely:
wherein x and y represent the number of members of the supervision committee and the candidate committee which consider the block verification to pass respectively; p and q represent the total number of members of the supervision committee and the candidate committee respectively; t isi，TjRespectively representing credit values corresponding to a supervision committee member i and a candidate committee member j which consider that the block verification passes; gamma and are respectively corresponding weights (wherein gamma is<). If the result of consensus meets the above condition, it indicates that the verified block is valid, and the leader broadcasts the block to the all-network RSU nodes to achieve consensus.
Because each RSU node in the network has different credibility according to the ranking of the whole network reputation value, the RSU node with high credibility has certain system management right, and the set of the RSU nodes with right is not invariable, and the committee member with certain right updates once when each new timestamp begins. Thus, in conjunction with the proposed dynamic reputation mechanism, the constraint of condition 2 in block validation can improve the security of the consensus method.
The invention provides a block chain consensus method based on a dynamic reputation mechanism, which comprises the following steps:
(1) step 1, system initialization.
The RSU initiates a request to an authority (e.g., a government agency) for joining the blockchain network, the request including an ID (e.g., public key) of the RSU. The authority acts as a supervisor, referring to various aspects of the RSU (e.g., whether it is an archival RSU node, whether it needs to be used in the slice area as a blockchain node, etc.). If the RSU is allowed to access the network, the authority initiates a transaction related to the network access allowance in the blockchain system, wherein the transaction comprises the ID number of the RSU, and the RSU is not considered to enter the blockchain system until the transaction is packaged on the blockchain. At this time, the authenticated RSU node, as a miner in the blockchain system, will perform operation and maintenance of the system together with other miners' nodes. If the authority refuses the access to the network at the RSU stage, the nodes of the whole network can not accept and trust the data packet sent by the RSU, and the RSU nodes need to reinitiate the access request.
(2) And 2, calculating the reputation.
In the reputation mechanism provided by the invention, the current reputation deviation value of the node needs to be determined by commonly recognizing the specific behavior of the node, the reputation deviation value reflects the contribution of the node to the system in the current block-out time, and then the leader with the right of packaging the current block packs the reputation deviation value into the block. Until the block is approved by the whole network, each miner calculates the credit value of the whole network miner in the local according to all credit deviation values in the block. The RSU nodes which just enter the block chain system need to download the main chain of the system, and then the credit deviation values contained in each legal block on the main chain are read one by one and the credit values of all the RSU nodes in the current network are calculated by combining the current credit influence factors.
(3) And step 3, grouping miners.
After calculating and obtaining the credit values of all RSU nodes in the network, each RSU node sorts all miners from high to low according to the credit values, the first p miners form a candidate committee for block generation and verification, and the first q nodes in the rest miners form a supervision committee for block verification.
(4) And step 4, determining the leader.
In the candidate committee members, a node Score under the current timestamp is calculated for each member node. Score may distinguish hash value D of m blocks before block chain by current timestampiAnd the fixed ID and the credit value of each miner are calculated, and the member with the minimum score becomes the leader under the current timestamp.
(5) And 5, generating a block.
And each RSU node judges whether the node is a leader or not according to the ranking of the reputation value, and if the node is the leader selected by the current timestamp node, the RSU node has the right to pack the transaction into a block and generate the block. The internal structure of the block is shown in fig. 2. The transaction may be an RSU admission permission containing the mineworker's ID number and the mineworker's status, with "1" indicating an admission permitted status. The transaction may also be a miner reputation deviation value that includes the miner's ID number and the miner's reputation deviation value at the current timestamp. Of course, data such as node access transactions are also possible. Finally, the leader broadcasts the packed blocks to the candidate committee and the supervisory committee.
(6) And step 6, verifying the block.
If the node is not a leader, judging whether the node is a committee member or not, and similarly, judging through ranking of the reputation value. And after the candidate committee and the supervision committee receive the to-be-verified block issued by the leader, the candidate committee and the supervision committee jointly execute a process of verifying the validity of the block. The process uses a modified PBFT algorithm to achieve consistency of verification results. If the block is illegal, the miners need to be grouped again according to the reputation ranking, namely, the committee members are updated, and then the leader is reselected.
(7) And 7, updating the reputation.
If the node is neither a leader nor a committee member, then it only needs to wait for a valid block. If the received block has a legal mark, the block is written into a local main chain, and the local credit is updated according to the credit deviation value in the block. In other words, the reputation value of the whole network node is recalculated by jumping to step 2.
Claims (5)
1. A block chain consensus method based on a dynamic reputation mechanism in a vehicle networking environment is characterized by comprising the following steps:
(1) step 1, system initialization
The method comprises the steps that a roadside unit node RSU initiates a request to an authority mechanism, and the request is applied to join a block chain system and comprises an ID of the RSU;
the authority is used as a supervising authority, and various parameters of the RSU are referred, including whether the RSU is a node RSU with a file record, and whether the RSU is required to be used as a block chain node in the slice area;
if the node RSU is allowed to be accessed to the network, the authority initiates a transaction related to the network access allowance in the blockchain system, wherein the transaction comprises the ID number of the node RSU, and the node RSU is not considered to enter the blockchain system until the transaction is packaged on the blockchain;
at the moment, the authenticated node RSU is used as a miner in the blockchain system to carry out operation maintenance of the system together with other miner nodes;
if the authority refuses the access of the node RSU at the stage, the nodes of the whole network can not accept and trust the data packet sent by the node RSU, and the node RSU needs to initiate the access request again;
(2) step 2, reputation calculation
Downloading a system main chain just entering a node RSU of a block chain system, reading credit deviation values contained in each legal block on the main chain one by one, and calculating credit values of all node RSUs in the current network by combining current credit influence factors;
(3) step 3, the miner group
After calculating and obtaining credit values of all nodes RSU in the network, each node RSU sorts all miners from high to low according to the credit values, the first p miners form a candidate committee for block generation and verification, and the first q nodes in the rest miners form a supervision committee for block verification;
(4) step 4, determining leader
In candidate committee members, the current time is calculated for each member nodeNode Score under stamp; score is the hash value D of the m blocks before the block chain under the current timestampiThe member with the minimum score obtained by calculating the fixed ID and the credit value of each miner becomes a leader under the current timestamp;
(5) step 5, generating a block
Each node RSU judges whether the node is a leader or not according to the ranking of the credit value, and if the node is the leader selected by the current timestamp node, the node RSU has the right to pack the transaction into a block and generate the block;
broadcasting the packed blocks to a candidate committee and a supervision committee by the leader;
(6) step 6, block verification
If the node RSU is not a leader, judging whether the node is a committee member or not, and also making a judgment through the ranking of credit values;
after receiving the to-be-verified block issued by the leader, the candidate committee and the supervision committee jointly execute a process of verifying the validity of the block;
if the block is illegal, the miners need to be grouped again according to the credit ranking, namely, the committee members are updated, and then the leader is selected again;
(7) step 7, updating the reputation
If the node RSU is not a leader or a committee member, only a legal block needs to be waited;
if the received block has a legal mark, the block is written into a local main chain, and the local credit is updated according to the credit deviation value in the block.
2. The block chain consensus method based on the dynamic reputation mechanism in the car networking environment according to claim 1, wherein: and determining the current reputation deviation value of the node RSU through the specific behaviors of the consensus nodes, wherein the reputation deviation value reflects the contribution of the node RSU to the system in the current block-out time.
3. The block chain consensus method based on the dynamic reputation mechanism in the car networking environment according to claim 1, wherein: the node RSU with malicious behavior is blacklisted, the miners who find the malicious behavior generate a blacklist transaction containing the malicious node RSU and broadcast the blacklist transaction to the whole network, the leader packs the transaction into a new block after receiving the transaction, and the node RSU is not approved by the nodes of the whole network after the block is uplink.
4. The block chain consensus method based on the dynamic reputation mechanism in the car networking environment according to claim 1, wherein: and the transaction in the step 5 is the network access permission of the RSU node, the miner reputation deviation value or the network access transaction of the RSU node.
5. The block chain consensus method based on the dynamic reputation mechanism in the car networking environment according to claim 1, wherein: the validity verification process in step 6 uses an improved PBFT algorithm to achieve consistency of verification results, specifically:
1) broadcasting the block to a verification node;
2) the verification node broadcasts the own opinion after verifying the validity of the block;
3) comparing the opinions of the verification node with other nodes, and sending the final opinion to a leader after being determined;
4) the leader integrates all the opinions of the verification nodes, and if the block passes the verification, the block is broadcasted;
the above process needs to be carried out under the following two conditions:
condition 1) at least 2f +1 feedback opinions need to be received, wherein f is the number of Byzantine nodes;
condition 2) the sum of the reputations of the 2f +1 feedback nodes received is greater than the sum of the reputations of all the verification nodes 2/3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010542422.7A CN111756546A (en) | 2020-06-15 | 2020-06-15 | Block chain consensus method based on dynamic credit mechanism in Internet of vehicles environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010542422.7A CN111756546A (en) | 2020-06-15 | 2020-06-15 | Block chain consensus method based on dynamic credit mechanism in Internet of vehicles environment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111756546A true CN111756546A (en) | 2020-10-09 |
Family
ID=72676136
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010542422.7A Pending CN111756546A (en) | 2020-06-15 | 2020-06-15 | Block chain consensus method based on dynamic credit mechanism in Internet of vehicles environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111756546A (en) |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112286963A (en) * | 2020-11-17 | 2021-01-29 | 北京物资学院 | Trusted inquiry system for block chain terminal data and implementation method thereof |
| CN112751824A (en) * | 2020-11-30 | 2021-05-04 | 长安大学 | Block chain-based vehicle-mounted named data network trust mechanism |
| CN112861163A (en) * | 2021-03-15 | 2021-05-28 | 云南大学 | Reputation ETC system based on evidence chain framework, data protection method and vehicle behavior management method based on reputation value |
| CN112907246A (en) * | 2021-03-18 | 2021-06-04 | 上海交通大学 | BFT protocol and PoW mechanism-based block chain consensus protocol implementation method and system |
| CN113038427A (en) * | 2021-03-01 | 2021-06-25 | 重庆邮电大学 | Block chain cross-region authentication method based on credit mechanism and DPOS |
| CN113141600A (en) * | 2021-04-23 | 2021-07-20 | 国网河南省电力公司信息通信公司 | Block chain distributed data sharing method based on Internet of vehicles |
| CN113159743A (en) * | 2021-02-02 | 2021-07-23 | 上海大学 | Vehicle crowd sensing excitation system and method based on block chain and edge calculation |
| CN113946829A (en) * | 2021-10-08 | 2022-01-18 | 东北大学 | Block chain-based vehicle networking distributed trust mechanism |
| CN114189522A (en) * | 2021-10-15 | 2022-03-15 | 敏博科技(武汉)有限公司 | Block chain consensus method and system based on priority in Internet of vehicles |
| CN114463009A (en) * | 2022-04-13 | 2022-05-10 | 成都理工大学 | Method for improving transaction security of large-scale energy node |
| CN114760306A (en) * | 2022-03-31 | 2022-07-15 | 广西玉林链向千禧大数据有限公司 | Task scheduling method for cloud and mist edge collaborative environment based on block chain |
| CN114945022A (en) * | 2022-05-20 | 2022-08-26 | 重庆邮电大学 | Internet of vehicles edge calculation sharing method based on block chain |
| CN115051983A (en) * | 2021-12-29 | 2022-09-13 | 昆明理工大学 | Vehicle networking trust management system and method based on block chain |
| CN115052017A (en) * | 2022-06-14 | 2022-09-13 | 上海交通大学 | Layered consensus method and system based on dynamic reputation mechanism in Internet of vehicles environment |
| CN115277722A (en) * | 2022-07-27 | 2022-11-01 | 长安大学 | DR-PBFT improved algorithm based on credit value model |
| CN115412374A (en) * | 2022-11-01 | 2022-11-29 | 国网浙江省电力有限公司金华供电公司 | Safe data sharing method based on credit consensus mechanism |
| CN116015672A (en) * | 2022-12-15 | 2023-04-25 | 山西大学 | PBFT consensus mechanism based on reputation model |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108616596A (en) * | 2018-05-09 | 2018-10-02 | 南京邮电大学 | It is adaptively known together method based on the block chain that dynamic authorization and network environment perceive |
| CN109194610A (en) * | 2018-07-24 | 2019-01-11 | 北京交通大学 | Vehicle-mounted mist data lightweight anonymous access authentication method based on block chain auxiliary |
| US20190251199A1 (en) * | 2018-02-14 | 2019-08-15 | Ivan Klianev | Transactions Across Blockchain Networks |
| CN110300107A (en) * | 2019-06-25 | 2019-10-01 | 南京邮电大学 | A kind of car networking secret protection trust model based on block chain |
| CN111131181A (en) * | 2019-12-05 | 2020-05-08 | 重庆邮电大学 | Reputation mechanism and DPBFT algorithm-based block chain dynamic DPoS consensus method |
-
2020
- 2020-06-15 CN CN202010542422.7A patent/CN111756546A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190251199A1 (en) * | 2018-02-14 | 2019-08-15 | Ivan Klianev | Transactions Across Blockchain Networks |
| CN108616596A (en) * | 2018-05-09 | 2018-10-02 | 南京邮电大学 | It is adaptively known together method based on the block chain that dynamic authorization and network environment perceive |
| CN109194610A (en) * | 2018-07-24 | 2019-01-11 | 北京交通大学 | Vehicle-mounted mist data lightweight anonymous access authentication method based on block chain auxiliary |
| CN110300107A (en) * | 2019-06-25 | 2019-10-01 | 南京邮电大学 | A kind of car networking secret protection trust model based on block chain |
| CN111131181A (en) * | 2019-12-05 | 2020-05-08 | 重庆邮电大学 | Reputation mechanism and DPBFT algorithm-based block chain dynamic DPoS consensus method |
Non-Patent Citations (3)
| Title |
|---|
| YUHAO WANG 等: "《Study of Blockchains‘s Consensus Mechanism Based on Credit》", 《IEEE ACCESS》 * |
| 张思贤等: "一种基于分组的区块链共识算法", 《计算机应用与软件》 * |
| 李俊清 等: "《基于信誉的动态授权PBFT共识机制》", 《软件》 * |
Cited By (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112286963B (en) * | 2020-11-17 | 2023-05-26 | 北京物资学院 | Block chain terminal data credible query system and implementation method thereof |
| CN112286963A (en) * | 2020-11-17 | 2021-01-29 | 北京物资学院 | Trusted inquiry system for block chain terminal data and implementation method thereof |
| CN112751824A (en) * | 2020-11-30 | 2021-05-04 | 长安大学 | Block chain-based vehicle-mounted named data network trust mechanism |
| CN113159743A (en) * | 2021-02-02 | 2021-07-23 | 上海大学 | Vehicle crowd sensing excitation system and method based on block chain and edge calculation |
| CN113038427A (en) * | 2021-03-01 | 2021-06-25 | 重庆邮电大学 | Block chain cross-region authentication method based on credit mechanism and DPOS |
| CN113038427B (en) * | 2021-03-01 | 2022-04-01 | 重庆邮电大学 | Block chain cross-region authentication method based on credit mechanism and DPOS |
| CN112861163A (en) * | 2021-03-15 | 2021-05-28 | 云南大学 | Reputation ETC system based on evidence chain framework, data protection method and vehicle behavior management method based on reputation value |
| CN112907246A (en) * | 2021-03-18 | 2021-06-04 | 上海交通大学 | BFT protocol and PoW mechanism-based block chain consensus protocol implementation method and system |
| CN113141600A (en) * | 2021-04-23 | 2021-07-20 | 国网河南省电力公司信息通信公司 | Block chain distributed data sharing method based on Internet of vehicles |
| CN113946829A (en) * | 2021-10-08 | 2022-01-18 | 东北大学 | Block chain-based vehicle networking distributed trust mechanism |
| CN113946829B (en) * | 2021-10-08 | 2024-05-10 | 东北大学 | Block chain-based Internet of vehicles distributed trust system |
| 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 |
| CN115051983A (en) * | 2021-12-29 | 2022-09-13 | 昆明理工大学 | Vehicle networking trust management system and method based on block chain |
| CN115051983B (en) * | 2021-12-29 | 2023-10-03 | 昆明理工大学 | Internet of vehicles trust management system and method based on blockchain |
| CN114760306A (en) * | 2022-03-31 | 2022-07-15 | 广西玉林链向千禧大数据有限公司 | Task scheduling method for cloud and mist edge collaborative environment based on block chain |
| CN114760306B (en) * | 2022-03-31 | 2024-04-09 | 四川链向科技集团有限公司 | Task scheduling method for cloud and fog edge collaborative environment based on blockchain |
| CN114463009A (en) * | 2022-04-13 | 2022-05-10 | 成都理工大学 | Method for improving transaction security of large-scale energy node |
| CN114945022A (en) * | 2022-05-20 | 2022-08-26 | 重庆邮电大学 | Internet of vehicles edge calculation sharing method based on block chain |
| CN114945022B (en) * | 2022-05-20 | 2023-05-23 | 重庆邮电大学 | Block chain-based Internet of vehicles edge computing sharing method |
| CN115052017A (en) * | 2022-06-14 | 2022-09-13 | 上海交通大学 | Layered consensus method and system based on dynamic reputation mechanism in Internet of vehicles environment |
| CN115277722B (en) * | 2022-07-27 | 2023-08-22 | 长安大学 | DR-PBFT (digital binary-representation-binary-representation) improvement method based on reputation value model |
| CN115277722A (en) * | 2022-07-27 | 2022-11-01 | 长安大学 | DR-PBFT improved algorithm based on credit value model |
| CN115412374A (en) * | 2022-11-01 | 2022-11-29 | 国网浙江省电力有限公司金华供电公司 | Safe data sharing method based on credit consensus mechanism |
| CN116015672A (en) * | 2022-12-15 | 2023-04-25 | 山西大学 | PBFT consensus mechanism based on reputation model |
| CN116015672B (en) * | 2022-12-15 | 2024-05-28 | 山西大学 | PBFT consensus mechanism based on reputation model |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111756546A (en) | Block chain consensus method based on dynamic credit mechanism in Internet of vehicles environment | |
| CN110300107B (en) | Vehicle networking privacy protection trust model based on block chain | |
| Ali et al. | A blockchain-based certificateless public key signature scheme for vehicle-to-infrastructure communication in VANETs | |
| Cui et al. | An efficient message-authentication scheme based on edge computing for vehicular ad hoc networks | |
| CN111601258B (en) | Vehicle networking node data safety communication method based on block chain | |
| CN104333596B (en) | Information reliability assessment method in Internet of vehicles environment | |
| CN111371905B (en) | Block chain layering consensus proving system and method based on cloud computing | |
| Yahiatene et al. | Towards a blockchain and software-defined vehicular networks approaches to secure vehicular social network | |
| WO2020000924A1 (en) | Message reliability evaluation method for aggregating two trust evaluations in internet of vehicles | |
| Islam et al. | Blockchain-enabled intelligent vehicular edge computing | |
| Pu | A novel blockchain-based trust management scheme for vehicular networks | |
| CN114139203B (en) | Block chain-based heterogeneous identity alliance risk assessment system and method and terminal | |
| CN112929333A (en) | Vehicle networking data safe storage and sharing method based on hybrid architecture | |
| Ogundoyin et al. | An efficient authentication scheme with strong privacy preservation for fog-assisted vehicular ad hoc networks based on blockchain and neuro-fuzzy | |
| Diallo et al. | A scalable blockchain-based scheme for traffic-related data sharing in VANETs | |
| Majumder et al. | A study on recent applications of blockchain technology in vehicular adhoc network (VANET) | |
| Ayobi et al. | A lightweight blockchain-based trust model for smart vehicles in vanets | |
| Herbadji et al. | Blockchain for internet of vehicles security | |
| CN112861163B (en) | Reputation ETC system based on evidence chain framework, data protection method and vehicle behavior management method based on reputation value | |
| Zhang et al. | Blockchain based secure package delivery via ridesharing | |
| Bai et al. | Blockchain-based Authentication and Proof-of-Reputation Mechanism for Trust Data Sharing in Internet of Vehicles. | |
| Diallo et al. | An improved PBFT-based consensus for securing traffic messages in VANETs | |
| Diallo et al. | When proof-of-work (pow) based blockchain meets vanet environments | |
| CN113453170A (en) | Block chain technology-based distributed authentication method for Internet of vehicles | |
| Kuang et al. | GTMS: A gated linear unit based trust management system for internet of vehicles using blockchain technology |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20201009 |
|
| RJ01 | Rejection of invention patent application after publication |