CN112751824A - Block chain-based vehicle-mounted named data network trust mechanism - Google Patents

Block chain-based vehicle-mounted named data network trust mechanism Download PDF

Info

Publication number
CN112751824A
CN112751824A CN202011368389.7A CN202011368389A CN112751824A CN 112751824 A CN112751824 A CN 112751824A CN 202011368389 A CN202011368389 A CN 202011368389A CN 112751824 A CN112751824 A CN 112751824A
Authority
CN
China
Prior art keywords
node
rsu
packet
vehicle
trust
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
Application number
CN202011368389.7A
Other languages
Chinese (zh)
Inventor
樊娜
邹小敏
李思瑞
段宗涛
王青龙
刘宁丽
王路阳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Changan University
Original Assignee
Changan University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Changan University filed Critical Changan University
Priority to CN202011368389.7A priority Critical patent/CN112751824A/en
Publication of CN112751824A publication Critical patent/CN112751824A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • 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/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
    • 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/20—Network architectures or network communication protocols for network security for managing network security; network security policies in general
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
    • 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

Abstract

The invention provides a block chain-based vehicle-mounted named data network trust mechanism. Firstly, a block chain network maintained by a roadside infrastructure (RSU) is built, and a trust value R of a vehicle node as a consumer is stored in the block chainconsumerAnd a trust value R when acting as a producerproducer(ii) a Second, RSU is based on RconsumerAnd RproducerCalculating a credit value R, and making a decision by inquiring the credit value R of a packet sending node from an RSU after a receiving node receives a packet; then, the receiving node marks the behavior of the packet sending node and returns the behavior to the RSU; finally, the RSU calculates the updated RconsumerAnd RproducerAnd added to the blockchain network. The trust between vehicles can be enhanced, and the interest packet flooding attack and the cache pollution attack in the vehicle-mounted named data network are inhibited.

Description

Block chain-based vehicle-mounted named data network trust mechanism
Technical Field
The invention relates to the technical field of safety trust of a vehicle-mounted named data network, in particular to a block chain-based vehicle-mounted named data network trust mechanism.
Background
Named Data Networks (NDNs) are a promising future Network architecture. NDN replaces IP addresses with hierarchical names, where forwarding of data depends on the name of the data, not the address of the data. Nodes in the NDN, which have two roles, i.e., consumers and producers, forward and transfer Data using Interest (Interest) packets and Data (Data) packets. NDN implements a secure content-based interest packet-data packet exchange model by embedding all security-related information into data packets. In addition, the cache function in the NDN network can enhance the content distribution in the network and improve the data access capability. Therefore, the named data network is applied to the scene of the Internet of vehicles, the problem of unstable communication caused by high mobility of vehicle nodes in the Internet of vehicles can be well solved, and the network request satisfaction rate and the network safety are improved. However, the introduction of NDN also brings new security problems, such as packet-of-interest flooding attacks and cache pollution attacks. The interest packet flooding attack is that a malicious consumer sends a large number of unsatisfiable interest packets with different names to occupy PIT resources, so that the requests of legal nodes cannot be satisfied. The cache pollution attack is that a malicious node occupies a cache by sending invalid contents. These attacks can cause data security problems and reduce network performance.
Aiming at the problems, the invention provides a block chain-based vehicle-mounted named data network trust mechanism, which can enhance trust among vehicles and inhibit interest packet flooding attack and cache pollution attack in a vehicle-mounted named data network. The block chain is a novel application mode of computer information technologies such as distributed data storage, point-to-point transmission, a consensus mechanism and an encryption algorithm. The block chain has the characteristics of decentralization, tamper resistance, traceability, anonymity and the like, and the safety of the network can be improved by applying the block chain to the Internet of vehicles.
Disclosure of Invention
The invention aims to provide a block chain-based vehicle-mounted named data network trust mechanism to improve the network security.
A block chain-based vehicle-mounted named data network trust mechanism specifically comprises the following steps:
step 1), building a block chain network maintained by an RSU, and storing a trust value when a vehicle node is used as a consumer and a trust value when the vehicle node is used as a producer in the block chain;
step 2), the receiving node queries the reputation value of the packet sending node from the RSU closest to the receiving node;
step 3), the receiving node judges the type of the received packet and makes a decision according to the credit value obtained in the step 2);
step 4), the receiving node marks the behavior of the packet sending node and returns the behavior to the RSU;
and 5), the RSU calculates the updated trust value and adds the trust value to the block chain network.
Further, the RSU monitors and manages the vehicle nodes within its communication range while maintaining a blockchain network on which to record and update the trust values of the vehicle nodes as consumers and producers.
Further, in step 2), the vehicle node ViReceives from node VjTo its nearest RSU, querying the vehicle node VjReputation value of
Figure BSA0000226157310000021
The method comprises the following specific steps:
2.1 RSU query blockchain derivation
Figure BSA0000226157310000022
And
Figure BSA0000226157310000023
2.2 RSU calculate reputation value by equation (1)
Figure BSA0000226157310000024
Wherein
Figure BSA0000226157310000025
Figure BSA0000226157310000026
2.3 RSU will reputation value
Figure BSA0000226157310000027
Returned to vehicle node Vi。
Further, in step 3), the vehicle node ViJudging whether the received packet is an Interest packet and returning the reputation value according to the step 2)
Figure BSA0000226157310000028
A decision is made. The method comprises the following specific steps:
3.1 node ViA preset threshold Th and a credit value
Figure BSA0000226157310000029
And (4) comparing, and if the formula (2) is not satisfied, discarding the Interest packet.
Figure BSA0000226157310000031
Where Th (Th ∈ [0, 1]) is an empirical threshold obtained through multiple tests.
3.2 node ViAnd inquiring whether the CS caches the Data packet matched with the Interest packet. If cached, the Data packet is returned to node VjOtherwise, it is checked whether there is a related entry in the PIT. If yes, updating a source interface of the PIT item, and discarding the Interest packet; otherwise, a new PIT entry is created and the Interest packet is forwarded.
3.3 node ViJudging the node V according to the consumerID field in the Interest packetjWhether it is a consumer, if VjIf it is a consumer, V is calculated according to the formula (3)jPIT utilization ratio
Figure BSA0000226157310000032
I.e. from node VjThe ratio of the interest packet related PIT entries to the PIT size. Node ViWill be provided with
Figure BSA0000226157310000033
Sent to the RSU.
Figure BSA0000226157310000034
Wherein the content of the first and second substances,
Figure BSA0000226157310000035
indicating receipt from consumer VjThe number of PIT entries of (a), PSize represents the size of the PIT. If VjAn interest packet flooding attack is launched, then
Figure BSA0000226157310000036
It will increase. Thus, it is possible to provide
Figure BSA0000226157310000037
The larger, VjThe less trustworthy.
Further, in step 4), the RSU receives the returned
Figure BSA0000226157310000038
And computing a trust value based on (4) and (5)
Figure BSA0000226157310000039
Figure BSA00002261573100000310
Figure BSA00002261573100000311
Wherein
Figure BSA00002261573100000312
Represents a node VjLast time of use
Figure BSA00002261573100000313
p is the trust impact factor, p is the value of
Figure BSA00002261573100000314
In inverse proportion. When V isjOf nodes in the network when initiating an interest packet flooding attack
Figure BSA00002261573100000315
The value will increase, the value of p will decrease,
Figure BSA00002261573100000316
it will be reduced. Alpha and beta are weight factors, and the optimal values are obtained according to multiple experiments, so that the relation that alpha is larger than beta, and alpha + beta is 1 is satisfied.
Further, in step 3), the vehicle node ViJudging whether the received packet is a Data packet and returning the credit value according to the step 2)
Figure BSA0000226157310000041
A decision is made. The method comprises the following specific steps:
4.1 if node ViIs the requester of the Data packet, and is node V according to the quality of the Data packetjScore and mark as q (q is equal to 0, 1)]) And sends q to the RSU. If q is 0, it indicates that the Data packet is invalid, then node ViAnd sending a Feedback packet containing the Data packet name to the RSU. Then RSU broadcasts the Feedback packet, after receiving the Feedback packet, the nodes in the network check whether the Data packet is cached in the CS, if so, the Data packet is deleted.
Further, in step 4), the RSU receives the returned score q, and calculates a trust value according to (6)
Figure BSA0000226157310000042
Figure BSA0000226157310000043
Wherein the content of the first and second substances,
Figure BSA0000226157310000044
represents VjLast time of use
Figure BSA0000226157310000045
q is ViGiving V the quality of received Data packetjThe higher the score,
Figure BSA0000226157310000046
the higher the value. Mu and lambda are two weight values, and the optimum value needs to be obtained by multiple experiments, wherein mu and lambda satisfy the relation that mu is more than lambda, and mu + lambda is 1.
4.2 if node ViNot the requester of the Data packet, queries its PIT for the presence of an associated entry. If not, the Data packet is dropped; otherwise, the Data packet is forwarded and the reputation value is compared
Figure BSA0000226157310000049
And a preset threshold Th. If the formula (2) is satisfied, caching the Data packet; otherwise, the buffer is not used.
Further, in step 5), the RSU will be updated
Figure BSA0000226157310000047
And
Figure BSA0000226157310000048
and recording as a transaction, forming a new block after sorting, broadcasting the block to other RSUs in the network for verification, and adding the newly generated block to a block chain after the verification is passed.
Compared with the prior art, the invention has the following beneficial technical effects:
the invention provides a block chain-based vehicle-mounted named data network trust mechanism. Firstly, a block chain network maintained by a roadside infrastructure (RSU) is built, and a trust value R of a vehicle node as a consumer is stored in the block chainconsumerAnd a trust value R when acting as a producerproducer(ii) a Second, RSU is based on RsonsumerAnd RproducerCalculating a credit value R, and making a decision by inquiring the credit value R of a packet sending node from an RSU after a receiving node receives a packet; then, the receiving node marks the behavior of the packet sending node and returns the behavior to the RSU; finally, the RSU calculates the updated RconsumerAnd RproducerAnd added to the blockchain network. The trust between vehicles can be enhanced, and the interest packet flooding attack and the cache pollution attack in the vehicle-mounted named data network are inhibited.
Drawings
Fig. 1 is a system architecture diagram.
Fig. 2 is a block diagram of a block chain.
Fig. 3 is a framework flow diagram of a trust mechanism.
Detailed Description
The invention is described in further detail below with reference to the accompanying drawings:
as shown in fig. 1 to fig. 3, the block chain-based vehicle-mounted named data network trust mechanism of the present invention specifically includes the following steps:
step 1), building a block chain network maintained by an RSU, and storing a trust value when a vehicle node is used as a consumer and a trust value when the vehicle node is used as a producer in the block chain;
step 2), the receiving node queries the reputation value of the packet sending node from the RSU closest to the receiving node;
step 3), the receiving node judges the type of the received packet and makes a decision according to the credit value obtained in the step 2);
step 4), the receiving node marks the behavior of the packet sending node and returns the behavior to the RSU;
and 5), the RSU calculates the updated trust value and adds the trust value to the block chain network.
Firstly, a block chain network maintained by a roadside infrastructure (RSU) is built, and a trust value R of a vehicle node as a consumer is stored in the block chainconsumerAnd a trust value R when acting as a producerproducer(ii) a Second, RSU is based on RconsumerAnd RproducerCalculating a credit value R, and after receiving the packet, the receiving node inquires the information of the packet sending node to the RSUA reputation value R to make a decision; then, the receiving node marks the behavior of the packet sending node and returns the behavior to the RSU; finally, the RSU calculates the updated RconsumerAnd RproducerAnd added to the blockchain network.
The present invention relates to three types of data packets: (1) interest package: when a consumer requests required data, an Interest packet is sent, wherein the name prefix of the requested data is contained; (2) data packet: the Data packet is returned according to a reverse path for forwarding the Interest packet if the producer receives the Interest packet and holds the content matched with the Interest packet; (3) feedback package: and when the consumer receives the invalid Data packet, sending a Feedback packet to the RSU, and reporting the name prefix of the Data packet. Adding a new field consumerID in an Interest packet for identifying the identity of a consumer sending the Interest packet; each node in the invention maintains three data structures: (1) content Store (CS): for storing content generated by the node itself or received from other nodes; (2) pending Interest Table (PIT): recording the information of the forwarded Interest packet, wherein each entry of the information comprises a name prefix and a source interface of the Interest packet; (3) forward Information Base (FIB): and recording the forwarding path of the node, wherein the forwarding path comprises the name prefix and the next hop information. In the invention, vehicle nodes are divided into different clusters, all vehicles in the effective communication range of each RSU form a cluster, and the RSU is used as a cluster head to manage the vehicle nodes in the cluster; simultaneously, a block chain maintained by all RSUs in the Internet of vehicles is designed, each RSU can perform operations of block creation, block verification and block addition, and identity information of a node and R of the node are recorded on the block chainconsumerAnd Rproducer. The block structure on the blockchain is shown in fig. 2. Suppose the set of vehicle nodes in the vehicle named-data network is V ═ V1，V2，...，VnIn which V isiAnd VjIs any two nodes.
A block chain-based vehicle-mounted named data network trust mechanism comprises the following steps:
step 1, vehicle nodeViReceives from node VjTo its nearest RSU, querying the vehicle node VjReputation value of
Figure BSA0000226157310000061
Step 2, RSU inquires block chain to obtain
Figure BSA0000226157310000062
And
Figure BSA0000226157310000063
and calculating a reputation value by equation (1)
Figure BSA0000226157310000064
And then compares the reputation value
Figure BSA0000226157310000065
Returned to vehicle node Vi. Wherein
Figure BSA0000226157310000067
Figure BSA0000226157310000066
Step 3, vehicle node ViJudging the type of the received packet, and if the packet is an Interest packet, entering the step 4; if the Data packet is, go to step 5.
Step 4, node ViBased on reputation value returned from RSU
Figure BSA0000226157310000071
The following steps are carried out:
4.1 node ViA preset threshold Th and a credit value
Figure BSA0000226157310000072
And (4) comparing, and if the formula (2) is not satisfied, discarding the Interest packet.
Figure BSA0000226157310000073
Where Th (Th ∈ [0, 1]) is an empirical threshold obtained through multiple tests.
4.2 node ViAnd inquiring whether the CS caches the Data packet matched with the Interest packet. If cached, the Data packet is returned to node VjOtherwise, it is checked whether there is a related entry in the PIT. If yes, updating a source interface of the PIT item, and discarding the Interest packet; otherwise, a new PIT entry is created and the Interest packet is forwarded.
4.3 node ViJudging the node V according to the consumerID field in the Interest packetjWhether it is a consumer, if VjIf it is a consumer, V is calculated according to the formula (3)jPIT utilization ratio
Figure BSA0000226157310000074
I.e. from node VjThe ratio of the interest packet related PIT entries to the PIT size. Node ViWill be provided with
Figure BSA0000226157310000075
Sent to the RSU. Then jump to step 6.
Figure BSA0000226157310000076
Wherein the content of the first and second substances,
Figure BSA0000226157310000077
indicating receipt from consumer VjThe number of PIT entries of (a), PSize represents the size of the PIT.
Step 5, node ViReceives from node VjAnd based on the reputation value returned from the RSU
Figure BSA0000226157310000078
The following steps are carried out:
5.1 if node ViIs the Data packetThe requester is node V according to the quality of the Data packetjScore and mark as q (q is equal to 0, 1)]) And gives q to the RSU. If q is 0, it indicates that the Data packet is invalid, then node ViAnd sending a Feedback packet containing the Data packet name to the RSU. Then RSU broadcasts the Feedback packet, after receiving the Feedback packet, the nodes in the network check whether the Data packet is cached in the CS, if so, the Data packet is deleted. Jump to step 7.
5.2 if node ViNot the requester of the Data packet, queries its PIT for the presence of an associated entry. If not, the Data packet is dropped; otherwise, the Data packet is forwarded and the reputation value is compared
Figure BSA0000226157310000081
And a preset threshold Th. If the formula (2) is satisfied, caching the Data packet; otherwise, the buffer is not used.
Step 6, RSU receives the return
Figure BSA0000226157310000082
And computing a trust value based on (4) and (5)
Figure BSA0000226157310000083
Then step 8 is entered.
Figure BSA0000226157310000084
Figure BSA0000226157310000085
Wherein
Figure BSA0000226157310000086
Represents a node VjLast time of use
Figure BSA0000226157310000087
p is the trust impact factor, p is the value of
Figure BSA0000226157310000088
In inverse proportion. Alpha and beta are weight factors, and the optimal values are obtained according to multiple experiments, so that the relation that alpha is larger than beta, and alpha + beta is 1 is satisfied.
And 7, the RSU receives the returned score q and calculates a trust value according to the (6)
Figure BSA0000226157310000089
Step 8 is entered.
Figure BSA00002261573100000810
Wherein the content of the first and second substances,
Figure BSA00002261573100000811
represents VjLast time of use
Figure BSA00002261573100000812
q is ViGiving V the quality of received Data packetjAnd (5) scoring. Mu and lambda are two weight values, and the optimum value needs to be obtained by multiple experiments, wherein mu and lambda satisfy the relation that mu is more than lambda, and mu + lambda is 1.
Step 8, RSU will be updated
Figure BSA00002261573100000813
And
Figure BSA00002261573100000814
and recording as a transaction, forming a new block after sorting, broadcasting the block to other RSUs in the network for verification, and adding the newly generated block to a block chain after the verification is passed.

Claims (8)

1. A block chain-based vehicle-mounted named data network trust mechanism is characterized by comprising the following steps:
step 1), building a block chain network maintained by an RSU, and storing a trust value when a vehicle node is used as a consumer and a trust value when the vehicle node is used as a producer in the block chain;
step 2), the receiving node queries the reputation value of the packet sending node from the RSU closest to the receiving node;
step 3), the receiving node judges the type of the received packet and makes a decision according to the credit value obtained in the step 2);
step 4), the receiving node marks the behavior of the packet sending node and returns the behavior to the RSU;
and 5), the RSU calculates the updated trust value and adds the trust value to the block chain network.
2. The blockchain-based vehicle-mounted named data network trust mechanism as claimed in claim 1, wherein the RSU monitors and manages vehicle nodes within communication range thereof, and maintains a blockchain network, and records and updates trust values of the vehicle nodes as consumers and producers on the blockchain network.
3. The block chain-based vehicle-mounted named data network trust mechanism as claimed in claim 1, wherein in step 2), the vehicle node ViReceives from node VjTo its nearest RSU, querying the vehicle node VjReputation value of
Figure FSA0000226157300000011
The method specifically comprises the following steps:
2.1 RSU query blockchain derivation
Figure FSA0000226157300000012
And
Figure FSA0000226157300000013
2.2 RSU calculate reputation value by equation (1)
Figure FSA0000226157300000014
Wherein
Figure FSA0000226157300000015
Figure FSA0000226157300000016
2.3 RSU will reputation value
Figure FSA0000226157300000017
Returned to vehicle node Vi。
4. The block chain-based vehicle-mounted named data network trust mechanism as claimed in claim 1, wherein in step 3), the vehicle node ViJudging whether the received packet is an Interest packet and returning the reputation value according to the step 2)
Figure FSA0000226157300000021
A decision is made. The method comprises the following specific steps:
3.1 node ViA preset threshold Th and a credit value
Figure FSA0000226157300000022
And (4) comparing, and if the formula (2) is not satisfied, discarding the Interest packet.
Figure FSA0000226157300000023
Where Th (Th ∈ [0, 1]) is an empirical threshold obtained through multiple tests.
3.2 node ViAnd inquiring whether the CS caches the Data packet matched with the Interest packet. If cached, the Data packet is returned to node VjOtherwise, it is checked whether there is a related entry in the PIT. If yes, updating a source interface of the PIT item, and discarding the Interest packet; otherwise, a new PIT entry is created and the Interest packet is forwarded.
3.3 node ViJudging the node V according to the consumerID field in the Interest packetjWhether or not it is consumptionIf V isjIf it is a consumer, V is calculated according to the formula (3)jPIT utilization ratio
Figure FSA0000226157300000024
I.e. from node VjThe ratio of the interest packet related PIT entries to the PIT size. Node ViWill be provided with
Figure FSA0000226157300000025
Sent to the RSU.
Figure FSA0000226157300000026
Wherein the content of the first and second substances,
Figure FSA0000226157300000027
indicating receipt from consumer VjThe number of PIT entries of (a), PSize represents the size of the PIT.
5. The mechanism as claimed in claim 4, wherein in step 4), the RSU receives the returned name data network trust mechanism
Figure FSA0000226157300000028
And computing a trust value based on (4) and (5)
Figure FSA0000226157300000029
Figure FSA00002261573000000210
Figure FSA00002261573000000211
Wherein
Figure FSA00002261573000000212
Represents a node VjLast time of use
Figure FSA00002261573000000213
p is the trust impact factor, p is the value of
Figure FSA00002261573000000214
In inverse proportion. Alpha and beta are weight factors, and the optimal values are obtained according to multiple experiments, so that the relation that alpha is larger than beta, and alpha + beta is 1 is satisfied.
6. The block chain-based vehicle-mounted named data network trust mechanism as claimed in claim 1, wherein in step 3), the vehicle node ViJudging whether the received packet is a Data packet and returning the credit value according to the step 2)
Figure FSA0000226157300000031
A decision is made. The method comprises the following specific steps:
4.1 if node ViIs the requester of the Data packet, and is node V according to the quality of the Data packetjScore and mark as q (q is equal to 0, 1)]) And sends q to the RSU. If q is 0, it indicates that the Data packet is invalid, then node ViAnd sending a Feedback packet containing the Data packet name to the RSU. Then RSU broadcasts the Feedback packet, after receiving the Feedback packet, the nodes in the network check whether the Data packet is cached in the CS, if so, the Data packet is deleted.
4.2 if node ViNot the requester of the Data packet, queries its PIT for the presence of an associated entry. If not, the Data packet is dropped; otherwise, the Data packet is forwarded and the reputation value is compared
Figure FSA0000226157300000032
And a preset threshold Th. If the formula (2) is satisfied, caching the Data packet; otherwise, the buffer is not used.
7. The method of claim 6A block chain-based vehicle-mounted named data network trust mechanism is characterized in that in step 4), an RSU receives a returned score q and calculates a trust value according to the score q (6)
Figure FSA0000226157300000033
Figure FSA0000226157300000034
Wherein the content of the first and second substances,
Figure FSA0000226157300000035
represents VjLast time of use
Figure FSA0000226157300000036
q is ViGiving V the quality of received Data packetjAnd (5) scoring. Mu and lambda are two weight values, and the optimum value needs to be obtained by multiple experiments, wherein mu and lambda satisfy the relation that mu is more than lambda, and mu + lambda is 1.
8. The mechanism of claim 1, wherein in step 5), the RSU updates the RSU
Figure FSA0000226157300000037
And
Figure FSA0000226157300000038
and recording as a transaction, forming a new block after sorting, broadcasting the block to other RSUs in the network for verification, and adding the newly generated block to a block chain after the verification is passed.
CN202011368389.7A 2020-11-30 2020-11-30 Block chain-based vehicle-mounted named data network trust mechanism Pending CN112751824A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011368389.7A CN112751824A (en) 2020-11-30 2020-11-30 Block chain-based vehicle-mounted named data network trust mechanism

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011368389.7A CN112751824A (en) 2020-11-30 2020-11-30 Block chain-based vehicle-mounted named data network trust mechanism

Publications (1)

Publication Number Publication Date
CN112751824A true CN112751824A (en) 2021-05-04

Family

ID=75648917

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011368389.7A Pending CN112751824A (en) 2020-11-30 2020-11-30 Block chain-based vehicle-mounted named data network trust mechanism

Country Status (1)

Country Link
CN (1) CN112751824A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113315703A (en) * 2021-05-31 2021-08-27 新疆大学 Optimization method and device of dynamic route forwarding strategy and related equipment

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160043940A1 (en) * 2014-08-11 2016-02-11 Palo Alto Research Center Incorporated Reputation-based instruction processing over an information centric network
CN107665405A (en) * 2017-09-26 2018-02-06 北京邮电大学 A kind of vehicle credit management method and device
CN109462836A (en) * 2018-11-09 2019-03-12 长安大学 Merge the car networking malicious node detection system and method for block chain common recognition mechanism
CN109767199A (en) * 2018-12-10 2019-05-17 西安电子科技大学 PBFT common recognition system and method, block chain data processing system based on prestige
CN110177356A (en) * 2019-05-31 2019-08-27 长安大学 A kind of vehicle-mounted name data network retransmission method based on trust model
CN110300107A (en) * 2019-06-25 2019-10-01 南京邮电大学 A kind of car networking secret protection trust model based on block chain
CN111447177A (en) * 2020-03-02 2020-07-24 西北工业大学 Vehicle networking trust management method based on block chain
CN111756546A (en) * 2020-06-15 2020-10-09 杭州电子科技大学 Block chain consensus method based on dynamic credit mechanism in Internet of vehicles environment
WO2020215247A1 (en) * 2019-04-24 2020-10-29 Nokia Technologies Oy Method and apparatus for supporting blockchain-based data storage in vehicular network
CN111967051A (en) * 2020-08-27 2020-11-20 安徽大学 Block chain-based inter-vehicle data safety sharing method and system

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160043940A1 (en) * 2014-08-11 2016-02-11 Palo Alto Research Center Incorporated Reputation-based instruction processing over an information centric network
CN107665405A (en) * 2017-09-26 2018-02-06 北京邮电大学 A kind of vehicle credit management method and device
CN109462836A (en) * 2018-11-09 2019-03-12 长安大学 Merge the car networking malicious node detection system and method for block chain common recognition mechanism
CN109767199A (en) * 2018-12-10 2019-05-17 西安电子科技大学 PBFT common recognition system and method, block chain data processing system based on prestige
WO2020215247A1 (en) * 2019-04-24 2020-10-29 Nokia Technologies Oy Method and apparatus for supporting blockchain-based data storage in vehicular network
CN110177356A (en) * 2019-05-31 2019-08-27 长安大学 A kind of vehicle-mounted name data network retransmission method based on trust model
CN110300107A (en) * 2019-06-25 2019-10-01 南京邮电大学 A kind of car networking secret protection trust model based on block chain
CN111447177A (en) * 2020-03-02 2020-07-24 西北工业大学 Vehicle networking trust management method based on block chain
CN111756546A (en) * 2020-06-15 2020-10-09 杭州电子科技大学 Block chain consensus method based on dynamic credit mechanism in Internet of vehicles environment
CN111967051A (en) * 2020-08-27 2020-11-20 安徽大学 Block chain-based inter-vehicle data safety sharing method and system

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
HAKIMA KHELIFI ET AL: "Reputation-Based Blockchain for Secure NDN Caching in Vehicular Networks", 《2018 IEEE CONFERENCE ON STANDARDS FOR COMMUNICATIONS AND NETWORKING (CSCN)》 *
刘江等: "基于命名数据网络的区块链信息传输机制", 《通信学报》 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113315703A (en) * 2021-05-31 2021-08-27 新疆大学 Optimization method and device of dynamic route forwarding strategy and related equipment

Similar Documents

Publication Publication Date Title
KR102301353B1 (en) Method for transmitting packet of node and content owner in content centric network
CN105376211B (en) Probabilistic delay forwarding technique without validation in content-centric networks
CN109905480B (en) Probabilistic cache content placement method based on content centrality
CN104753797B (en) A kind of content center network dynamic routing method based on selectivity caching
CN109921997B (en) Network caching method, cache and storage medium for named data
CN104811493B (en) The virtual machine image storage system and read-write requests processing method of a kind of network aware
US20070171911A1 (en) Routing system and method for managing rule entry thereof
CN109639758B (en) Method and device for protecting user behavior privacy in content-centric network
Mick et al. Muncc: Multi-hop neighborhood collaborative caching in information centric networks
CN105262833B (en) A kind of the cross-layer caching method and its node of content center network
CN109788319B (en) Data caching method
CN113783779B (en) Hierarchical random caching method in named data network
CN109040163B (en) Named data network privacy protection caching decision method based on k anonymity
Singh et al. A walkthrough of name data networking: Architecture, functionalities, operations and open issues
CN112751824A (en) Block chain-based vehicle-mounted named data network trust mechanism
Lal et al. A popularity based content eviction scheme via betweenness-centrality caching approach for content-centric networking (CCN)
CN113254743A (en) Secure semantic perception search method for dynamic spatial data in Internet of vehicles
CN108156249B (en) Network cache updating method based on approximate Markov chain
Liu et al. Blockchain-empowered content cache system for vehicle edge computing networks
CN112688880B (en) Method for reducing redundant data packet transmission in named data network
CN113382053B (en) Content active pushing method based on node semi-local centrality and content popularity
CN112822275B (en) Lightweight caching strategy based on TOPSIS entropy weight method
CN111262785B (en) Multi-attribute probability caching method in named data network
CN113810851A (en) Vehicle track privacy protection method for Internet of vehicles
Mei A dynamic ICN and IoT based caching method supporting high‐tech transformation

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
WD01 Invention patent application deemed withdrawn after publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20210504