Research Area:  Fog Computing
In this paper, we consider the problem of task offloading in a software-defined access network, where IoT devices are connected to fog computing nodes by multi-hop IoT access-points (APs). The proposed scheme considers the following aspects in a fog-computing-based IoT architecture: 1) optimal decision on local or remote task computation; 2) optimal fog node selection; and 3) optimal path selection for offloading. Accordingly, we formulate the multi-hop task offloading problem as an integer linear program (ILP). Since the feasible set is non-convex, we propose a greedy-heuristic-based approach to efficiently solve the problem. The greedy solution takes into account delay, energy consumption, multi-hop paths, and dynamic network conditions, such as link utilization and SDN rule-capacity. Experimental results show that the proposed scheme is capable of reducing the average delay and energy consumption by 12% and 21%, respectively, compared with the state of the art.
Keywords:  
Author(s) Name:  Sudip Misra; Niloy Saha
Journal name:  IEEE Journal on Selected Areas in Communications
Conferrence name:  
Publisher name:  IEEE
DOI:   10.1109/JSAC.2019.2906793
Volume Information:  Volume: 37, Issue: 5, May 2019, Page(s): 1159 - 1166
Paper Link:   https://ieeexplore.ieee.org/abstract/document/8672614