TY - GEN
T1 - Joint Optimization of Task Offloading and Resource Allocation in Tactical Edge Networks
AU - Zhang, Zhaofeng
AU - Lin, Xuanli
AU - Xue, Guoliang
AU - Zhang, Yanchao
AU - Chan, Kevin S.
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - Recent years have witnessed explosive growth in deploying IoT devices over tactical edge networks. Due to the limited computing resources of local edge devices, there is an urgent need to offload the computing tasks to edge servers. A central question here is "How can we design offloading strategies and resource allocation plans so that all the computing resource constraints of servers and communication constraints between devices and servers are satisfied?"In this paper, we formulate the problem of jointly optimizing task offloading and resource allocation (JOA) in tactical edge networks as maximizing the total task completion rewards subject to various resource constraints. We design two algorithms to solve the JOA problem. The first is an exact algorithm using a search tree, where the branch-cutting criterion is well-crafted based on the property of the JOA problem. The second is a meta-heuristic algorithm based on the simulated annealing approach. We conduct numerical evaluations and demonstrate that the proposed exact algorithm can obtain the optimal task offloading strategy and resource allocation plan. The heuristic algorithm can efficiently provide competitive performance.
AB - Recent years have witnessed explosive growth in deploying IoT devices over tactical edge networks. Due to the limited computing resources of local edge devices, there is an urgent need to offload the computing tasks to edge servers. A central question here is "How can we design offloading strategies and resource allocation plans so that all the computing resource constraints of servers and communication constraints between devices and servers are satisfied?"In this paper, we formulate the problem of jointly optimizing task offloading and resource allocation (JOA) in tactical edge networks as maximizing the total task completion rewards subject to various resource constraints. We design two algorithms to solve the JOA problem. The first is an exact algorithm using a search tree, where the branch-cutting criterion is well-crafted based on the property of the JOA problem. The second is a meta-heuristic algorithm based on the simulated annealing approach. We conduct numerical evaluations and demonstrate that the proposed exact algorithm can obtain the optimal task offloading strategy and resource allocation plan. The heuristic algorithm can efficiently provide competitive performance.
UR - http://www.scopus.com/inward/record.url?scp=85214556372&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85214556372&partnerID=8YFLogxK
U2 - 10.1109/MILCOM61039.2024.10773851
DO - 10.1109/MILCOM61039.2024.10773851
M3 - Conference contribution
AN - SCOPUS:85214556372
T3 - Proceedings - IEEE Military Communications Conference MILCOM
SP - 703
EP - 708
BT - 2024 IEEE Military Communications Conference, MILCOM 2024
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2024 IEEE Military Communications Conference, MILCOM 2024
Y2 - 28 October 2024 through 1 November 2024
ER -