Dynamic IoTFog Task Allocation using ManytoOne Shortest Path Algorithm In this paper, we consider a task allocation problem in an IoTfog environment. We need to allocate a task from the IoT device to any fog node that meets the tasku0027s need. A task allocation method must be suitable for the dynamic nature of the network and the fog node condition. Thus, this paper presents an online algorithm and uses the SoftwareDefined Network. It can serially handle task allocation and get a global network and fog node statistics. The network has many fog nodes with many possible paths, it is important to select an optimal combination of them. So, we formulate the allocation decision as a multisource singletarget shortest path problem on a weighted graph. We propose a joint fog nodelink utilization cost and a modified A* algorithm called the ManytoOne Shortest Path algorithm. Our method can give a fast and optimal result. It shows by the experiment result which the proposed method outperforms the previous works.

CostEfficient Resource Provision for Multiple Mobile Users in Fog Computing Fog computing is an emerging paradigm that brings the computing capabilities close to distributed IoT devices, which provides networking services between end devices and traditional cloud data centers. One important mission is to further reduce the monetary cost of fog resources while meeting the evergrowing demand of multiple users. In this paper, we focus on minimizing the total cost for multiple mobile users to provide an efficient resource provisioning scheme in fog computing. The total cost includes two aspects: the replication cost and the transmission cost. We consider two cases for the resource provision problem by focusing on different cost models. First, one simple case where users can only upload one replication is discussed, and an optimal solution is proposed by converting the original problem into one of bipartite graph matching. Then we consider a more complicated case that each user can upload multiple replications on fog nodes in the resource provisioning. For different transmission cost models, the transmission cost is related to the distance of each pair of fog nodes. This problem is proven to be NPhard. We first propose a nonadaptive algorithm which is proved to be bounded by 23W13OPT. Another 3eapproximation algorithm is proposed based on local search, which has better performance with higher complexity. Extensive simulations also prove the efficiency of our schemes.