A performance optimization method for BlockIoV information sharing process

Abstract

The application focuses on the BlockIoV (Blockchain-based Internet of Vehicles) information sharing process and proposes a performance optimization method for the BlockIoV information sharing process by using a multi-objective optimization algorithm. To solve the BlockIoV information sharing performance problem, we perform iterative search based on the multi-objective optimization idea to obtain the Pareto performance optimization results of the throughput, delay and block utilization. The goal of the innovation is to solve the performance optimization problem of the blockchain technology in the field of vehicle information sharing. The proposed performance optimization method provides valuable guidance for designers and provides a Pareto optimal solution set for the configuration of the BlockIoV information sharing system, so as to make a more intelligent decision in balancing the performance indicators such as throughput, delay and block utilization.

Description

Technical Field

[0001] This invention belongs to the field of blockchain technology applications, and specifically focuses on optimizing the performance of information sharing in BlockIoV (Blockchain-based Internet of Vehicles). Its goal is to effectively find the optimal blockchain configuration scheme in a given test environment to achieve Pareto optimization of performance indicators such as throughput, latency, and block utilization during BlockIoV information sharing. This invention achieves optimization of throughput, latency, and block utilization in the BlockIoV information sharing process under a given test environment by iteratively optimizing the three performance indicators of throughput, latency, and block utilization through multi-objective optimization and searching to generate the Pareto equilibrium optimal performance result. Background Technology

[0002] The Internet of Vehicles (IoV) refers to a large-scale Internet of Things (IoT) network that enables information sharing between vehicles, roads, people, and the internet. It establishes interconnected relationships between things, vehicles, and the environment to facilitate data and information transmission, thereby improving driving safety and experience. Through intelligent information interaction between vehicles, the IoV can provide universal and revolutionary services, offering users a high-quality and safe driving experience. Blockchain, a technology that enables trusted interaction through decentralization, effectively addresses issues such as information leakage, privacy exposure, and poor interoperability and compatibility between nodes in IoV information sharing and centralized storage, thus fully ensuring information security within the IoV. Currently, Blockchain-based Internet of Vehicles (BlockIoV) has become a hot research topic in IoV information sharing.

[0003] In the design of vehicle-to-everything (V2X) information sharing, performance is a crucial metric. Compared to other types of IoT, V2X has higher requirements for throughput and latency. For example, when vehicles are traveling at high speeds, real-time responses to changes in surrounding vehicles and road conditions are necessary to prevent traffic accidents. Therefore, V2X networks must possess high throughput and low latency. For BlockIoV, the introduction of a blockchain consensus mechanism inevitably impacts its information sharing throughput and latency. Furthermore, since blockchain block resources are limited, block utilization must be carefully monitored to avoid wasting resources. Therefore, we need to conduct more in-depth optimization research on the performance of BlockIoV information sharing, finding a reasonable blockchain configuration optimization scheme to ensure that its information sharing throughput (TPS), latency (LOT), and block utilization (BUR) better meet the performance requirements of current V2X scenarios.

[0004] However, throughput, latency, and block utilization are interrelated; maximizing one metric may lead to a decrease in others. For example, to maximize throughput, the block generation interval is typically shortened and the block size increased, thereby packaging more transactions within the same timeframe, improving throughput and reducing latency. However, this may reduce block utilization, resulting in a waste of block resources. Therefore, how to achieve Pareto equilibrium optimal values ​​for throughput, latency, and block utilization in BlockIoV information sharing without sacrificing the performance of other metrics—that is, optimizing multiple performance objectives—has become a problem that needs to be addressed in this research.

[0005] This invention focuses on the BlockIoV information sharing process and proposes a performance optimization method for this process using a multi-objective optimization algorithm. Addressing the performance issues of BlockIoV information sharing, we employ a multi-objective optimization approach, iteratively searching for three performance metrics—throughput, latency, and block utilization—using a multi-objective optimization algorithm to obtain the Pareto-optimal blockchain configuration. After iteration, we obtain the Pareto-optimal solution set, which records the blockchain configuration schemes (including block generation interval and block size) that achieve a balanced optimal value for the three performance metrics of throughput, latency, and block utilization in the BlockIoV information sharing process.

[0006] Therefore, this invention innovatively proposes a performance optimization method for the BlockIoV information sharing process. It employs a multi-objective optimization algorithm and plans iterative evolution rules to obtain Pareto optimal solution sets for throughput, latency, and block utilization. This method effectively addresses the performance challenges of BlockIoV information sharing systems, providing reliable support and guidance for their application. Summary of the Invention

[0007] This invention provides a performance optimization method for the BlockIoV information sharing process. It adopts a multi-objective optimization algorithm and plans iterative evolution rules to obtain the Pareto optimal solution set for throughput, latency and block utilization, thereby achieving the goal of solving Pareto optimization for multiple performance objectives.

[0008] To achieve the above objectives, this method first initializes the block generation interval and block size in the blockchain configuration scheme, thereby obtaining initial individual optimal configuration schemes and group optimal configuration schemes. Subsequently, based on a preset number of iterations, the block generation interval and block size are repeatedly adjusted to generate new blockchain configuration schemes. In each iteration, the individual optimal configuration scheme for that round is obtained. The individual optimal configuration scheme for this round is compared with the group optimal configuration scheme obtained in the previous round to determine the group optimal configuration scheme for this iteration. Finally, based on the group optimal configuration scheme obtained in the last iteration, the performance of throughput, latency, and block utilization under this configuration is comprehensively evaluated.

[0009] Specifically, the method includes the following steps:

[0010] 1) Blockchain Configuration Scheme Initialization. This step constructs an initial configuration for the blockchain configuration scheme in the BlockIoV information sharing process. Inputs include the number of blockchain configuration schemes, the maximum and minimum values ​​of the block generation interval and block size. First, based on the maximum and minimum values ​​of the block generation interval and block size, the block generation interval and block size of each blockchain configuration scheme are randomly generated, and the rate of change of the block generation interval and block size in the next iteration is initialized. Second, the performance of throughput, latency, and block utilization in the BlockIoV information sharing process under this blockchain configuration scheme is calculated. Then, based on the performance of all blockchain configuration schemes, the individual optimal scheme is initialized, all non-dominated configuration schemes obtained from the initialization are solved, and the external archive value is initialized based on the non-dominated solutions. Finally, the globally optimal blockchain configuration scheme is initialized based on the external archive value.

[0011] 2) Pareto Performance Optimization Result Search and Generation. This step iteratively optimizes three performance metrics: throughput, latency, and block utilization. Inputs include inertia factor, velocity factor, and number of iterations. First, based on the inertia factor and velocity factor, the rate of change of block generation interval and block size is updated, and this rate of change generates the block generation interval and block size for all blockchain configuration schemes in this iteration. Second, the throughput, latency, and block utilization performance under all blockchain configuration schemes in this iteration are calculated. Then, based on the performance performance of all blockchain configuration schemes, individual optimalities are initialized, all non-dominated configuration schemes obtained from the initialization are solved, and based on the non-dominated solutions, the external archive value for this iteration is obtained. Finally, by calculating the congestion distance and selection probability, the globally optimal blockchain configuration scheme G for this iteration is searched and generated. best Finally, after reaching the required number of iterations, the globally optimal blockchain configuration scheme G is output. best The corresponding throughput (TPS), latency (LOT), and block utilization (BUR) results are the Pareto performance optimization results.

[0012] Furthermore, the specific steps of step 1) above are as follows:

[0013] Step 1)-1: Initial state;

[0014] Step 1)-2: Input the number of blockchain configuration schemes (particals), the maximum value (max_) and minimum value (min_) of the block generation interval and block size;

[0015] Steps 1)-3: Initialize 5 blockchain configuration schemes based on the maximum value max_ and the minimum value min_. Each blockchain configuration scheme blockchain contains the block generation interval B. interval and block size B size ;

[0016] Steps 1)-4: For each blockchain scheme, initialize its block generation interval and the rate of change of block size v. interval and v size ;

[0017] Steps 1)-5: Calculate the throughput (TPS), latency (LOT), and block utilization (BUR) during the BlockIoV information sharing process under each blockchain scheme;

[0018] Steps 1)-6: Search for the locally optimal blockchain configuration scheme P among the partials blockchain configuration schemes. best ;

[0019] Steps 1)-7: Calculate the i-th blockchain configuration scheme. i Crowded distance I (blockchain) i );

[0020]

[0021] Among them, blockchian j and blockchian k The furthest from blockchian i The two closest blockchain configuration schemes are TPS (blockchain) and TPS (transactions per second). j ), LOT (blockchain) j ) and BUR (blockchian j (referring to blockchain configuration scheme) j Throughput (TPS), latency (LOT), and block utilization (BUR) max LOT max and BUR maxThis refers to the maximum values ​​of TPS, LOT, and BUR for initializing all blockchain configuration schemes.

[0022] Steps 1)-8: Based on the congestion distance I (blockchain) i ) compute blockchain i The probability of selection p(x) i );

[0023]

[0024] Steps 1)-9: The higher the selection probability, the easier it is to be selected into the external archive value NC. Based on the selection probability p(x) of all schemes... i Initialize NC;

[0025] Step 1)-10: Initialize the globally optimal blockchain configuration scheme G based on the external archive value NC. best ;

[0026] Step 1)-11: Output the initial globally optimal blockchain configuration scheme result G best ;

[0027] Step 1)-12: End state.

[0028] Furthermore, the specific steps of step 2) above are as follows:

[0029] Step 2)-1: Initial state;

[0030] Step 2)-2: Input the inertia factor w, velocity factor c, and iteration number cycle_;

[0031] Step 2)-3: Determine if the iteration count cycle_ has been reached. If not, proceed to the next step. If it has been reached, proceed to step 2)-15.

[0032] Steps 2)-4: Based on the inertia factor w, velocity factor c, and rate of change v interval and v size Calculate the block generation interval and block size change rate v' of the blockchain configuration scheme. interval and v' size ;

[0033] v' interval =w*v interval +c*(P best -B interval -blockchain i _B interval )

[0034] v' size =w*v size +c*(Pbest -B size -blockchain i _B size )

[0035] Among them, P best -B interval and P best -B interval P represents the optimal value of an individual in the previous iteration. best Block generation interval B interval and block size B size blockchain i _B interval and blockchain i _B size Represents the i-th blockchain configuration scheme. i Block generation interval B interval and block size B size .

[0036] Steps 2)-5: Calculate the block generation interval and block size of the partials blockchain configuration schemes in this iteration based on the rate of change v';

[0037] blockchain k .B interval =blockchain k-1 .B interval +v' interval

[0038] blockchain k .B size =blockchain k-1 .B size +v' size

[0039] Among them, blockchain k .B interval and blockchain k .B size Indicates the block generation interval and block size for the current iteration, blockchain k-1 .B interval and blockchain k-1 .B size This indicates the block generation interval and block size of the previous iteration.

[0040] Steps 2)-6: Calculate the throughput (TPS), latency (LOT), and block utilization (BUR) during the BlockIoV information sharing process under each blockchain scheme;

[0041] Steps 2)-7: Update the individual optimal P in this iteration based on the performance results of the partials blockchain configuration schemes. best ;

[0042] Steps 2)-8: Place P best The TPS, LOT, and BUR values ​​of each blockchain configuration scheme in G best A comparison of the performance of all configuration schemes;

[0043] Step 2)-9: Determine G best Does there exist a blockchain configuration scheme whose performance completely dominates the current blockchain configuration scheme, and is the dominance relationship expressed as... That is, the throughput and block utilization of the blockchain configuration are higher than the current scheme, and the latency is lower than the current scheme. If this exists, the blockchain configuration scheme is marked as an inferior solution; if it does not exist, the blockchain configuration scheme is marked as a non-inferior solution.

[0044]

[0045] TPSk(x) represents the current iteration P best The TPS results of the solution, TPS k-1 (x) represents the previous iteration G. best The TPS result is the same for the others. This applies if and only if G... best The TPS, LOT, and BUR of a certain blockchain configuration scheme are all less than P. best The blockchain configuration scheme defines P. best The blockchain configuration scheme is subject to G best The solution is determined by the blockchain configuration scheme; otherwise, it is a non-inferior solution.

[0046] Step 2)-10: Based on the obtained non-dominated solution, obtain the external archive blockchain configuration scheme NC at this time;

[0047] Step 2)-11: Calculate the i-th blockchain configuration scheme. i Crowded distance I (blockchain) i );

[0048]

[0049] Among them, blockchian j and blockchian k The furthest from blockchian i The two closest blockchain configuration schemes are TPS (blockchain) and TPS (transactions per second). j), LOT (blockchain) j ) and BUR (blockchian j (referring to blockchain configuration scheme) j Throughput (TPS), latency (LOT), and block utilization (BUR) max LOT max and BUR max This refers to the maximum values ​​of TPS, LOT, and BUR for initializing all blockchain configuration schemes.

[0050] Step 2)-12: Based on the congestion distance I (blockchain) i ) compute blockchain i The probability of selection p(x) i );

[0051]

[0052] Steps 2)-13: Based on the selection probability p(x) of all options i Update the globally optimal blockchain configuration scheme G. best ;

[0053] Step 2)-14: Update the inertia factor w;

[0054]

[0055] w = w start -(w start -w now (X) i (k)-1) 2

[0056] Among them, w start and w now These refer to the initial value of w and the value in this iteration, respectively.

[0057] Step 2)-15: Output the globally optimal blockchain configuration scheme G best The corresponding throughput (TPS), latency (LOT), and block utilization (BUR) results;

[0058] Step 2)-16: End state. Attached Figure Description

[0059] Figure 1 This is an overall framework diagram of a performance optimization method for BlockIoV information sharing process in this invention.

[0060] Figure 2 for Figure 1 A flowchart for initializing the blockchain configuration scheme.

[0061] Figure 3 for Figure 1 A flowchart showing the results of Pareto performance optimization search. Detailed Implementation

[0062] To better understand the technical content of the present invention, specific embodiments are described below in conjunction with the accompanying drawings.

[0063] Figure 1 This is an overall framework diagram of a performance optimization method for the information sharing process of vehicle networking based on blockchain, as implemented in this invention.

[0064] 1) Blockchain Configuration Scheme Initialization. This step constructs an initial configuration for the blockchain configuration scheme in the BlockIoV information sharing process. Inputs include the number of blockchain configuration schemes, the maximum and minimum values ​​of the block generation interval and block size. First, based on the maximum and minimum values ​​of the block generation interval and block size, the block generation interval and block size of each blockchain configuration scheme are randomly generated, and the rate of change of the block generation interval and block size in the next iteration is initialized. Second, the performance of throughput, latency, and block utilization in the BlockIoV information sharing process under this blockchain configuration scheme is calculated. Then, based on the performance of all blockchain configuration schemes, the individual optimal scheme is initialized, all non-dominated configuration schemes obtained from the initialization are solved, and the external archive value is initialized based on the non-dominated solutions. Finally, the globally optimal blockchain configuration scheme is initialized based on the external archive value.

[0065] 2) Pareto Performance Optimization Result Search and Generation. This step iteratively optimizes three performance metrics: throughput, latency, and block utilization. Inputs include an inertia factor, a velocity factor, and the number of iterations. First, based on the inertia and velocity factors, the rate of change of the block generation interval and block size is updated, and this rate of change generates the block generation interval and block size for all blockchain configuration schemes in this iteration. Second, the performance of throughput (TPS), latency (LOT), and block utilization (BUR) under this blockchain configuration scheme is calculated. Then, the individual optimality is updated based on the performance of all blockchain configuration schemes. The performance of each blockchain configuration scheme in the individual optimality is compared with the global optimality, and the external archive value for this iteration is obtained based on the dominance relationship. Finally, the congestion distance and selection probability are calculated, and the globally optimal blockchain configuration scheme and its performance optimization results are updated for this iteration.

[0066] Figure 2 A flowchart for initializing the blockchain configuration scheme. This is used to initialize the blockchain configuration scheme in the optimization method, generating an initial optimal configuration scheme for the group. The specific steps are as follows:

[0067] Step 1: Initial state; Step 2: Input the number of blockchain configuration schemes (particals), the maximum value (max_) and minimum value (min_) of the block generation interval and block size; Step 3: Initialize the block generation interval B of the partial blockchain configuration schemes (blockchain) based on the maximum value (max_) and minimum value (min_). interval and block size B size Step 4: Initialize the block generation interval and block size change rate v for each blockchain scheme; Step 5: Calculate the throughput TPS, latency LOT, and block utilization BUR for each blockchain scheme; Step 6: Initialize the individual optimal P based on the performance results of the partials blockchain configuration schemes. best Step 7: Calculate the i-th blockchain configuration scheme. i Crowded distance I (blockchain) i Step 8: Based on the congestion distance I (blockchain) i ) compute blockchain i The probability of selection p(x) i Step 9: Based on the selection probability p(x) of all options... i Step 10: Initialize the globally optimal blockchain configuration scheme G based on the external archive value NC. best Step 11: Output the initial globally optimal blockchain configuration scheme result G best Step 12: End state.

[0068] Figure 3 This is a flowchart of an iterative loop. It's used to iteratively optimize the blockchain configuration scheme, finding the Pareto optimal solution for throughput, latency, and block utilization. The specific steps are as follows:

[0069] Step 1: Initial state; Step 2: Input inertia factor w, velocity factor c, iteration count cycle_; Step 3: Check if the iteration count cycle_ has been reached. If not, proceed to the next step; if reached, proceed to step 15; Step 4: Calculate the block generation interval and block size change rate v' of the blockchain configuration scheme based on the inertia factor w, velocity factor c, and change rate v; Step 5: Calculate the block generation interval and block size of the partials blockchain configuration schemes in this iteration based on the change rate v'; Step 6: Calculate the throughput TPS, latency LOT, and block utilization BUR of each scheme blockchain; Step 7: Update the individual optimal P of this iteration based on the performance results of the partials blockchain configuration schemes. best Step 8: Place P bestEach blockchain configuration scheme in G best Compare all configuration schemes; Step 9: Determine G best Does there exist a blockchain configuration scheme whose performance completely dominates the current blockchain configuration scheme, and is the dominance relationship expressed as... That is, the throughput and block utilization of this blockchain configuration are both higher than the current scheme, and the latency is lower than the current scheme. If this exists, the blockchain configuration scheme is marked as an inferior solution; if it does not exist, the blockchain configuration scheme is marked as a non-inferior solution. Step 10: Based on the obtained non-inferior solution, obtain the external archive blockchain configuration scheme NC at this time. Step 11: Calculate the i-th blockchain configuration scheme blockchain. i Crowded distance I (blockchain) i Step 12: Based on the congestion distance I (blockchain) i ) compute blockchain i The probability of selection p(x) i Step 13: Based on the selection probability p(x) of all options... i Update the globally optimal blockchain configuration scheme G. best Step 14: Update the inertia factor w; Step 15: Output the globally optimal blockchain configuration scheme G best The corresponding throughput (TPS), latency (LOT), and block utilization (BUR) results; Step 16: End status.

[0070] In summary, this invention proposes a performance optimization method for the BlockIoV information sharing process. By initializing the blockchain configuration scheme and using a multi-objective optimization algorithm, it iteratively searches the block generation interval and block size in the configuration scheme, thereby optimizing the throughput, latency, and block utilization of the BlockIoV information sharing process under a given test scenario.

Claims

1. A performance optimization method for the BlockIoV information sharing process in a blockchain-based Internet of Vehicles (IoV) system. By initializing the blockchain configuration scheme, and based on the idea of ​​multi-objective optimization algorithm, the block generation interval and block size in the configuration scheme are iteratively optimized, thereby achieving the goal of optimizing the throughput, latency and block utilization of the BlockIoV information sharing process under a given test scenario. The method includes the following steps: 1) Blockchain configuration scheme initialization: Based on the maximum and minimum values ​​of the block generation interval and block size, randomly generate the block generation interval and block size for each blockchain configuration scheme, and initialize the rate of change of the block generation interval and block size in the next iteration; calculate the performance of throughput, latency, and block utilization under these blockchain configuration schemes; initialize the individual optimal scheme based on the performance of all blockchain configuration schemes, solve all non-dominated configuration schemes obtained from the initialization, and initialize the external archive value based on the non-dominated solution; initialize the globally optimal blockchain configuration scheme based on the external storage value. 2) Pareto performance optimization result search and generation: Based on the inertia factor and velocity factor, update the rate of change of block generation interval and block size, and generate the block generation interval and block size for all blockchain configuration schemes in this iteration based on this rate of change; calculate the throughput, latency, and block utilization performance of all blockchain configuration schemes in this iteration; initialize individual optimality based on the performance of all blockchain configuration schemes, solve for all non-dominated configuration schemes obtained from the initialization, and obtain the external archive value for this iteration based on the non-dominated solutions. Finally, by calculating the congestion distance and selection probability, search and generate the globally optimal blockchain configuration scheme for this iteration. Among them, the first A blockchain configuration scheme crowded distance ; in, and The most distant The two closest blockchain configuration schemes, , and Blockchain configuration scheme Throughput (TPS), latency (LOT), and block utilization (BUR) , and This refers to the maximum values ​​of TPS, LOT, and BUR for all initial blockchain configuration schemes; after reaching the required number of iterations, it outputs the globally optimal blockchain configuration scheme. The corresponding throughput (TPS), latency (LOT), and block utilization (BUR) results are the Pareto performance optimization results.

2. The performance optimization method for the information sharing process in a blockchain-based vehicle network (BlockIoV) as described in claim 1, characterized in that, In step 1), the blockchain configuration scheme is initialized. This step constructs an initial configuration for the blockchain configuration scheme in the BlockIoV information sharing process. The input includes the number of blockchain configuration schemes, the maximum and minimum values ​​of the block generation interval and block size. First, based on the maximum and minimum values ​​of the block generation interval and block size, the block generation interval and block size of each blockchain configuration scheme are randomly generated, and the rate of change of the block generation interval and block size in the next iteration is initialized. Second, the performance of throughput, latency, and block utilization in the BlockIoV information sharing process under this blockchain configuration scheme is calculated. Then, the individual optimal scheme is initialized based on the performance of all blockchain configuration schemes, all non-dominated configuration schemes obtained from the initialization are solved, and the external archive value is initialized based on the non-dominated solutions. Finally, the globally optimal blockchain configuration scheme is initialized based on the external archive value.

Images