Adaptive Computation Offloading with Task Scheduling Minimizing Reallocation in VANETs
- Document Type
- Publications · Journal Article
- Registered DB
- SCIEScopus
- Journal Ranking
- JCR Q3Scopus Q2
- Journal
- ELECTRONICS11(7) · #1106 · 2022
- Citation
- Web of Science 2Scopus 4
- FWCI (Scopus)
- 0.26
- JCR IF
- JCR 2021 2.69
- ISSN
- 2079-9292
Authors
- Gong, MinyeongFirst authorUniv Seoul, Dept Elect & Comp Engn, Seoul 02504, South Korea
- Yoo, YounghwanPusan Natl Univ, Sch Comp Engn & Sci, Busan 46241, South Korea
- Ahn, SanghyunCorresponding authorUniv Seoul, Dept Comp Sci & Engn, Seoul 02504, South Korea
Abstract
Computation Offloading (CO) can accelerate application running through parallel processing. This paper proposes a method called vehicular adaptive offloading (VAO) in which vehicles in vehicular ad-hoc networks (VANETs) offload computationally intensive tasks to nearby vehicles by taking into account the dynamic topology change of VANETs. In CO, task scheduling has a huge impact on overall performance. After representing the precedence relationship between tasks with a directed acyclic graph (DAG), VAO in the CO requesting vehicle assigns tasks to neighbors so that it can minimize the probability of task reallocations caused by connection disruption between vehicles in VANETs. The simulation results showed that the proposed method decreases the number of reallocations by 45.4%, as compared with the well-known task scheduling algorithms HEFT and Max-Min. Accordingly, the schedule length of entire tasks belonging to one application is shortened by 14.4% on average.
Keywords
computation offloadingdirected acyclic graphtask schedulingvehicular ad hoc networkEDGE
Identifiers
- Scopus EID
- 2-s2.0-85127433302
- WoS UID
- 000780649800001



Login
Back to Publication list