CN116193515A - V2V cooperation-based non-uniform vehicle task unloading method - Google Patents
V2V cooperation-based non-uniform vehicle task unloading method Download PDFInfo
- Publication number
- CN116193515A CN116193515A CN202310140357.9A CN202310140357A CN116193515A CN 116193515 A CN116193515 A CN 116193515A CN 202310140357 A CN202310140357 A CN 202310140357A CN 116193515 A CN116193515 A CN 116193515A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- task
- formula
- vehicles
- uniform
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
- H04W28/09—Management thereof
- H04W28/0925—Management thereof using policies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
- H04W28/0875—Load balancing or load distribution to or through Device to Device [D2D] links, e.g. direct-mode links
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
- H04W28/09—Management thereof
- H04W28/0958—Management thereof based on metrics or performance parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
- H04W28/09—Management thereof
- H04W28/0958—Management thereof based on metrics or performance parameters
- H04W28/0967—Quality of Service [QoS] parameters
- H04W28/0975—Quality of Service [QoS] parameters for reducing delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
- H04W4/46—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for vehicle-to-vehicle communication [V2V]
Abstract
The invention discloses a non-uniform vehicle task unloading method based on V2V cooperation, and belongs to the technical field of communication. In non-uniform vehicle edge networks, problems of network resource utilization degradation and task scheduling failure may be caused due to dynamic unordered changes in network topology and resource status. Aiming at the problem, a non-uniform vehicle task unloading method based on V2V cooperation is provided. According to the method, available cooperative vehicles in a reasonable communication range are searched according to the real-time speed of the vehicles and the position relation among the vehicles, and the unloading period and task scheduling among the cooperative vehicles are dynamically planned, so that the network resource utilization rate and the task completion rate are improved, and the task unloading time delay is reduced.
Description
Technical Field
The invention belongs to the technical field of communication networks, and particularly relates to a non-uniform vehicle task unloading method based on V2V cooperation.
Background
With the rapid development of mobile communication networks, the application of vehicular services has received extensive attention from the academia and industry. Communication between vehicles (V2V) may be achieved through technologies such as Cellular-V2X, c_v2x, or dedicated short range communication (Dedicate Short Range Commnunication, DSRC) based on the ieee802.11p protocol. Meanwhile, a mobile vehicle equipped with an On Board Unit (OBU) also has certain computing and storage capabilities, and can support certain task processing, such as path planning, real-time navigation, and the like, so that the automobile is regarded as one of important terminals of the current mobile communication network.
However, the limitation of the vehicle-mounted terminal in computing and storage capabilities may be difficult to meet the resource requirements of part of the vehicle-mounted applications, so as to affect the service quality experience of the user, and therefore, in the vehicle edge network, offloading the task to other network nodes with computing resources and storage resources is an effective task processing mode. V2V is used as an information interaction technology between vehicles, and can provide short-distance information sharing and resource sharing services for the moving vehicles. Therefore, by utilizing the V2V technology, the tasks generated by the vehicle are unloaded to the surrounding idle vehicles for execution, so that the task processing time delay can be reduced, and the network service quality can be improved.
Existing studies on V2V collaborative offloading generally only consider a simple assumption of mobility, i.e. that the vehicle is stationary or traveling at a constant speed, and that a single offloading destination is employed for task scheduling during offloading. However, in real life, due to the type of the vehicle, road conditions and subjective intention of the driver, the vehicle often has different driving modes and speeds, which may cause dynamic unordered changes of network topology and resource status, and simultaneously, adopting a single unloading destination mode may also cause the decrease of network resource utilization rate and the failure of task scheduling, thereby causing the deterioration of task completion delay and completion rate index. Aiming at the problems, a non-uniform vehicle task unloading method based on V2V cooperation is provided. According to the method, a dynamic programming unloading period mode is adopted, and available cooperative vehicles in a reasonable communication range are searched according to the real-time speed of the vehicles and the position relation among the vehicles so as to perform task scheduling of a plurality of unloading destinations, so that task processing is accelerated, and the network resource utilization rate and the task completion rate are improved.
Disclosure of Invention
The present invention is directed to solving the above problems of the prior art. A non-uniform vehicle task unloading method based on V2V cooperation is provided. The technical scheme of the invention is as follows:
a non-uniform vehicle task unloading method based on V2V cooperation, a road vehicle set is expressed as I (I E I), each vehicle is configured with a corresponding vehicle-mounted unit OBU to provide task unloading service, and the task unloading service adopts a dynamic periodic scheduling mode to carry out task unloading, and the method specifically comprises the following steps:
101. vehicle i initiates a task offloading request Z i Acquiring task data amount d i Task computational complexity c i Task delay threshold
Initializing the amount of completed tasks of the vehicle +.>
The cycle number k=0, and the system time t=0;
102. let k=k+1, according to the real-time speed v of the vehicle i i Calculate the kth period time tau i,k ；
103. Establishing a temporary set I temp For each non-mission-carrying vehicle i' within the communicable range of vehicle i, a speed v is determined i′ Relative distance l to vehicle i i,i′ Calculating sustainable communication time t i,i′ Will t i,i′ ≥τ i,k Is put into I temp Enabling the cooperative vehicle task to complete identification
104. For set I temp Normalizing its sustainable communication time t with vehicle i 'for each vehicle i' in (a) i,i′ And can provide computing resource f i′ And according to normalized sustainable communication timet′ i,i′ And normalizing the computing resource f' i′ Calculate the comprehensive screening index e' i′ ；
105. Will set I temp All vehicles in (2) are according to e' i′ The first n vehicles are put into a set I' of the collaborative vehicles, and the set I is deleted temp ；
106. For each vehicle I 'in the set I', a computing resource f may be provided according to the vehicle I i′ And the transmission rate r of the vehicle i i Calculating the amount of the task to be cooperatively offloaded in the kth period of the vehicle i
Performing task scheduling and offloading;
107. if it is
Jump to 108, otherwise jump to 110;
108. if it is
Jump to 109, otherwise let ∈ ->
Jump to 110;
109. for each cooperative vehicle I 'in I', if the cooperative task is completed
And returns the result, let
Releasing collaborative vehicle computing resource f i′ Deleting I 'from the set I', jumping to 107, otherwise jumping to 107;
110. updating a task latency threshold for vehicle i
According to->
Determining the amount of completed tasks for vehicle i
Let->
If d i > 0, jump to 102, otherwise jump to 111;
111. the algorithm ends.
Further, the kth period duration τ of the vehicle i in the step 102 i,k The calculation method of (2) is shown in the formula (1):
in formula (1), τ 0 Representing the minimum unload period, gamma and eta are constants, v i Indicating the current speed of the vehicle i.
Further, in the step 103, the vehicle i and the cooperative vehicle i' can continuously communicate for a time t i,i′ The calculation method of (2) is shown in the formula:
in the formula (2), R V2V Indicating the communicable range between vehicles, l i,i′ Representing the distance between vehicle i and vehicle i', v i′ Representing the current speed of the vehicle i'.
Further, the step 104 normalizes the sustainable communication time t i ′ ,i′ And normalizing the computing resource f i The calculation method of "is shown in the following formula (3) and formula (4):
further, the comprehensive screening index e of the vehicle i' in the step 104 i The calculation method of "is shown in the formula (5):
e′ i′ ＝α·t′ i,i′ +β·f′ i′ (5)
in the formula (5), α and β represent weight factors.
Further, in the step 106, the task amount of the cooperative unloading of the cooperative vehicle i' is calculated
The calculation method of (2) is shown in the formula (6):
in the formula (6), f i′ Representing available computing resources of the cooperative vehicle i', r i Representing the transmission rate of vehicle i, c i Representing task computational complexity.
Further, the task amount of the vehicle i is completed in the step 110
The calculation method of (2) is shown in the formula (7):
the invention has the advantages and beneficial effects as follows:
the existing research on V2V cooperative unloading mainly aims at stationary vehicles or uniform-speed driving vehicle scenes, and a single unloading destination is generally adopted for task scheduling, so that the problem of multi-vehicle cooperative unloading under the condition of non-uniform-speed driving is not considered. Non-uniform movement of the vehicle may cause dynamic unordered changes in network topology and resource status, resulting in reduced network resource utilization and task scheduling failure, thereby resulting in degradation of task completion delay and completion rate index. Aiming at the problems, a non-uniform vehicle task unloading method based on V2V cooperation is provided. According to the method, available cooperative vehicles in a reasonable communication range are searched according to the real-time speed of the vehicles and the position relation among the vehicles, a workshop cooperative unloading model based on dynamic periodic scheduling is constructed, and the unloading period and task scheduling among the cooperative vehicles are planned in real time, so that the network resource utilization rate and the task completion rate are improved, and the task unloading time delay is reduced.
Drawings
FIG. 1 is a flow chart of a non-uniform vehicle task offloading method based on V2V collaboration in accordance with a preferred embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and specifically described below with reference to the drawings in the embodiments of the present invention. The described embodiments are only a few embodiments of the present invention.
The technical scheme for solving the technical problems is as follows:
the concepts and models to which this disclosure relates are as follows.
1. Network model
The road vehicle set is denoted as I (I epsilon I), and each vehicle is provided with a corresponding vehicle-mounted unit OBU to provide task unloading service, and the vehicles are subjected to task unloading in a V2V mode.
2. Other symbols related to the present invention are described below.
v i : speed of vehicle at present moment
τ i,k : unloading period at current time
d i : task data size
c i : task computational complexity
t i,i′ : sustainable communication time between vehicle i' and vehicle i
f i′ : available computing resources of vehicle i
t i ′ ,i′ : normalized sustainable communication time of vehicle i' to vehicle i
f i "C: normalization of the vehicle i' may provide the computing resource f i′
e i "C: comprehensive screening index of vehicle i
R V2V : communication range between vehicles
τ 0 : minimum unloading period
Gamma, eta: period adjustment factor
Alpha, beta: weighting factor
l i,i′ : distance of vehicle i from cooperative vehicle i
n: collaborative vehicle aggregate size
The technical scheme of the invention is described as follows.
1. The kth cycle duration τ of vehicle i i,k
The calculation method is shown in the formula (1):
in formula (1), τ 0 Representing the minimum unload period, gamma and eta are constants, v i Indicating the current speed of the vehicle i.
2. Sustainable communication time t of vehicle i and cooperative vehicle i i,i′
The calculation method is shown in the formula (2):
in the formula (2), R V2V Indicating the communicable range between vehicles, l i,i′ Representing the distance between vehicle i and vehicle i', v i′ Representing the current speed of the vehicle i'.
3. Normalizing sustainable communication time t' i,i′ And normalizing the computing resource f' i′
The calculation method is shown in the formula (3) and the formula (4):
4. comprehensive screening index e 'of vehicle i' i′
The calculation method is shown in the formula (5):
e′ i′ ＝α·t′ i,i′ +β·f′ i′ (5)
in the formula (5), α and β represent weight factors.
5. Cooperable task load off-load of vehicle i
The calculation method is shown in the formula (6):
in the formula (6), f i′ Representing available computing resources of the cooperative vehicle i', r i Representing the transmission rate of vehicle i, c i Representing task computational complexity.
6. Quantity of completed tasks for vehicle i
The calculation method is shown in the formula (7):
a non-uniform vehicle task unloading method based on V2V cooperation comprises the following steps.
Step 1: vehicle i initiates a task offloading request Z i Acquiring task data amount d i Task computational complexity c i Task delay threshold
Initializing the amount of completed tasks of the vehicle +.>
The cycle number k=0, and the system time t=0;
step 2: let k=k+1, according to the real-time speed v of the vehicle i i Calculate the kth period time tau i,k ；
Step 3: establishing a temporary set I temp For each non-mission-carrying vehicle i' within the communicable range of vehicle i, a speed v is determined i′ Relative distance l to vehicle i i,i′ Calculating sustainable communication time t i,i′ Will t i,i′ ≥τ i,k Is put into I temp Enabling the cooperative vehicle task to complete identification
Step 4: for set I temp Normalizing its sustainable communication time t with vehicle i 'for each vehicle i' in (a) i,i′ And can provide computing resource f i′ And according to the normalized sustainable communication time t i ′ ,i′ And normalizing the computing resource f i "calculate its comprehensive screening index e' i′ ；
Step 5: will set I temp All vehicles in (2) are according to e' i′ The first n vehicles are put into a set I' of the collaborative vehicles, and the set I is deleted temp ；
Step 6: for each vehicle I 'in the set I', a computing resource f may be provided according to the vehicle I i′ And the transmission rate r of the vehicle i i Calculating the amount of the task to be cooperatively offloaded in the kth period of the vehicle i
Performing task scheduling and offloading;
step 7: if it is
Step 8, if not, step 10 is skipped;
step 8: if it is
Jump to step 9, otherwise let ∈ ->
Jump to step 10;
step 9: for each cooperative vehicle I 'in I', if the cooperative task is completed
And returns the result, let
Releasing collaborative vehicle computing resource f i′ Deleting I 'from the set I', jumping to the step 7, otherwise jumping to the step 7;
step 10: updating a task latency threshold for vehicle i
According to->
Determining the amount of tasks completed for vehicle i>
Let->
If d i Jump to step 2 > 0, otherwise jump to step 11;
step 11: the algorithm ends.
The system, apparatus, module or unit set forth in the above embodiments may be implemented in particular by a computer chip or entity, or by a product having a certain function. One typical implementation is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.
The above examples should be understood as illustrative only and not limiting the scope of the invention. Various changes and modifications to the present invention may be made by one skilled in the art after reading the teachings herein, and such equivalent changes and modifications are intended to fall within the scope of the invention as defined in the appended claims.
Claims (7)
1. A non-uniform vehicle task unloading method based on V2V cooperation, a road vehicle set is expressed as I (I E I), each vehicle is configured with a corresponding vehicle-mounted unit OBU to provide task unloading service, the method is characterized in that a dynamic periodic scheduling mode is adopted to carry out task unloading, and the method specifically comprises the following steps:
101. vehicle i initiates a task offloading request Z i Acquiring task data amount d i Task computational complexity c i Task delay threshold
Initializing the amount of completed tasks of the vehicle +.>
The cycle number k=0, and the system time t=0;
102. let k=k+1, according to the real-time speed v of the vehicle i i Calculate the kth period time tau i,k ；
103. Establishing a temporary set I temp For each non-mission-carrying vehicle i' within the communicable range of vehicle i, a speed v is determined i′ Relative distance l to vehicle i i,i′ Calculating sustainable communication time t i,i′ Will t i,i′ ≥τ i,k Is put into I temp Enabling the cooperative vehicle task to complete identification
104. For set I temp Normalizing its sustainable communication time t with vehicle i 'for each vehicle i' in (a) i,i′ And can provide computing resource f i′ And according to the normalized sustainable communication time t i ′ ,i′ And normalizing the computing resource f i "calculate its comprehensive screening index e i ″；
105. Will set I temp E for all vehicles in (2) i "size is arranged in descending order, and the first n vehicles are put inAmong the set of collaborative vehicles I', the set I is deleted temp ；
106. For each vehicle I 'in the set I', a computing resource f may be provided according to the vehicle I i′ And the transmission rate r of the vehicle i i Calculating the amount of the task to be cooperatively offloaded in the kth period of the vehicle i
Performing task scheduling and offloading;
107. if it is
Jump to 108, otherwise jump to 110;
108. if it is
Jump to 109, otherwise let ∈ ->
Jump to 110;
109. for each cooperative vehicle I 'in I', if the cooperative task is completed
Is to let ∈K and return the result>
Releasing collaborative vehicle computing resource f i′ Deleting I 'from the set I', jumping to 107, otherwise jumping to 107;
110. updating a task latency threshold for vehicle i
According to->
Determining the amount of tasks completed for vehicle i>
Order the
If d i > 0, jump to 102, otherwise jump to 111;
111. the algorithm ends.
2. The non-uniform vehicle task offloading method according to claim 1, wherein the kth cycle duration τ of the vehicle i in the step 102 i,k The calculation method of (2) is shown in the formula (1):
in formula (1), τ 0 Representing the minimum unload period, gamma and eta are constants, v i Indicating the current speed of the vehicle i.
3. The non-uniform vehicle task offloading method according to claim 1, wherein in step 103, the vehicle i and the cooperative vehicle i' can communicate continuously for a time t i,i′ The calculation method of (2) is shown in the formula:
in the formula (2), R V2V Indicating the communicable range between vehicles, l i,i′ Representing the distance between vehicle i and vehicle i', v i′ Representing the current speed of the vehicle i'.
4. The V2V collaboration-based non-uniform vehicle mission offloading method of claim 1, wherein the normalizing the sustainable communication time t in step 104 i ′ ,i′ And normalizing the computing resource f i The calculation method of "is shown in the following formula (3) and formula (4):
5. the non-uniform vehicle task offloading method according to claim 1, wherein the comprehensive screening index e of the vehicle i' in the step 104 i The calculation method of "is shown in the formula (5):
e i ″＝α·t i ′ ,i′ +β·f i ″ (5)
in the formula (5), α and β represent weight factors.
6. The V2V collaboration-based non-uniform vehicle task offloading method of claim 1, wherein the step 106 includes the step of collaboratively offloading a task amount of the collaboration vehicle i'
The calculation method of (2) is shown in the formula (6):
in the formula (6), f i′ Representing available computing resources of the cooperative vehicle i', r i Representing the transmission rate of vehicle i, c i Representing task computational complexity.
7. The V2V collaboration-based non-uniform vehicle task offloading method of claim 1, wherein the step 110 is performed on the completed task volume of the vehicle i
The calculation method of (2) is shown in the formula (7):
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310140357.9A CN116193515A (en) | 2023-02-20 | 2023-02-20 | V2V cooperation-based non-uniform vehicle task unloading method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310140357.9A CN116193515A (en) | 2023-02-20 | 2023-02-20 | V2V cooperation-based non-uniform vehicle task unloading method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116193515A true CN116193515A (en) | 2023-05-30 |
Family
ID=86448277
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310140357.9A Pending CN116193515A (en) | 2023-02-20 | 2023-02-20 | V2V cooperation-based non-uniform vehicle task unloading method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116193515A (en) |
-
2023
- 2023-02-20 CN CN202310140357.9A patent/CN116193515A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11176822B2 (en) | Network computer system to evaluate an operator of a freight vehicle | |
| CN112714178B (en) | Task unloading method and device based on vehicle-mounted edge calculation | |
| CN112887905B (en) | Task unloading method based on periodic resource scheduling in Internet of vehicles | |
| CN112888021B (en) | Task unloading method for avoiding interruption in Internet of vehicles | |
| CN107257379A (en) | Method and apparatus for pushed information | |
| CN109919713B (en) | Order pushing method and device and readable storage medium | |
| CN112559078B (en) | Method and system for hierarchically unloading tasks of mobile edge computing server | |
| CN113692052A (en) | Network edge machine learning training method | |
| CN116193515A (en) | V2V cooperation-based non-uniform vehicle task unloading method | |
| CN108770014B (en) | Calculation evaluation method, system and device of network server and readable storage medium | |
| CN115185658A (en) | Task unloading scheduling method based on time and communication reliability and related product | |
| CN113449895A (en) | Vehicle dispatching method and device | |
| CN115146478A (en) | Running condition construction method and device based on optimization algorithm and related equipment | |
| CN111507753A (en) | Information pushing method and device and electronic equipment | |
| CN116321295A (en) | Vehicle edge cooperative unloading method in non-uniform vehicle edge network | |
| WO2022118520A1 (en) | Radio-wave-map providing device, radio-wave-map providing method, and radio-wave-map providing program | |
| CN111144602A (en) | Vehicle scheduling method and device | |
| CN117808653B (en) | Data analysis method based on Internet of vehicles, terminal equipment and storage medium | |
| CN114390624A (en) | Non-uniform speed vehicle task unloading method for solving cell switching problem | |
| CN116112976B (en) | Equipment calculation migration method, device, equipment and storage medium | |
| US11195508B2 (en) | Information processing device, information processing method, and program for generating synthesized audio content from text when audio content is not reproducible | |
| CN117768919A (en) | SFC-based complex road condition vehicle network task unloading method | |
| CN115243220A (en) | Partial task unloading and resource allocation algorithm based on LSTM-DDPG | |
| CN116367229A (en) | Edge network computing resource dynamic optimization method based on multi-unmanned aerial vehicle cooperation | |
| JP2021135100A (en) | Information processing device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |