2017
DOI: 10.1109/tvt.2017.2714704
|View full text |Cite
|
Sign up to set email alerts
|

AVE: Autonomous Vehicular Edge Computing Framework with ACO-Based Scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
141
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 300 publications
(141 citation statements)
references
References 32 publications
0
141
0
Order By: Relevance
“…An alternative method is to make task offloading decisions by the task generators in a distributed manner. An autonomous vehicular edge framework which enables V-V and V-I offloading is proposed in [23], followed by a task scheduling algorithm based on ant colony optimization. However, when the number of vehicles is large, the computational complexity can be quite high.…”
Section: B Task Offloading Algorithmsmentioning
confidence: 99%
“…An alternative method is to make task offloading decisions by the task generators in a distributed manner. An autonomous vehicular edge framework which enables V-V and V-I offloading is proposed in [23], followed by a task scheduling algorithm based on ant colony optimization. However, when the number of vehicles is large, the computational complexity can be quite high.…”
Section: B Task Offloading Algorithmsmentioning
confidence: 99%
“…Task offloading decisions can also be made by each client node independently in a distributed manner, corresponding to the vehicle-vehicle offloading mode. Feng et al [12] proposed a distributed VeFN architecture, where RSUs and vehicles can offload tasks to their neighboring nodes based on their distributed decisions. They designed a task offloading algorithm based on ant colony optimization, in order to maximize the sum utility of offloaded tasks related to delay, and evaluate it in a system level simulator using real traces.…”
Section: B State-of-the-art On Computing In Vehicular Networkmentioning
confidence: 99%
“…They designed a task offloading algorithm based on ant colony optimization, in order to maximize the sum utility of offloaded tasks related to delay, and evaluate it in a system level simulator using real traces. However, the RSUs and vehicles are treated equally in [12], while in real systems, RSUs often know more about the network conditions, which should be more effectively exploited.…”
Section: B State-of-the-art On Computing In Vehicular Networkmentioning
confidence: 99%
“…However, the centralized control requires large signaling overheads for vehicular states update, and the proposed algorithm has high complexity. A distributed task offloading algorithm is proposed in [14] based on ant colony optimization, which is of much lower complexity. However, it still requires exchanges of vehicular states.…”
Section: Introductionmentioning
confidence: 99%