TY - JOUR
T1 - Privacy-Aware Collaborative Task Offloading in Fog Computing
AU - Razaq, Mian Muaz
AU - Tak, Byungchul
AU - Peng, Limei
AU - Guizani, Mohsen
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2022/2/1
Y1 - 2022/2/1
N2 - Numerous new applications have been proliferated with the mature of 5G, which generates a large number of latency-sensitive and computationally intensive mobile data requests. The real-time requirement of these mobile data has been accommodated well by fog computing in the past few years, mainly through offloading tasks to fog nodes in the vicinity. On the other hand, the user-privacy hidden in the Internet-of-Things (IoT) data has not been sufficiently considered in the presence of insecure fog nodes. It is risky to offload an entire mission-critical task to just one fog node or several fog nodes owned by the same service provider (SP), especially when the SP is marked with low-security credit and tends to collect data information of users for malicious use. To address this issue, we classify IoT user tasks based on their security requirements, divide them into different numbers of smaller fragments, and, finally, offload the segments of a task to multiple fog nodes owned by the same or various SPs according to their security requirements. The selected fog nodes will collaboratively serve the divided fragments to avoid the possible damage caused by the leak of sensitive data due to compromised fog nodes of malicious SPs. For this, we propose an integer linear programming (ILP) model and a dynamic programming algorithm to maximize the number of successfully served IoT data tasks with satisfactory security requirements while minimizing the end-to-end transmission delay. The numerical results show that the proposed ILP model and algorithm can significantly increase the successful provisioning ratio for tasks with high-security requirements.
AB - Numerous new applications have been proliferated with the mature of 5G, which generates a large number of latency-sensitive and computationally intensive mobile data requests. The real-time requirement of these mobile data has been accommodated well by fog computing in the past few years, mainly through offloading tasks to fog nodes in the vicinity. On the other hand, the user-privacy hidden in the Internet-of-Things (IoT) data has not been sufficiently considered in the presence of insecure fog nodes. It is risky to offload an entire mission-critical task to just one fog node or several fog nodes owned by the same service provider (SP), especially when the SP is marked with low-security credit and tends to collect data information of users for malicious use. To address this issue, we classify IoT user tasks based on their security requirements, divide them into different numbers of smaller fragments, and, finally, offload the segments of a task to multiple fog nodes owned by the same or various SPs according to their security requirements. The selected fog nodes will collaboratively serve the divided fragments to avoid the possible damage caused by the leak of sensitive data due to compromised fog nodes of malicious SPs. For this, we propose an integer linear programming (ILP) model and a dynamic programming algorithm to maximize the number of successfully served IoT data tasks with satisfactory security requirements while minimizing the end-to-end transmission delay. The numerical results show that the proposed ILP model and algorithm can significantly increase the successful provisioning ratio for tasks with high-security requirements.
KW - Fog computing
KW - Internet of Things (IoT)
KW - user privacy
UR - http://www.scopus.com/inward/record.url?scp=85099732396&partnerID=8YFLogxK
U2 - 10.1109/TCSS.2020.3047382
DO - 10.1109/TCSS.2020.3047382
M3 - Article
AN - SCOPUS:85099732396
SN - 2329-924X
VL - 9
SP - 88
EP - 96
JO - IEEE Transactions on Computational Social Systems
JF - IEEE Transactions on Computational Social Systems
IS - 1
ER -