Evaluation of a Two-Way Tree-Based Fog Computing (TWTBFC) Model

Abstract

In our previous studies, the TBFC (Tree-Based Fog Computing) model is proposed to reduce the electric energy consumed by fog nodes and servers in the fog computing model. Here, fog nodes are hierarchically structured in a height-balanced tree. A root node shows a cloud of servers and leaf nodes are edge nodes which collect data from sensors and send actions to actuators. Each node receives data from child nodes and sends the processed data to a parent node. Finally, servers receive sensor data processed by fog nodes and send actions to actuators. Thus, sensor data is sent up to a root node from sensors and action are sent down to actuators from the root node. In order to more promptly deliver actions to actuators, the TWTBFC (Two-Way TBFC) model is proposed where nodes send processed data not only to a parent node but also to each child node. Thus, each node can get more global data obtained by processing data from every sibling node. The node can make a decision on actions to be done by descendant nodes. On the other hand, more amount of data is transmitted in networks and processed by a fog node. In this paper, we discuss how to reduce the processing load of each node in the TWTBFC model.