CN114390624A - Non-uniform speed vehicle task unloading method for solving cell switching problem - Google Patents

Non-uniform speed vehicle task unloading method for solving cell switching problem Download PDF

Info

Publication number
CN114390624A
CN114390624A CN202210081356.7A CN202210081356A CN114390624A CN 114390624 A CN114390624 A CN 114390624A CN 202210081356 A CN202210081356 A CN 202210081356A CN 114390624 A CN114390624 A CN 114390624A
Authority
CN
China
Prior art keywords
task
vehicle
cell
unloading
period
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.)
Granted
Application number
CN202210081356.7A
Other languages
Chinese (zh)
Other versions
CN114390624B (en
Inventor
鲍宁海
岳渤涵
崔丽平
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN202210081356.7A priority Critical patent/CN114390624B/en
Publication of CN114390624A publication Critical patent/CN114390624A/en
Application granted granted Critical
Publication of CN114390624B publication Critical patent/CN114390624B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/24—Reselection being triggered by specific parameters
    • H04W36/30—Reselection being triggered by specific parameters by measured or perceived connection quality data
    • 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/09—Management thereof
    • H04W28/0958—Management thereof based on metrics or performance parameters
    • H04W28/0967—Quality of Service [QoS] parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/24—Reselection being triggered by specific parameters
    • H04W36/32—Reselection being triggered by specific parameters by location or mobility data, e.g. speed data
    • 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]
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Train Traffic Observation, Control, And Security (AREA)

Abstract

The invention discloses a non-uniform speed vehicle task unloading method for solving the problem of cell switching, belonging to the technical field of communication. Aiming at the problems of interruption and loss of an unloading task caused by uncertainty of switching time and position of a vehicle user between cells, a mixed-mode task unloading method based on dynamic period segmentation is provided. The method selects proper unloading modes for the task vehicles in the overlapped coverage area according to the real-time speed and position information of the vehicles in the adjacent cells. By selecting the effective cooperative vehicles, the unloading mode of V2V2I is adopted to avoid the interruption of the unloading task caused by random switching, and the unloading period is compressed, and the unloading mode of V2I is adopted to minimize the loss of the unloading task, so that the task unloading delay of vehicle users during the cell switching period is effectively reduced.

Description

Non-uniform speed vehicle task unloading method for solving cell switching problem
Technical Field
The invention belongs to the technical field of communication. In particular to a non-uniform speed vehicle task unloading method for solving the problem of cell switching.
Background
The intelligent transportation system based on the internet of vehicles can provide rich application services for drivers, including traffic supervision, automatic driving, real-time navigation and the like. These applications can reduce the occurrence of traffic jams and accidents, thereby improving traffic efficiency and driving comfort of people. However, such applications have stringent requirements on response time and require the consumption of significant computational resources. The vehicle-mounted device itself is difficult to meet the computing requirements of these applications due to resource limitations. Although the traditional cloud computing can provide sufficient computing resources for vehicle users and shorten computing time, the deployment position of the traditional cloud computing is usually far away from user terminals, so that larger propagation and transmission delay overhead is caused. The mobile edge computing greatly shortens the distance between a user and computing resources by deploying the edge server at the user access side, thereby effectively reducing the time delay overhead of task unloading.
Currently, research on vehicle moving edge calculation only focuses on task unloading when a vehicle runs at a constant speed in a cell, and does not consider uncertainty of switching time and position between cells caused by non-constant speed running of the vehicle and environmental influence on signal strength in a real scene, so that when a vehicle user performs cell switching, an unloading result of a previous cell cannot be returned in time, an unloading task is interrupted or lost, and user service quality is deteriorated.
Aiming at the problem, a mixed-mode task unloading method based on dynamic period segmentation is provided, so that the task interruption and loss of a vehicle user during cell switching are minimized, and the task unloading delay is effectively reduced.
Disclosure of Invention
The present invention is directed to solving the above problems of the prior art. A non-uniform speed vehicle task unloading method for solving the problem of cell switching is provided. The technical scheme of the invention is as follows:
a non-uniform speed vehicle task unloading method for solving the problem of cell switching comprises the following steps:
101. initializing the task size s according to the task request of the vehicle j in the overlapping area of the cell i and the i +1jTime delay constraint
Figure BDA0003486174160000021
Amount of completed task
Figure BDA0003486174160000022
Number of cycles k equals 1, unload mode decision variable θ j,k0, binary variable
Figure BDA0003486174160000023
xj＝0；
102. Establishing a set J' of available cooperating communicating vehicles associated with cell i +1, if
Figure BDA0003486174160000024
Selecting the V2I task unload mode to make thetaj,kIf 1, go to step 103, otherwise, select the task unload mode of V2I and let θ bej,kAnd (5) selecting a cooperative vehicle J 'from the J' according to the shortest distance priority principle, and updating the current speed v of the task request vehicle JjAnd the distance l between j and jj,j′Effective communication distance R according to V2VV2VCalculating V2V Link duration
Figure BDA0003486174160000025
Skipping to step 103;
103. decision variable theta based on unload modej,kVehicle speed vjAnd V2V link duration
Figure BDA0003486174160000026
Calculating the current unload period tauj,kIf theta is greater than theta j,k1, allocating server resources for vehicle j in cell i
Figure BDA0003486174160000027
Skipping to step 104, otherwise, allocating server resources for the vehicle j in the cell i +1
Figure BDA0003486174160000028
Jumping to step 104;
104. decision variable theta based on unload modej,kUnloading period tauj,kAnd a distributed garmentServer resources
Figure BDA0003486174160000029
Or
Figure BDA00034861741600000210
Calculating the task unloading amount s of the current periodj,kExecuting task unloading;
105. if the unloading result of the period k is not returned, jumping to the step 106, otherwise, making
Figure BDA00034861741600000211
Jump to step 109;
106. if the period k is not over, jump to step 107, otherwise, order
Figure BDA00034861741600000212
Jump to step 109;
107. if vehicle j is switched from cell i to cell i +1, let xjIf 1, jumping to step 108, otherwise, jumping to step 105;
108. if theta is greater than thetaj,kGo to step 105 if 0, otherwise, order the program
Figure BDA00034861741600000213
Jump to step 109;
109. if theta is greater than thetaj,kReleasing server resources for cell i as 1
Figure BDA00034861741600000214
Otherwise, releasing the server resource of the cell i +1
Figure BDA00034861741600000215
110. Order to
Figure BDA00034861741600000216
If it is not
Figure BDA00034861741600000217
And xjJump 0 ═ 0Step 102, otherwise, jumping to step 111;
111. the algorithm ends.
Further, the duration of the V2V link in step 102
Figure BDA0003486174160000031
The calculation method is shown in formula (1):
Figure BDA0003486174160000032
in the formula (1), vmaxIndicates the maximum vehicle speed, vminIndicating a minimum vehicle speed.
Further, the V2I task unloading mode and the V2I task unloading mode in the step 102 are respectively defined as follows:
the V2I task offloading mode refers to the task requesting vehicle offloading the task to the current cell edge server for execution, and the V2I task offloading mode refers to the task requesting vehicle offloading the task to the next cell edge server for execution by the cooperating vehicle.
Further, the current unloading period τ in step 103j,kThe calculation method of (2) is shown in formula (2):
Figure BDA0003486174160000033
in the formula (2), the variable α ∈ (0, 10)]，β∈(0,1]For adjusting the current vehicle speed vjAnd unload period τj,kThe relationship of (c), τ0Is the minimum unload period.
Further, the server computing resource is allocated in step 103
Figure BDA0003486174160000034
The calculation method of (2) is shown in formula (3):
Figure BDA0003486174160000035
in the formula (3), FiRepresenting the total computing resources of the cell i server, fiIndicating cell i server remaining available resources, NiIndicates the number of vehicles staying in cell i,
Figure BDA0003486174160000036
indicating the time that has been spent performing the task.
Further, the task unloading amount s of the current cycle in the step 104j,kThe calculation method of (2) is shown in formula (4):
Figure BDA0003486174160000041
in the formula (4), rV2IRepresenting the V2I link transmission rate, r, between the vehicle and the RSUV2VIndicating the V2V link transmission rate, c, between vehiclesjRepresenting the task complexity.
The invention has the following advantages and beneficial effects:
the invention discloses a non-uniform speed vehicle task unloading method for solving the problem of cell switching. The existing related research usually only focuses on the task unloading problem when the vehicle runs at a constant speed in a cell, and does not consider the uncertainty of switching time and position between cells caused by the fact that the vehicle runs at a non-constant speed and the signal intensity is influenced by the environment in a real scene, so that the problem that the unloading task is interrupted or lost when a vehicle user switches the cells is difficult to avoid. According to the real-time speed and position information of vehicles in adjacent cells, the method selects proper unloading modes for task vehicles in overlapping coverage areas among the cells respectively. By selecting the effective cooperative vehicles, the unloading mode of V2V2I is adopted to avoid the interruption of the unloading task caused by random switching, and the unloading period is compressed, and the unloading mode of V2I is adopted to minimize the loss of the unloading task, so that the task unloading delay of vehicle users during the cell switching period is effectively reduced.
Drawings
Fig. 1 is a flow chart of a non-uniform velocity vehicle task offloading method for dealing with a cell handover problem according to a preferred embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be described in detail and clearly with reference to the accompanying drawings. The described embodiments are only some of the embodiments of the present invention.
The technical scheme for solving the technical problems is as follows:
the concepts and models involved in the present disclosure are as follows.
1. Network model
A plurality of roadside units (RSUs) are deployed on a road, and each RSU is provided with an edge server. The RSU coverage is the entire road in the current cell, and adjacent cells have overlapping coverage. The vehicle can communicate with the current cell RSU as well as with other vehicles within communication range.
2. Other symbols relating to the present invention are described below.
i: cell i
j: vehicle j
k: period k
sj: vehicle j task size
Figure BDA0003486174160000051
Vehicle j task delay constraints
cj: vehicle j task complexity
Figure BDA0003486174160000052
The amount of tasks that vehicle j has completed
θj,k: offload mode decision variables
Figure BDA0003486174160000053
Flag bit for judging whether it belongs to effective period
xj: flag bit for judging whether cell switching occurs
J': set of available collaborative communication vehicles
vj: current running speed of vehicle j
vmax: maximum speed of vehicle
vmin: minimum running speed of vehicle
RV2V: effective communication distance between vehicles
lj,j′: distance between vehicles j and j
Figure BDA0003486174160000054
V2V Link duration
τj,k: current unload cycle of vehicle j
Figure BDA0003486174160000061
Server computing resources allocated at cell i
fi: cell i server remaining available resources
Fi: cell i Server Total resources
Ni: number of vehicles staying in cell i
sj,k: number of tasks unloaded by vehicle j in cycle k
Figure BDA0003486174160000062
Time already spent performing the vehicle j task
rV2I: V2I Link Transmission Rate
rV2V: V2V Link Transmission Rate
The technical solution of the present invention is explained as follows.
1. V2V Link duration
Figure BDA0003486174160000063
The calculation method is shown in formula (1):
Figure BDA0003486174160000064
in the formula (1), vmaxIndicates the maximum vehicle speed, vminIndicating a minimum vehicle speed.
2. Current unload period τj,k
The calculation method is shown in formula (2):
Figure BDA0003486174160000065
in the formula (2), the variable α ∈ (0, 10)]，β∈(0,1]For adjusting the current vehicle speed vjAnd unload period τj,kThe relationship of (c), τ0Is the minimum unload period.
3. V2I task offload mode and V2V2I task offload mode definitions
The V2I task offloading mode refers to the task requesting vehicle offloading the task to the current cell edge server for execution, and the V2I task offloading mode refers to the task requesting vehicle offloading the task to the next cell edge server for execution by the cooperating vehicle.
4. Allocating server computing resources
Figure BDA0003486174160000071
The calculation method is shown in formula (3):
Figure BDA0003486174160000072
5. task unload amount s of current cyclej,k
The calculation method is shown in formula (4):
Figure BDA0003486174160000073
a non-uniform speed vehicle task unloading method for solving the problem of cell switching comprises the following steps.
Step 1: initializing s according to task requests of vehicles j in the overlapping area of the cell i and the i +1j，
Figure BDA0003486174160000074
k＝1，θj,k＝0，
Figure BDA0003486174160000075
xj＝0；
Step 2: establishing a set J' of available cooperating communicating vehicles associated with cell i +1, if
Figure BDA0003486174160000076
Selecting the V2I task unload mode to make thetaj,kAnd (4) jumping to the step 3, otherwise, selecting the task unloading mode of V2V2I and enabling theta to be theta j,k0, selecting a cooperative vehicle J 'from J' according to the shortest distance priority principle, and updating vj，lj,j′Is calculated according to the formula (1)
Figure BDA0003486174160000077
Jumping to the step 3;
and step 3: calculating τ according to equation (2)j,kIf theta is greater than thetaj,kAllocating server resources according to equation (3) as 1
Figure BDA0003486174160000078
Skipping to step 104, otherwise, allocating server resources according to formula (3)
Figure BDA0003486174160000079
Jumping to step 104;
and 4, step 4: calculating s according to equation (4)j,kExecuting task unloading;
and 5: if the unloading result of the period k is not returned, jumping to the step 6, otherwise, ordering
Figure BDA0003486174160000081
Skipping to step 9;
step 6: if the period k is not over, jumping to step 7, otherwise, ordering
Figure BDA0003486174160000082
Skipping to step 9;
and 7: if vehicle j is switched from cell i to cell i +1, let xjIf the value is 1, jumping to the step 8, otherwise, jumping to the step 5;
and 8: if theta is greater than thetaj,kIf not, go to step 5, otherwise, order
Figure BDA0003486174160000083
Skipping to step 9;
and step 9: if theta is greater than thetaj,kReleasing server resources when becoming 1
Figure BDA0003486174160000084
Otherwise, releasing the server resource
Figure BDA0003486174160000085
Step 10: order to
Figure BDA0003486174160000086
If it is not
Figure BDA0003486174160000087
And xjIf not, jumping to the step 2, otherwise, jumping to the step 11;
step 11: the algorithm ends.
The method illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. One typical implementation device is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smartphone, 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 an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The above examples are to be construed as merely illustrative and not limitative of the remainder of the disclosure. After reading the description of the invention, the skilled person can make various changes or modifications to the invention, and these equivalent changes and modifications also fall into the scope of the invention defined by the claims.

Claims (6)

1. A non-uniform speed vehicle task unloading method for solving the problem of cell switching is characterized by comprising the following steps:
101. initializing the task size s according to the task request of the vehicle j in the overlapping area of the cell i and the i +1jTime delay constraint
Figure FDA0003486174150000011
Amount of completed task
Figure FDA0003486174150000012
Number of cycles k equals 1, unload mode decision variable θj,k0, binary variable
Figure FDA0003486174150000013
xj＝0；
102. Establishing a set J' of available cooperating communicating vehicles associated with cell i +1, if
Figure FDA0003486174150000014
Selecting the V2I task unload mode to make thetaj,kIf 1, jump to step 103, otherwise, select the task unload mode V2I, and order itθj,kAnd (5) selecting a cooperative vehicle J 'from the J' according to the shortest distance priority principle, and updating the current speed v of the task request vehicle JjAnd the distance l between j and jj,j′Effective communication distance R according to V2VV2VCalculating V2V Link duration
Figure FDA0003486174150000015
Skipping to step 103;
103. decision variable theta based on unload modej,kVehicle speed vjAnd V2V link duration
Figure FDA0003486174150000016
Calculating the current unload period tauj,kIf theta is greater than thetaj,k1, allocating server resources for vehicle j in cell i
Figure FDA0003486174150000017
Skipping to step 104, otherwise, allocating server resources for the vehicle j in the cell i +1
Figure FDA0003486174150000018
Jumping to step 104;
104. decision variable theta based on unload modej,kUnloading period tauj,kAnd allocated server resources
Figure FDA0003486174150000019
Or
Figure FDA00034861741500000110
Calculating the task unloading amount s of the current periodj,kExecuting task unloading;
105. if the unloading result of the period k is not returned, jumping to the step 106, otherwise, making
Figure FDA00034861741500000111
Jump to step 109;
106. if the period k is not over, jump to step 107, otherwise, order
Figure FDA00034861741500000112
Jump to step 109;
107. if vehicle j is switched from cell i to cell i +1, let xjIf 1, jumping to step 108, otherwise, jumping to step 105;
108. if theta is greater than thetaj,kGo to step 105 if 0, otherwise, order the program
Figure FDA00034861741500000113
Jump to step 109;
109. if theta is greater than thetaj,kReleasing server resources for cell i as 1
Figure FDA00034861741500000114
Otherwise, releasing the server resource of the cell i +1
Figure FDA0003486174150000021
110. Order to
Figure FDA0003486174150000022
If it is not
Figure FDA0003486174150000023
And xjIf 0, jumping to step 102, otherwise, jumping to step 111;
111. the algorithm ends.
2. The method for off-uniform vehicle mission offloading for cell handover issue of claim 1, wherein duration of V2V link in step 102
Figure FDA0003486174150000024
The calculation method is shown in formula (1):
Figure FDA0003486174150000025
in the formula (1), vmaxIndicates the maximum vehicle speed, vminIndicating a minimum vehicle speed.
3. The method for offloading non-uniform vehicular tasks in response to the cell handover issue as claimed in claim 2, wherein the V2I task offloading mode and the V2I task offloading mode in step 102 are respectively defined as follows:
the V2I task offloading mode refers to the task requesting vehicle offloading the task to the current cell edge server for execution, and the V2I task offloading mode refers to the task requesting vehicle offloading the task to the next cell edge server for execution by the cooperating vehicle.
4. The method for offloading a non-uniform vehicle task in response to a cell handover issue as recited in claim 3, wherein the current offloading period τ is in step 103j,kThe calculation method of (2) is shown in formula (2):
Figure FDA0003486174150000026
in the formula (2), the variable α ∈ (0, 10)]，β∈(0,1]For adjusting the current vehicle speed vjAnd unload period τj,kThe relationship of (c), τ0Is the minimum unload period.
5. The method for off-loading non-uniform vehicle tasks to deal with cell switching problems as claimed in claim 4, wherein said step 103 allocates server computing resources
Figure FDA0003486174150000027
The calculation method of (2) is shown in formula (3):
Figure FDA0003486174150000028
in the formula (3), FiRepresenting the total computing resources of the cell i server, fiIndicating cell i server remaining available resources, NiIndicates the number of vehicles staying in cell i,
Figure FDA0003486174150000031
indicating the time that has been spent performing the task.
6. The method as claimed in claim 5, wherein the task unloading amount s of the current cycle in step 104 is the same as the task unloading amount s of the non-uniform velocity vehicle for solving the problem of cell switchingj,kThe calculation method of (2) is shown in formula (4):
Figure FDA0003486174150000032
in the formula (4), rV2IRepresenting the V2I link transmission rate, r, between the vehicle and the RSUV2VIndicating the V2V link transmission rate, c, between vehiclesjRepresenting the task complexity.
CN202210081356.7A 2022-01-24 2022-01-24 Non-uniform vehicle task unloading method for dealing with cell switching problem Active CN114390624B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210081356.7A CN114390624B (en) 2022-01-24 2022-01-24 Non-uniform vehicle task unloading method for dealing with cell switching problem

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210081356.7A CN114390624B (en) 2022-01-24 2022-01-24 Non-uniform vehicle task unloading method for dealing with cell switching problem

Publications (2)

Publication Number Publication Date
CN114390624A true CN114390624A (en) 2022-04-22
CN114390624B CN114390624B (en) 2023-05-30

Family

ID=81203141

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210081356.7A Active CN114390624B (en) 2022-01-24 2022-01-24 Non-uniform vehicle task unloading method for dealing with cell switching problem

Country Status (1)

Country Link
CN (1) CN114390624B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020101155A1 (en) * 2018-11-13 2020-05-22 ㈜유양디앤유 Method for supporting vehicle mobility in vlc network
CN112512013A (en) * 2020-11-27 2021-03-16 山东师范大学 Learning pruning-based vehicle networking mobile edge computing task unloading method and system
CN112888021A (en) * 2021-01-29 2021-06-01 重庆邮电大学 Task unloading method for avoiding interruption in Internet of vehicles
CN113891477A (en) * 2021-11-04 2022-01-04 重庆邮电大学 Resource allocation method based on MEC calculation task unloading in Internet of vehicles
US20220210686A1 (en) * 2020-07-15 2022-06-30 Nantong University Energy-efficient optimized computing offloading method for vehicular edge computing network and system thereof

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020101155A1 (en) * 2018-11-13 2020-05-22 ㈜유양디앤유 Method for supporting vehicle mobility in vlc network
US20220210686A1 (en) * 2020-07-15 2022-06-30 Nantong University Energy-efficient optimized computing offloading method for vehicular edge computing network and system thereof
CN112512013A (en) * 2020-11-27 2021-03-16 山东师范大学 Learning pruning-based vehicle networking mobile edge computing task unloading method and system
CN112888021A (en) * 2021-01-29 2021-06-01 重庆邮电大学 Task unloading method for avoiding interruption in Internet of vehicles
CN113891477A (en) * 2021-11-04 2022-01-04 重庆邮电大学 Resource allocation method based on MEC calculation task unloading in Internet of vehicles

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
WANYING HUANG; TIAN SONG; YATING YANG: "Cluster-Based Cooperative Caching With Mobility Prediction in Vehicular Named Data Networking", IEEE ACCESS *
岳渤涵: "基于VEC 的非匀速车辆任务卸载策略研究", CNKI *
张海波;栾秋季;朱江;李方伟;: "车辆异构网中基于移动边缘计算的任务卸载与资源分配", 物联网学报 *
张海波;程妍;刘开健;贺晓帆;: "车联网中整合移动边缘计算与内容分发网络的移动性管理策略", 电子与信息学报 *

Also Published As

Publication number Publication date
CN114390624B (en) 2023-05-30

Similar Documents

Publication Publication Date Title
CN111835827B (en) Internet of things edge computing task unloading method and system
Feng et al. AVE: Autonomous vehicular edge computing framework with ACO-based scheduling
Dai et al. A scheduling algorithm for autonomous driving tasks on mobile edge computing servers
CN108777852A (en) A kind of car networking content edge discharging method, mobile resources distribution system
EP3457664A1 (en) Method and system for finding a next edge cloud for a mobile user
Cha et al. Virtual edge: Exploring computation offloading in collaborative vehicular edge computing
CN113055487B (en) VMEC service network selection-based migration method
CN112887905B (en) Task unloading method based on periodic resource scheduling in Internet of vehicles
Wu et al. Load balance guaranteed vehicle-to-vehicle computation offloading for min-max fairness in VANETs
CN111240821B (en) Collaborative cloud computing migration method based on Internet of vehicles application security grading
CN113645273B (en) Internet of vehicles task unloading method based on service priority
CN112888021B (en) Task unloading method for avoiding interruption in Internet of vehicles
CN115297171A (en) Edge calculation unloading method and system for cellular Internet of vehicles hierarchical decision
CN115278648A (en) Service bearer switching method and device
CN115988462B (en) Debugging method of edge computing module based on vehicle-road cooperation
CN113596106A (en) Time delay sensitive type slice resource scheduling method based on multi-edge server cooperation
CN114390624B (en) Non-uniform vehicle task unloading method for dealing with cell switching problem
Yu et al. A situation enabled framework for energy-efficient workload offloading in 5G vehicular edge computing
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
Gong et al. Vehicular Cloud Forming and Task Scheduling for Energy-Efficient Cooperative Computing
Zhao et al. A research of task-offloading algorithm for distributed vehicles
CN114980127A (en) Calculation unloading method based on federal reinforcement learning in fog wireless access network
Pan et al. A Route Planning for Autonomous Vehicle in 5G and Edge Computing Environment
CN114513815A (en) Task unloading energy consumption optimization method for non-uniform speed vehicle users

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
GR01 Patent grant
GR01 Patent grant