TY - JOUR
T1 - PHY Security Design for Mobile Crowd Computing in ICV Networks Based on Multi-Agent Reinforcement Learning
AU - Luo, Xuewen
AU - Liu, Yiliang
AU - Chen, Hsiao Hwa
AU - Guo, Qing
N1 - Publisher Copyright:
© 2002-2012 IEEE.
PY - 2023/10/1
Y1 - 2023/10/1
N2 - In this paper, we propose a multi-roadside unit (RSU) assisted mobile crowd computing framework for intelligently connected vehicle (ICV) networks, where vehicles within RSUs' coverage act as workers to provide their computation and communication resources for computing resource limited vehicle user equipments (VUEs). Physical (PHY) layer security is used to secure computation task offloading and results feedback in time-varying vehicular channels. Artificial noise (AN) assisted adaptive wiretap coding is adopted to enhance the security of offloading links. With PHY security, the intended receiver can decode secret message while eavesdropper cannot. A modified exhaustive two-dimensional (2D) search algorithm is proposed to optimize transmission rate and secrecy rate in an effective secrecy throughput maximization problem, and a multi-agent twin delayed deep deterministic policy gradient algorithm (MATD3) is utilized to assign VUEs' tasks without a central controller, where a reward function is defined according to the computing costs, including execution time, energy consumption, and price paid for computing. Finally, simulations verify the effectiveness of the proposed framework.
AB - In this paper, we propose a multi-roadside unit (RSU) assisted mobile crowd computing framework for intelligently connected vehicle (ICV) networks, where vehicles within RSUs' coverage act as workers to provide their computation and communication resources for computing resource limited vehicle user equipments (VUEs). Physical (PHY) layer security is used to secure computation task offloading and results feedback in time-varying vehicular channels. Artificial noise (AN) assisted adaptive wiretap coding is adopted to enhance the security of offloading links. With PHY security, the intended receiver can decode secret message while eavesdropper cannot. A modified exhaustive two-dimensional (2D) search algorithm is proposed to optimize transmission rate and secrecy rate in an effective secrecy throughput maximization problem, and a multi-agent twin delayed deep deterministic policy gradient algorithm (MATD3) is utilized to assign VUEs' tasks without a central controller, where a reward function is defined according to the computing costs, including execution time, energy consumption, and price paid for computing. Finally, simulations verify the effectiveness of the proposed framework.
UR - http://www.scopus.com/inward/record.url?scp=85149421973&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85149421973&partnerID=8YFLogxK
U2 - 10.1109/TWC.2023.3245637
DO - 10.1109/TWC.2023.3245637
M3 - Article
AN - SCOPUS:85149421973
SN - 1536-1276
VL - 22
SP - 6810
EP - 6825
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 10
ER -