TY - JOUR
T1 - Task Offloading in Terrestrial-Support-Free Multi-Layer Multi-Access Edge Computing
AU - Peng, Limei
AU - Ho, Pin Han
AU - Zhao, Ke
N1 - Publisher Copyright:
© 1979-2012 IEEE.
PY - 2024
Y1 - 2024
N2 - The article investigates aerial computing terrestrial-support-free multi-layer multi-access edge computing (AC-TMMEC) systems within the context of massive machine-type communications (mMTC) beyond 5G (B5G). With its four layers, namely space platform (S), high-altitude platform (HAP), low-altitude platform (LAP), and ground mobile access point platform (G), task offloading of ground users takes place in a sparsely distributed and dynamic environment mainly due to the high mobility of the AC-TMMEC entities. The article begins by reviewing the state-of-the-art, then identifies data routing and trajectory planning as new challenges in the design of AC-TMMEC offloading schemes. A simple yet effective task offloading scheme under AC-TMMEC, called iterative maximum flow algorithm (IMFA), is introduced, aiming to jointly solve the problems of source-destination pairing and data routing in a single shot via iterative maximum flow search. Extensive case studies are conducted to gain insights on the offloading latency performance of the proposed IMFA and compare it with a couple of counterparts with respect to two key parameters, namely the number of task requests and data size of each request.
AB - The article investigates aerial computing terrestrial-support-free multi-layer multi-access edge computing (AC-TMMEC) systems within the context of massive machine-type communications (mMTC) beyond 5G (B5G). With its four layers, namely space platform (S), high-altitude platform (HAP), low-altitude platform (LAP), and ground mobile access point platform (G), task offloading of ground users takes place in a sparsely distributed and dynamic environment mainly due to the high mobility of the AC-TMMEC entities. The article begins by reviewing the state-of-the-art, then identifies data routing and trajectory planning as new challenges in the design of AC-TMMEC offloading schemes. A simple yet effective task offloading scheme under AC-TMMEC, called iterative maximum flow algorithm (IMFA), is introduced, aiming to jointly solve the problems of source-destination pairing and data routing in a single shot via iterative maximum flow search. Extensive case studies are conducted to gain insights on the offloading latency performance of the proposed IMFA and compare it with a couple of counterparts with respect to two key parameters, namely the number of task requests and data size of each request.
UR - http://www.scopus.com/inward/record.url?scp=85198036447&partnerID=8YFLogxK
U2 - 10.1109/MCOM.001.2300020
DO - 10.1109/MCOM.001.2300020
M3 - Article
AN - SCOPUS:85198036447
SN - 0163-6804
VL - 62
SP - 82
EP - 87
JO - IEEE Communications Magazine
JF - IEEE Communications Magazine
IS - 7
ER -