Contextual User-Centric Task Offloading for Mobile Edge Computing in Ultra-Dense Network

被引:8
作者
Liu, Sige [1 ]
Cheng, Peng [2 ,3 ]
Chen, Zhuo [4 ]
Xiang, Wei [5 ]
Vucetic, Branka [1 ]
Li, Yonghui [1 ]
机构
[1] Univ Sydney, Sch Elect & Informat Engn, Camperdown, NSW 2006, Australia
[2] La Trobe Univ, Dept Comp Sci & Informat Technol, Bundoora, Vic 3086, Australia
[3] Univ Sydney, Camperdown, NSW 2006, Australia
[4] CSIRO DATA61, Sydney, NSW 2001, Australia
[5] La Trobe Univ, Sch Engn & Math Sci, Bundoora, Vic 3086, Australia
关键词
Mobile edge computing; ultra-dense network; contextual bandit learning; Lyapunov optimization; RESOURCE-ALLOCATION; PLACEMENT; 5G; OPTIMIZATION; CLOUD;
D O I
10.1109/TMC.2022.3168355
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Integrating mobile edge computing (MEC) in ultra-dense network (UDN) is a key enabler to meet the service demand by allowing smart devices to perform uninterrupted task offloading via densely deployed MEC servers. In most cases, the smart devices randomly move around the whole network. Consequently, the popular "MEC-centralized decision" offloading approach could be inapplicable, as joint decision-making among multiple MEC servers becomes difficult due to time synchronization and information exchange overhead. In this paper, we take a user-centric approach to minimize a long-term delay for a given task duration under a price budget constraint. To address this problem, we develop a novel contextual sleeping bandit learning (CSBL) algorithm, which integrates contextual information and sleeping characteristic to accelerate the learning convergence and leverage Lyapunov optimization to deal with the price budget constraint. Furthermore, we extend to a multiple offloading scenario where multiple MEC servers can be selected in each offloading round and propose a CSBL-multiple (CSBL-M) algorithm to address the exponential increase of the offloading selections. For both CSBL and CSBL-M, we derive the upper bounds of learning regret and provide rigorous proofs that they asymptotically approach the Oracle algorithm within bounded deviations for finite task duration. Simulation results illustrate that our proposed algorithms significantly outperform existing algorithms in both single offloading and multiple offloading scenario.
引用
收藏
页码:5092 / 5108
页数:17
相关论文
共 49 条
[1]   A new random walk model for PCS networks [J].
Akyildiz, IF ;
Lin, YB ;
Lai, WR ;
Chen, RJ .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2000, 18 (07) :1254-1260
[2]   Sleeping Multi-Armed Bandit Learning for Fast Uplink Grant Allocation in Machine Type Communications [J].
Ali, Samad ;
Ferdowsi, Aidin ;
Saad, Walid ;
Rajatheva, Nandana ;
Haapola, Jussi .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (08) :5072-5086
[3]  
[Anonymous], 2011, 36931 3GPP TR
[4]   Finite-time analysis of the multiarmed bandit problem [J].
Auer, P ;
Cesa-Bianchi, N ;
Fischer, P .
MACHINE LEARNING, 2002, 47 (2-3) :235-256
[5]   Mobi-Flow: Mobility-Aware Adaptive Flow-Rule Placement in Software-Defined Access Network [J].
Bera, Samaresh ;
Misra, Sudip ;
Obaidat, Mohammad S. .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2019, 18 (08) :1831-1842
[6]   Spatio-Temporal Edge Service Placement: A Bandit Learning Approach [J].
Chen, Lixing ;
Xu, Jie ;
Ren, Shaolei ;
Zhou, Pan .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2018, 17 (12) :8388-8401
[7]   USER-CENTRIC ULTRA-DENSE NETWORKS FOR 5G: CHALLENGES, METHODOLOGIES, AND DIRECTIONS [J].
Chen, Shanzhi ;
Qin, Fei ;
Hu, Bo ;
Li, Xi ;
Chen, Zhonglin .
IEEE WIRELESS COMMUNICATIONS, 2016, 23 (02) :78-85
[8]  
CHENG M, 2016, PROC IEEE 24 INT C N, P1, DOI DOI 10.1109/ICC.2016.7510999
[9]   Joint Task Offloading and Resource Allocation for Mobile Edge Computing in Ultra-Dense Network [J].
Cheng, Zhipeng ;
Min, Minghui ;
Gao, Zhibin ;
Huang, Lianfen .
2020 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2020,
[10]   Ultra-Dense LEO: Integrating Terrestrial-Satellite Networks Into 5G and Beyond for Data Offloading [J].
Di, Boya ;
Zhang, Hongliang ;
Song, Lingyang ;
Li, Yonghui ;
Li, Geoffrey Ye .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2019, 18 (01) :47-62