CN116996846A - Data transmission method, device, electronic equipment, medium and program product - Google Patents
Data transmission method, device, electronic equipment, medium and program product Download PDFInfo
- Publication number
- CN116996846A CN116996846A CN202210447481.5A CN202210447481A CN116996846A CN 116996846 A CN116996846 A CN 116996846A CN 202210447481 A CN202210447481 A CN 202210447481A CN 116996846 A CN116996846 A CN 116996846A
- Authority
- CN
- China
- Prior art keywords
- node
- information
- state information
- trust value
- determining
- 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
- 230000005540 biological transmission Effects 0.000 title claims abstract description 51
- 238000000034 method Methods 0.000 title claims abstract description 47
- 230000003993 interaction Effects 0.000 claims abstract description 34
- 238000004590 computer program Methods 0.000 claims description 17
- 238000011156 evaluation Methods 0.000 claims description 13
- 239000011159 matrix material Substances 0.000 claims description 11
- 230000006870 function Effects 0.000 claims description 10
- 238000012795 verification Methods 0.000 claims description 10
- 238000004422 calculation algorithm Methods 0.000 claims description 7
- 238000004891 communication Methods 0.000 abstract description 10
- 238000010586 diagram Methods 0.000 description 6
- 230000006855 networking Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 241001331845 Equus asinus x caballus Species 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 2
- 230000006399 behavior Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 241000497429 Obus Species 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000012854 evaluation process Methods 0.000 description 1
- 230000005484 gravity Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/246—Connectivity information discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application relates to the technical field of communication, and provides a data transmission method, a data transmission device, electronic equipment, a medium and a program product. Comprising the following steps: under the condition that the first node receives the interest packet sent by the second node, determining the comprehensive trust value of the second node based on the times of successful forwarding of the data packet by the second node in the first preset time and interaction record information corresponding to the second node; and under the condition that the comprehensive trust value of the second node exceeds a first preset threshold and the information corresponding to the interest packet is not stored in the first node, determining target adjacent nodes in all adjacent nodes based on the first state information of all adjacent nodes corresponding to the first node and the second state information of the first node, wherein the first state information and the second state information comprise: node position information, node speed information, node driving direction information and comprehensive trust values; and forwarding the interest packet to the target adjacent node. And the security of data transmission is improved through the comprehensive trust value of each node.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a data transmission method, apparatus, electronic device, medium, and program product.
Background
The vehicle-mounted naming data network (Vehicular Named Data Networking, VDN) is a novel network for applying the naming data network to a vehicle-mounted self-organizing network environment, and has important application in the field of intelligent transportation. The VDN can effectively solve the problems of continuous change of network topology, intermittent communication link caused by rapid movement of nodes, frequent link interruption and the like in the car networking environment. At present, a great deal of research is being conducted on data transmission based on VNDN, and although there are a great deal of research results, the problem of intermittent connection and low transmission efficiency caused by rapid movement of vehicle nodes is mainly solved, and the problem of data transmission safety is not fully considered.
Therefore, how to ensure more reliable transmission of data in the VNDN network has become a problem to be solved in the industry.
Disclosure of Invention
The embodiment of the application provides a data transmission method, a device, electronic equipment, a medium and a program product, which are used for solving the technical problem of insufficient data transmission security in a VDN network.
In a first aspect, an embodiment of the present application provides a data transmission method, including:
under the condition that a first node receives an interest packet sent by a second node, determining the comprehensive trust value of the second node based on the times of successful forwarding of a data packet by the second node in a first preset time and interaction record information corresponding to the second node;
and under the condition that the comprehensive trust value of the second node exceeds a first preset threshold and the information corresponding to the interest packet is not stored in the first node, determining a target adjacent node in each adjacent node based on the first state information of each adjacent node corresponding to the first node and the second state information of the first node, wherein the first state information and the second state information comprise: node position information, node speed information, node driving direction information and comprehensive trust values;
forwarding the interest packet to the target adjacent node.
In one embodiment, the determining the comprehensive trust value of the second node based on the number of times that the second node successfully forwards the data packet in the first preset time and interaction record information corresponding to the second node includes:
Determining a direct trust value of the second node based on the times of successful forwarding of the data packet and the times of unsuccessful forwarding of the data packet in a first preset time by the second node;
determining an indirect trust value of the second node based on the similarity between the interaction record information of the first adjacent node corresponding to the second node and the interaction record information of the second node in the first preset time, wherein the first adjacent node is a node directly adjacent to the second node;
and analyzing the direct trust value and the indirect trust value based on a time decay function to determine the comprehensive trust value of the second node.
In one embodiment, after said determining the integrated trust value of the second node, further comprising:
broadcasting block information corresponding to the comprehensive trust value of the second node to all authorized roadside infrastructure nodes by the target roadside infrastructure nodes through a Bayesian fault-tolerant algorithm for common-identification verification;
and adding the block information into a block chain after each authorized roadside infrastructure node completes consensus verification.
In one embodiment, the determining, based on the first state information of each neighboring node corresponding to the first node and the second state information of the first node, a target neighboring node in the neighboring nodes includes:
Determining inter-node distance information, inter-node relative speed information and inter-node link duration of each adjacent node and the first node based on first state information of each adjacent node corresponding to the first node and second state information of the first node;
constructing an evaluation matrix based on inter-node distance information, inter-node relative speed information, inter-node link duration and comprehensive trust values in the first state information of each adjacent node and the first node;
and analyzing the evaluation matrix by a multi-attribute decision method to determine the target adjacent node in the adjacent nodes.
In one embodiment, the determining, based on the first state information of each neighboring node corresponding to the first node and the second state information of the first node, inter-node distance information, inter-node relative speed information, and inter-node link duration between each neighboring node and the first node includes:
determining inter-node distance information between each of the neighboring nodes and the first node based on node position information in the respective first state information and node position information in the second state information;
Determining relative speed information between each adjacent node and the first node based on the node speed information and the node driving direction information of the first state information and the second state information;
and determining inter-node link durations of each neighboring node and the first node based on the node position information, the node speed information, and the node travel direction information of each of the first state information and the second state information.
In a second aspect, an embodiment of the present application provides a data transmission apparatus, including: the first determining module is used for determining the comprehensive trust value of the second node based on the times of successful forwarding of the data packet by the second node in a first preset time and interaction record information corresponding to the second node under the condition that the first node receives the interest packet sent by the second node;
a second determining module, configured to determine, when the integrated trust value of the second node exceeds a first preset threshold and the information corresponding to the interest packet is not stored in the first node, a target neighboring node in each neighboring node based on first state information of each neighboring node corresponding to the first node and second state information of the first node, where the first state information and the second state information each include: node position information, node speed information, node driving direction information and comprehensive trust values;
And the transmission module is used for forwarding the interest packet to the target adjacent node.
In one embodiment, the second determining module is specifically configured to:
determining a direct trust value of the second node based on the times of successful forwarding of the data packet and the times of unsuccessful forwarding of the data packet in a first preset time by the second node;
determining an indirect trust value of the second node based on the similarity between the interaction record information of the first adjacent node corresponding to the second node and the interaction record information of the second node in the first preset time, wherein the first adjacent node is a node directly adjacent to the second node;
and analyzing the direct trust value and the indirect trust value based on a time decay function to determine the comprehensive trust value of the second node.
In a third aspect, an embodiment of the present application provides an electronic device, including a processor and a memory storing a computer program, where the processor implements the steps of the data transmission method according to the first or second aspect when executing the program.
In a fourth aspect, embodiments of the present application provide a computer program product comprising a computer program which, when executed by a processor, implements the steps of the data transmission method of the first or second aspect.
According to the data transmission method, the device, the electronic equipment, the medium and the program product, the target adjacent node for forwarding the interest packet is continuously searched only under the condition that the comprehensive trust value of the second node exceeds the first preset threshold value by calculating the comprehensive trust value of each node, and the comprehensive trust value of each node is fully considered in the process of searching the target adjacent node, so that reliable nodes are effectively selected for data forwarding, and the safety of data transmission is improved.
Drawings
In order to more clearly illustrate the application or the technical solutions of the prior art, the following description will briefly explain the drawings used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are some embodiments of the application, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic flow chart of a data transmission method according to an embodiment of the present application;
FIG. 2 is a schematic diagram of a vehicle-mounted named data networking described in an embodiment of the present application;
fig. 3 is a schematic structural diagram of a data transmission device according to an embodiment of the present application;
Fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present application more apparent, the technical solutions of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application, and it is apparent that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
Fig. 1 is a flow chart of a data transmission method according to an embodiment of the present application. Referring to fig. 1, an embodiment of the present application provides a data transmission method, which may include:
step 110, under the condition that a first node receives an interest packet sent by a second node, determining a comprehensive trust value of the second node based on the times of successful forwarding of a data packet by the second node in a first preset time and interaction record information corresponding to the second node;
specifically, the first node and the second node described in the embodiment of the present application are all vehicle nodes in the vehicle-mounted named data network, and fig. 2 is a schematic structural diagram of the vehicle-mounted named data network described in the embodiment of the present application, as shown in fig. 2, including: a certificate authority (CA, certificate Authority), one or more roadside infrastructure (RSU), one or more Vehicle nodes (Vehicle).
More specifically, CA is an important component in the system model, is an authority responsible for issuing and managing digital certificates, acts as a fully trusted third party, assumes responsibility for the validity check of public keys in the public key hierarchy, and manages all vehicles and RSUs. If there is a new vehicle to join the on-board ad hoc network, or the RSU wants to become a node of the block chain in the on-board ad hoc network, registration must first be effected at the CA. After successful registration, the authority will generate system common parameters for these vehicles and RSUs. In addition, each vehicle obtains a mutually different identity-based key and public key address (pseudonym) from the authority, and the authority records the correspondence between the true identity of the vehicle and the pseudonym.
A Road Side Unit (RSU) is an infrastructure installed at the Road Side to deploy a trust management model. The RSU has a certain storage capacity and computing power sufficient to perform trust management work. The RSUs in the same area can form a vehicle edge layer and are mainly responsible for calculating trust data uploaded by vehicle nodes and are used as consensus nodes of block chains to perform consensus on blocks. In this scheme, the blockchain of the RSUs is maintained jointly by all RSUs. Among these RSUs, there are a part of special RSUs, called authorized RSUs, whose task is to verify new blocks generated by other RSUs, thus achieving consensus in the blockchain.
The vehicle units are users in the vehicle-mounted ad hoc network, all vehicles are provided with vehicle-mounted units (OBUs) with good performance, the vehicles can wirelessly communicate with other vehicles and RSUs within a certain range, and vehicle nodes can upload own evaluations of the other vehicles to the RSUs to realize data information transmission. The vehicle may play four roles: producer, consumer, forwarder and data mule. The producer uses the sensor to collect data to generate data package; the consumer requests data from the network as a requester of the data; the forwarder is used as a relay node to be responsible for data forwarding; the data mules are vehicles which carry data but which have not been connected to other nodes in a network for a while. The communication between the vehicle nodes is mainly realized through the exchange of two Data packets, namely an Interest packet (Interest) and a Data packet (Data), wherein the Interest packet is responsible for requesting Data, and the Data packet is responsible for returning corresponding required Data.
After the first node receives the interest packet sent by the second node, the latest comprehensive trust value of the second node at the current moment is obtained based on the times of successful forwarding of the data packet by the second node in the first preset time and interaction record information corresponding to the second node, wherein the comprehensive trust value comprises a direct trust value of the first node to the second node and an indirect trust value from a neighboring node of the second node.
The first preset time described in the embodiment of the present application may be a preset time threshold, which may be specifically 24 hours or 48 hours, or may be shorter, for example, 30 minutes, or the like.
The number of times of successful forwarding of the data packet and the interactive record information described in the embodiment of the application are both data within a first preset time.
Step 120, determining, when the integrated trust value of the second node exceeds a first preset threshold and the information corresponding to the interest packet is not stored in the first node, a target neighboring node in each neighboring node based on first state information of each neighboring node corresponding to the first node and second state information of the first node, where the first state information and the second state information each include: node position information, node speed information, node driving direction information and comprehensive trust values;
specifically, in the embodiment of the present application, if the integrated trust value of the second node exceeds the first preset threshold, the reliability of the second node is considered to be higher, and the second node is determined to be a trusted node.
Optionally, if the integrated trust level of the second node is less than or equal to the first preset threshold, the trust level of the second node is considered to be lower, and forwarding the interest packet sent by the second node is abandoned.
Optionally, when the integrated trust value of the second node exceeds a first preset threshold and the information corresponding to the interest packet is stored in the first node, it is indicated that the first node may directly transmit the information corresponding to the interest packet back to the second node, and at this time, it is not necessary to continuously find a forwarding node for forwarding.
Optionally, in the case that the integrated trust value of the second node exceeds a first preset threshold and the information corresponding to the interest packet is not stored in the first node, the information corresponding to the interest packet needs to be forwarded to other nodes, so that the information corresponding to the interest packet is found from the other nodes.
In this case, the first node may preferentially find the node forwarding the interest packet from the neighboring nodes of the first node, and when finding the node forwarding the interest packet, it is necessary to find the node with higher security as much as possible, so that the target neighboring node in the neighboring nodes is determined by the first state information of the neighboring nodes corresponding to the first node and the second state information of the first node.
The first state information described in the embodiment of the application comprises node position information, node speed information, node driving direction information and comprehensive trust value of the first node.
The second state information described in the embodiment of the application comprises node position information, node speed information, node driving direction information and comprehensive trust value of the second node.
The target adjacent node described in the embodiment of the application is a node selected from all adjacent nodes of the first node for forwarding the interest packet.
And step 130, forwarding the interest packet to the target adjacent node.
In the embodiment of the application, after the target adjacent node is determined, the target adjacent node forwards the interest packet to the corresponding adjacent node.
Optionally, after the target neighboring node forwards the interest packet to its corresponding neighboring node, the corresponding neighboring node also further determines the comprehensive trust value of the target neighboring node, and confirms whether the information corresponding to the interest packet is stored in the corresponding neighboring node until the information corresponding to the interest packet is found.
In the embodiment of the application, the target adjacent node for forwarding the interest packet is continuously searched only under the condition that the comprehensive trust value of the second node exceeds the first preset threshold value by calculating the comprehensive trust value of each node, and the comprehensive trust value of each node is fully considered in the process of searching the target adjacent node, so that reliable nodes are effectively selected for data forwarding, and the safety of data transmission is improved.
Optionally, the determining, based on the number of times that the second node successfully forwards the data packet in the first preset time and interaction record information corresponding to the second node, the comprehensive trust value of the second node includes:
determining a direct trust value of the second node based on the times of successful forwarding of the data packet and the times of unsuccessful forwarding of the data packet in a first preset time by the second node;
determining an indirect trust value of the second node based on the similarity between the interaction record information of the first adjacent node corresponding to the second node and the interaction record information of the second node in the first preset time;
and analyzing the direct trust value and the indirect trust value based on a time decay function to determine the comprehensive trust value of the second node.
Specifically, in the embodiment of the application, if the vehicle nodes find that the surrounding vehicle nodes forward the data packet correctly within a certain time, the two nodes are regarded as performing a positive interaction, otherwise are regarded as performing a negative interaction, trust evaluation is performed through the positive interaction times and the negative interaction times among the nodes to obtain a direct trust value, and it can be understood that the first node observes the times of successful data packet forwarding and the times of unsuccessful data packet forwarding of the second node within a first preset time, so that trust evaluation is performed through the positive interaction times and the negative interaction times of the second node observed by the first node to obtain the direct trust value of the second node.
More specifically, in the embodiment of the present application, the first neighboring node corresponding to the second node specifically refers to a node neighboring the second node around the second node.
In the embodiment of the application, the recommendation trust degree is obtained by mutually recommending trust evaluation results among the nodes, so that the indirect trust degree is obtained, the indirect trust degree is used for avoiding subjectivity and unilateral property of direct trust to enhance the objectivity, and the nodes are mainly influenced by a third party, so that a plurality of neighbor recommendations are necessary to be used for calculation.
An indirect trust value of the second node is calculated based on the similarity between the interaction record information of each first neighboring node and the interaction record information of the second node. The trust values of all vehicles within their communication range are then updated, stored in an aggregated list using hashing techniques, and the aggregated list is then broadcast. Thus, all vehicle nodes may obtain indirect trust values for nodes of neighboring vehicles by querying the aggregated list.
More specifically, the time characteristic of the user behavior is a factor that must be paid attention to in the trust evaluation process, the trust needs to have time-decaying property, the reference degree to the recent trust degree is greater than the reference degree to the trust degree which is far away from the time, and the data and the evaluation result which are close to the current time should have higher specific gravity. Thus introducing a time decay function. The time decay function represents the most recent time principle, and the trust level decays to different degrees with the corresponding weight. The trust value of the node to other nodes gradually slows down gradually along with the time, namely the attenuation comfort of the value is in direct proportion to the current value, so that the direct trust value and the indirect trust value are analyzed based on a time attenuation function, and the comprehensive trust value of the second node is determined.
In the embodiment of the application, the integrated trust value of the second node is finally determined through a time decay function by fully considering the decay influence of the event on the trust degree after the direct trust value and the indirect trust value of the second node are respectively calculated, so that the reliability and the safety of the second node are effectively analyzed.
Optionally, after the determining the integrated trust value of the second node, the method further includes:
broadcasting block information corresponding to the comprehensive trust value of the second node to all authorized roadside infrastructure nodes by the target roadside infrastructure nodes through a Bayesian fault-tolerant algorithm for common-identification verification;
and adding the block information into a block chain after each authorized roadside infrastructure node completes consensus verification.
Specifically, after the integrated trust value of the second node is obtained, this value must be added to the blockchain immediately in place of the original trust value. In order to generate a new block containing a new trust value, all roadside infrastructure nodes using workload proof are elected firstly, the elected method is to make the roadside infrastructure nodes compete to complete a certain workload, and the first roadside infrastructure node which completes the work becomes a target roadside infrastructure node.
The main task of implementing the consensus mechanism is borne by the target roadside infrastructure node that performs the workload proof most quickly and all authorized roadside infrastructure nodes in the blockchain system together. The consensus algorithm used herein to authorize the roadside infrastructure nodes is to use the bayer fault tolerance algorithm. The target roadside infrastructure node broadcasts the complete data of the new block and the individual time stamps and the proof of workload it has completed to all authorized roadside infrastructure nodes for verification. After all authorized roadside infrastructure nodes verify that the data from the leader node is legitimate and do complete the workload certification, they broadcast their own verification results together with the signature to each other. The authorized roadside infrastructure node collects authentication results from other nodes, and the negotiation is successful to add the block to the blockchain.
In the embodiment of the application, the reputation values of the vehicles in the VDN are updated and stored by the vehicle node and roadside infrastructure node consensus algorithm, so that the instantaneity of the reputation values of all the nodes is effectively ensured.
Optionally, the determining, based on the first state information of each neighboring node corresponding to the first node and the second state information of the first node, a target neighboring node in the neighboring nodes includes:
Determining inter-node distance information, inter-node relative speed information and inter-node link duration of each adjacent node and the first node based on first state information of each adjacent node corresponding to the first node and second state information of the first node;
constructing an evaluation matrix based on inter-node distance information, inter-node relative speed information, inter-node link duration and comprehensive trust values in the first state information of each adjacent node and the first node;
and analyzing the evaluation matrix by a multi-attribute decision method to determine the target adjacent node in the adjacent nodes.
Specifically, the multi-attribute decision method described in the embodiment of the present application refers to a decision problem of selecting the most alternative scheme or performing scheme ordering under the condition of considering a plurality of attributes, and mapping to the present application is to order neighboring nodes by the method in consideration of four attribute values of inter-node distance information, inter-node relative speed information, inter-node link duration and comprehensive trust value, thereby selecting the best forwarding node. Through the comprehensive consideration of a plurality of indexes, the most forwarding node can be better selected, the damage of malicious nodes is avoided, and the efficient and reliable transmission of the message is ensured.
More specifically, in the application embodiment, a decision matrix may be created that includes m neighboring nodes and four attributes that correspond to inter-node distance information, inter-node relative speed information, inter-node link duration, and comprehensive trust values, respectively.
The decision matrix is therefore f= [ F pq ] m×n Representing the value of the q-th neighbor node under the p-th criterion. The ordering method is performed as follows:
1) Constructing a normalized decision matrix H= [ H ] pq ] m×n
2) Constructing weighted normalized decisions o= [ O ] pq ] m×n For simplicity, w of all criteria q Equally distributed.
O pq ＝w q h pq ,p＝1,2,...,m；q＝1,2,...,n
3) And determining positive and negative ideal solutions.
The inter-node distance information, the inter-node link duration and the comprehensive trust value are positive standards, and the inter-node relative speed information is a negative standard.
4) Calculating Euclidean distance between each solution and positive and negative ideal solutions, wherein the Euclidean distance is as follows
5) The proximity of each solution to the positive ideal solution is calculated.
Finally to E p Sorting, select E p The adjacent node with the largest value is used as a target adjacent node, so that the malicious node is prevented from being selected as a forwarding node, and the message transmission efficiency is effectively improved.
In the embodiment of the application, the four attributes including the inter-node distance information, the inter-node relative speed information, the inter-node link duration and the comprehensive credit value are combined through a multi-attribute decision method, so that the target adjacent node is screened out, and the forwarding efficiency is ensured on the premise of ensuring the forwarding safety.
Optionally, the determining, based on the first state information of each neighboring node corresponding to the first node and the second state information of the first node, inter-node distance information, inter-node relative speed information, and inter-node link duration between each neighboring node and the first node includes:
determining inter-node distance information between each of the neighboring nodes and the first node based on node position information in the respective first state information and node position information in the second state information;
determining relative speed information between each adjacent node and the first node based on the node speed information and the node driving direction information of the first state information and the second state information;
and determining inter-node link durations of each neighboring node and the first node based on the node position information, the node speed information, and the node travel direction information of each of the first state information and the second state information.
In particular, the neighboring nodes described in the present applicationAnd a first node V i Inter-node distance information->The method comprises the following steps:
the neighboring nodes described in the present applicationAnd a first node V i Inter-node relative speed information ∈>The method comprises the following steps:
the neighboring nodes described in the present applicationAnd a first node V i Inter-node link duration between nodes of (a)The method comprises the following steps:
wherein, the liquid crystal display device comprises a liquid crystal display device,node location information for the first node, +.>For node location information of neighboring nodes, +.>For the first node real-time speed, < >>Real-time speed for neighboring nodes;
specifically, the comprehensive trust value described in the embodiment of the present application may be calculated by the foregoing embodiment, which is not described in detail herein.
In the embodiment of the application, the inter-node distance information, the inter-node relative speed information and the inter-node link duration can be further calculated through the node position information, the node speed information and the node running direction information, so that the subsequent calculation is facilitated.
In an alternative embodiment, the data transmission method described in the embodiment of the present application may resist a black hole attack (black hole attack), which is a typical network layer DoS attack mode, and is also a common attack type in the internet of vehicles. The black hole attack belongs to an internal attack mode, and is an attack initiated by an authorized network internal malicious node. In this attack, an illegal node declares itself to the source node that there is a shortest path to the destination node using the routing protocol, thereby forming a black hole in the network.
When a source request node V1 broadcasts a request packet to a network, a relay node forwards the request packet to a node V3, after the node V3 broadcasts the request packet, the node V4 lies about a shortest path reaching a destination node, but V5 is the best node suitable for forwarding, after the node V4 forwards the request packet, the node V5 hears that the surrounding nodes forward the request packet, the request packet is not forwarded, the destination node Vr receives the request packet, and then returns and transmits the original path of the Data packet to the node V4, but the node V4 does not forward the received Data packet, but directly discards or redirects the received Data packet to a disguised destination node, thereby forming a black hole special for absorbing Data in the network. In the black hole attack, malicious nodes fully utilize the design defects of the routing protocol, and maliciously intercept and discard node data and even steal the data of some important nodes in the network while destroying the network data forwarding mechanism.
Under the non-attack scene, the transmission method designed in the proposal is compared with two strategies of LFBL and GOFP, the number of vehicle nodes is taken as independent variables, and four performance indexes of interest packet satisfaction rate, average time delay, average hop count and throughput are used for carrying out comprehensive and reasonable performance analysis.
Under a black hole attack scene, a data transmission method in the embodiment of the application is compared with two strategies of the related technology, the number of malicious nodes is used as an independent variable, and five performance indexes of detection accuracy, an Interest packet satisfaction rate, average time delay, average hop count and throughput are used for carrying out comprehensive and reasonable performance analysis. Therefore, the safe transmission method provided by the application is proved to be feasible, can resist and inhibit black hole attacks to a certain extent, detect malicious behaviors, reduce transmission delay, improve message forwarding efficiency and optimize the overall performance of the VANETs network.
The data transmission device provided by the embodiment of the present application is described below, and the data transmission device described below and the data transmission method described above may be referred to correspondingly.
Fig. 3 is a schematic structural diagram of a data transmission device according to an embodiment of the present application, where, as shown in fig. 3, the data transmission device includes: a first determining module 310, a second determining module 320, and a transmitting module 330; the first determining module 310 is configured to determine, when a first node receives an interest packet sent by a second node, a comprehensive trust value of the second node based on a number of times that the second node successfully forwards a data packet in a first preset time and interaction record information corresponding to the second node; the second determining module 320 is configured to determine, when the integrated trust value of the second node exceeds a first preset threshold and the information corresponding to the interest packet is not stored in the first node, a target neighboring node among the neighboring nodes based on first state information of the neighboring nodes corresponding to the first node and second state information of the first node, where the first state information and the second state information each include: node position information, node speed information, node driving direction information and comprehensive trust values; wherein, the transmission module 330 is configured to forward the interest packet to the target neighboring node.
Optionally, the second determining module is specifically configured to:
determining a direct trust value of the second node based on the times of successful forwarding of the data packet and the times of unsuccessful forwarding of the data packet in a first preset time by the second node;
determining an indirect trust value of the second node based on the similarity between the interaction record information of the first adjacent node corresponding to the second node and the interaction record information of the second node in the first preset time;
and analyzing the direct trust value and the indirect trust value based on a time decay function to determine the comprehensive trust value of the second node.
Optionally, the device is further configured to:
broadcasting block information corresponding to the comprehensive trust value of the second node to all authorized roadside infrastructure nodes by the target roadside infrastructure nodes through a Bayesian fault-tolerant algorithm for common-identification verification;
and adding the block information into a block chain after each authorized roadside infrastructure node completes consensus verification.
Optionally, the second determining module is specifically configured to:
determining inter-node distance information, inter-node relative speed information and inter-node link duration of each adjacent node and the first node based on first state information of each adjacent node corresponding to the first node and second state information of the first node;
Constructing an evaluation matrix based on inter-node distance information, inter-node relative speed information, inter-node link duration and comprehensive trust values in the first state information of each adjacent node and the first node;
and analyzing the evaluation matrix by a multi-attribute decision method to determine the target adjacent node in the adjacent nodes.
In the embodiment of the application, the target adjacent node for forwarding the interest packet is continuously searched only under the condition that the comprehensive trust value of the second node exceeds the first preset threshold value by calculating the comprehensive trust value of each node, and the comprehensive trust value of each node is fully considered in the process of searching the target adjacent node, so that reliable nodes are effectively selected for data forwarding, and the safety of data transmission is improved.
Fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present application, as shown in fig. 4, the electronic device may include: processor 410, communication interface (Communication Interface) 420, memory 430 and communication bus 440, wherein processor 410, communication interface 420 and memory 430 communicate with each other via communication bus 440. The processor 410 may call a computer program in the memory 430 to perform the steps of a data transmission method, for example comprising: under the condition that a first node receives an interest packet sent by a second node, determining the comprehensive trust value of the second node based on the times of successful forwarding of a data packet by the second node in a first preset time and interaction record information corresponding to the second node; and under the condition that the comprehensive trust value of the second node exceeds a first preset threshold and the information corresponding to the interest packet is not stored in the first node, determining a target adjacent node in each adjacent node based on the first state information of each adjacent node corresponding to the first node and the second state information of the first node, wherein the first state information and the second state information comprise: node position information, node speed information, node driving direction information and comprehensive trust values; forwarding the interest packet to the target adjacent node.
Further, the logic instructions in the memory 430 described above may be implemented in the form of software functional units and may be stored in a computer-readable storage medium when sold or used as a stand-alone product. Based on this understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
In another aspect, embodiments of the present application further provide a computer program product, where the computer program product includes a computer program, where the computer program may be stored on a non-transitory computer readable storage medium, where the computer program when executed by a processor is capable of executing the steps of the data transmission method provided in the foregoing embodiments, for example, including: under the condition that a first node receives an interest packet sent by a second node, determining the comprehensive trust value of the second node based on the times of successful forwarding of a data packet by the second node in a first preset time and interaction record information corresponding to the second node; and under the condition that the comprehensive trust value of the second node exceeds a first preset threshold and the information corresponding to the interest packet is not stored in the first node, determining a target adjacent node in each adjacent node based on the first state information of each adjacent node corresponding to the first node and the second state information of the first node, wherein the first state information and the second state information comprise: node position information, node speed information, node driving direction information and comprehensive trust values; forwarding the interest packet to the target adjacent node.
In another aspect, embodiments of the present application further provide a processor-readable storage medium storing a computer program for causing a processor to execute the steps of the method provided in the above embodiments, for example, including: under the condition that a first node receives an interest packet sent by a second node, determining the comprehensive trust value of the second node based on the times of successful forwarding of a data packet by the second node in a first preset time and interaction record information corresponding to the second node; and under the condition that the comprehensive trust value of the second node exceeds a first preset threshold and the information corresponding to the interest packet is not stored in the first node, determining a target adjacent node in each adjacent node based on the first state information of each adjacent node corresponding to the first node and the second state information of the first node, wherein the first state information and the second state information comprise: node position information, node speed information, node driving direction information and comprehensive trust values; forwarding the interest packet to the target adjacent node.
The processor-readable storage medium may be any available medium or data storage device that can be accessed by a processor, including, but not limited to, magnetic storage (e.g., floppy disks, hard disks, magnetic tape, magneto-optical disks (MOs), etc.), optical storage (e.g., CD, DVD, BD, HVD, etc.), semiconductor storage (e.g., ROM, EPROM, EEPROM, nonvolatile storage (NAND FLASH), solid State Disk (SSD)), and the like.
The apparatus embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
From the above description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course may be implemented by means of hardware. Based on this understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a computer readable storage medium, such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method described in the respective embodiments or some parts of the embodiments.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present application, and are not limiting; although the application has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present application.
Claims (10)
1. A data transmission method, comprising:
under the condition that a first node receives an interest packet sent by a second node, determining the comprehensive trust value of the second node based on the times of successful forwarding of a data packet by the second node in a first preset time and interaction record information corresponding to the second node;
and under the condition that the comprehensive trust value of the second node exceeds a first preset threshold and the information corresponding to the interest packet is not stored in the first node, determining a target adjacent node in each adjacent node based on the first state information of each adjacent node corresponding to the first node and the second state information of the first node, wherein the first state information and the second state information comprise: node position information, node speed information, node driving direction information and comprehensive trust values;
Forwarding the interest packet to the target adjacent node.
2. The method for transmitting data according to claim 1, wherein the determining the integrated trust value of the second node based on the number of times the second node successfully forwards the data packet in the first preset time and the interaction record information corresponding to the second node includes:
determining a direct trust value of the second node based on the times of successful forwarding of the data packet and the times of unsuccessful forwarding of the data packet in a first preset time by the second node;
determining an indirect trust value of the second node based on the similarity between the interaction record information of the first adjacent node corresponding to the second node and the interaction record information of the second node in the first preset time, wherein the first adjacent node is a node directly adjacent to the second node;
and analyzing the direct trust value and the indirect trust value based on a time decay function to determine the comprehensive trust value of the second node.
3. The data transmission method according to claim 2, further comprising, after said determining the integrated trust value of the second node:
Broadcasting block information corresponding to the comprehensive trust value of the second node to all authorized roadside infrastructure nodes by the target roadside infrastructure nodes through a Bayesian fault-tolerant algorithm for common-identification verification;
and adding the block information into a block chain after each authorized roadside infrastructure node completes consensus verification.
4. The data transmission method according to claim 1, wherein the determining a target neighboring node among the respective neighboring nodes based on the first state information of the respective neighboring node corresponding to the first node and the second state information of the first node includes:
determining inter-node distance information, inter-node relative speed information and inter-node link duration of each adjacent node and the first node based on first state information of each adjacent node corresponding to the first node and second state information of the first node;
constructing an evaluation matrix based on inter-node distance information, inter-node relative speed information, inter-node link duration and comprehensive trust values in the first state information of each adjacent node and the first node;
and analyzing the evaluation matrix by a multi-attribute decision method to determine the target adjacent node in the adjacent nodes.
5. The data transmission method according to claim 4, wherein the determining the inter-node distance information, the inter-node relative speed information, the inter-node link duration of each neighboring node and the first node based on the first state information of each neighboring node corresponding to the first node and the second state information of the first node includes:
determining inter-node distance information between each of the neighboring nodes and the first node based on node position information in the respective first state information and node position information in the second state information;
determining relative speed information between each adjacent node and the first node based on the node speed information and the node driving direction information of the first state information and the second state information;
and determining inter-node link durations of each neighboring node and the first node based on the node position information, the node speed information, and the node travel direction information of each of the first state information and the second state information.
6. A data transmission apparatus, comprising:
the first determining module is used for determining the comprehensive trust value of the second node based on the times of successful forwarding of the data packet by the second node in a first preset time and interaction record information corresponding to the second node under the condition that the first node receives the interest packet sent by the second node;
A second determining module, configured to determine, when the integrated trust value of the second node exceeds a first preset threshold and the information corresponding to the interest packet is not stored in the first node, a target neighboring node in each neighboring node based on first state information of each neighboring node corresponding to the first node and second state information of the first node, where the first state information and the second state information each include: node position information, node speed information, node driving direction information and comprehensive trust values;
and the transmission module is used for forwarding the interest packet to the target adjacent node.
7. The data transmission device according to claim 6, wherein the second determining module is specifically configured to:
determining a direct trust value of the second node based on the times of successful forwarding of the data packet and the times of unsuccessful forwarding of the data packet in a first preset time by the second node;
determining an indirect trust value of the second node based on the similarity between the interaction record information of the first adjacent node corresponding to the second node and the interaction record information of the second node in the first preset time, wherein the first adjacent node is a node directly adjacent to the second node;
And analyzing the direct trust value and the indirect trust value based on a time decay function to determine the comprehensive trust value of the second node.
8. An electronic device comprising a processor and a memory storing a computer program, characterized in that the processor implements the steps of the data transmission method of any one of claims 1 to 5 when executing the computer program.
9. A non-transitory computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when executed by a processor, implements the data transmission method according to any one of claims 1 to 5.
10. A computer program product comprising a computer program, characterized in that the computer program, when executed by a processor, implements the steps of the data transmission method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210447481.5A CN116996846A (en) | 2022-04-26 | 2022-04-26 | Data transmission method, device, electronic equipment, medium and program product |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210447481.5A CN116996846A (en) | 2022-04-26 | 2022-04-26 | Data transmission method, device, electronic equipment, medium and program product |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116996846A true CN116996846A (en) | 2023-11-03 |
Family
ID=88532665
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210447481.5A Pending CN116996846A (en) | 2022-04-26 | 2022-04-26 | Data transmission method, device, electronic equipment, medium and program product |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116996846A (en) |
-
2022
- 2022-04-26 CN CN202210447481.5A patent/CN116996846A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Mirsadeghi et al. | A trust infrastructure based authentication method for clustered vehicular ad hoc networks | |
| WO2020258060A2 (en) | Blockchain-based privacy protection trust model for internet of vehicles | |
| Xia et al. | An attack-resistant trust inference model for securing routing in vehicular ad hoc networks | |
| Cui et al. | An efficient message-authentication scheme based on edge computing for vehicular ad hoc networks | |
| Grover | Security of Vehicular Ad Hoc Networks using blockchain: A comprehensive review | |
| Meddeb Makhlouf et al. | SE-AOMDV: Secure and efficient AOMDV routing protocol for vehicular communications | |
| Xing et al. | Trust-evaluation-based intrusion detection and reinforcement learning in autonomous driving | |
| Kumar Karn et al. | A survey on VANETs security attacks and sybil attack detection | |
| Kerrache et al. | RITA: RIsk‐aware Trust‐based Architecture for collaborative multi‐hop vehicular communications | |
| CN107835077B (en) | Mutual trust cluster collaborative verification method for anonymous authentication of vehicle-mounted network | |
| Engoulou et al. | A decentralized reputation management system for securing the internet of vehicles | |
| Amari et al. | Trust Management in Vehicular Ad-Hoc Networks: Extensive Survey | |
| Sun et al. | Communication by credence: trust communication in vehicular Ad Hoc networks | |
| Herbadji et al. | Blockchain for internet of vehicles security | |
| Kerrache et al. | Hierarchical adaptive trust establishment solution for vehicular networks | |
| Theodore et al. | A novel lightweight authentication and privacy-preserving protocol for vehicular ad hoc networks | |
| Sangwan et al. | A classification of misbehavior detection schemes for VANETs: a survey | |
| Saravanan et al. | Trust aware ad hoc routing protocol with key management based mechanism and optimal energy‐efficient cluster head selection in mobile ad hoc networks | |
| Tripathi et al. | ReTrust: reliability and recommendation trust-based scheme for secure data sharing among internet of vehicles (IoV) | |
| Salimitari et al. | BATS: A blockchain-based authentication and trust management system in vehicular networks | |
| CN110855670B (en) | Method suitable for credible message broadcasting and security authentication of vehicle-mounted ad hoc network | |
| LI et al. | Using UAV to Detect Truth for Clean Data Collection in Sensor‑Cloud Systems | |
| Roy et al. | BLAME: A blockchain-assisted misbehavior detection and event validation in VANETs | |
| Raya | Data-centric trust in ephemeral networks | |
| CN114449000B (en) | Internet of vehicles data consensus optimization storage method and storage system |
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 |