Aug 2026· 2026 6th International Conference on Emerging Smart Technologies and Applications (eSmarTA)· pp. 1-7· 0 citations· 20 references
Abstract
A new paradigm for satisfying the ever-growing demands of real-time Sixth Generation (6G) applications is Mobile Edge Computing (MEC). Additionally, base stations and Internet of Things devices that incorporate renewable energy harvesting capabilities have the potential to lower grid energy use. To maximize system potential and lower carbon emissions, it is crucial to make effective decisions about job offloading and resource allocation. A carbon-aware MEC architecture that uses both grid and renewable energy sources is proposed in this paper. Our goal is to jointly manage resource allocation and task offloading while monitoring carbon emissions and task queue delays to optimize system behavior under uncertainty, specifically for stochastic workloads and variable renewable generation. To balance these two cost components (emissions and queue length), we create a combined optimization problem. We develop a deep deterministic policy gradient (DDPG)-based joint optimization technique to address this issue in a constantly changing environment. In the optimization, we consider greedy policy (GP) and full offloading (FO), as well as time-average carbon emission (TACE) and time-average queue length (TAQL) as performance metrics, and time-average queue length (TAQL) and full execution (FE) as baseline strategies; we also evaluate normalized time-average cumulative reward (NTACR). This method uses continuous-action reinforcement learning to generate efficient, real-time control policies. For the proposed MEC network, numerical statistics show that our approach can lead to effective offloading and lower carbon emissions.
This study jointly optimizes task offloading and system resource scheduling to minimize the long-term delay–energy cost of NOMA-MEC systems using a master-refined multi-agent proximal policy optimization algorithm.
A task scheduling method using the Deep Q-Network to determine the computation node for the computation task and a dynamic congestion-aware mechanism to determine a low-cost routing path is proposed, which gradually obtains an effective task scheduling scheme through multiple rounds of alternating iterations.
A constrained optimization model that supports different management goals through alternative objective functions (latency-aware or power-aware) while enforcing operational constraints, including node capacities, slice-specific latency bounds, and explicit limits on VNF migrations/relocations between scheduling periods...
R. Moreno-Vozmediano, E. Huedo, R. Montero et al.· Journal of Network and Syste...· 0 citations
A preference-adaptive dueling double deep Q-network algorithm, termed PA-DDQN, is proposed by integrating preference conditioning, multi-head attention, a dueling architecture, and double Q-learning, demonstrating its effectiveness in enhancing service responsiveness, energy efficiency, and reliability in smart library...
Jingjing Qu, Peiying Zhang, Ruixin Wang et al.· Information· 0 citations
This work introduces Online Pricing-based Slice Admission Control and Resource Allocation (OPA) framework, which dynamically assigns pseudo-prices to resources that capture long-term scarcity and anticipated inter-temporal opportunity costs and designs an exponential pricing strategy that guarantees bounded worst-case...
Muhammad Sulaiman, Bo Sun, M. A. Salahuddin et al.· 0 citations
The integration of 5G/6G networks with the Internet of Vehicles (IoV) requires efficient computational offloading for data-intensive applications such as autonomous driving and augmented reality. Although Unmanned Aerial Vehicles (UAVs) offer agile mobile edge computing (MEC) capabilities, their operational efficiency...
Fitzgerald Quincy Clarke, J. Odoom, Ruth S. Kubvoruno et al.· International Conference on...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.