Adaptive Computation Offloading with Task Scheduling Minimizing Reallocation in VANETs
- 문서 유형
- 연구출판물 · 학술지 논문
- 등재
- SCIEScopus
- 저널 순위
- JCR Q3Scopus Q2
- 저널
- ELECTRONICS11(7) · #1106 · 2022
- 피인용
- Web of Science 2Scopus 4
- FWCI (Scopus)
- 0.26
- JCR IF
- JCR 2021 2.69
- ISSN
- 2079-9292
저자
- Gong, Minyeong제1저자Univ Seoul, Dept Elect & Comp Engn, Seoul 02504, South Korea
- 유영환Pusan Natl Univ, Sch Comp Engn & Sci, Busan 46241, South Korea
- Ahn, Sanghyun교신저자Univ Seoul, Dept Comp Sci & Engn, Seoul 02504, South Korea
초록
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.
키워드
computation offloadingdirected acyclic graphtask schedulingvehicular ad hoc networkEDGE
식별자
- Scopus EID
- 2-s2.0-85127433302
- WoS UID
- 000780649800001



로그인
연구물 목록으로