TY - JOUR
T1 - A Secure Content Caching Scheme for Disaster Backup in Fog Computing Enabled Mobile Social Networks
AU - Su, Zhou
AU - Xu, Qichao
AU - Luo, Jun
AU - Pu, Huayan
AU - Peng, Yan
AU - Lu, Rongxing
N1 - Publisher Copyright:
© 2005-2012 IEEE.
PY - 2018/10
Y1 - 2018/10
N2 - Caching content with fog computing at the edge nodes has been a promising alternative to mitigate burdens of backbone networks and improve mobile users' quality of experience in mobile social networks (MSNs). However, as edge node may be vulnerable due to the attacks from malicious users, the design of secure caching schemes for the fog/edge enabled MSNs becomes a new challenge. In this paper, to tackle the above problem, we propose a secure caching scheme for disaster backup in MSNs with fog computing. Specifically, to protect the privacy, a partitioning and scrambling method is first designed to encrypt the contents. Then, the encrypted contents are replicated to multiple replicates, where these replicates are delivered and stored in different servers. Based on the recovery time objective and content delivery latency, an auction game model is developed to determine the optimal servers, where both edge nodes and cloud servers can obtain the maximum utilities. Extensive simulations are conducted to show the effectiveness and reliability of the proposed scheme.
AB - Caching content with fog computing at the edge nodes has been a promising alternative to mitigate burdens of backbone networks and improve mobile users' quality of experience in mobile social networks (MSNs). However, as edge node may be vulnerable due to the attacks from malicious users, the design of secure caching schemes for the fog/edge enabled MSNs becomes a new challenge. In this paper, to tackle the above problem, we propose a secure caching scheme for disaster backup in MSNs with fog computing. Specifically, to protect the privacy, a partitioning and scrambling method is first designed to encrypt the contents. Then, the encrypted contents are replicated to multiple replicates, where these replicates are delivered and stored in different servers. Based on the recovery time objective and content delivery latency, an auction game model is developed to determine the optimal servers, where both edge nodes and cloud servers can obtain the maximum utilities. Extensive simulations are conducted to show the effectiveness and reliability of the proposed scheme.
KW - Cloud server
KW - content caching
KW - disaster backup
KW - mobile social networks (MSNs)
UR - https://www.scopus.com/pages/publications/85049103065
U2 - 10.1109/TII.2018.2849984
DO - 10.1109/TII.2018.2849984
M3 - 文章
AN - SCOPUS:85049103065
SN - 1551-3203
VL - 14
SP - 4579
EP - 4589
JO - IEEE Transactions on Industrial Informatics
JF - IEEE Transactions on Industrial Informatics
IS - 10
M1 - 8395067
ER -