Defense scheme against advanced persistent threats in mobile fog computing security

Document Type

Journal Article

Publication Title

Computer Networks

Volume

221

Publisher

Elsevier

School

School of Engineering

RAS ID

55046

Funders

Beijing Natural Science Foundation, PR China China Ministry of Education - China Mobile Scientific Research Foundation Deanship of Scientific Research at King Khalid University, Kingdom of Saudi Arabia

Comments

Waqas, M., Tu, S., Wan, J., Mir, T., Alasmary, H., & Abbas, G. (2023). Defense scheme against advanced persistent threats in mobile fog computing security. Computer Networks, 221, article 109519. https://doi.org/10.1016/j.comnet.2022.109519

Abstract

In mobile fog computing (MFC), data processing and applications are concentrated in devices at the network's edge. This means that data can be processed in local intelligent devices without being sent to the cloud for execution, bringing great convenience to end-users. Fog computing is a semi-virtualised service computing architecture model between cloud computing and personal computing. However, its virtualized environment is vulnerable to advanced persistent threats (APT). In this paper, we propose an APT defense scheme based on MFC's Double Q-learning (DQL) algorithm. First, we apply prospect theory (PT) to build a static subjective game model between APT attackers and legitimate users. In addition, a dynamic game scheme based on DQL is proposed against APT attacks. Finally, we compare our proposed method with the existing methods, i.e., the Q-learning algorithm, Sarsa algorithm and Greedy algorithm. The experimental results show that the proposed method can effectively suppress the attack motivation of APT attackers, improve the utility of legitimate users, and protect the security of the fog computing environment.

DOI

10.1016/j.comnet.2022.109519

Access Rights

subscription content

Link to Full Text

Share

 
COinS