TY - JOUR
T1 - Secure Mobile Edge Computing Networks in the Presence of Multiple Eavesdroppers
AU - Lai, Xiazhi
AU - Fan, Lisheng
AU - Lei, Xianfu
AU - Deng, Yansha
AU - Karagiannidis, George K.
AU - Nallanathan, Arumugam
N1 - Funding Information:
This work was supported in part by the NSFC (No. 6187113962101145), in part by the International Science and Technology Cooperation Projects of Guangdong Province (No. 2020A0505100060), in part by the Natural Science Foundation of Guangdong Province (No. 2021A1515011392), and in part by the research program of Guangzhou University (No. YK2020008YJ2021003). The work of Xianfu Lei was supported by the National Natural Science Foundation of China under Grant 61971360, the Fundamental Research Funds for the Central Universities under Grant XJ2021KJZK007, and the open research fund of National Mobile Communications Research Laboratory, Southeast University (No. 2021D05).
Publisher Copyright:
© 1972-2012 IEEE.
PY - 2022/1
Y1 - 2022/1
N2 - In this paper, we investigate a secure mobile edge computing (MEC) network in the presence of multiple eavesdroppers, where multiple users can offload parts of their tasks to the computational access point (CAP). The multiple eavesdroppers may overhear the confidential task offloading, which leads to information leakage. In order to address this issue, we present the minimization problem of the secrecy outage probability (SOP), by jointly taking into account the constraints from the latency and energy consumption. With the aim to improve the system secrecy performance, we then introduce three user selection criteria to choose the best user among multiple ones. Specifically, criterion I maximizes the locally computational capacity, while criterion II and III maximize the secrecy capacity and data rate of main links, respectively. For these criteria, we further analyze the system secrecy performance by deriving analytical and asymptotic expressions for the SOP, from which we can conclude important insights for the system design. Finally, simulation and analytical results are provided to verify the proposed analysis. The results show that the three criteria can efficiently safeguard the MEC networks, compared to the traditional local computing and fully offloading, especially with a large value of user number.
AB - In this paper, we investigate a secure mobile edge computing (MEC) network in the presence of multiple eavesdroppers, where multiple users can offload parts of their tasks to the computational access point (CAP). The multiple eavesdroppers may overhear the confidential task offloading, which leads to information leakage. In order to address this issue, we present the minimization problem of the secrecy outage probability (SOP), by jointly taking into account the constraints from the latency and energy consumption. With the aim to improve the system secrecy performance, we then introduce three user selection criteria to choose the best user among multiple ones. Specifically, criterion I maximizes the locally computational capacity, while criterion II and III maximize the secrecy capacity and data rate of main links, respectively. For these criteria, we further analyze the system secrecy performance by deriving analytical and asymptotic expressions for the SOP, from which we can conclude important insights for the system design. Finally, simulation and analytical results are provided to verify the proposed analysis. The results show that the three criteria can efficiently safeguard the MEC networks, compared to the traditional local computing and fully offloading, especially with a large value of user number.
KW - energy consumption
KW - latency
KW - mobile edge computing
KW - secrecy outage probability
KW - Secure communication
KW - user selection
UR - http://www.scopus.com/inward/record.url?scp=85107656107&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2021.3119075
DO - 10.1109/TCOMM.2021.3119075
M3 - Article
AN - SCOPUS:85107656107
SN - 0090-6778
VL - 70
SP - 500
EP - 513
JO - IEEE TRANSACTIONS ON COMMUNICATIONS
JF - IEEE TRANSACTIONS ON COMMUNICATIONS
IS - 1
ER -