A blockchain-based task trust distribution method for internet of vehicles

Abstract

The application discloses a kind of based on blockchain's Internet of Vehicles task credible distribution method.Method includes: (1) initialization system parameter and establishes relevant model, including task time delay model, vehicle score model and reputation value model;(2) RSU broadcasts data center unloading task data package message, and vehicle that wants to complete task uploads own computing capacity and task offer;(3) RSU distributes task according to reputation value model and vehicle offer;(4) RSU calculates vehicle score according to the computing result returned by vehicle and updates reputation value;(5) data center distributes remuneration to vehicle and RSU;(6) according to the multi-weight blockchain consensus algorithm of vehicle reputation value, miner is selected and block is issued, i.e.on chain.The application can quickly and efficiently distribute task to vehicle, and improves data security.

Description

Technical Field

[0001] The present invention relates to the field of vehicle networking task distribution, and in particular to a blockchain-based vehicle networking task trusted distribution method. Background Art

[0002] With the rapid development of the Internet of Vehicles (IoV) and communication technologies, the integration of mobile edge computing and IoV has enabled vehicle edge computing (VEC) to address complex, heterogeneous, and dynamic in-vehicle environments, ensuring the highest possible quality of service across diverse scenarios. Trust management is a critical issue in IoV, as the presence of malicious nodes in the IoV makes vehicle-transmitted data unreliable. Trust management enables the calculation of vehicle reliability within the IoV and also distributes, calculates, and updates reputation values ​​stored in RSUs. Data security for both vehicles and RSUs is crucial for task offloading. Given these considerations, blockchain is considered a viable tool for addressing these challenges. Due to its high security and reliability, blockchain has been widely used to address the trust issues inherent in task offloading. Its decentralized nature enables trust management between RSUs and maintains data consistency.

[0003] The problem of task offloading in the Internet of Vehicles (IoV) based on blockchain has been widely studied. Some researchers have utilized reputation and contract theory to optimize consensus management and designed a two-stage soft-security-enhanced solution to ensure the security and effectiveness of data sharing schemes. Others have proposed a blockchain-based IoV trust management system that addresses message credibility by calculating vehicle reputation values. Others have utilized blockchain to store trust values ​​and proposed trust management schemes. Finally, some have proposed blockchain-based secure computation offloading scheduling schemes. However, most existing research focuses on task offloading algorithms, while limited research has focused on trusted task distribution using blockchain. Therefore, this paper proposes a blockchain-based trusted task distribution method for IoV to address issues such as poor vehicle task completion performance and data security. Summary of the Invention

[0004] Purpose of the invention: The purpose of the present invention is to address the problem of vehicle task distribution in the vehicle network with poor performance in completing tasks and data security, and to provide a trusted distribution method for vehicle network tasks based on blockchain, so as to quickly and effectively distribute tasks and upload data to the chain, thereby effectively improving data security.

[0005] Technical solution: To achieve the above-mentioned purpose, the present invention adopts the following technical solution:

[0006] A blockchain-based method for trusted distribution of Internet of Vehicles tasks, comprising the following steps:

[0007] (1) Initialize system parameters, including the roadside unit set R, the vehicle set S corresponding to each roadside unit jj , vehicles reporting computing capabilities Task size Task computing volume And task delay model, vehicle scoring model, vehicle reputation value model;

[0008] (2) The data center offloads the task to the RSU, the RSU broadcasts the task data packet message, and the vehicle that wants to complete the task uploads its own computing power f ji And the task quotation price ji [l];

[0009] (3) RSU is based on the reputation value model and the vehicle quotation function Distribute tasks to vehicles: First calculate RSU and distribute tasks to vehicles Probability Then arrange the N vehicles in order of their original numbers and calculate the cumulative probability of distributing tasks to all vehicles Finally, a random number m is generated between 0 and 1. If the number is between the two cumulative probabilities, such as If the vehicle is currently idle, the task is assigned to the vehicle, otherwise continue to traverse other vehicles;

[0010] (4) RSU calculates vehicle ratings based on the vehicle rating model If the vehicle If only one task is completed, its reputation value is updated to r ji [l]; If the vehicle If you complete multiple tasks, the reputation value will be updated to cr ji [l];

[0011] (5) The data center distributes rewards to vehicles and RSUs. The rewards received by vehicles and RSUs are Price ji [l] and U j [l];

[0012] (6) Select miners based on the multi-weight blockchain consensus algorithm of vehicle reputation value: First, calculate the function RStake(j) and the probability p(RStake) of each RSU being selected as a miner. j ); Then arrange the k RSUs according to the original serial number of the RSU nodes, and the cumulative probability of all RSUs being elected as miners is q(RStake j ); Finally, a random number m is generated between 0 and 1. If the number is between the two cumulative probabilities, such as q(RStake j )<m<q(RStake j+1 ), then RSUj is selected as the miner, and finally the miner publishes the block.

[0013] In step (2), the vehicle Uploaded quotation function price ji [l]The calculation formula is:

[0014]

[0015] Among them, E ji [l] is the energy consumption of the vehicle to complete the lth task, s1 is the price per unit of energy, and k is the energy efficiency parameter.

[0016] The function in step (3) The calculation formula is:

[0017]

[0018] Among them, l ji For vehicles The number of tasks completed, price max The highest bid uploaded for the vehicle.

[0019] The calculation formula is:

[0020] The calculation formula is:

[0021] The price paid by the data center to the vehicle in step (5) ji The calculation formula for [l] is:

[0022]

[0023] Among them, λ0 is the guaranteed reward for participating in the task, and χ1 is the weight parameter affecting the delay due to false reporting of computing power;

[0024] The benefit U of RSU j j [l]The calculation formula is:

[0025]

[0026] The reputation value function of RSU in step (6) is:

[0027]

[0028] Among them, the highest reputation value rsu_value jmax The initial reputation value is 100, rsu_value j0 is 50, f j _num is the number of false broadcasts by RSU, t j _num is the number of honest broadcasts by RSU;

[0029] The calculation formula of function RStake(j) is:

[0030] p(RStake j ) is calculated as:

[0031] q(RStake j ) is calculated as:

[0032] Beneficial effects: Compared with the existing technology, the blockchain-based vehicle network task trusted distribution method of the present invention can effectively distribute tasks to vehicles and improve data security. It has superior performance and is easy to implement. BRIEF DESCRIPTION OF THE DRAWINGS

[0033] Figure 1 It is an application scenario diagram of the method of the present invention;

[0034] Figure 2 Flowchart of the trusted distribution method for Internet of Vehicles tasks based on blockchain;

[0035] Figure 3 This is a comparison chart of the bandwidth required by the algorithm of the present invention and other algorithms;

[0036] Figure 4 This is a comparison chart of the communication overhead of the algorithm in the present invention and other algorithms under different numbers of nodes. DETAILED DESCRIPTION

[0037] The present invention is further illustrated below with reference to the accompanying drawings and specific embodiments. It should be understood that these embodiments are only used to illustrate the present invention and are not used to limit the scope of the present invention. After reading the present invention, modifications of various equivalent forms of the present invention made by those skilled in the art all fall within the scope defined by the claims attached to this application.

[0038] The following is a detailed analysis of the scene settings and parameter settings. The present invention is not limited to the specific scene and parameter settings in the embodiments.

[0039] 1. Internet of Vehicles Environment Settings

[0040] Consider a real-world connected vehicle environment, consisting of three entities: a data center, RSUs, and vehicles. There are five RSUs and 25 vehicles, generating a total of 930 tasks. Assume that the number of vehicles within each RSU is random, and there are k RSUs, denoted as R = {1, 2, ..., j, ..., k}, where j∈[1, k], and the set of vehicles within the jth RSU is: h j is the number of vehicles within the range of the jth RSU, then the total number of vehicles within the range of the kth RSU is:

[0041] 2. Establishment of relevant models

[0042] (1) Task delay model

[0043] The mission delay model is a vehicle The total delay t to complete the lth task ji [l],t ji [l]The calculation formula is as follows:

[0044]

[0045] in, is the transmission rate of tasks from RSU to vehicle, The calculation formula is:

[0046]

[0047] Among them, p ji It's a vehicle The transmission power, It's a vehicle The distance between RSU j and RSU j, α is the path loss coefficient, B represents the total channel bandwidth allocated to all vehicles in the range of RSU j, represents the channel bandwidth allocated to each vehicle in the range of RSU j, and n0 represents the power spectral density.

[0048] (2) Vehicle scoring model

[0049] vehicle Scoring of completed task l The calculation formula is as follows:

[0050]

[0051] Where t′ ji [l] is the i-th vehicle in the j-th RSU The actual computing time for executing the lth task is calculated as follows: quality ji For vehicles False capability function, calculated as quality ji For vehicles The actual capability function is calculated as r ji [l-1] is the vehicle The reputation value of the previous task, γ is the weight parameter of the control ability function, and f′ ji is the actual computing capacity of the i-th vehicle in the j-th RSU, is the transmission rate from the jth RSU to the i-th vehicle, max(r m ) represents the maximum value of the reputation value of the vehicle in the jth RSU in the past, tn is the number of times the vehicle honestly uploads its computing power, fn is the number of times the vehicle falsely reports its computing power, and ε is the weight that controls the number of honest uploads of computing power. is the mean of historical reputation values, and α1, α2, α3, α4, and α5 are the weights of the five items before and after the control scoring model.

[0052] (3) Vehicle Reputation Value Model

[0053] The vehicle reputation value model is divided into the following two cases:

[0054] 1) If the vehicle If only one task is completed, its reputation value is updated to r ji [l],r ji [l]The formula is as follows:

[0055]

[0056] 2) If the vehicle If you complete multiple tasks, the reputation value will be updated to cr ji [l],cr ji [l]The formula is as follows:

[0057]

[0058] Among them, β1, β2, β3 and β4 are the weights of the four terms before and after the reputation value function when there is only one task. 11 , β 22 , β 33 and β 44 It is the weight of the four terms before and after the reputation value function in the case of controlling multiple tasks.

[0059] like Figure 2 As shown, an embodiment of the present invention discloses a blockchain-based trusted distribution method for Internet of Vehicles tasks, comprising the following steps:

[0060] (1) Initialize system parameters, including the roadside unit set R, the vehicle set S corresponding to each roadside unit j j , vehicles reporting computing capabilities Task size Task computing volume And task delay model, vehicle scoring model, vehicle reputation value model;

[0061] (2) The data center offloads the task to the RSU, the RSU broadcasts the task data packet message, and the vehicle that wants to complete the task uploads its own computing power fji And the task quotation price ji [l];

[0062] (3) RSU is based on the reputation value model and the vehicle quotation function Distribute tasks to vehicles: First calculate RSU and distribute tasks to vehicles Probability Then arrange the N vehicles in order of their original numbers and calculate the cumulative probability of distributing tasks to all vehicles Finally, a random number m is generated between 0 and 1. If the number is between the two cumulative probabilities, such as If the vehicle is currently idle, the task is assigned to the vehicle, otherwise continue to traverse other vehicles;

[0063] (4) RSU calculates vehicle ratings based on the vehicle rating model If the vehicle If only one task is completed, its reputation value is updated to r ji [l]; If the vehicle If you complete multiple tasks, the reputation value will be updated to cr ji [l];

[0064] (5) The data center distributes rewards to vehicles and RSUs. The rewards received by vehicles and RSUs are Price ji [l] and U j [l];

[0065] (6) Select miners based on the multi-weight blockchain consensus algorithm of vehicle reputation value: First, calculate the function RStake(j) and the probability p(RStake) of each RSU being selected as a miner. j ); Then arrange the k RSUs according to the original serial number of the RSU nodes, and the cumulative probability of all RSUs being elected as miners is q(RStake j ); Finally, a random number m is generated between 0 and 1. If the number is between the two cumulative probabilities, such as q(RStake j )<m<q(RStake j+1 ), then RSU j is selected as the miner, and finally the miner publishes the block.

[0066] In step (2), the vehicle Uploaded quotation function price ji [l]The calculation formula is:

[0067]

[0068] Among them, E ji [l] is the energy consumption of the vehicle to complete the lth task, s1 is the price per unit of energy, and k is the energy efficiency parameter.

[0069] The function in step (3) The calculation formula is:

[0070]

[0071] Among them, l ji For vehicles The number of tasks completed, price max The highest bid uploaded for the vehicle.

[0072] The calculation formula is:

[0073] The calculation formula is:

[0074] The price paid by the data center to the vehicle in step (5) ji The calculation formula for [l] is:

[0075]

[0076] Among them, λ0 is the guaranteed reward for participating in the task, and χ1 is the weight parameter affecting the delay due to false reporting of computing power;

[0077] The benefit U of RSU j j [l]The calculation formula is:

[0078]

[0079] The reputation value function of RSU in step (6) is:

[0080]

[0081] Among them, the highest reputation value rsu_value jmax The initial reputation value is 100, rsu_value j0 is 50, f j _num is the number of false broadcasts by RSU, t j _num is the number of honest broadcasts by RSU;

[0082] The calculation formula of function RStake(j) is:

[0083] p(RStake j ) is calculated as:

[0084] q(RStake j ) is calculated as:

[0085] Figure 3 is the comparison chart of bandwidth required by the algorithm and other algorithms. In order to verify the advantages of the method of the present application over the prior art, the present application sets the following simulation parameters: the number of RSUs k is 5, the total number of vehicles N is 25, the total number of task arrival time slots M is 1500, the bandwidth of RSU is 5MHz, the path loss coefficient in the channel is 4, the noise power N0 is 10 -15 W, the vehicle transmission power is 2W, the vehicle distance to RSU obeys (0, 300) random distribution, the computing power f of the vehicle obeys (5, 21) random distribution, the task data obeys (24, 56) random distribution, the task computing capacity obeys (6, 14) random distribution, and the computing energy efficiency parameter K is 5x10 ji -27 From Figure 3 it can be seen that when the block size is constant, as the number of nodes increases, the network bandwidth also increases, and when the number of nodes is the same and the transmission data size is the same, the network bandwidth required by the multi-weight consensus algorithm based on reputation value of the present application has the slowest growth trend, which meets the performance requirement of low power consumption.

[0086] Figure 4 is the communication overhead comparison chart of the algorithm and other algorithms under different node numbers. According to the communication frequency formula, the communication frequency of the algorithm can be calculated. From Figure 4 it can be seen that the communication frequency of PoW is proportional to the number of nodes, and the communication frequency of the algorithm is much less than that of PoW consensus algorithm, so the communication overhead of the consensus algorithm of the present application is lower.​

Claims

1. A blockchain-based method for trusted distribution of Internet of Vehicles tasks, characterized by: The method comprises the following steps: (1) Initialize system parameters, including the roadside unit set R, the vehicle set S corresponding to each roadside unit j j , vehicles reporting computing capabilities Task size Task computing volume And task delay model, vehicle scoring model, vehicle reputation value model; (2) The data center offloads the task to the RSU, which broadcasts the task data packet message. The vehicle that wants to complete the task l uploads its own computing power f ji And the task quotation price ji [l]; (3) RSU is based on the reputation value model and the vehicle quotation function Assign tasks to vehicles; (4) RSU calculates vehicle ratings based on the vehicle rating model The vehicle scoring model is as follows: Where t′ ji [l] is the i-th vehicle in the j-th RSU The actual computing time for executing the lth task is calculated as follows: quality ji For vehicles False capability function, calculated as quality ji For vehicles The actual capability function is calculated as r ji [l-1] is the vehicle The reputation value of the previous task, γ is the weight parameter of the control ability function, and f′ ji is the actual computing capacity of the i-th vehicle in the j-th RSU, is the transmission rate from the jth RSU to the i-th vehicle, max(r m ) represents the maximum reputation value of the vehicle in the jth RSU in the past, tn is the number of times the vehicle honestly uploads its computing power, fn is the number of times the vehicle falsely reports its computing power, and ε is the weight that controls the number of honest uploads of computing power. is the mean of historical reputation values, α1, α2, α3, α4, and α5 are the weights of the five items before and after the control scoring model; if the vehicle If only one task is completed, its reputation value is updated to r ji [l]; If the vehicle If you complete multiple tasks, the reputation value will be updated to cr ji [l]; (5) The data center distributes rewards to vehicles and RSUs. The rewards received by vehicles and RSUs are Price ji [l] and U j [l]; (6) A multi-weight blockchain consensus algorithm based on the vehicle reputation value selects miners and publishes blocks.

2. A blockchain-based vehicle networking task trusted distribution method according to claim 1, characterized in that: The function in step (3) The calculation formula is: Among them, l ji For vehicles The number of tasks completed, price max The highest bid uploaded for the vehicle.

3. The blockchain-based trusted distribution method for Internet of Vehicles tasks according to claim 1, characterized in that: The price paid by the data center to the vehicle in step (5) ji The calculation formula for [l] is: Among them, λ0 is the guaranteed reward for participating in the task, and χ1 is the weight parameter affecting the delay due to false reporting of computing power; The benefit U of RSU j j [l]The calculation formula is: Among them, θ1 and θ2 are weights, and 4. The method for trusted distribution of Internet of Vehicles tasks based on blockchain according to claim 1, characterized in that: The reputation value function of the RSU in step (6) is: Among them, rsu_value jmax The maximum reputation value is 100, and the initial reputation value is rsu_value j0 is 50, f j _num is the number of false broadcasts by RSU, t j _num is the number of honest broadcasts by RSU; The calculation formula for RStake(j) is:

Images