A task allocation method, system, device and storage medium for Internet of Vehicles

Abstract

This application discloses a task allocation method, system, device, and storage medium for vehicle-to-everything (V2X) communication. The task allocation method includes obtaining the current location coordinates of the service vehicle, the task vehicle, the base station, the task popularity, the number of vehicles participating in I2V communication, and the number of vehicle matching pairs participating in V2V communication; calculating a first transmission delay and a second transmission delay based on the service vehicle, task vehicle, and base station location coordinates; calculating the total benefit value of the service vehicle and the total benefit value of the base station based on the first transmission delay, the second transmission delay, the task popularity, the number of vehicles, and the number of vehicle matching pairs; calculating the optimal task allocation scheme based on the total benefit value of the base station, the total benefit value of the service vehicle, and preset constraints; and allocating service vehicles to complete the task requests of corresponding task vehicles based on the optimal task allocation scheme, thereby improving resource utilization.

Description

Technical Field

[0001] This application relates to the technical field of task allocation in the Internet of Vehicles (IoV), and in particular to a task allocation method, system, device and storage medium for the IoV. Background Technology

[0002] In recent years, with the rapid development of vehicle-to-everything (V2X) technology, the intelligence level of modern transportation systems has been continuously improving. V2X achieves more efficient and safer traffic management through vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication. However, with the rapid increase in the number of vehicles and the dynamic changes in user content requests in V2I, the communication load that base stations need to handle has increased, posing a severe challenge to existing communication architectures. Especially in large-scale dynamic environments, the communication load of base stations will increase significantly, which will not only lead to a decline in communication quality but also adversely affect the overall stability of the system. Currently, how to effectively manage content request offloading and task scheduling remains an urgent problem to be solved.

[0003] Existing research has proposed caching strategies based on content popularity metrics to optimize resource allocation and communication efficiency. However, these methods often overlook the selfishness and dynamism of virtual networks. Virtual volunteers tend to focus only on their own content needs and lack the willingness to cooperate. Furthermore, existing research mainly relies on static rule-driven caching and traffic distribution strategies, which are difficult to adapt to the dynamic changes in task requests and vehicle mobility in connected vehicles. Summary of the Invention

[0004] This application aims to at least address the technical problems existing in the prior art. To this end, this application proposes a task allocation method, system, device, and storage medium for vehicle-to-everything (V2X) networks, which can flexibly adjust the matching relationship under dynamic demand scenarios, maximize the utility of base stations and service vehicles, and improve resource utilization.

[0005] The first aspect of this application provides a task allocation method for a vehicle-to-everything (V2X) network, comprising the following steps:

[0006] The system obtains the current location coordinates of the service vehicle, the task vehicle, the base station, the task popularity, the number of vehicles participating in I2V communication, and the number of vehicle matching pairs participating in V2V communication, where I2V refers to base station and vehicle, and V2V refers to vehicle and vehicle.

[0007] The first transmission delay is calculated based on the location coordinates of the service vehicle and the location coordinates of the task vehicle.

[0008] The second transmission delay is calculated based on the location coordinates of the mission vehicle and the location coordinates of the base station.

[0009] The total service vehicle benefit is calculated based on the first transmission delay, the task popularity, the number of vehicles, and the number of vehicle matching pairs.

[0010] The total base station benefit is calculated based on the second transmission delay, the task popularity, the number of vehicles, and the number of vehicle matching pairs.

[0011] The optimal task allocation scheme is calculated based on the total benefit value of the base station, the total benefit value of the service vehicle, and the preset constraints. Then, the service vehicles are allocated to complete the task requests of the corresponding task vehicles based on the optimal task allocation scheme.

[0012] The control method according to the embodiments of this application has at least the following beneficial effects:

[0013] This method obtains the current location coordinates of the service vehicle, task vehicle, and base station, as well as the task popularity, the number of vehicles participating in I2V communication, and the number of vehicle matching pairs participating in V2V communication. Here, I2V refers to base station-to-vehicle communication, and V2V refers to vehicle-to-vehicle communication. It calculates a first transmission delay based on the service vehicle and task vehicle location coordinates; a second transmission delay based on the task vehicle and base station location coordinates; a total service vehicle benefit value based on the first transmission delay, task popularity, number of vehicles, and number of vehicle matching pairs; and a total base station benefit value based on the second transmission delay, task popularity, number of vehicles, and number of vehicle matching pairs. By calculating the total service vehicle and base station benefits, this application enables flexible adjustment of matching relationships under dynamic demand scenarios, maximizing the utility of both the base station and service vehicles. Based on the total base station and service vehicle benefits and preset constraints, it calculates the optimal task allocation scheme and allocates service vehicles to complete the corresponding task vehicle's task request, thereby improving resource utilization.

[0014] According to some embodiments of this application, calculating the first transmission delay based on the service vehicle location coordinates and the task vehicle location coordinates includes:

[0015] Get the size of each task content requested by the task vehicle, the transmit power of all service vehicles, and the first fixed bandwidth allocated to all vehicles in V2V communication;

[0016] The first distance is calculated based on the location coordinates of the service vehicle and the location coordinates of the mission vehicle using the following formula:

[0017]

[0018] in, Let be the first distance between the i-th service vehicle and the j-th mission vehicle at time t. Let x be the x-coordinate of the i-th service vehicle at time t. Let be the ordinate of the i-th service vehicle at time t. Let x be the x-coordinate of the j-th mission vehicle at time t. Let be the ordinate of the j-th mission vehicle at time t;

[0019] The received signal power is calculated based on the transmitted power using the following formula:

[0020]

[0021] in, Let G be the received signal power of the j-th mission vehicle receiving the mission signal from the i-th service vehicle at time t. t G represents the antenna gain at the transmitting end. r Here, g is the antenna gain at the receiver, g is the speed of light, and h is the channel frequency. Let α be the transmit power of the i-th service vehicle, and α be the path loss exponent.

[0022] The first transmission rate is calculated based on the received signal power and the first fixed bandwidth using the following formula:

[0023]

[0024] in, To match the first transmission rate of the j-th task vehicle with the i-th service vehicle at time t, B V2V Where N is the first fixed bandwidth and N0 is the channel noise power;

[0025] The first transmission delay is calculated based on the task content size and the first transmission rate using the following formula:

[0026]

[0027] Among them, s m The size of the m-th task content requested by the j-th task vehicle. The first transmission delay for matching the m-th task content of the i-th service vehicle to the j-th task vehicle at time t.

[0028] According to some embodiments of this application, the calculation of the second transmission delay based on the location coordinates of the mission vehicle and the location coordinates of the base station includes:

[0029] Obtain the base station transmit power and the second fixed bandwidth allocated to all vehicles in I2V communication;

[0030] The second distance is calculated based on the coordinates of the mission vehicle and the coordinates of the base station using the following formula:

[0031]

[0032] in, Let y be the second distance between the base station and the j-th mission vehicle at time t. BS Let z be the x-coordinate of the base station. BS The vertical coordinate of the base station. Let x be the x-coordinate of the j-th mission vehicle at time t. Let be the ordinate of the j-th mission vehicle at time t;

[0033] The power of the transmitted signal from the base station to the mission vehicle is calculated using the following formula based on the base station's transmit power:

[0034]

[0035] in, Let G be the transmission signal power of the task sent by the base station to the j-th task vehicle at time t. t G represents the antenna gain at the transmitting end. r Here, g is the antenna gain at the receiver, g is the speed of light, and h is the channel frequency. Where α is the base station transmit power, and α is the path loss exponent.

[0036] The second transmission rate is calculated based on the transmitted signal power and the second fixed bandwidth using the following formula:

[0037]

[0038] in, To match the second transmission rate of the base station for the j-th mission vehicle at time t, B I2V The second fixed bandwidth is N0, and the channel noise power is N0.

[0039] The second transmission delay is calculated based on the task content size and the second transmission rate using the following formula:

[0040]

[0041] Among them, s m The size of the m-th task content requested by the j-th task vehicle. The second transmission delay is used to match the m-th task content of the base station for the j-th task vehicle at time t.

[0042] According to some embodiments of this application, the step of calculating the total service vehicle benefit value based on the first transmission delay, the task popularity, the number of vehicles, and the number of vehicle matching logs includes:

[0043] The base station load rate is calculated based on the number of vehicles and the number of vehicle matching pairs.

[0044] The next-moment state transition probability matrix for each mission vehicle is determined using big data analytics.

[0045] Determine the initial task allocation scheme, and based on the initial task allocation scheme, determine the binary values ​​of the service vehicle and the base station:

[0046]

[0047] in, For time t+1, match the j-th task vehicle with the m-th task content of the i-th service vehicle. The base station binary value for matching the m-th task content of the base station to the j-th task vehicle at time t+1;

[0048] Based on the next-time state transition probability matrix, the base station load rate, the first transmission delay, the task popularity, the service vehicle binary value, and the base station binary value, the total service vehicle benefit value is calculated using the following formula:

[0049]

[0050] in, Let f be the service vehicle benefit value of the i-th service vehicle at time t, ξ be the first preset parameter value, r be the preset unit price of the task content, and f be the service vehicle benefit value of the i-th service vehicle at time t. m Let m be the task popularity of the m-th task content. Let be the base station load rate at time t. Let V be the state transition probability value of the m-th task content of the j-th task vehicle at time t+1, ε be the second preset parameter value, C be the task content set, τ be the preset content transmission energy consumption coefficient, β be the preset content processing weight coefficient, and V be the state transition probability value of the m-th task content of the j-th task vehicle at time t+1. Sev For the collection of service vehicles, Let s be the total service vehicle benefit at time t. m The size of the m-th task content requested for the j-th task vehicle.

[0051] According to some embodiments of this application, the calculation of base station load rate based on the number of vehicles and the number of vehicle matching logs includes:

[0052] The first allocated bandwidth is calculated based on the second fixed bandwidth and the number of vehicles using the following formula:

[0053]

[0054] in, For the first bandwidth allocation at time t, B I2V For the second fixed bandwidth, Let t be the number of vehicles participating in I2V communication at time t;

[0055] The second allocated bandwidth is calculated based on the first fixed bandwidth and the number of vehicle matching pairs using the following formula:

[0056]

[0057] in, For the second allocated bandwidth at time t, B V2V For the first fixed bandwidth, Let t be the number of vehicles participating in V2V communication at time t;

[0058] The total bandwidth is calculated based on the first allocated bandwidth and the second allocated bandwidth using the following formula:

[0059]

[0060] in, The total bandwidth at time t;

[0061] The base station load rate is calculated based on the total bandwidth using the following formula:

[0062]

[0063] in, Let B be the base station load rate at time t. total This represents the total available bandwidth of the base station.

[0064] According to some embodiments of this application, the total benefit value of the base station is calculated using the following formula:

[0065]

[0066] in, V represents the total benefit of the base station at time t. Tav It is a set of task vehicles, ξ is the first preset parameter value, r is the preset unit price of task content, and f m Let m be the task popularity of the m-th task content. Let be the base station load rate at time t. Let ε be the state transition probability value of the m-th task content of the j-th task vehicle at time t+1, ε be the second preset parameter value, C be the task content set, τ be the preset content transmission energy consumption coefficient, β be the preset content processing weight coefficient, and s be the state transition probability value of the m-th task content of the j-th task vehicle at time t+1. m The size of the m-th task content requested for the j-th task vehicle.

[0067] According to some embodiments of this application, the step of calculating the optimal task allocation scheme based on the total benefit value of the base station, the total benefit value of the service vehicle, and preset constraints includes:

[0068] Calculate the total benefit value based on the total benefit value of the base station and the total benefit value of the service vehicle;

[0069] Based on the total benefit value and the preset constraints, the initial task allocation scheme is updated using a genetic algorithm to obtain the optimal task allocation scheme, wherein the preset constraints are:

[0070]

[0071] Wherein, C1 is the first preset constraint, C2 is the second preset constraint, C3 is the third preset constraint, C2 is the fourth preset constraint, C1 is the fifth preset constraint, and C2 is the sixth preset constraint. Let be the preset maximum cache capacity of the i-th service vehicle at time t. The first preset maximum distance, This is the second preset maximum distance.

[0072] A second aspect of this application provides a task allocation system for a vehicle-to-everything (V2X) network, the V2X task allocation system comprising:

[0073] The data acquisition module is used to acquire the current location coordinates of the service vehicle, the task vehicle, the base station, the task popularity, the number of vehicles participating in I2V communication, and the number of vehicle matching pairs participating in V2V communication, wherein I2V refers to base station and vehicle, and V2V refers to vehicle and vehicle.

[0074] The first transmission delay calculation module is used to calculate the first transmission delay based on the service vehicle location coordinates and the task vehicle location coordinates.

[0075] The second transmission delay calculation module is used to calculate the second transmission delay based on the location coordinates of the mission vehicle and the location coordinates of the base station.

[0076] The service vehicle benefit total value calculation module is used to calculate the service vehicle benefit total value based on the first transmission delay, the task popularity, the number of vehicles, and the number of vehicle matching pairs;

[0077] The base station benefit total value calculation module is used to calculate the base station benefit total value based on the second transmission delay, the task popularity, the number of vehicles, and the number of vehicle matching pairs;

[0078] The task allocation module is used to calculate the optimal task allocation scheme based on the total benefit value of the base station, the total benefit value of the service vehicle, and preset constraints, and to allocate service vehicles to complete the task requests of the corresponding task vehicles based on the optimal task allocation scheme.

[0079] This system obtains the current location coordinates of the service vehicle, task vehicle, and base station, as well as the task popularity, the number of vehicles participating in I2V communication, and the number of vehicle matching pairs participating in V2V communication. Here, I2V refers to base station to vehicle, and V2V refers to vehicle to vehicle. Based on the service vehicle and task vehicle location coordinates, it calculates a first transmission delay; based on the task vehicle and base station location coordinates, it calculates a second transmission delay; based on the first transmission delay, task popularity, number of vehicles, and number of vehicle matching pairs, it calculates the total service vehicle benefit; and based on the second transmission delay, task popularity, number of vehicles, and number of vehicle matching pairs, it calculates the total base station benefit. By calculating the total service vehicle benefit and the total base station benefit, this application enables flexible adjustment of matching relationships under dynamic demand scenarios, maximizing the utility of the base station and service vehicles. Based on the total base station benefit, the total service vehicle benefit, and preset constraints, it calculates the optimal task allocation scheme and allocates service vehicles to complete the corresponding task vehicle's task request, thereby improving resource utilization.

[0080] A third aspect of this application provides a task allocation electronic device for a vehicle network, including at least one control processor and a memory for communicatively connecting to the at least one control processor; the memory stores instructions executable by the at least one control processor, which are executed by the at least one control processor to enable the at least one control processor to perform the above-described task allocation method for a vehicle network.

[0081] A fourth aspect of this application provides a computer-readable storage medium storing computer-executable instructions for causing a computer to perform the aforementioned task allocation method for the Internet of Vehicles.

[0082] It should be noted that the beneficial effects of the second to fourth aspects of this application with respect to the prior art are the same as the beneficial effects of the above-mentioned vehicle networking task allocation system with respect to the prior art, and will not be described in detail here.

[0083] Additional aspects and advantages of this application will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of this application. Attached Figure Description

[0084] The above and / or additional aspects and advantages of this application will become apparent and readily understood from the description of the embodiments taken in conjunction with the following drawings, in which:

[0085] Figure 1 This is a flowchart of a task allocation method for a vehicle network according to an embodiment of this application;

[0086] Figure 2 This is a schematic diagram of a scenario for the task allocation method for the Internet of Vehicles provided in this application;

[0087] Figure 3 This is a schematic diagram of the cache state of each service vehicle in the vehicle-to-everything (V2X) task allocation method provided in this application;

[0088] Figure 4 This is a schematic diagram illustrating the content transmission and pricing process of the task allocation method for the Internet of Vehicles provided in this application;

[0089] Figure 5 This is a schematic diagram illustrating the impact of parameter τ in the task allocation method for vehicle networking provided in this application on the base station utility;

[0090] Figure 6 This is a schematic diagram illustrating the influence of parameter τ on vehicle utility in the task allocation method of the Internet of Vehicles provided in this application;

[0091] Figure 7 This is a schematic diagram illustrating the impact of parameter β in the task allocation method for vehicle networking provided in this application on the base station utility;

[0092] Figure 8 This is a schematic diagram illustrating the influence of parameter β on vehicle utility in the task allocation method of the Internet of Vehicles provided in this application.

[0093] Figure 9 This is a schematic diagram illustrating the impact of parameter ξ in the task allocation method for vehicle networking provided in this application on the base station's effectiveness;

[0094] Figure 10 This is a schematic diagram illustrating the impact of parameter ξ in the task allocation method for the Internet of Vehicles provided in this application on vehicle utility;

[0095] Figure 11 This is a schematic diagram illustrating the impact of the presence or absence of a service vehicle on the base station load rate in the vehicle-to-everything (V2X) task allocation method provided in this application.

[0096] Figure 12 This is a schematic diagram of the structure of an embodiment of the vehicle networking task allocation system provided in this application;

[0097] Figure 13 This is a schematic diagram of the structure of an embodiment of the electronic device provided in this application. Detailed Implementation

[0098] The embodiments of this application are described in detail below. Examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain this application, and should not be construed as limiting this application.

[0099] In the description of this application, the use of terms such as "first," "second," etc., is for the purpose of distinguishing technical features only and should not be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated or the order of the technical features indicated.

[0100] In the description of this application, it should be understood that the orientation descriptions, such as up, down, etc., are based on the orientation or positional relationship shown in the accompanying drawings, and are only for the convenience of describing this application and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation, and therefore should not be construed as a limitation of this application.

[0101] In the description of this application, it should be noted that, unless otherwise explicitly defined, terms such as "setup," "installation," and "connection" should be interpreted broadly, and those skilled in the art can reasonably determine the specific meaning of the above terms in this application in conjunction with the specific content of the technical solution.

[0102] Before introducing this application, let's first introduce the following terms:

[0103] Resource pricing: Reasonable value assessment and pricing of various limited or shareable resources (such as computing resources, communication bandwidth, storage and data) in the vehicle-to-everything (V2X) system, in order to optimize resource allocation, improve system efficiency and incentivize users to participate in resource sharing.

[0104] V2X (Vehicle to Everything): V2X is one of the supporting technologies for intelligent vehicles and intelligent transportation. It includes various application communication scenarios such as vehicle-to-vehicle (V2V), vehicle-to-infrastructure (V2I), vehicle-to-pedestrian (V2P), and vehicle-to-network (V2N).

[0105] Base Station Load: In vehicle-to-everything (V2X) communication, this refers to the data processing volume, number of connected devices, spectrum resource utilization rate, and other indicators carried by cellular base stations (such as 4G / 5G base stations) or roadside units (RSUs), reflecting the resource utilization of base stations and the degree of network congestion.

[0106] In recent years, with the rapid development of vehicle-to-everything (V2X) technology, the intelligence level of modern transportation systems has been continuously improving. V2X achieves more efficient and safer traffic management through vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication. However, with the rapid increase in the number of vehicles and the dynamic changes in user content requests in V2I, the communication load that base stations need to handle has increased, posing a severe challenge to existing communication architectures. Especially in large-scale dynamic environments, the communication load of base stations will increase significantly, which will not only lead to a decline in communication quality but also adversely affect the overall stability of the system. Currently, how to effectively manage content request offloading and task scheduling remains an urgent problem to be solved.

[0107] Existing research has proposed caching strategies based on content popularity metrics to optimize resource allocation and communication efficiency. However, these methods often overlook the selfishness and dynamism of virtual networks. Virtual volunteers tend to focus only on their own content needs and lack the willingness to cooperate. Furthermore, existing research mainly relies on static rule-driven caching and traffic distribution strategies, which are difficult to adapt to the dynamic changes in task requests and vehicle mobility in connected vehicles.

[0108] To address the aforementioned technical deficiencies, embodiments of this application provide a task allocation method, system, device, and storage medium for vehicle networking.

[0109] Please see Figure 1 This is a flowchart illustrating a task allocation method for a vehicle-to-everything (V2X) network provided in an embodiment of this application. This method is applied to an electronic device, which may be a server, etc. Figure 1 As shown, the task allocation method of this vehicle-to-everything (V2X) network includes:

[0110] Step S101: Obtain the current location coordinates of the service vehicle, the task vehicle, the base station, the task popularity, the number of vehicles participating in I2V communication, and the number of vehicle matching pairs participating in V2V communication, where I2V refers to base station and vehicle, and V2V refers to vehicle and vehicle.

[0111] Step S102: Calculate the first transmission delay based on the service vehicle location coordinates and the task vehicle location coordinates;

[0112] Step S103: Calculate the second transmission delay based on the location coordinates of the mission vehicle and the location coordinates of the base station;

[0113] Step S104: Calculate the total service vehicle benefit value based on the first transmission delay, task popularity, number of vehicles, and number of vehicle matching pairs;

[0114] Step S105: Calculate the total base station benefit value based on the second transmission delay, task popularity, number of vehicles, and number of vehicle matching pairs;

[0115] Step S106: Calculate the optimal task allocation scheme based on the total benefit value of the base station, the total benefit value of the service vehicle, and the preset constraints, and allocate service vehicles to complete the task requests of the corresponding task vehicles based on the optimal task allocation scheme.

[0116] This method obtains the current location coordinates of the service vehicle, task vehicle, and base station, as well as the task popularity, the number of vehicles participating in I2V communication, and the number of vehicle matching pairs participating in V2V communication. Here, I2V refers to base station-to-vehicle communication, and V2V refers to vehicle-to-vehicle communication. It calculates a first transmission delay based on the service vehicle and task vehicle location coordinates; a second transmission delay based on the task vehicle and base station location coordinates; a total service vehicle benefit value based on the first transmission delay, task popularity, number of vehicles, and number of vehicle matching pairs; and a total base station benefit value based on the second transmission delay, task popularity, number of vehicles, and number of vehicle matching pairs. By calculating the total service vehicle and base station benefits, this application enables flexible adjustment of matching relationships under dynamic demand scenarios, maximizing the utility of both the base station and service vehicles. Based on the total base station and service vehicle benefits and preset constraints, it calculates the optimal task allocation scheme and allocates service vehicles to complete the corresponding task vehicle's task request, thereby improving resource utilization.

[0117] In some embodiments, calculating the first transmission delay based on the service vehicle location coordinates and the mission vehicle location coordinates includes:

[0118] Step S201: Obtain the size of each task content requested by the task vehicle, the transmission power corresponding to all service vehicles, and the first fixed bandwidth allocated to all vehicles in V2V communication;

[0119] Step S202: Calculate the first distance based on the service vehicle's location coordinates and the mission vehicle's location coordinates using the following formula:

[0120]

[0121] in, Let be the first distance between the i-th service vehicle and the j-th mission vehicle at time t. Let x be the x-coordinate of the i-th service vehicle at time t. Let be the ordinate of the i-th service vehicle at time t. Let x be the x-coordinate of the j-th mission vehicle at time t. Let be the ordinate of the j-th mission vehicle at time t;

[0122] Step S203: Calculate the received signal power based on the transmitted power using the following formula:

[0123]

[0124] in, Let G be the received signal power of the j-th mission vehicle receiving the mission signal from the i-th service vehicle at time t. t G represents the antenna gain at the transmitting end. r Here, g is the antenna gain at the receiver, g is the speed of light, and h is the channel frequency. Let α be the transmit power of the i-th service vehicle, and α be the path loss exponent.

[0125] Step S204: Calculate the first transmission rate based on the received signal power and the first fixed bandwidth using the following formula:

[0126]

[0127] in, To match the first transmission rate of the j-th task vehicle with the i-th service vehicle at time t, B V2V Where N is the first fixed bandwidth and N0 is the channel noise power;

[0128] Step S205: Calculate the first transmission delay based on the task content size and the first transmission rate using the following formula:

[0129]

[0130] Among them, s m The size of the m-th task content requested by the j-th task vehicle. The first transmission delay for matching the m-th task content of the i-th service vehicle to the j-th task vehicle at time t.

[0131] Reference Figure 2 In a connected vehicle scenario, all vehicles in the system include task vehicles and service vehicles. Task vehicles initiate content requests, while service vehicles provide caching and content delivery services. Each vehicle in the set has a specific function. The roles of vehicles in the system are randomly distributed, which makes task allocation and communication optimization highly dynamic. The scenario diagram illustrates the process of a task vehicle requesting content from a service vehicle or base station. The base station is responsible for task coordination and pays incentives to service vehicles.

[0132] Specifically, in some embodiments, the cached content set is defined as C = {1,2,...,m,...,M}, containing M cached content resources. The cached content set represents the content types that all task vehicles in the system may request and the content types that service vehicles can cache. The size of each content m may vary, and this difference further affects transmission time and system performance. When a task vehicle initiates a content request, some service vehicles directly meet the task vehicle's needs via V2V; if not cached, the base station needs to complete the direct transmission of content via I2V communication. The set of vehicles and the cached content set together constitute the core foundation of the entire vehicle-to-everything (V2X) communication. The base station's management strategy aims to optimize task allocation between vehicles and coordinate V2V and I2V communication methods to reduce communication load and improve overall system efficiency.

[0133] Reference Figure 3 Each service vehicle randomly caches a portion of its content: SeV-1 caches content A, B, and C; SeV-2 caches content A, B, and D; and SeV-3 caches content B, D, and E. The cache status of each service vehicle is as follows: Figure 3 As shown.

[0134] In some embodiments, calculating the second transmission delay based on the location coordinates of the mission vehicle and the location coordinates of the base station includes:

[0135] Step S301: Obtain the base station transmit power and the second fixed bandwidth allocated to all vehicles in I2V communication;

[0136] Step S302: Calculate the second distance based on the mission vehicle's location coordinates and the base station's location coordinates using the following formula:

[0137]

[0138] in, Let y be the second distance between the base station and the j-th mission vehicle at time t. BS Let z be the x-coordinate of the base station. BS The vertical coordinate of the base station. Let x be the x-coordinate of the j-th mission vehicle at time t. Let be the ordinate of the j-th mission vehicle at time t;

[0139] Step S303: Calculate the transmission signal power sent by the base station to the mission vehicle based on the base station's transmission power using the following formula:

[0140]

[0141] in, Let G be the transmission signal power of the task sent by the base station to the j-th task vehicle at time t. t G represents the antenna gain at the transmitting end.r Here, g is the antenna gain at the receiver, g is the speed of light, and h is the channel frequency. Where α is the base station transmit power, and α is the path loss exponent.

[0142] Step S304: Calculate the second transmission rate based on the transmitted signal power and the second fixed bandwidth using the following formula:

[0143]

[0144] in, To match the second transmission rate of the base station for the j-th mission vehicle at time t, B I2V The second fixed bandwidth is N0, and the channel noise power is N0.

[0145] Step S305: Calculate the second transmission delay based on the task content size and the second transmission rate using the following formula:

[0146]

[0147] Among them, s m The size of the m-th task content requested by the j-th task vehicle. The second transmission delay is used to match the m-th task content of the base station for the j-th task vehicle at time t.

[0148] Specifically, refer to Figure 4 The process comprises two parts: one with incentives and one without. In the incentivized part, the task vehicle sends its carrier information, content request, and utility function to the service carrier pool. The incentive mechanism coordinates the interaction between the task vehicle and the service carrier, including the pricing, negotiation, and payment processes for the request. Ultimately, the selected service carrier delivers the content. In the unincentivized part, the task vehicle directly sends a request to the BS and obtains the content without the need for service vehicles or incentives.

[0149] The communication model in this application is divided into two modes: V2V communication and I2V communication. The communication distance, transmission rate, receiving power and transmission delay of each mode are modeled by mathematical formulas.

[0150] In some embodiments, the total service vehicle benefit value is calculated based on a first transmission delay, task popularity, number of vehicles, and number of vehicle matching logs, including:

[0151] Step S401: Calculate the base station load rate based on the number of vehicles and the number of vehicle matching pairs;

[0152] Step S402: Determine the state transition probability matrix for each mission vehicle at the next moment using big data analysis methods;

[0153] Step S403: Determine the initial task allocation scheme, and determine the service vehicle binary value and the base station binary value based on the initial task allocation scheme:

[0154]

[0155] in, For time t+1, match the j-th task vehicle with the m-th task content of the i-th service vehicle. The base station binary value for matching the m-th task content of the base station to the j-th task vehicle at time t+1;

[0156] Step S404: Based on the state transition probability matrix at the next time step, base station load rate, first transmission delay, task popularity, service vehicle binary value, and base station binary value, calculate the total service vehicle benefit value using the following formula:

[0157]

[0158] in, Let f be the service vehicle benefit value of the i-th service vehicle at time t, ξ be the first preset parameter value, r be the preset unit price of the task content, and f be the service vehicle benefit value of the i-th service vehicle at time t. m Let m be the task popularity of the m-th task content. Let be the base station load rate at time t. Let V be the state transition probability value of the m-th task content of the j-th task vehicle at time t+1, ε be the second preset parameter value, C be the task content set, τ be the preset content transmission energy consumption coefficient, β be the preset content processing weight coefficient, and V be the state transition probability value of the m-th task content of the j-th task vehicle at time t+1. Sev For the collection of service vehicles, Let s be the total service vehicle benefit at time t. m The size of the m-th task content requested for the j-th task vehicle.

[0159] This application introduces a prediction mechanism, enabling the base station to dynamically adjust its reward mechanism and transmission mode based on content request behavior at time t+1. This aims to achieve efficient utilization of base station resources and maximize overall utility. The reward mechanism incentivizes service vehicles to participate in content transmission, reducing the load on the base station and ensuring communication service quality.

[0160] In some embodiments, the base station load rate is calculated based on the number of vehicles and the number of vehicle matching logs, including:

[0161] Step S501: Calculate the first allocated bandwidth based on the second fixed bandwidth and the number of vehicles using the following formula:

[0162]

[0163] in, For the first bandwidth allocation at time t, BI2V For the second fixed bandwidth, Let t be the number of vehicles participating in I2V communication at time t;

[0164] Step S502: Calculate the second allocated bandwidth based on the first fixed bandwidth and the number of vehicle matching pairs using the following formula:

[0165]

[0166] in, For the second allocated bandwidth at time t, B V2V For the first fixed bandwidth, Let t be the number of vehicles participating in V2V communication at time t;

[0167] Step S503: Calculate the total bandwidth based on the first allocated bandwidth and the second allocated bandwidth using the following formula:

[0168]

[0169] in, The total bandwidth at time t;

[0170] Step S504: Calculate the base station load rate based on the total bandwidth using the following formula:

[0171]

[0172] in, Let B be the base station load rate at time t. total This represents the total available bandwidth of the base station.

[0173] Specifically, the base station is the core of communication in the Internet of Vehicles (IoV). Its main functions include: 1) Task allocation: The base station is responsible for receiving requests from task vehicles and deciding whether the request is processed directly by the base station (I2V communication) or through content transmission via an incentivized service vehicle (V2V communication). 2) Load status management: The base station needs to monitor its own communication load rate in real time to ensure that it is within a reasonable range.

[0174] In some embodiments, the total benefit value of the base station is calculated using the following formula:

[0175]

[0176] in, V represents the total benefit of the base station at time t. Tav It is a set of task vehicles, ξ is the first preset parameter value, r is the preset unit price of task content, and f m Let m be the task popularity of the m-th task content. Let be the base station load rate at time t. Let ε be the state transition probability value of the m-th task content of the j-th task vehicle at time t+1, ε be the second preset parameter value, C be the task content set, τ be the preset content transmission energy consumption coefficient, β be the preset content processing weight coefficient, and s be the state transition probability value of the m-th task content of the j-th task vehicle at time t+1. m The size of the m-th task content requested for the j-th task vehicle.

[0177] In some embodiments, the optimal task allocation scheme is calculated based on the total benefit value of the base station, the total benefit value of the service vehicle, and preset constraints, including:

[0178] Step S601: Calculate the total benefit value based on the total benefit value of the base station and the total benefit value of the service vehicle;

[0179] Step S602: Based on the total benefit value and preset constraints, the initial task allocation scheme is updated using a genetic algorithm to obtain the optimal task allocation scheme. The preset constraints are:

[0180]

[0181] Wherein, C1 is the first preset constraint, C2 is the second preset constraint, C3 is the third preset constraint, C2 is the fourth preset constraint, C1 is the fifth preset constraint, and C2 is the sixth preset constraint. Let be the preset maximum cache capacity of the i-th service vehicle at time t. The first preset maximum distance, This is the second preset maximum distance.

[0182] Specifically, the optimization problem in this application includes the following constraints: C1 ensures that each task vehicle can only be served by a service vehicle or a BS, but not by both, thus ensuring that each task is uniquely assigned. C2 specifies that the allocation variable is binary, indicating whether a task is assigned to a BS or a service vehicle. C3 ensures that the total resource consumption of all tasks assigned to a specific service vehicle does not exceed the resource capacity of the service vehicle. C4 requires that the distance between each task vehicle and its assigned service vehicle does not exceed the maximum V2V communication range. C5 ensures that the distance between the task vehicle and the BS does not exceed the maximum communication range. Finally, C6 guarantees that the resource requirements of each task are strictly positive, ensuring that all tasks have meaningful resource requirements.

[0183] Specifically, in a dynamic wireless network, the base station needs to make a decision about matching the service vehicle with the task vehicle at each time t, based on the request status of the vehicle user and the capability of the service vehicle. To this end, variables are introduced. This is used to represent the optimal matching scheme made by the base station at time t. Specifically, Defined as the set of matching relationships between service vehicles and task vehicles:

[0184]

[0185] Where (i,j) represents that service vehicle i is assigned to complete the request of task vehicle j, and (a,b) represents that service vehicle a is assigned to complete the request of task vehicle b. The goal is to find a matching relationship that maximizes the utility of the base station and all service vehicles while satisfying resource constraints and service vehicle capabilities.

[0186] Specifically, the basic process of this application based on the genetic algorithm is divided into the following steps: First, the population is randomly initialized, with each individual representing a matching scheme between a service vehicle and a task vehicle, ensuring that all schemes meet constraints such as the needs of the task vehicle and the capabilities of the service vehicle. Next, each individual is evaluated using a fitness function, which comprehensively considers matching utility, such as the degree to which the needs of the task vehicle are met, the service cost of the service vehicle, and the overall revenue of the base station; higher fitness indicates a better matching scheme. In each generation of evolution, individuals with higher fitness are preferentially retained as parents through selection operations, simulating "survival of the fittest"; the matching information of the parents is combined through crossover operations to generate new offspring, thereby exploring new matching schemes; the matching relationship of the offspring is randomly adjusted through mutation operations to break the local consistency of the population and prevent the algorithm from getting trapped in local optima. Furthermore, in each evolution, the population fitness gradually increases, eventually converging to the matching scheme with the highest utility. Through multiple generations of evolution, the genetic algorithm can gradually optimize the matching scheme and flexibly adjust the matching relationship under dynamic demand scenarios, thereby maximizing the utility of the base station and the service vehicle.

[0187] Reference Figure 5 and Figure 6 As can be observed from the graph, BS utility initially increases with increasing BS unit reward, then gradually decreases. This is because at lower reward values, service vehicles are more motivated to participate in task transfers, which reduces the service cost of the BS and thus increases BS utility. However, as the unit reward continues to increase, the increased reward cost outweighs the benefits of task transfer, leading to a decrease in BS utility. Furthermore, higher τ values ​​further reduce BS utility due to increased transmission energy consumption.

[0188] Reference Figure 7 and Figure 8 As can be observed from the figure, the utility of both the base station and the service vehicle is significantly affected as the β value increases.

[0189] Reference Figure 9 and Figure 10As can be observed from the figure, BS utility initially increases and then decreases with increasing unit reward. At low reward values, the relatively small incentive cost effectively attracts service vehicles to participate in task offloading, significantly reducing the base station's transmission energy consumption and thus improving base station utility. However, as the unit reward continues to increase, the growth in incentive cost gradually outpaces the benefits of task offloading, leading to a decline in base station utility. Furthermore, different incentive coefficients have a significant impact on BS utility; the peak BS utility gradually decreases as the incentive coefficient increases, and the rate of decrease accelerates, indicating that a larger incentive coefficient amplifies the negative impact of incentive cost on BS utility.

[0190] Reference Figure 11 As can be observed from the graph, without service vehicles involved, the BS load rate rises rapidly with the increase in the number of requested content, reaching full load (load rate of 1) when the number of content requests approaches 50. In contrast, service vehicle involvement (V2V) significantly reduces the BS load rate. When the number of requests is low, the difference in BS load rate between the two cases is not significant; however, as the number of requests increases, the task diversion effect of service vehicles gradually becomes apparent, causing a significant slowdown in the growth of BS load.

[0191] Specifically, for the convenience of those skilled in the art, a set of preferred embodiments is provided below:

[0192] I. Data Acquisition:

[0193] Obtain the current location coordinates of the service vehicle, the task vehicle, the base station, the task popularity, the number of vehicles participating in I2V communication, and the number of vehicle matching pairs participating in V2V communication. Here, I2V refers to base station and vehicle, and V2V refers to vehicle and vehicle.

[0194] II. First Transmission Delay Calculation:

[0195] The first transmission delay is calculated based on the location coordinates of the service vehicle and the mission vehicle, specifically as follows:

[0196] Get the size of each task content requested by the task vehicle, the transmit power of all service vehicles, and the first fixed bandwidth allocated to all vehicles in V2V communication;

[0197] The first distance is calculated based on the location coordinates of the service vehicle and the mission vehicle using the following formula:

[0198]

[0199] in, Let be the first distance between the i-th service vehicle and the j-th mission vehicle at time t. Let x be the x-coordinate of the i-th service vehicle at time t. Let be the ordinate of the i-th service vehicle at time t. Let x be the x-coordinate of the j-th mission vehicle at time t. Let be the ordinate of the j-th mission vehicle at time t;

[0200] The received signal power is calculated based on the transmit power using the following formula:

[0201]

[0202] in, Let G be the received signal power of the j-th mission vehicle receiving the mission signal from the i-th service vehicle at time t. t G represents the antenna gain at the transmitting end. r Here, g is the antenna gain at the receiver, g is the speed of light, and h is the channel frequency. Let α be the transmit power of the i-th service vehicle, and α be the path loss exponent.

[0203] The first transmission rate is calculated based on the received signal power and the first fixed bandwidth using the following formula:

[0204]

[0205] in, To match the first transmission rate of the j-th task vehicle with the i-th service vehicle at time t, B V2V Where N is the first fixed bandwidth and N0 is the channel noise power;

[0206] The first transmission delay is calculated based on the task content size and the first transmission rate using the following formula:

[0207]

[0208] Among them, s m The size of the m-th task content requested by the j-th task vehicle. The first transmission delay for matching the m-th task content of the i-th service vehicle to the j-th task vehicle at time t.

[0209] III. Second Transmission Delay Calculation:

[0210] The second transmission delay is calculated based on the location coordinates of the mission vehicle and the base station, specifically as follows:

[0211] Obtain the base station transmit power and the second fixed bandwidth allocated to all vehicles in I2V communication;

[0212] The second distance is calculated based on the coordinates of the mission vehicle and the base station using the following formula:

[0213]

[0214] in, Let y be the second distance between the base station and the j-th mission vehicle at time t. BS Let z be the x-coordinate of the base station. BS The vertical coordinate of the base station. Let x be the x-coordinate of the j-th mission vehicle at time t. Let be the ordinate of the j-th mission vehicle at time t;

[0215] The power of the signal transmitted from the base station to the mission vehicle is calculated using the following formula based on the base station's transmit power:

[0216]

[0217] in, Let G be the transmission signal power of the task sent by the base station to the j-th task vehicle at time t. t G represents the antenna gain at the transmitting end. r Here, g is the antenna gain at the receiver, g is the speed of light, and h is the channel frequency. Where α is the base station transmit power, and α is the path loss exponent.

[0218] The second transmission rate is calculated based on the transmitted signal power and the second fixed bandwidth using the following formula:

[0219]

[0220] in, To match the second transmission rate of the base station for the j-th mission vehicle at time t, B I2V The second fixed bandwidth is N0, and the channel noise power is N0.

[0221] The second transmission delay is calculated based on the task content size and the second transmission rate using the following formula:

[0222]

[0223] Among them, s m The size of the m-th task content requested by the j-th task vehicle. The second transmission delay is used to match the m-th task content of the base station for the j-th task vehicle at time t.

[0224] IV. Calculation of Total Service Vehicle Benefits:

[0225] The total service vehicle benefit is calculated based on the first transmission delay, task popularity, number of vehicles, and number of vehicle matching pairs, specifically as follows:

[0226] The base station load rate is calculated based on the number of vehicles and the number of vehicle matching pairs, specifically:

[0227] The first allocated bandwidth is calculated based on the second fixed bandwidth and the number of vehicles using the following formula:

[0228]

[0229] in, For the first bandwidth allocation at time t, B I2V For the second fixed bandwidth, Let t be the number of vehicles participating in I2V communication at time t;

[0230] The second allocated bandwidth is calculated based on the first fixed bandwidth and the number of vehicle matching pairs using the following formula:

[0231]

[0232] in, For the second allocated bandwidth at time t, B V2V For the first fixed bandwidth, Let t be the number of vehicles participating in V2V communication at time t;

[0233] The total bandwidth is calculated based on the first and second allocated bandwidths using the following formula:

[0234]

[0235] in, The total bandwidth at time t;

[0236] The base station load rate is calculated based on the total bandwidth using the following formula:

[0237]

[0238] in, Let B be the base station load rate at time t. total This represents the total available bandwidth of the base station.

[0239] The next-moment state transition probability matrix for each mission vehicle is determined using big data analytics.

[0240] Determine the initial task allocation scheme, and based on the initial task allocation scheme, determine the binary values ​​of the service vehicle and the base station:

[0241]

[0242] in, For time t+1, match the j-th task vehicle with the m-th task content of the i-th service vehicle. The base station binary value for matching the m-th task content of the base station to the j-th task vehicle at time t+1;

[0243] Based on the next-time state transition probability matrix, base station load rate, first transmission delay, task popularity, service vehicle binary value, and base station binary value, the total service vehicle benefit value is calculated using the following formula:

[0244]

[0245] in, Let f be the service vehicle benefit value of the i-th service vehicle at time t, ξ be the first preset parameter value, r be the preset unit price of the task content, and f be the service vehicle benefit value of the i-th service vehicle at time t. m Let m be the task popularity of the m-th task content. Let be the base station load rate at time t. Let V be the state transition probability value of the m-th task content of the j-th task vehicle at time t+1, ε be the second preset parameter value, C be the task content set, τ be the preset content transmission energy consumption coefficient, β be the preset content processing weight coefficient, and V be the state transition probability value of the m-th task content of the j-th task vehicle at time t+1. Sev For the collection of service vehicles, Let s be the total service vehicle benefit at time t. m The size of the m-th task content requested for the j-th task vehicle.

[0246] V. Calculation of Total Base Station Benefits:

[0247] The total base station benefit is calculated using the following formula based on the second transmission delay, task popularity, number of vehicles, and number of vehicle matching pairs:

[0248]

[0249] in, V represents the total benefit of the base station at time t. Tav It is a set of task vehicles, ξ is the first preset parameter value, r is the preset unit price of task content, and f m Let m be the task popularity of the m-th task content. Let be the base station load rate at time t. Let ε be the state transition probability value of the m-th task content of the j-th task vehicle at time t+1, ε be the second preset parameter value, C be the task content set, τ be the preset content transmission energy consumption coefficient, β be the preset content processing weight coefficient, and s be the state transition probability value of the m-th task content of the j-th task vehicle at time t+1. m The size of the m-th task content requested for the j-th task vehicle.

[0250] VI. Task Assignment:

[0251] The optimal task allocation scheme is calculated based on the total benefit value of the base station, the total benefit value of the service vehicle, and preset constraints. Then, service vehicles are allocated according to the optimal task allocation scheme to complete the corresponding task requests. Specifically:

[0252] Calculate the total benefit value based on the total benefit value of the base station and the total benefit value of the service vehicle.

[0253] Based on the total benefit value and preset constraints, the initial task allocation scheme is updated using a genetic algorithm to obtain the optimal task allocation scheme. The preset constraints are as follows:

[0254]

[0255] Wherein, C1 is the first preset constraint, C2 is the second preset constraint, C3 is the third preset constraint, C2 is the fourth preset constraint, C1 is the fifth preset constraint, and C2 is the sixth preset constraint. Let be the preset maximum cache capacity of the i-th service vehicle at time t. The first preset maximum distance, This is the second preset maximum distance.

[0256] Additionally, refer to Figure 12 One embodiment of this application provides a task allocation system for a vehicle-to-everything (V2X) network, including a feature extraction module 1100, a first transmission delay calculation module 1200, a second transmission delay calculation module 1300, a service vehicle benefit total value calculation module 1400, a base station benefit total value calculation module 1500, and a task allocation module 1600, wherein:

[0257] The data acquisition module 1100 is used to acquire the current service vehicle location coordinates, task vehicle location coordinates, base station location coordinates, task popularity, number of vehicles participating in I2V communication, and number of vehicle matching pairs participating in V2V communication. Here, I2V refers to base station and vehicle, and V2V refers to vehicle and vehicle.

[0258] The first transmission delay calculation module 1200 is used to calculate the first transmission delay based on the service vehicle position coordinates and the task vehicle position coordinates;

[0259] The second transmission delay calculation module 1300 is used to calculate the second transmission delay based on the position coordinates of the mission vehicle and the position coordinates of the base station.

[0260] The service vehicle total benefit calculation module 1400 is used to calculate the total service vehicle benefit based on the first transmission delay, task popularity, number of vehicles, and number of vehicle matching pairs;

[0261] The base station benefit total value calculation module 1500 is used to calculate the base station benefit total value based on the second transmission delay, task popularity, number of vehicles and number of vehicle matching pairs;

[0262] The task allocation module 1600 is used to calculate the optimal task allocation scheme based on the total benefit value of the base station, the total benefit value of the service vehicle, and preset constraints, and to allocate service vehicles to complete the task requests of the corresponding task vehicles based on the optimal task allocation scheme.

[0263] This system obtains the current location coordinates of the service vehicle, task vehicle, and base station, as well as the task popularity, the number of vehicles participating in I2V communication, and the number of vehicle matching pairs participating in V2V communication. Here, I2V refers to base station to vehicle, and V2V refers to vehicle to vehicle. Based on the service vehicle and task vehicle location coordinates, it calculates a first transmission delay; based on the task vehicle and base station location coordinates, it calculates a second transmission delay; based on the first transmission delay, task popularity, number of vehicles, and number of vehicle matching pairs, it calculates the total service vehicle benefit; and based on the second transmission delay, task popularity, number of vehicles, and number of vehicle matching pairs, it calculates the total base station benefit. By calculating the total service vehicle benefit and the total base station benefit, this application enables flexible adjustment of matching relationships under dynamic demand scenarios, maximizing the utility of the base station and service vehicles. Based on the total base station benefit, the total service vehicle benefit, and preset constraints, it calculates the optimal task allocation scheme and allocates service vehicles to complete the corresponding task vehicle's task request, thereby improving resource utilization.

[0264] It should be noted that the system embodiments described above are based on the same inventive concept as the method embodiments described above. Therefore, the relevant content of the method embodiments described above is also applicable to the system embodiments described above, and will not be repeated here.

[0265] Figure 13 This paper illustrates a schematic diagram of the hardware structure for task allocation in a vehicle-to-everything (V2X) network provided in an embodiment of this application.

[0266] The task allocation device in the vehicle network may include a processor 301 and a memory 302 storing computer program instructions.

[0267] Specifically, the processor 301 may include a central processing unit (CPU), an application-specific integrated circuit (ASIC), or one or more integrated circuits that can be configured to implement the embodiments of this application.

[0268] Memory 302 may include mass storage for data or instructions. For example, and not limitingly, memory 302 may include a hard disk drive (HDD), floppy disk drive, flash memory, optical disk, magneto-optical disk, magnetic tape, or Universal Serial Bus (USB) drive, or a combination of two or more of these. Where appropriate, memory 302 may include removable or non-removable (or fixed) media. Where appropriate, memory 302 may be internal or external to the integrated gateway disaster recovery device. In a particular embodiment, memory 302 is non-volatile solid-state memory.

[0269] In some embodiments, memory 302 may include read-only memory (ROM), random access memory (RAM), disk storage media device, optical storage media device, flash memory device, electrical, optical, or other physical / tangible memory storage device. Thus, generally, memory includes one or more tangible (non-transitory) computer-readable storage media (e.g., memory devices) encoded with software including computer-executable instructions, and when the software is executed (e.g., by one or more processors), it is operable to perform the operations described with reference to the method according to one aspect of this disclosure.

[0270] The processor 301 reads and executes computer program instructions stored in the memory 302 to implement any of the vehicle networking task allocation methods in the above embodiments.

[0271] In one example, the task allocation device for the vehicle-to-everything (V2X) network may also include a communication interface 303 and a bus 310. For example, Figure 13 As shown, the processor 301, memory 302, and communication interface 303 are connected through bus 310 and complete communication with each other.

[0272] The communication interface 303 is mainly used to realize communication between various modules, devices, units and / or equipment in the embodiments of this application.

[0273] Bus 310 includes hardware, software, or both, that couples components of the vehicular network task allocation device together. For example, and not limitingly, the bus may include an Accelerated Graphics Port (AGP) or other graphics bus, an Enhanced Industry Standard Architecture (EISA) bus, a Front Side Bus (FSB), HyperTransport (HT) interconnect, an Industry Standard Architecture (ISA) bus, an Infinite Bandwidth Interconnect, a Low Pin Count (LPC) bus, a memory bus, a Microchannel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a Video Electronics Standards Association Local (VLB) bus, or other suitable buses, or combinations of two or more of these. Where appropriate, bus 310 may include one or more buses. Although specific buses are described and illustrated in embodiments of this application, this application contemplates any suitable bus or interconnect.

[0274] The vehicle-to-everything (V2X) task allocation device can execute the V2X task allocation method in this application embodiment based on a 3D design model, thereby achieving a combination of... Figure 1 and Figure 12 The task allocation method and system of the Internet of Vehicles are described.

[0275] Furthermore, in conjunction with the task allocation method for the Internet of Vehicles (IoV) in the above embodiments, this application embodiment can provide a computer storage medium for implementation. This computer storage medium stores computer program instructions; when these computer program instructions are executed by a processor, they implement any of the task allocation methods for the IoV in the above embodiments.

[0276] It should be clarified that this application is not limited to the specific configurations and processes described above and shown in the figures. For the sake of brevity, detailed descriptions of known methods are omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method process of this application is not limited to the specific steps described and shown. Those skilled in the art can make various changes, modifications, and additions, or change the order of steps, after understanding the spirit of this application.

[0277] The functional blocks shown in the above block diagram can be implemented as hardware, software, firmware, or a combination thereof. When implemented in hardware, they can be, for example, electronic circuits, application-specific integrated circuits (ASICs), appropriate firmware, plug-ins, function cards, etc. When implemented in software, the elements of this application are programs or code segments used to perform the required tasks. Programs or code segments can be stored on a machine-readable medium or transmitted over a transmission medium or communication link via data signals carried on a carrier wave. "Machine-readable medium" can include any medium capable of storing or transmitting information. Examples of machine-readable media include electronic circuits, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), floppy disks, CD-ROMs, optical disks, hard disks, fiber optic media, radio frequency (RF) links, etc. Code segments can be downloaded via computer networks such as the Internet, intranets, etc.

[0278] It should also be noted that the exemplary embodiments mentioned in this application describe methods or systems based on a series of steps or apparatus. However, this application is not limited to the order of the above steps; that is, the steps can be performed in the order mentioned in the embodiments, or in a different order, or several steps can be performed simultaneously.

[0279] The aspects of this disclosure have been described above with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this disclosure. It should be understood that each block in the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing apparatus to produce a machine such that these instructions, executable via the processor of the computer or other programmable data processing apparatus, enable the implementation of the functions / actions specified in one or more blocks of the flowchart illustrations and / or block diagrams. Such a processor can be, but is not limited to, a general-purpose processor, a special-purpose processor, a special application processor, or a field-programmable logic circuit. It is also understood that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can also be implemented by special-purpose hardware performing the specified functions or actions, or can be implemented by a combination of special-purpose hardware and computer instructions.

[0280] The above description is merely a specific implementation of this application. Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, modules, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here. It should be understood that the protection scope of this application is not limited thereto. Any person skilled in the art can easily conceive of various equivalent modifications or substitutions within the technical scope disclosed in this application, and these modifications or substitutions should all be covered within the protection scope of this application.

Claims

1. A task allocation method for vehicle-to-everything (V2X) networks, characterized in that, The task allocation method of the vehicle-to-everything (V2X) network includes: The system obtains the current location coordinates of the service vehicle, the task vehicle, the base station, the task popularity, the number of vehicles participating in I2V communication, and the number of vehicle matching pairs participating in V2V communication, where I2V refers to base station and vehicle, and V2V refers to vehicle and vehicle. The first transmission delay is calculated based on the location coordinates of the service vehicle and the location coordinates of the task vehicle. The second transmission delay is calculated based on the location coordinates of the mission vehicle and the location coordinates of the base station. The total service vehicle benefit is calculated based on the first transmission delay, the task popularity, the number of vehicles, and the number of vehicle matching pairs, specifically as follows: The base station load rate is calculated based on the number of vehicles and the number of vehicle matching pairs, specifically as follows: Having obtained the second fixed bandwidth allocated to all vehicles in I2V communication, the first allocated bandwidth is calculated based on the second fixed bandwidth and the number of vehicles using the following formula: in, For the first First allocate bandwidth at any time. For the second fixed bandwidth, For the first The number of vehicles participating in I2V communication at any given time; Given the first fixed bandwidth allocated to all vehicles in V2V communication, the second allocated bandwidth is calculated based on the first fixed bandwidth and the number of vehicle matching pairs using the following formula: in, For the first Second allocation of bandwidth at time, For the first fixed bandwidth, For the first The number of vehicles participating in V2V communication at any given time; The total bandwidth is calculated based on the first allocated bandwidth and the second allocated bandwidth using the following formula: in, For the first Total bandwidth at any given moment; The base station load rate is calculated based on the total bandwidth using the following formula: in, For the first Base station load rate at any time This represents the total available bandwidth of the base station; The next-moment state transition probability matrix for each mission vehicle is determined using big data analytics. Determine the initial task allocation scheme, and based on the initial task allocation scheme, determine the binary values ​​of the service vehicle and the base station: in, For the first Time of the first The mission vehicle was matched with the first The first service vehicle The binary value of the service vehicle for each task content. For the first Time of the first The first mission vehicle matched with the base station The base station binary value of each task content; Based on the next-time state transition probability matrix, the base station load rate, the first transmission delay, the task popularity, the service vehicle binary value, and the base station binary value, the total service vehicle benefit value is calculated using the following formula: in, For the first Time of the first The service vehicle efficiency value of a service vehicle The first preset parameter value, To preset the unit price of task content, For the first The popularity of each task content For the first Base station load rate at any time For the first Time of the first The mission vehicle's first The state transition probability value for each task content. The second preset parameter value, A collection of task content, To preset the content transmission energy consumption factor, Preset weighting coefficients for content processing. For the collection of service vehicles, For the first Total value of services provided by the vehicle at all times For the first The first mission vehicle requested The size of each task content For the first Time of the first The mission vehicle was matched with the first The first service vehicle The first transmission delay of each task content; The total base station benefit is calculated based on the second transmission delay, the task popularity, the number of vehicles, and the number of vehicle matching pairs. The optimal task allocation scheme is calculated based on the total base station benefit value, the total service vehicle benefit value, and preset constraints. Service vehicles are then allocated based on the optimal task allocation scheme to complete the corresponding task requests. The calculation of the optimal task allocation scheme based on the total base station benefit value, the total service vehicle benefit value, and preset constraints includes: Calculate the total benefit value based on the total benefit value of the base station and the total benefit value of the service vehicle; Based on the total benefit value and the preset constraints, the initial task allocation scheme is updated using a genetic algorithm to obtain the optimal task allocation scheme, wherein the preset constraints are: in, This is the first preset constraint in the preset constraint conditions. This is the second preset constraint condition in the preset constraint conditions. This is the third preset constraint in the preset constraint conditions. This is the fourth preset constraint in the preset constraint conditions. This is the fifth preset constraint in the preset constraint conditions. This is the sixth preset constraint in the preset constraint conditions. For the first Time of the first The preset maximum cache capacity of each service vehicle. The first preset maximum distance, The second preset maximum distance, For the first Time of the first Service vehicle and the first The first distance of the mission vehicle For the first Time base station and the The second distance of the mission vehicle It is a collection of mission vehicles.

2. The task allocation method for vehicle networking according to claim 1, characterized in that, The calculation of the first transmission delay based on the location coordinates of the service vehicle and the location coordinates of the task vehicle includes: Obtain the size of each task requested by the task vehicle and the corresponding transmission power of all service vehicles; The first distance is calculated based on the location coordinates of the service vehicle and the location coordinates of the mission vehicle using the following formula: in, For the first Time of the first Service vehicle and the first The first distance of the mission vehicle For the first Time of the first The x-coordinate of each service vehicle. For the first Time of the first The longitudinal coordinate of each service vehicle. For the first Time of the first The x-coordinate of the mission vehicle. For the first Time of the first The longitudinal coordinate of the mission vehicle; The received signal power is calculated based on the transmitted power using the following formula: in, For the first Time of the first The mission vehicle received the first The signal reception power of the service vehicle's mission. For the antenna gain at the transmitting end, For the antenna gain at the receiving end, At the speed of light, For channel frequency, For the first The transmission power of the service vehicle The path loss index; The first transmission rate is calculated based on the received signal power and the first fixed bandwidth using the following formula: in, For the first Time of the first The mission vehicle was matched with the first The first transmission rate of the service vehicle For the first fixed bandwidth, Channel noise power; The first transmission delay is calculated based on the task content size and the first transmission rate using the following formula: in, For the first The first mission vehicle requested The size of each task content For the first Time of the first The mission vehicle was matched with the first The first service vehicle The first transmission delay of each task content.

3. The task allocation method for vehicle networking according to claim 2, characterized in that, The calculation of the second transmission delay based on the location coordinates of the mission vehicle and the location coordinates of the base station includes: Obtain the base station's transmit power; The second distance is calculated based on the coordinates of the mission vehicle and the coordinates of the base station using the following formula: in, For the first Time base station and the The second distance of the mission vehicle The x-coordinate of the base station. The vertical coordinate of the base station. For the first Time of the first The x-coordinate of the mission vehicle. For the first Time of the first The longitudinal coordinate of the mission vehicle; The power of the transmitted signal from the base station to the mission vehicle is calculated using the following formula based on the base station's transmit power: in, For the first The time base station sends the first The signal transmission power of the mission vehicle. For the antenna gain at the transmitting end, For the antenna gain at the receiving end, At the speed of light, For channel frequency, For base station transmission power, The path loss index; The second transmission rate is calculated based on the transmitted signal power and the second fixed bandwidth using the following formula: in, For the first Time of the first The mission vehicle is matched with the base station's second transmission rate. For the second fixed bandwidth, Channel noise power; The second transmission delay is calculated based on the task content size and the second transmission rate using the following formula: in, For the first The first mission vehicle requested The size of each task content For the first Time of the first The first mission vehicle matched with the base station The second transmission delay of each task content.

4. The task allocation method for vehicle networking according to claim 3, characterized in that, The total benefit value of the base station is calculated using the following formula: in, For the first Total value of base station benefits at any time It is a collection of mission vehicles. The first preset parameter value, To preset the unit price of task content, For the first The popularity of each task content For the first Base station load rate at any time For the first Time of the first The mission vehicle's first The state transition probability value for each task content. The second preset parameter value, A collection of task content, To preset the content transmission energy consumption factor, Preset weighting coefficients for content processing. For the first The first mission vehicle requested The size of each task content.

5. A task allocation system for vehicle networking, characterized in that, The task allocation system of the vehicle network includes: The data acquisition module is used to acquire the current location coordinates of the service vehicle, the task vehicle, the base station, the task popularity, the number of vehicles participating in I2V communication, and the number of vehicle matching pairs participating in V2V communication, wherein I2V refers to base station and vehicle, and V2V refers to vehicle and vehicle. The first transmission delay calculation module is used to calculate the first transmission delay based on the service vehicle location coordinates and the task vehicle location coordinates; The second transmission delay calculation module is used to calculate the second transmission delay based on the location coordinates of the mission vehicle and the location coordinates of the base station. The service vehicle total benefit calculation module is used to calculate the total service vehicle benefit based on the first transmission delay, the task popularity, the number of vehicles, and the number of vehicle matching pairs. Specifically: The base station load rate is calculated based on the number of vehicles and the number of vehicle matching pairs, specifically as follows: Having obtained the second fixed bandwidth allocated to all vehicles in I2V communication, the first allocated bandwidth is calculated based on the second fixed bandwidth and the number of vehicles using the following formula: in, For the first First allocate bandwidth at any time. For the second fixed bandwidth, For the first The number of vehicles participating in I2V communication at any given time; Given the first fixed bandwidth allocated to all vehicles in V2V communication, the second allocated bandwidth is calculated based on the first fixed bandwidth and the number of vehicle matching pairs using the following formula: in, For the first Second allocation of bandwidth at time, For the first fixed bandwidth, For the first The number of vehicles participating in V2V communication at any given time; The total bandwidth is calculated based on the first allocated bandwidth and the second allocated bandwidth using the following formula: in, For the first Total bandwidth at any given moment; The base station load rate is calculated based on the total bandwidth using the following formula: in, For the first Base station load rate at any time This represents the total available bandwidth of the base station; The next-moment state transition probability matrix for each mission vehicle is determined using big data analytics. Determine the initial task allocation scheme, and based on the initial task allocation scheme, determine the binary values ​​of the service vehicle and the base station: in, For the first Time of the first The mission vehicle was matched with the first The first service vehicle The binary value of the service vehicle for each task content. For the first Time of the first The first mission vehicle matched with the base station The base station binary value of each task content; Based on the next-time state transition probability matrix, the base station load rate, the first transmission delay, the task popularity, the service vehicle binary value, and the base station binary value, the total service vehicle benefit value is calculated using the following formula: in, For the first Time of the first The service vehicle efficiency value of a service vehicle The first preset parameter value, To preset the unit price of task content, For the first The popularity of each task content For the first Base station load rate at any time For the first Time of the first The mission vehicle's first The state transition probability value for each task content. The second preset parameter value, A collection of task content, To preset the content transmission energy consumption factor, Preset weighting coefficients for content processing. For the collection of service vehicles, For the first Total value of services provided by the vehicle at all times For the first The first mission vehicle requested The size of each task content For the first Time of the first The mission vehicle was matched with the first The first service vehicle The first transmission delay of each task content; The base station benefit total value calculation module is used to calculate the base station benefit total value based on the second transmission delay, the task popularity, the number of vehicles, and the number of vehicle matching pairs; The task allocation module is used to calculate the optimal task allocation scheme based on the total base station benefit value, the total service vehicle benefit value, and preset constraints, and to allocate service vehicles to complete the corresponding task requests based on the optimal task allocation scheme. The calculation of the optimal task allocation scheme based on the total base station benefit value, the total service vehicle benefit value, and preset constraints includes: Calculate the total benefit value based on the total benefit value of the base station and the total benefit value of the service vehicle; Based on the total benefit value and the preset constraints, the initial task allocation scheme is updated using a genetic algorithm to obtain the optimal task allocation scheme, wherein the preset constraints are: in, This is the first preset constraint in the preset constraint conditions. This is the second preset constraint condition in the preset constraint conditions. This is the third preset constraint in the preset constraint conditions. This is the fourth preset constraint in the preset constraint conditions. This is the fifth preset constraint in the preset constraint conditions. This is the sixth preset constraint in the preset constraint conditions. For the first Time of the first The preset maximum cache capacity of each service vehicle. The first preset maximum distance, The second preset maximum distance, For the first Time of the first Service vehicle and the first The first distance of the mission vehicle For the first Time base station and the The second distance of the mission vehicle It is a collection of mission vehicles.

6. A task allocation device for vehicle networking, characterized in that, It includes at least one control processor and a memory for communicatively connecting to the at least one control processor; the memory stores instructions executable by the at least one control processor, which, when executed by the at least one control processor, enable the at least one control processor to perform a task allocation method for a vehicle network as described in any one of claims 1 to 4.

7. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions for causing a computer to perform a task allocation method for a vehicle network as described in any one of claims 1 to 4.

Images