TY - JOUR
T1 - Mobile Edge Computing for Multi-Services Digital Twin-Enabled IoT Heterogeneous Networks
AU - Liu, Weiqi
AU - Hossain, Mohammad Arif
AU - Ansari, Nirwan
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2024
Y1 - 2024
N2 - A scheme for edge computing-enabled offloading in a digital twin (DT) enabled heterogeneous network (HetNet) of multi-services IoT devices (IDs) is proposed. This scheme optimizes the association and handover of IDs, offloading ratio, and resource allocation considering the number of IDs, deadline requirements, and resource capacities. The objective is to enhance future generation networks by considering the ID movement, diverse ID requests, and network heterogeneity. We formulate the problem as Joint ID assOciatIon, offloadiNg ratio, Wireless bandwidth and computIng reSource allocation, and digital twin placEment (JOINWISE), aiming to minimize the task completion time of all IDs while considering ID movement. Since JOINWISE is a mixed-integer nonlinear problem, we decompose it into two sub-problems: the ID Association (IDA) problem and the offloading Ratio, DT plAcement, bandwiDth and computIng resource allOcation (RADIO) problem. IDA can be solved by mapping it to a multi-dimensional multiple knapsacks problem. Due to the non-convexity, high dimension of decision variables, and dynamic HetNet environment of RADIO, we propose a deep deterministic policy gradient (DDPG) based reinforcement learning method to iteratively solve the two sub-problems. Simulation results have confirmed the effectiveness of our proposed scheme in tackling the JOINWISE problem.
AB - A scheme for edge computing-enabled offloading in a digital twin (DT) enabled heterogeneous network (HetNet) of multi-services IoT devices (IDs) is proposed. This scheme optimizes the association and handover of IDs, offloading ratio, and resource allocation considering the number of IDs, deadline requirements, and resource capacities. The objective is to enhance future generation networks by considering the ID movement, diverse ID requests, and network heterogeneity. We formulate the problem as Joint ID assOciatIon, offloadiNg ratio, Wireless bandwidth and computIng reSource allocation, and digital twin placEment (JOINWISE), aiming to minimize the task completion time of all IDs while considering ID movement. Since JOINWISE is a mixed-integer nonlinear problem, we decompose it into two sub-problems: the ID Association (IDA) problem and the offloading Ratio, DT plAcement, bandwiDth and computIng resource allOcation (RADIO) problem. IDA can be solved by mapping it to a multi-dimensional multiple knapsacks problem. Due to the non-convexity, high dimension of decision variables, and dynamic HetNet environment of RADIO, we propose a deep deterministic policy gradient (DDPG) based reinforcement learning method to iteratively solve the two sub-problems. Simulation results have confirmed the effectiveness of our proposed scheme in tackling the JOINWISE problem.
KW - digital twin
KW - edge computing
KW - HetNet
KW - wireless communication
UR - http://www.scopus.com/inward/record.url?scp=85208738073&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85208738073&partnerID=8YFLogxK
U2 - 10.1109/TCCN.2024.3490779
DO - 10.1109/TCCN.2024.3490779
M3 - Article
AN - SCOPUS:85208738073
SN - 2332-7731
JO - IEEE Transactions on Cognitive Communications and Networking
JF - IEEE Transactions on Cognitive Communications and Networking
ER -