CN109922149A - A kind of car networking Data Exchange Model based on block chain - Google Patents
A kind of car networking Data Exchange Model based on block chain Download PDFInfo
- Publication number
- CN109922149A CN109922149A CN201910166226.1A CN201910166226A CN109922149A CN 109922149 A CN109922149 A CN 109922149A CN 201910166226 A CN201910166226 A CN 201910166226A CN 109922149 A CN109922149 A CN 109922149A
- Authority
- CN
- China
- Prior art keywords
- node
- message
- chain
- alliance
- 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
Landscapes
- Traffic Control Systems (AREA)
Abstract
The present invention provides a kind of car networking Data Exchange Models based on block chain, model is based on alliance's chain (Consortium Blockchain) plus relaying chain (Relay-Chain), node in model includes roadside infrastructure unit (RodeSide Unit, RSU) and vehicle unit (Onboard Unit), each node is involved in into model.By the attribute access strategy matching between design node, reduces unnecessary block and generate, reduce block chain expense.By alliance's chain in conjunction with across chain technology, the message transmission between different alliances is realized.And it is the model realization process specification, easy to operate.
Description
Technical field
The invention belongs to Computer Science and Technology field, in particular to a kind of car networking data exchange based on block chain
Model.
Background technique
With the development of the city, demand of the people to traffic trip is higher and higher, and the number of vehicles in city is also increasingly
More, intelligent transportation system is just playing increasingly important role in terms of promoting traffic system operational efficiency.Wherein, car networking
(Vehicular Ad-hoc Network, VANET) is intelligent transportation system (Intelligent Transportation
System, ITS) core component.Car networking is that have perception, calculating, storage and nothing on traffic route by travelling
The move vehicle of line communication capacity and the Base communication facility on road and the novel self-organizing network formed.It can be to friendship
Logical overall process carries out intelligentized control method, effectively improves traffic driving safety and user is facilitated to drive, while being also daily trip
Or the traffic value-added service such as trip amusement provides active platform.
With the fast development of car networking technology, many occur can be used for the wireless communication technique of intelligent transportation system, packet
Include 3G/4G, WIFI, WAVE etc..Wherein WAVE (Wireless Access in Vehicule Environment) protocol stack is
From DSRC (Dedicated Short Range Communication) standard evolution, including IEEE 802.11p and
IEEE P1609 two parts.Therefore, the vehicle in car networking needs support the built-in on board unit of IEEE 802.11p standard
(On Board Unit,OBU).The vehicle travelled on highway periodically sends security information using interior OBU.The letter of car networking
Breath transmitting is divided into Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I).As vehicle joins
The problem of development of net, secret protection and information security, is more and more important, however due to the communication environment of car networking complexity, it leads
Causing communication process, there are many security risks, such as: the attack such as message is distorted, forged, stealing, therefore, many is ground in recent years
The person of studying carefully is studied for safety problems such as authentication, information integrity, non-repudiations in car networking.Traditional vehicle connection
Network architecture is divided into four layers: first layer is central administrative authority, that is, certificate management authority Certificate
Authorities (CAs), the second layer are made of a series of security domains, are responsible for managing encrypted relevant information material, third layer by
RSU composition, RSU are built on highway according to certain rule, and the last layer is vehicle node.Traditional centralized architecture imparts card
The very big power of book mechanism, not can guarantee the safety of data center, and attacker takes certain attack means to steal and forge use
The privacy information at family, arbitrarily distorts message, be easy to cause Single Point of Faliure, it may be assumed that trusted authorization center, which is broken, can not work normally
Etc. safety problems.
Summary of the invention
The present invention designs a kind of car networking number based on block chain for the car networking application scenarios in intelligent transportation system
According to exchange model, model is based on alliance's chain (Consortium Blockchain) plus relays chain (Relay-Chain), in model
Node include roadside infrastructure unit (RodeSide Unit, RSU) and vehicle unit (Onboard Unit).Alliance
The alliance that chain has multiple definition according in scheme to divide is constituted, such as: commercial circle, airport, railway station etc..In commercial circle alliance
In chain, there are multiple vehicle node OBU, roadside unit RSU.Wherein, RSU can be shop in commercial circle, gas station, charge station very
To the traffic lights monitoring system for being some crossing.RSU in alliance according to region division at central node and fringe node, it is certain
Central node is subsequent as accounting nodes presence, and fringe node participates in constituting the node in relaying chain, to realize in city
Information transmitting between each alliance's chain.Based on this model, the transmitting information that vehicle node can be convenient shares real-time traffic letter
Breath and city hot information realize the information transmitting between the car networking system interior joint of decentralization, solve conventional center
Change and generates block overhead issues in Single Point of Faliure safety problem present in framework and block chain.
1. a kind of car networking Data Exchange Model based on block chain, comprising the following steps:
Step 1: model uses alliance's chain framework, there are multiple alliances in car networking, between the node in each networking
Carry out information transmitting；
Alliance's chain refers to that the block chain that preselected node controls can be received during common recognition, in the model, leads to
Certain RSU nodes in alliance in regional center are often chosen as accounting nodes, participate in common recognition process；
Information transmitting refers to that a vehicle node OBU sends first message between the node, by way of broadcast
Transmitting generates record block by common recognition algorithm common recognition, charges to block link network after other vehicle nodes are received and are proved to be successful
In network；
Step 2: user when driving, submits certain integral in locating alliance region, sends a real-time messages, passes through
Broadcast waits other vehicle nodes OBU to respond and is proved to be successful；
The integral refers to that the vehicle node for sending message needs to submit certain integral, only when other vehicle nodes
Generation responds block after obtaining this message and successful match, submits to accounting nodes therewith and is accumulated by return after common recognition
Give the vehicle node for sending message.
The information sending node OBU1It sends real-time messages and refers to OBU1He to one information of alliance's regional broadcast, it
Need to pay a definite integral, this information is broadcasted later, is waited other vehicle nodes to obtain information and is attempted matching；
Step 3: other vehicle nodes OBUXThe message for receiving broadcast, first attempts to the strategy matching that accesses, matching at
The user of function just can receive this message, receive the vehicle node OBU of message laterXIt needs to submit certain integral as signature
This record is sent to accounting nodes later by gold, waits accounting nodes to complete according to common recognition algorithm common recognition, block link network is added
In network；
The access strategy matching refers to the vehicle node OBU for preparing to receive messageXIt needs to go by the attribute of oneself
Matching sends the vehicle node OBU of message1The access strategy tree of formulation.Such as: OBU1Formulate access strategy tree { AND
{ " Parking ", OR { " Fee ", " next to the mall ", " space > 3 Remaining " } } }, another vehicle node
OBU2Attribute be { " Parking ", " Free ", " Remaining space=5 " }；
The vehicle node OBU for receiving messageXIntegral is submitted to refer to preventing other vehicle nodes false as cash pledge
Response.Such as: the vehicle node having does not have successful match that can send this Message Record yet, arbitrarily goes matching message.
The accounting nodes refer to receiving the vehicle of message when match messages success by this record of common recognition proof of algorithm
Node OBUXThis message content can be obtained, this record is sent to accounting nodes later and waits common recognition.If by altogether
Know proof of algorithm success, then this records in the block network that can coalize；
The common recognition algorithm refer in alliance's chain frequently with common recognition the algorithm PBFT, PBFT of anti-Byzantine failure tolerance be one
Kind of state machine copy replication algorithm, i.e. service are modeled as state machine, state machine distributed system different nodes into
Row copy replication.The copy of each state machine saves the state of service, while also achieving the operation of service.It will be all
The set of copy composition is indicated using capital R, is arrived using 0 | R | each copy of -1 integer representation.Usually assume that failure
Number of nodes is m, and entire service node number is | R |=3m+1, m is possible to the maximum number of the copy of failure here.To the greatest extent
Pipe, which may exist, is more than 3m+1 copy, but additional copy cannot improve reliability other than reducing performance.
The PBFT algorithm steps are as follows:
Step A: a host node (Leader) is elected from all nodes of alliance, new block is responsible for generation by host node；
The step B:Pre-Prepare stage: the transaction that each node sends client other node broadcasts into alliance,
Host node Node1List will be stored in after from network collection to the multiple transaction sequence that need to be placed in new block, and by the list to
Alliance Broadcast diffuses to other nodes Node2、Node3、Node4Deng；
The step C:Prepare stage: after each node receives transaction List Table, these transaction are executed according to sequence simulation.
After All Activity has executed, the Hash digest of new block is calculated based on transaction results, and broadcast to the whole network, Node2->
Node1Node3Node4, Node3->Node1Node2Node4, Node4Because delay machine can not broadcast (in alliance it is possible that this
The node of sample)；
The step D:Commit stage: if the 2m (m is tolerable Byzantium's number of nodes) that a node receives is a other
The abstract that node is sent is all equal with oneself, just broadcasts a commit message to the whole network；
The step E:Reply stage: if a node receives 2m+1 commit message, newly-generated response can be submitted
Local block chain and slip condition database are arrived in block and its transaction (message of transmission)；
Step 4: the message in each alliance's chain is shared, and the vehicle for needing to know this message in other alliances is passed to
Node, across the chain technology of Cosmos developed by Tendermint team are realized；
The shared transmitting of the message refers to the block being proved to be successful in each alliance by accounting nodes common recognition in alliance
Between mutually transmit, share to other vehicle nodes for needing to obtain such message, such as: the vehicle section of expressway region alliance
Suggestion is obtained in relation to the message of parking and cuisines in commercial circle；
Across the chain technology of the Cosmos refers to the technology of Tendermint team exploitation.Cosmos is claimed by many
For " subregion " independent blocks chain form network.First subregion of Cosmos is referred to as Cosmos hinge.Cosmos pivot
Knob is a kind of more assets equity proof encryption currency networks, it can be adapted to and be risen to network by simple governance mechanism
Grade.In addition, Cosmos hinge can realize extension by linking other subregions.
The hinge of Cosmos network and each subregion can communicate (IBC) agreement by block interchain and be communicated, this
Virtual User datagram protocol (UDP) or transmission control protocol (TCP) of the agreement aiming at block chain.Token can pacify
Entirely, other subregions rapidly are gone to from a subregion, without gathering around between two subregions with exchange mobility.On the contrary, institute
There is the token transfer across subregion all can carry out the total amount that each subregion of tracing record holds token by Cosmos hinge with this.This
A hinge can keep apart each subregion and other failure subregions.Because everyone can be by new piecewise connection to Cosmos
Hinge, thus subregion by can be new with back compatible block chain technology.The interoperability of block interchain may be implemented using Cosmos,
Wherein, IBC is communicated using across chain between cosmos hinge and subregion.
Step 5: message transmission being carried out by above step between the node in each alliance, and then by cosmos across chain
Technology realizes the information transmitting of the whole network.
Beneficial effect
The present invention provides a kind of car networking Data Exchange Model based on block chain, on the basis of alliance's chain and relaying chain
On, it realizes the car networking traffic model of decentralization, supports to transmit real-time messages in user's driving process, solve traditional vehicle connection
Safety present in net centralized architecture and performance issue.In the model, pass through the area attributes multiple and different in city
Domain is divided into multiple alliances, and then forms alliance's chain by different nodes, forms extensive self-care community, transmits the speed of message
Faster.In view of having great deal of nodes in alliance and multiple message transmission occurring, if verifying message successfully needs to generate greatly
The block of amount, provides a kind of matching access strategy mechanism, and just being verified to the greatest extent for successful match generates block and block chain is added
Network.This mechanism is greatly reduced unnecessary record and generates, to reduce the expense for generating block.It is integrated by introducing
System, the node for transmitting spoofing deducts it and realizes the integral submitted, for receiving the node of message, if false ring
It answers, it will the integral before deducting as cash pledge guarantees authenticity, the validity of information as far as possible.Skill is relayed by introducing
Art (Cosmos) realizes the transaction of different alliances in the model, i.e. message transmission.
Detailed description of the invention
Fig. 1 is system structure diagram of the invention；
Fig. 2 is access strategy structural schematic diagram in the present invention；
Fig. 3 is the flow chart of message transmission in the present invention.
Specific embodiment
Below with reference to specific example and Figure of description, the invention will be further described.
In the present embodiment, due to alliance's chain is related to more than region and between distance it is distant, pass through Program Generating
Each node location replaces in alliance, runs the present embodiment by emulation experiment.In conjunction with JAVA block chain open source projects, alliance's chain
Using JAVA language, realize that vehicle node has different node IPs in a program based on SpringBoot exploitation.Block memory
Storage is SQL statement, and embedded data library uses MySQL.Across chain technology uses open source projects Cosmos, it is only necessary to call
Cosmos-SDK develops Plugin, handles peculiar business, write the application program for meeting ABCI interface.
A kind of car networking Message-Passing Model based on block chain, including the following steps:
Step 1: model uses alliance's chain framework, there are multiple alliances in car networking, between the node in each networking
Carry out information transmitting；
Alliance's chain refers to that the block chain that preselected node controls can be received during common recognition, in the model, leads to
Certain RSU nodes in alliance in regional center are often chosen as accounting nodes, participate in common recognition process；
Information transmitting refers to that a vehicle node OBU sends first message between the node, by way of broadcast
Transmitting generates record block by common recognition algorithm common recognition, charges to block link network after other vehicle nodes are received and are proved to be successful
In network；
In this example, node sends a piece of news M, next formulates access strategy.
Step 2: user when driving, submits certain integral in locating alliance region, sends a real-time messages, passes through
Broadcast waits other vehicle nodes OBU to respond and is proved to be successful；
The integral refers to that the vehicle node for sending message needs to submit certain integral, only when other vehicle nodes
Generation responds block after obtaining this message and successful match, submits to accounting nodes therewith and is accumulated by return after common recognition
Give the vehicle node for sending message.
The information sending node OBU1It sends real-time messages and refers to OBU1He to one information of alliance's regional broadcast, it
Need to pay a definite integral, this information is broadcasted later, is waited other vehicle nodes to obtain information and is attempted matching；
Step 3: other vehicle nodes OBUXThe message for receiving broadcast, first attempts to the strategy matching that accesses, matching at
The user of function just can receive this message, receive the vehicle node OBU of message laterXIt needs to submit certain integral as signature
This record is sent to accounting nodes later by gold, waits accounting nodes to complete according to common recognition algorithm common recognition, block link network is added
In network；
The access strategy matching refers to the vehicle node OBU for preparing to receive messageXIt needs to go by the attribute of oneself
Matching sends the vehicle node OBU of message1The access strategy tree of formulation.Such as: OBU1Formulate access strategy tree { AND
{ " Parking ", OR { " Fee ", " next to the mall ", " space > 3 Remaining " } } }, another vehicle node
OBU2Attribute be { " Parking ", " Free ", " Remaining space=5 " }；
In this example, program is using following code as access strategy and user property:
// example 1
Static String [] attr={ " baf1 ", " fim ", " foo " }；
Static String policy=" bar foo fim goo 1of2baf1 1of2 2of3baf bob 1of2
1of2"；
// example 2
Static String [] attr_sara=
"hire_date_flexint_0xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
xxxxxxxxxxxxxxx",
"hire_date_flexint_1332980893",
"hire_date_flexint_x0xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
xxxxxxxxxxxxxxx",
"hire_date_flexint_xx0xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
xxxxxxxxxxxxxxx",
"hire_date_flexint_xxx0xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
xxxxxxxxxxxxxxx",
"hire_date_flexint_xxxx0xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
xxxxxxxxxxxxxxx",
……
"hire_date_ge_2^02","hire_date_ge_2^04","hire_date_ge_2^08","hire_
date_ge_2^16",
"hire_date_lt_2^32","it_department",
"office_flexint_0xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
xxxxxxxxxxxx",
"office_flexint_1431",
"office_flexint_x0xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
xxxxxxxxxxxx",
……
"office_ge_2^02","office_ge_2^04","office_ge_2^08",
"office_lt_2^16","office_lt_2^32","sysadmin"}；
Static String policy_kevin_or_sara=
"hire_date_flexint_xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx0
xxxxx
"+"hire_date_flexint_xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
x0xxxx"
+"2of2hire_date_flexint_xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
x0xxxxxxxx"
+"hire_date_flexint_xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx0xxx
xxxx"
+"hire_date_flexint_xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx0xxx
xxx"
+
……
+"1of2executive_level_ge_2^04executive_level_ge_2^08executive_level_
ge_2^16executive_level_ge_2^32 1of5audit_group strategy_team 2of3business_
staff 2of2 1of2"；
The vehicle node OBU for receiving messageXIntegral is submitted to refer to preventing other vehicle nodes false as cash pledge
Response.Such as: the vehicle node having does not have successful match that can send this Message Record yet, arbitrarily goes matching message.
The accounting nodes refer to receiving the vehicle of message when match messages success by this record of common recognition proof of algorithm
Node OBUXThis message content can be obtained, this record is sent to accounting nodes later and waits common recognition.If by altogether
Know proof of algorithm success, then this records in the block network that can coalize；
By the value of the non-leaf nodes in read access strategy, it is identified as the character string of segmentation, finally goes attributes match:
The common recognition algorithm refer in alliance's chain frequently with common recognition the algorithm PBFT, PBFT of anti-Byzantine failure tolerance be one
Kind of state machine copy replication algorithm, i.e. service are modeled as state machine, state machine distributed system different nodes into
Row copy replication.The copy of each state machine saves the state of service, while also achieving the operation of service.It will be all
The set of copy composition is indicated using capital R, is arrived using 0 | R | each copy of -1 integer representation.Usually assume that failure
Number of nodes is m, and entire service node number is | R |=3m+1, m is possible to the maximum number of the copy of failure here.To the greatest extent
Pipe, which may exist, is more than 3m+1 copy, but additional copy cannot improve reliability other than reducing performance.
The PBFT algorithm steps are as follows:
Step A: a host node (Leader) is elected from all nodes of alliance, new block is responsible for generation by host node；
The step B:Pre-Prepare stage: the transaction that each node sends client other node broadcasts into alliance,
Host node Node1List will be stored in after from network collection to the multiple transaction sequence that need to be placed in new block, and by the list to
Alliance Broadcast diffuses to other nodes Node2、Node3、Node4Deng；
The step C:Prepare stage: after each node receives transaction List Table, these transaction are executed according to sequence simulation.
After All Activity has executed, the Hash digest of new block is calculated based on transaction results, and broadcast to the whole network, Node2->
Node1Node3Node4, Node3->Node1Node2Node4, Node4Because delay machine can not broadcast (in alliance it is possible that this
The node of sample)；
The step D:Commit stage: if the 2m (m is tolerable Byzantium's number of nodes) that a node receives is a other
The abstract that node is sent is all equal with oneself, just broadcasts a commit message to the whole network；
The step E:Reply stage: if a node receives 2m+1 commit message, newly-generated response can be submitted
Local block chain and slip condition database are arrived in block and its transaction (message of transmission)；
After each node receives the proposal of 2m+1 to the same view, following procedure, which represents, generates new block:
Each node i p port list is obtained from server, group is added:
Step 4: the message in each alliance's chain is shared, and the vehicle for needing to know this message in other alliances is passed to
Node, across the chain technology of Cosmos developed by Tendermint team are realized；
The shared transmitting of the message refers to the block being proved to be successful in each alliance by accounting nodes common recognition in alliance
Between mutually transmit, share to other vehicle nodes for needing to obtain such message, such as: the vehicle section of expressway region alliance
Suggestion is obtained in relation to the message of parking and cuisines in commercial circle；
Across the chain technology of the Cosmos refers to the technology of Tendermint team exploitation.Cosmos is claimed by many
For " subregion " independent blocks chain form network.First subregion of Cosmos is referred to as Cosmos hinge.Cosmos pivot
Knob is a kind of more assets equity proof encryption currency networks, it can be adapted to and be risen to network by simple governance mechanism
Grade.In addition, Cosmos hinge can realize extension by linking other subregions.
The hinge of Cosmos network and each subregion can communicate (IBC) agreement by block interchain and be communicated, this
Virtual User datagram protocol (UDP) or transmission control protocol (TCP) of the agreement aiming at block chain.Token can pacify
Entirely, other subregions rapidly are gone to from a subregion, without gathering around between two subregions with exchange mobility.On the contrary, institute
There is the token transfer across subregion all can carry out the total amount that each subregion of tracing record holds token by Cosmos hinge with this.This
A hinge can keep apart each subregion and other failure subregions.Because everyone can be by new piecewise connection to Cosmos
Hinge, thus subregion by can be new with back compatible block chain technology.The interoperability of block interchain may be implemented using Cosmos,
Wherein, IBC is communicated using across chain between cosmos hinge and subregion.
Cosmos-sdk Open Source Code on Github has following: client, crypto, networks, servers,
Tools, scripts etc. core code packet.Wherein, the logic of ABCI App program is realized in app and server catalogue.
The logic of App program is relatively easy, mainly realizes the interface of ABCI, calls Stack, specific to operate by one of Stack
A middleware processing.
Message is created by realizing Msg interface:
Message is encoded with JSON and is signed by sender:
It after realizing core logic, is stored by initialization, calls ABCI interface.Start to carry out message transmission.
It is filled and is stored with account information:
Step 5: message transmission being carried out by above step between the node in each alliance, and then by cosmos across chain
Technology realizes the information transmitting of the whole network.
Sample result analysis can be greatly lowered unnecessary block by the model and generate, it is average to generate block expense
42.5% is reduced, block expense, raising efficiency are reduced；The present invention uses Cosmos across chain technology on the basis of alliance's chain simultaneously
Realize a great problem between block chain, the transaction between chain chain.Although across chain technology is still constantly improve development, the invention is preliminary
Car networking decentralization is solved the problems, such as in conjunction with this technology and realizes the information transmitting between different alliances.
Claims (3)
1. a kind of car networking Data Exchange Model based on block chain, comprising the following steps:
Step 1: model uses alliance's chain framework, there are multiple alliances in car networking, carries out between the node in each networking
Information transmitting；
Alliance's chain refers to that the block chain that preselected node controls can be received during common recognition, in the model, usually selects
It takes certain RSU nodes in alliance in regional center as accounting nodes, participates in common recognition process；
Information transmitting refers to that a vehicle node OBU sends first message between the node, is transmitted by way of broadcast,
After other vehicle nodes are received and are proved to be successful, record block is generated by common recognition algorithm common recognition, is charged in block chain network；
Step 2: user when driving, submits certain integral in locating alliance region, a real-time messages is sent, by wide
It broadcasts, other vehicle nodes OBU is waited to respond and is proved to be successful；
The integral refers to that the vehicle node for sending message needs to submit certain integral, only when other vehicle nodes obtain
Response block is generated after this message and successful match, submit to therewith accounting nodes by returned after common recognition integral to
Send the vehicle node of message.
The information sending node OBU1It sends real-time messages and refers to OBU1, to one information of alliance's regional broadcast, it is needed for he
A definite integral is paid, this information is broadcasted later, is waited other vehicle nodes to obtain information and is attempted matching；
Step 3: other vehicle nodes OBUXThe message for receiving broadcast first attempts to the strategy matching that accesses, the use of successful match
Family just can receive this message, receive the vehicle node OBU of message laterXNeed to submit certain integral as cash pledge, it
This record is sent to accounting nodes afterwards, waits accounting nodes to complete according to common recognition algorithm common recognition, is added in block chain network；
The access strategy matching refers to the vehicle node OBU for preparing to receive messageXIt needs that matching is gone to send out by the attribute of oneself
Send the vehicle node OBU of message1The access strategy tree of formulation.Such as: OBU1Formulate access strategy tree { AND { " Parking ", OR
{ " Fee ", " next to the mall ", " space > 3 Remaining " } } }, another vehicle node OBU2Attribute be
{ " Parking ", " Free ", " Remaining space=5 " }；
The vehicle node OBU for receiving messageXIntegral is submitted to refer to preventing other vehicle node false responses as cash pledge.
Such as: the vehicle node having does not have successful match that can send this Message Record yet, arbitrarily goes matching message.
The accounting nodes refer to receiving the vehicle section of message when match messages success by this record of common recognition proof of algorithm
Point OBUXThis message content can be obtained, this record is sent to accounting nodes later and waits common recognition.If calculated by common recognition
Method is proved to be successful, then this records in the block network that can coalize；
The common recognition algorithm refer in alliance's chain frequently with common recognition the algorithm PBFT, PBFT of anti-Byzantine failure tolerance be a kind of shape
State machine copy replication algorithm, i.e. service are modeled as state machine, and state machine carries out secondary in the different nodes of distributed system
This duplication.The copy of each state machine saves the state of service, while also achieving the operation of service.By all copies
The set of composition is indicated using capital R, is arrived using 0 | R | each copy of -1 integer representation.Usually assume that malfunctioning node
Number is m, and entire service node number is | R |=3m+1, m is possible to the maximum number of the copy of failure here.Although can
It is more than 3m+1 copy to exist, but additional copy cannot improve reliability other than reducing performance.
The PBFT algorithm steps are as follows:
Step A: a host node (Leader) is elected from all nodes of alliance, new block is responsible for generation by host node；
The step B:Pre-Prepare stage: the transaction that each node sends client other node broadcasts into alliance, main section
Point Node1List will be stored in after from network collection to the multiple transaction sequence that need to be placed in new block, and by the list to alliance
Broadcast, diffuses to other nodes Node2、Node3、Node4Deng；
The step C:Prepare stage: after each node receives transaction List Table, these transaction are executed according to sequence simulation.It is all
After transaction has executed, the Hash digest of new block is calculated based on transaction results, and broadcast to the whole network, Node2->Node1 Node3
Node4, Node3->Node1 Node2 Node4, Node4Because delay machine can not be broadcasted (it is possible that such section in alliance
Point)；
The step D:Commit stage: if 2m (m is tolerable Byzantium's number of nodes) a other nodes that a node receives
The abstract sent is all equal with oneself, just broadcasts a commit message to the whole network；
The step E:Reply stage: if a node receives 2m+1 commit message, newly-generated response block can be submitted
And its local block chain and slip condition database are arrived in transaction (message of transmission)；
Step 4: the message in each alliance's chain is shared, and passes to the vehicle section for needing to know this message in other alliances
Point, across the chain technology of Cosmos developed by Tendermint team are realized；
The shared transmitting of the message refers to the block being proved to be successful in each alliance by accounting nodes common recognition between alliance
Mutually transmitting, shares to other vehicle nodes for needing to obtain such message, such as: the vehicle node of expressway region alliance is uncommon
It hopes and obtains in relation to the message of parking and cuisines in commercial circle；
Across the chain technology of the Cosmos refers to the technology of Tendermint team exploitation.Cosmos is referred to as by many
The network of the independent blocks chain composition of " subregion ".First subregion of Cosmos is referred to as Cosmos hinge.Cosmos hinge is
A kind of more assets equity proof encryption currency networks, it can be adapted to and be upgraded to network by simple governance mechanism.
In addition, Cosmos hinge can realize extension by linking other subregions.
The hinge of Cosmos network and each subregion can communicate (IBC) agreement by block interchain and be communicated, this agreement
Aiming at the Virtual User datagram protocol (UDP) or transmission control protocol (TCP) of block chain.Token can safely, fastly
Fast ground goes to other subregions from a subregion, without gathering around between two subregions with exchange mobility.On the contrary, it is all across point
The token transfer in area all can carry out the total amount that each subregion of tracing record holds token by Cosmos hinge with this.This hinge
Each subregion and other failure subregions can be kept apart.Because everyone can by new piecewise connection to Cosmos hinge,
So subregion by can be new with back compatible block chain technology.The interoperability of block interchain may be implemented using Cosmos, wherein
IBC is communicated using across chain between cosmos hinge and subregion.
Step 5: message transmission being carried out by above step between the node in each alliance, and then passes through across the chain technology of cosmos
Realize the information transmitting of the whole network.
2. the method according to claim 1, wherein be different from traditional car networking based on centralization framework,
The invention is based on alliance's chain and relaying chain is realized, the transaction problem between block chain is solved using across chain technology, in certain journey
Decentralization is realized on degree, solves the problems, such as Single Point of Faliure and performance issue.Alliance's chain li side facilities units section in the invention
Point can be the nodes such as gas station, retail shop, traffic monitoring facilities, convenient for verifying the correctness of block information during common recognition.
3. the method according to claim 1, wherein the access strategy matching the following steps are included:
Step 1: sending information node OBU1Formulate one's own access strategy tree AND " Parking ", OR " Fee ",
"next to the mall","Remaining space>3"}}}；
Step 2: the node for receiving message is first matched, OBU2Attribute be { " Parking ", " Free ", " Remaining
Space=5 " }；Access strategy by matching OBU1 finds that the attribute of OBU2 meets the access strategy, then OBU2, which can get, is somebody's turn to do
Message sends this record to accounting nodes by OBU2 later, verifies whether to generate new block by common recognition.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910166226.1A CN109922149A (en) | 2019-03-06 | 2019-03-06 | A kind of car networking Data Exchange Model based on block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910166226.1A CN109922149A (en) | 2019-03-06 | 2019-03-06 | A kind of car networking Data Exchange Model based on block chain |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109922149A true CN109922149A (en) | 2019-06-21 |
Family
ID=66963438
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910166226.1A Pending CN109922149A (en) | 2019-03-06 | 2019-03-06 | A kind of car networking Data Exchange Model based on block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109922149A (en) |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110535687A (en) * | 2019-07-30 | 2019-12-03 | 大连理工大学 | The collaboration caching method of lightweight block chain under a kind of environment based on car networking |
| CN110766408A (en) * | 2019-10-24 | 2020-02-07 | 杭州趣链科技有限公司 | Cross-chain transaction verification method, engine, equipment and storage medium for heterogeneous block chain |
| CN110942524A (en) * | 2019-12-05 | 2020-03-31 | 中国科学院自动化研究所 | Cloud edge end cooperative parking management timing charging system and method based on block chain |
| CN110995852A (en) * | 2019-12-12 | 2020-04-10 | 北京诚达交通科技有限公司 | Vehicle path recording method and system |
| CN111050303A (en) * | 2019-12-13 | 2020-04-21 | 国家计算机网络与信息安全管理中心山东分中心 | Intelligent Internet of vehicles implementation method and system based on block chain technology |
| CN111064800A (en) * | 2019-12-26 | 2020-04-24 | 杭州云象网络技术有限公司 | Block chain technology-based safe vehicle contact social network construction method |
| CN111277978A (en) * | 2020-01-21 | 2020-06-12 | 南京如般量子科技有限公司 | Vehicle networking system and method based on secret sharing and alliance chain |
| CN111404962A (en) * | 2020-03-26 | 2020-07-10 | 杭州复杂美科技有限公司 | Federation link point data transmission method, equipment and storage medium |
| CN111447591A (en) * | 2020-02-18 | 2020-07-24 | 江苏荣泽信息科技股份有限公司 | Vehicle networking data exchange method based on block chain |
| CN111479237A (en) * | 2020-04-06 | 2020-07-31 | 湖南大学 | Decentralized distributed VANET system based on block chain and deep learning |
| CN111510496A (en) * | 2020-04-16 | 2020-08-07 | 山东交通学院 | Traffic guidance system and method based on block chain information sharing |
| CN111600908A (en) * | 2020-06-17 | 2020-08-28 | 杭州云链趣链数字科技有限公司 | Data processing method, system, computer device and readable storage medium |
| CN111601258A (en) * | 2020-05-15 | 2020-08-28 | 浙江树人学院（浙江树人大学） | Vehicle networking node data safety communication method based on block chain |
| CN111797171A (en) * | 2020-07-22 | 2020-10-20 | 南京纯白矩阵科技有限公司 | Data synchronization system based on block chain cross-chain technology |
| CN111866066A (en) * | 2020-06-04 | 2020-10-30 | 江苏理工学院 | Vehicle networking consensus algorithm based on DPoS |
| CN112398853A (en) * | 2020-11-16 | 2021-02-23 | 东软集团股份有限公司 | Method, device and system for realizing alliance chain cross-chain communication |
| CN112636897A (en) * | 2020-12-17 | 2021-04-09 | 清华大学 | Data encryption method for intelligent networked automobile cloud control application and cloud control energy-saving system |
| CN114048482A (en) * | 2021-11-05 | 2022-02-15 | 大连海事大学 | LSTM risk prediction access control method based on block chain |
| CN114980023A (en) * | 2022-06-02 | 2022-08-30 | 昆明理工大学 | Internet of vehicles data sharing method based on cross-chain technology |
| CN117478304A (en) * | 2023-12-28 | 2024-01-30 | 湖南天河国云科技有限公司 | Block chain management method, system and computer equipment |
-
2019
- 2019-03-06 CN CN201910166226.1A patent/CN109922149A/en active Pending
Cited By (30)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110535687A (en) * | 2019-07-30 | 2019-12-03 | 大连理工大学 | The collaboration caching method of lightweight block chain under a kind of environment based on car networking |
| CN110535687B (en) * | 2019-07-30 | 2021-06-04 | 大连理工大学 | Cooperative caching method based on lightweight block chain in Internet of vehicles environment |
| CN110766408A (en) * | 2019-10-24 | 2020-02-07 | 杭州趣链科技有限公司 | Cross-chain transaction verification method, engine, equipment and storage medium for heterogeneous block chain |
| CN110942524A (en) * | 2019-12-05 | 2020-03-31 | 中国科学院自动化研究所 | Cloud edge end cooperative parking management timing charging system and method based on block chain |
| CN110942524B (en) * | 2019-12-05 | 2021-03-02 | 中国科学院自动化研究所 | Cloud edge end cooperative parking management timing charging system and method based on block chain |
| CN110995852A (en) * | 2019-12-12 | 2020-04-10 | 北京诚达交通科技有限公司 | Vehicle path recording method and system |
| CN111050303A (en) * | 2019-12-13 | 2020-04-21 | 国家计算机网络与信息安全管理中心山东分中心 | Intelligent Internet of vehicles implementation method and system based on block chain technology |
| CN111050303B (en) * | 2019-12-13 | 2022-12-06 | 国家计算机网络与信息安全管理中心山东分中心 | Intelligent Internet of vehicles implementation method and system based on block chain technology |
| CN111064800A (en) * | 2019-12-26 | 2020-04-24 | 杭州云象网络技术有限公司 | Block chain technology-based safe vehicle contact social network construction method |
| CN111064800B (en) * | 2019-12-26 | 2022-04-19 | 杭州云象网络技术有限公司 | Block chain technology-based safe vehicle contact social network construction method |
| CN111277978A (en) * | 2020-01-21 | 2020-06-12 | 南京如般量子科技有限公司 | Vehicle networking system and method based on secret sharing and alliance chain |
| CN111277978B (en) * | 2020-01-21 | 2022-11-01 | 南京如般量子科技有限公司 | Vehicle networking system and method based on secret sharing and alliance chain |
| CN111447591A (en) * | 2020-02-18 | 2020-07-24 | 江苏荣泽信息科技股份有限公司 | Vehicle networking data exchange method based on block chain |
| CN111404962B (en) * | 2020-03-26 | 2022-06-24 | 杭州复杂美科技有限公司 | Federation link point data transmission method, equipment and storage medium |
| CN111404962A (en) * | 2020-03-26 | 2020-07-10 | 杭州复杂美科技有限公司 | Federation link point data transmission method, equipment and storage medium |
| CN111479237A (en) * | 2020-04-06 | 2020-07-31 | 湖南大学 | Decentralized distributed VANET system based on block chain and deep learning |
| CN111510496B (en) * | 2020-04-16 | 2023-04-07 | 山东交通学院 | Traffic guidance system and method based on block chain information sharing |
| CN111510496A (en) * | 2020-04-16 | 2020-08-07 | 山东交通学院 | Traffic guidance system and method based on block chain information sharing |
| CN111601258A (en) * | 2020-05-15 | 2020-08-28 | 浙江树人学院（浙江树人大学） | Vehicle networking node data safety communication method based on block chain |
| CN111866066B (en) * | 2020-06-04 | 2023-11-07 | 江苏理工学院 | Internet of vehicles consensus algorithm based on DPoS |
| CN111866066A (en) * | 2020-06-04 | 2020-10-30 | 江苏理工学院 | Vehicle networking consensus algorithm based on DPoS |
| CN111600908A (en) * | 2020-06-17 | 2020-08-28 | 杭州云链趣链数字科技有限公司 | Data processing method, system, computer device and readable storage medium |
| CN111797171A (en) * | 2020-07-22 | 2020-10-20 | 南京纯白矩阵科技有限公司 | Data synchronization system based on block chain cross-chain technology |
| CN112398853B (en) * | 2020-11-16 | 2023-04-18 | 东软集团股份有限公司 | Method, device and system for realizing alliance chain cross-chain communication |
| CN112398853A (en) * | 2020-11-16 | 2021-02-23 | 东软集团股份有限公司 | Method, device and system for realizing alliance chain cross-chain communication |
| CN112636897A (en) * | 2020-12-17 | 2021-04-09 | 清华大学 | Data encryption method for intelligent networked automobile cloud control application and cloud control energy-saving system |
| CN114048482A (en) * | 2021-11-05 | 2022-02-15 | 大连海事大学 | LSTM risk prediction access control method based on block chain |
| CN114980023A (en) * | 2022-06-02 | 2022-08-30 | 昆明理工大学 | Internet of vehicles data sharing method based on cross-chain technology |
| CN117478304A (en) * | 2023-12-28 | 2024-01-30 | 湖南天河国云科技有限公司 | Block chain management method, system and computer equipment |
| CN117478304B (en) * | 2023-12-28 | 2024-03-01 | 湖南天河国云科技有限公司 | Block chain management method, system and computer equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109922149A (en) | A kind of car networking Data Exchange Model based on block chain | |
| Baza et al. | B-ride: Ride sharing with privacy-preservation, trust and fair payment atop public blockchain | |
| Shrestha et al. | A new type of blockchain for secure message exchange in VANET | |
| Singh et al. | Branch based blockchain technology in intelligent vehicle | |
| Hammi et al. | Bubbles of Trust: A decentralized blockchain-based authentication system for IoT | |
| Wang et al. | Challenges and solutions in autonomous driving: A blockchain approach | |
| Li et al. | Toward blockchain-based fair and anonymous ad dissemination in vehicular networks | |
| Lopez et al. | A multi-layered blockchain framework for smart mobility data-markets | |
| CN109275122B (en) | Service-proof-based consensus protocol design and Internet of vehicles application method thereof | |
| Sharma et al. | Blockchain-based internet of vehicles (IoV): an efficient secure ad hoc vehicular networking architecture | |
| CN111314871B (en) | Safe sharing travel service scheme based on alliance block chain | |
| Guo et al. | Proof-of-event recording system for autonomous vehicles: A blockchain-based solution | |
| CN109068299A (en) | A kind of car networking framework and its working method based on block chain | |
| Feng et al. | Blockchain-based data management and edge-assisted trusted cloaking area construction for location privacy protection in vehicular networks | |
| Abbade et al. | Blockchain applied to vehicular odometers | |
| Zhao et al. | Federated learning-based collaborative authentication protocol for shared data in social IoV | |
| CN106572088A (en) | Vehicle-mounted self-organizing network pseudonym conversion method based on virtual user | |
| CN113905351A (en) | Internet of vehicles authentication method based on block chain and confidential calculation | |
| Meijers et al. | Blockchain for v2x: Applications and architectures | |
| Lu et al. | ATMChain: Blockchain‐Based Security Framework for Cyber‐Physics System in Air Traffic Management | |
| Jabbarpour et al. | Proposing a secure self-fining vehicle using blockchain and vehicular edge computing | |
| CN117241242A (en) | Hierarchical block chain consensus method for Internet of vehicles | |
| Xu et al. | Benefit and pricing of spatio-temporal information in Mobile Peer-to-Peer networks | |
| Sarkar et al. | Cloud enabled Blockchain-based secured communication in mutual intelligent transportation using neural synchronization | |
| Wu et al. | A trusted paradigm of data management for blockchain-enabled Internet of Vehicles in smart cities |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190621 |
|
| WD01 | Invention patent application deemed withdrawn after publication |