Task offloading in mobile fog computing by classification and regression tree
Fog computing (FC) as an extension of cloud computing provides a lot of smart devices at the network edge, which can store and process data near end users. Because FC reduces latency and power consumption, it is suitable for the Internet of Things (IoT) applications as healthcare, vehicles, and smar...
Gespeichert in:
Veröffentlicht in: | Peer-to-peer networking and applications 2020, Vol.13 (1), p.104-122 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Fog computing (FC) as an extension of cloud computing provides a lot of smart devices at the network edge, which can store and process data near end users. Because FC reduces latency and power consumption, it is suitable for the Internet of Things (IoT) applications as healthcare, vehicles, and smart cities. In FC, the mobile devices (MDs) can offload their heavy tasks to fog devices (FDs). The selection of best FD for offloading has serious challenges in the time and energy. In this paper, we present a Module Placement method by Classification and regression tree Algorithm (MPCA). We select the best FDs for modules by MPCA. Initially, the power consumption of MDs are checked, if this value is greater than Wi-Fi’s power consumption, then offloading will be done. The MPCA’s decision parameters for selecting the best FD include authentication, confidentiality, integrity, availability, capacity, speed, and cost. To optimize MPCA, we analyze and apply the probability of network’s resource utilization in the module offloading. This method is called by (MPMCP). To evaluate our proposed approach, we simulate MPCA and MPMCP algorithms and compare them with First Fit (FF) and local mobile processing methods in Cloud, FDs, and MDs. The results include the power consumption, response time and performance show that the proposed methods are superior to other compared methods. |
---|---|
ISSN: | 1936-6442 1936-6450 |
DOI: | 10.1007/s12083-019-00721-7 |