REACT: Reinforcement learning and multi-objective optimization for task scheduling in ultra-dense edge networks

被引:0
|
作者
Smithamol, M. B. [1 ]
Sridhar, Rajeswari [2 ]
机构
[1] LBS Inst Technol Women Trivandrum, Thiruvananthapuram, Kerala, India
[2] NIT Trichy, Trichy 620015, Tamil Nadu, India
关键词
Edge computing; Computation offloading; Resource allocation; Latency optimization; Sensitivity analysis; RESOURCE-ALLOCATION;
D O I
10.1016/j.adhoc.2025.103834
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper addresses the challenges of task scheduling and resource allocation in ultra-dense edge cloud (UDEC) networks, which integrate micro and macro base stations with diverse user equipment in 5G environments. To optimize system performance, we propose REACT, a novel two-level scheduling framework leveraging reinforcement learning (RL) for energy-efficient task scheduling. At the upper level, RL-based adaptive optimization replaces conventional power allocation techniques, dynamically minimizing transmission energy consumption under the Non-Orthogonal Multiple Access (NOMA) protocol. At the lower level, the joint task offloading and resource allocation problem is modeled as a multi-objective optimization challenge. This is solved using a hybrid approach combining meta-heuristic algorithms and Long Short-Term Memory (LSTM) predictive models, maximizing response rates and system throughput. Sensitivity analyses explore the effects of user density, channel quality, workload, and request size on performance. Comparative evaluations against state-of-the-art methods demonstrate the proposed framework's superior efficiency in tackling dynamic scheduling challenges, achieving energy savings and enhancing user experience.
引用
收藏
页数:15
相关论文
共 50 条
  • [31] Cost-Efficient Resources Scheduling for Mobile Edge Computing in Ultra-Dense Networks
    Lu, Yangguang
    Chen, Xin
    Zhang, Yongchao
    Chen, Ying
    IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2022, 19 (03): : 3163 - 3173
  • [32] Load Optimization Based on Edge Collaboration in Software Defined Ultra-Dense Networks
    Yang, Peng
    Zhang, Yifu
    Lv, Ji
    IEEE ACCESS, 2020, 8 : 30664 - 30674
  • [33] TS-SMOSA: A Multi-Objective Optimization Method for Task Scheduling in Mobile Edge Computing
    Zhao, Xuhui
    Shi, Yan
    Chen, Shanzhi
    JOURNAL OF INTERNET TECHNOLOGY, 2019, 20 (04): : 1057 - 1068
  • [34] Computing Offloading and Resource Optimization in Ultra-dense Networks with Mobile Edge Computation
    Zhang Haibo
    Li Hu
    Chen Shanxue
    He Xiaofan
    JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2019, 41 (05) : 1194 - 1201
  • [35] Computing offloading and resource scheduling based on DDPG in ultra-dense edge computing networks
    Ruizhong Du
    Jingya Wang
    Yan Gao
    The Journal of Supercomputing, 2024, 80 : 10275 - 10300
  • [36] User-Oriented Task Offloading for Mobile Edge Computing in Ultra-Dense Networks
    Liu, Sige
    Cheng, Peng
    Chen, Zhuo
    Xiang, Wei
    Vucetic, Branka
    Li, Yonghui
    2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2021,
  • [37] Optimization of Ultra-Dense Wireless Powered Networks
    Diamantoulakis, Panagiotis D.
    Papanikolaou, Vasilis K.
    Karagiannidis, George K.
    SENSORS, 2021, 21 (07)
  • [38] Research on Cloud Task Scheduling based on Multi-Objective Optimization
    Hao, Xiaohong
    Han, Yufang
    Cao, Juan
    Yan, Yan
    Wang, Dongjiang
    PROCEEDINGS OF THE 2017 INTERNATIONAL CONFERENCE ON MECHANICAL, ELECTRONIC, CONTROL AND AUTOMATION ENGINEERING (MECAE 2017), 2017, 61 : 466 - 471
  • [39] Multi-Objective Task Scheduling Optimization in Cloud Computing: An Appraisal
    Gabi, Danlami
    Ismail, Abdul Samad
    Zainal, Anazida
    Zakaria, Zalmiyah
    ADVANCED SCIENCE LETTERS, 2018, 24 (05) : 3609 - 3615
  • [40] Multi-objective multicast optimization with deep reinforcement learning
    Li, Xiaole
    Tian, Jinwei
    Wang, Cuiping
    Jiang, Yinghui
    Wang, Xing
    Wang, Jiuru
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2025, 28 (04):