TY - JOUR
T1 - Satisfaction-Maximized Secure Computation Offloading in Multi-Eavesdropper MEC Networks
AU - Liu, Shumei
AU - Guo, Lei
AU - Yeoh, Philip Lee
AU - Vucetic, Branca
AU - Li, Yonghui
AU - Duong, Trung Q.
PY - 2021/11/23
Y1 - 2021/11/23
N2 - In this paper, we consider a mobile edge computing(MEC)-based secure computation offloading system, and design a practical multi-eavesdropper model including two specific scenarios of non-colluding and colluding eavesdropping. Furthermore, we design a requirement satisfaction model by exploring practical variations in user request patterns for security provisioning, delay reduction and energy saving. Based on these, we propose a satisfaction-maximized secure computation offloading (SMaxSCO) scheme, and then formulate an optimization problem aiming at maximizing users’ requirement satisfactions subject to secrecy offloading rate, tolerable delay, task workload and maximum power constraints. Since the optimization problem is nonconvex, we present an efficient successive convex approximation (SCA)-based algorithm to obtain suboptimal solutions. We demonstrate that the proposed SMax-SCO scheme achieves a significant improvement in security performance and requirement satisfaction compared with existing schemes. Moreover, we conclude that SMax-SCO can resist eavesdropping attacks of multiple eavesdroppers and even colluding eavesdroppers.
AB - In this paper, we consider a mobile edge computing(MEC)-based secure computation offloading system, and design a practical multi-eavesdropper model including two specific scenarios of non-colluding and colluding eavesdropping. Furthermore, we design a requirement satisfaction model by exploring practical variations in user request patterns for security provisioning, delay reduction and energy saving. Based on these, we propose a satisfaction-maximized secure computation offloading (SMaxSCO) scheme, and then formulate an optimization problem aiming at maximizing users’ requirement satisfactions subject to secrecy offloading rate, tolerable delay, task workload and maximum power constraints. Since the optimization problem is nonconvex, we present an efficient successive convex approximation (SCA)-based algorithm to obtain suboptimal solutions. We demonstrate that the proposed SMax-SCO scheme achieves a significant improvement in security performance and requirement satisfaction compared with existing schemes. Moreover, we conclude that SMax-SCO can resist eavesdropping attacks of multiple eavesdroppers and even colluding eavesdroppers.
U2 - 10.1109/TWC.2021.3128247
DO - 10.1109/TWC.2021.3128247
M3 - Article
SN - 1536-1276
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
ER -