Developed by Noah Kwaku Baah and Yingchi Mao of Hohai University in Nanjing, together with Portia Annabelle Opoku and Hans Oheneba Aduse Opoku, the approach tackles the core tension at the heart of edge computing. Offloading a task can save a device’s battery and speed up processing, but it consumes network bandwidth, adds transmission delay, and depends on the availability of edge resources that fluctuate from second to second. Most existing offloading strategies treat these factors with fixed priorities, which works well under one set of network conditions and poorly under others. WCOA instead adapts in real time, continuously reweighting the relative importance of energy consumption, bandwidth, latency, and computational resource availability as conditions change. The result is a decision process that tracks the shifting realities of a live network rather than optimizing for a static snapshot of it.

The technical heart of the framework is an Adaptive Weighting Algorithm, or AWA, which dynamically adjusts the weights assigned to each cost component in the optimization objective. When a device’s battery runs low, energy considerations gain weight; when the network is congested, bandwidth and latency dominate; when edge servers are heavily loaded, the cost of competing for computational resources rises in the calculation. This adaptive weighting is paired with two complementary offloading schemes, designated P-COM and G-COM, which model the decision problem in different configurations. Together they capture the trade-offs between executing tasks locally, transmitting them to edge nodes, and dividing work across the mobile-edge-cloud continuum, allowing the system to evaluate the true total cost of each option rather than optimizing a single metric in isolation.

What distinguishes WCOA from many heuristic offloading strategies is its use of exact mathematical optimization. The researchers formulated the offloading decision as a mixed-integer linear programming problem and solved it with Gurobi’s commercial MILP solver, employing Branch and Bound techniques to search the space of possible decisions efficiently. Mixed-integer programming is a class of optimization in which some variables must take whole-number values, such as a binary choice between offloading and not offloading, while others vary continuously, such as the fraction of resources allocated to a task. The Branch and Bound method systematically divides the problem into smaller subproblems, discarding branches that cannot contain better solutions than those already found. This rigor guarantees that the decisions produced are optimal with respect to the weighted cost function, not merely good approximations.

Speed is where the results become striking. Exact optimization methods are often dismissed in edge computing because solving them can take too long for real-time decisions, where offloading choices must be made in milliseconds. Yet WCOA reaches optimal offloading decisions within 0.1 to 1.05 milliseconds, which the authors report is up to five times faster than existing solvers applied to the same problem. That speed matters because the value of an offloading decision decays rapidly: a choice that is optimal for the network state of one moment may be stale by the next. By making exact optimization fast enough for live use, the framework bridges a long-standing gap between the theoretical guarantees of mathematical programming and the practical demands of latency-sensitive mobile applications.

The simulation results quantify the gains. Compared with popular baseline techniques, including LDROA, OONS, and Greedy strategies, WCOA reduced CPU and RAM usage by more than 70 percent and cut overall costs by 50 to 70 percent. Greedy approaches, which make locally sensible choices without considering the global picture, are a common benchmark in this field precisely because they are fast and simple, so outperforming them by such margins while retaining optimality guarantees is significant. The reductions in resource consumption also carry implications for scalability: if each offloading decision consumes far less processor time and memory on the edge infrastructure itself, then a single edge server can serve many more devices, which is essential as IoT deployments grow toward the tens of billions.

The study situates itself within a rich body of prior work on computation offloading. Earlier research has explored dynamic offloading for energy-harvesting devices, Markov decision process formulations of offloading timing, deep reinforcement learning agents that learn offloading policies from experience, and genetic and swarm-based heuristics for task scheduling. Each approach embodies a trade-off: learned policies can adapt to complex environments but offer no optimality guarantees and require extensive training data, while heuristics are fast but can be trapped by locally attractive yet globally poor decisions. WCOA’s contribution is to show that with the right problem formulation and a sufficiently fast solver, exact optimization can be competitive in real time, combining provable optimality with the adaptivity that heuristic and learning-based methods were designed to provide.

The broader context makes this work timely. Edge computing has become a foundational technology for 5G and future 6G networks, autonomous vehicles, industrial automation, and augmented reality, all of which demand millisecond-scale responsiveness that centralized clouds cannot deliver. Surveys of the field have repeatedly identified the offloading decision problem as a central bottleneck: the question of where computation should run determines whether the promise of edge computing is realized in practice. Strategies that reduce latency, energy use, and computational overhead simultaneously, as WCOA claims to do, directly improve both quality of service, measured in network performance terms, and quality of experience, measured in what users actually perceive. The authors frame their approach as a scalable and cost-effective solution for future MEC systems, and the reported resource savings support that framing.

There are, as with any simulation-based study, natural questions about how the framework will behave in physical deployments. Real networks introduce channel fading, user mobility, and hardware variability that simulators approximate imperfectly, and the authors note that no datasets were generated or analyzed during the study, meaning the evaluation rests on modeled scenarios. The work was published in Cluster Computing on 17 September 2026, received on 23 July 2025 and accepted on 3 September 2026, after revisions in March of that year. The authors report no competing interests and no external funding for the research. Corresponding author Noah Kwaku Baah led the conceptualization, methodology, software, and validation work, with co-authors contributing to supervision, software, visualization, and editing.

Even so, the direction of travel is clear. As connected devices multiply and the applications they run grow heavier, the intelligence that decides where computation happens will matter as much as the raw capacity of the servers themselves. WCOA demonstrates that the oldest tool in the optimization arsenal, exact mixed-integer programming, can be made fast enough to sit inside that decision loop, reweighting its priorities millisecond by millisecond as batteries drain, bandwidth fluctuates, and edge servers fill and empty. If the reported gains in resource efficiency and cost translate from simulation to production networks, the framework could help edge infrastructure keep pace with a device population heading toward 40.6 billion, ensuring that the smart devices of the next decade remain smart without draining their batteries or their users’ patience.

Subject of Research: Adaptive weighted cost-optimization for task offloading decisions in mobile edge computing

Article Title: An adaptive weighted cost-optimization approach (WCOA) for task offloading decision in mobile edge computing

Article References: Baah, N. K., Mao, Y., Opoku, P. A., & Aduse Opoku, H. O. (2026). An adaptive weighted cost-optimization approach (WCOA) for task offloading decision in mobile edge computing. Cluster Computing, 29(13), Article 754. https://doi.org/10.1007/s10586-026-06556-1

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06556-1

Keywords: mobile edge computing, task offloading, Internet of Things, mixed-integer linear programming, Gurobi, branch and bound, adaptive weighting, latency optimization, energy efficiency, cost optimization, 5G, distributed computing

The core challenge the researchers tackle is known as task offloading in Mobile Edge Computing, or MEC. When a smartphone, sensor, or connected machine generates a computational task, the system must decide whether to execute it locally on the device, on a nearby edge server, or remotely in the cloud. Each option involves a trade-off: local execution conserves network bandwidth but drains the device battery and may be too slow; edge execution reduces delay but competes with other users for limited resources; cloud execution offers raw power but introduces transmission latency. The combined cost, measured as a balance of execution delay and energy consumption, is what users ultimately experience, and minimizing it across thousands of simultaneous users is a formidable optimization problem.

Existing approaches to this problem have leaned heavily on metaheuristic algorithms, a family of search techniques that explore large solution spaces where exact methods would be computationally infeasible. Popular examples include particle swarm optimization, the grey wolf optimizer, and genetic algorithms. But as the authors note, these methods frequently suffer from premature convergence, meaning the search settles on a mediocre solution too early; poor diversity in the initial population, which limits the range of solutions explored; and an inability to scale effectively in highly dynamic, ultra-dense network environments where thousands of devices compete simultaneously. These weaknesses translate directly into higher costs and slower responses for end users.

To overcome these limitations, Li and Li built their framework on the White Shark Optimization algorithm, a bio-inspired metaheuristic introduced in 2022 that models the way great white sharks locate and capture prey. In the standard algorithm, candidate solutions move through the search space much like sharks navigating toward food, guided by positional updates that mimic the predators’ sensing and movement patterns. While effective for general global optimization problems, the original formulation still leaves room for improvement when applied to the fast-moving, multi-dimensional decision space of edge-cloud task offloading, where network conditions and user demands shift continuously.

The improved version integrates three key mechanisms, each targeting a specific weakness of the base algorithm. The first is CIRCLE chaotic mapping, which is used for population initialization. In metaheuristic search, the starting positions of candidate solutions matter enormously: a well-spread initial population covers more of the search space and reduces the risk of missing promising regions. Chaotic maps generate sequences that are deterministic yet pseudo-random and spread across the entire feasible range, giving the algorithm a more diverse starting set than conventional random initialization and helping it avoid clustering around unrepresentative points from the outset.

The second mechanism is an adaptive non-linear weight factor that dynamically balances global exploration and local exploitation. Exploration refers to the algorithm’s tendency to search broadly across the solution space, while exploitation refers to its focus on refining solutions in promising neighborhoods. Too much exploration wastes computational effort wandering aimlessly; too much exploitation causes the search to collapse prematurely around a local optimum. By adjusting the weighting non-linearly over the course of the run, the IWSO shifts emphasis from broad searching early on to fine-tuned refinement later, a transition that is crucial in the non-stationary environment of edge-cloud systems.

The third enhancement is Fitness-Distance Balance-based Cauchy reverse learning, a mechanism that helps the algorithm escape local optima. Opposition-based or reverse learning generates candidate solutions that are, in a defined sense, mirror images of existing ones, giving the search a second chance to find better regions it might otherwise never visit. By selecting the reference solution using the Fitness-Distance Balance criterion, which weighs both the quality of a solution and its distance from the best-known one, the method avoids biasing the search toward solutions that are merely close to the current best. The Cauchy mutation component introduces large, heavy-tailed jumps that can carry the search out of stagnant basins of attraction.

Extensive experimental simulations reported in the study demonstrate that the proposed approach significantly improves both convergence accuracy and convergence speed compared with existing White Shark Optimization variants and other standard metaheuristics. In practical terms, this means the algorithm reaches better offloading decisions in fewer iterations, an important property for edge systems where scheduling decisions must be made in near real time. The improved search translates directly into a substantially lower overall user-perceived cost, because the framework optimally balances execution delay against energy consumption when assigning tasks across the edge-cloud continuum.

Perhaps the most striking result concerns scalability. The IWSO exhibits exceptional robustness and optimization performance in ultra-dense network scenarios containing up to 1,000 User Equipments, successfully overcoming the bottlenecks that limit traditional scheduling schemes. This matters because the density of connected devices is rising relentlessly: smart factories, connected vehicles, dense urban sensor deployments, and massive IoT installations all push networks toward configurations where hundreds or thousands of devices must be scheduled simultaneously. An optimizer that degrades gracefully at that scale, rather than collapsing into premature convergence, is a meaningful step toward practical edge-cloud orchestration.

The work, published in Cluster Computing as volume 29, article number 749, arrives amid a broader wave of research into intelligent resource management for edge-assisted IoT applications, including hybrid bio-inspired optimizers, reinforcement learning-based offloading, and multi-objective scheduling frameworks. What distinguishes this contribution is the systematic combination of chaos-based initialization, adaptive weighting, and fitness-distance-guided reverse learning within a single joint offloading framework for an edge-cloud collaborative architecture. As 5G and future 6G networks multiply the number of edge nodes and the diversity of connected devices, algorithms of this kind, capable of balancing delay, energy, and scale simultaneously, are likely to become essential components of the software layer that keeps the responsive, energy-aware computing promised by edge-cloud integration within reach.

Subject of Research: Bio-inspired metaheuristic optimization for task offloading in mobile edge-cloud computing

Article Title: An improved white shark optimization algorithm for edge-cloud integrated computation offloading

Article References: An improved white shark optimization algorithm for edge-cloud integrated computation offloading. (n.d.). https://doi.org/10.1007/s10586-026-06541-8

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06541-8

Keywords: mobile edge computing, task offloading, white shark optimization, metaheuristics, edge-cloud collaboration, Internet of Things, chaotic mapping, fitness-distance balance, ultra-dense networks, energy efficiency, latency, Cluster Computing

The space-air-ground integrated network, or SAGIN, is widely regarded as a cornerstone architecture for 6G. By fusing satellites in orbit, unmanned aerial vehicles in the lower atmosphere, and terrestrial stations on the ground, SAGIN promises global seamless coverage, low latency, and efficient energy use. That matters most precisely where conventional networks fail: remote regions with sparse communication infrastructure, and disaster zones where sudden events can knock out fixed base stations altogether. Traditional mobile edge computing, which depends on fixed infrastructure, simply cannot guarantee the ultra-high reliability, ultra-low latency, and high data rates that next-generation applications demand in such environments. SAGIN’s heterogeneous fleet of platforms can blanket vast areas and compensate for the blind spots of terrestrial networks, but that same heterogeneity creates a scheduling nightmare.

The difficulty is fundamental rather than incidental. Satellites sweep across the sky on predictable but relentless orbits, UAVs drift with wind and mission demands, and ground stations contend with fluctuating user loads. Devices differ wildly in computing power, energy reserves, and communication capabilities. Deployment is inherently distributed, spanning thousands of kilometers. Deciding which node should process which task, when to offload computation, and how to allocate bandwidth and energy across such a system is a resource optimization problem of extraordinary complexity. Every decision made by one node ripples through the others, so treating each element in isolation produces suboptimal, often unstable, outcomes.

The researchers’ answer begins with a digital twin. Digital twin technology creates a precise, real-time virtual replica of a physical system, allowing operators and algorithms to observe, model, and test the network without touching the real hardware. In manufacturing and industry 4.0 settings, digital twins have already proven their worth, and recent studies have extended the concept to vehicular edge networks, satellite constellations, and 6G ultra-reliable low-latency communications. Building on that lineage, the team designed and implemented DT-SAG, a digital twin-based integrated simulation platform that models satellites, UAVs, and ground stations collaboratively. The platform achieves what the authors describe as collaborative modeling and intelligent scheduling across all three layers, giving the learning algorithms a faithful sandbox in which to experiment before committing decisions to the physical network.

Inside that sandbox, the intelligence comes from a marriage of two machine learning techniques. The first is multi-agent deep reinforcement learning, specifically the Multi-Agent Deep Deterministic Policy Gradient algorithm, known as MADDPG. In multi-agent environments, naive reinforcement learning can become wildly unstable, because each agent’s policy changes while the others are still learning to respond to it. MADDPG tames this chaos through a paradigm called centralized training with distributed execution: during training, a critic sees the actions and observations of all agents and learns the global dynamics of the system, while at execution time each agent acts using only its own local observations. This makes the approach well suited to SAGIN, where each satellite, drone, or ground station must make fast, autonomous decisions under real-world conditions.

The second ingredient is federated learning, a distributed training framework that flips the usual logic of machine learning on its head. Instead of shipping raw data to a central server, federated learning lets each node train locally on its own data and then share only model parameters, which are aggregated into a global model. In the SAGIN context, this design delivers three benefits at once. It slashes communication overhead, a critical concern when the links in question run through space and air. It protects data privacy, since sensitive user information never leaves the local node. And it improves training efficiency by parallelizing learning across the network’s distributed agents. The authors combined MADDPG with federated learning into a single algorithm they call FLMADDPG, which enables efficient collaboration among agents while sidestepping the privacy risks and communication bottlenecks that plague centralized learning.

The technical logic of the combination is elegant. Each agent in the network, whether a satellite, a UAV, or a ground station, runs its own MADDPG instance, learning how to schedule tasks, allocate resources, and manage energy based on local conditions mirrored in the digital twin. Periodically, the agents federate: their learned policy parameters are aggregated to produce a shared global policy that captures the collective experience of the whole network. Each agent then refines that global policy against its own local realities. The result is a system that learns both the fine-grained particulars of each node and the coarse-grained dynamics of the network as a whole, without any single point of data collection. The digital twin supplies the accurate state information and safe rehearsal environment that such learning requires, closing the loop between the virtual and physical layers.

Experimental results reported in the study indicate that the FLMADDPG approach delivers measurable gains across the three metrics that matter most for SAGIN: network coverage efficiency, energy management, and communication performance. The authors report that the method effectively enhances all three, demonstrating the potential of integrating digital twins with federated learning for network optimization. While the study is computational rather than a field deployment, the simulation platform’s collaborative modeling of satellites, UAVs, and ground stations suggests that the framework could be ported to real constellations and aerial fleets as 6G standardization matures. The research was supported in part by the Open Foundation of the State Key Laboratory of Networking and Switching Technology at Beijing University of Posts and Telecommunications and by Beijing municipal education programs.

The broader significance of the work lies in its convergence of three frontier technologies at once. Digital twin research has flourished in factories and vehicular networks, and recent studies have explored blockchain-aided twin-based offloading in space-air-ground systems. Federated learning has been adapted to aerial and space networks in frameworks such as topology-aware olive branch learning, and multi-agent reinforcement learning has been applied to computation offloading in air-ground networks and low Earth orbit satellite edge computing. What distinguishes the new study is the integration of all three into a single coherent pipeline: a twin that mirrors the network, agents that learn within the twin, and a federation mechanism that lets them learn together without surrendering privacy or drowning the network’s own links in training traffic.

Challenges remain before such systems fly for real. The dynamism of orbital mechanics, atmospheric conditions, and user mobility means that a digital twin must be continuously synchronized with its physical counterpart, and any lag between the two could degrade the quality of learned policies. Federated aggregation across nodes with wildly different computational capacities and intermittent connectivity is itself an open research problem, one that other teams have begun addressing with weighted aggregation schemes for aerial and space networks. Yet the direction is clear. As 6G ambitions stretch from dense cities to disaster zones, oceans, and the far reaches of the planet, the networks that serve them will need to be simulated before they are built, and taught before they are trusted. This study offers a concrete blueprint for how a digital mirror, a swarm of learning agents, and a privacy-preserving federation protocol can together turn a chaotic three-layer network into a coordinated, self-optimizing whole.

Subject of Research: Resource optimization in space-air-ground integrated networks using digital twins and federated multi-agent reinforcement learning

Article Title: Resource Optimization of Space-Air-Ground Integrated Network Based on Digital Twin and Federated Multi-agent Reinforcement Learning

Article References: Li, J., Zeng, Q., Lu, L., & Qi, Z. (2026). Resource Optimization of Space-Air-Ground Integrated Network Based on Digital Twin and Federated Multi-agent Reinforcement Learning. Mobile Networks and Applications. https://doi.org/10.1007/s11036-026-02518-4

Image Credits: AI Generated

DOI: 10.1007/s11036-026-02518-4

Keywords: 6G, space-air-ground integrated network, digital twin, federated learning, multi-agent reinforcement learning, MADDPG, mobile edge computing, resource allocation, UAV networks, satellite communication, energy efficiency, task offloading

The reason this problem is so difficult lies in its mathematical structure. Task scheduling in edge and fog environments is formally classified as NP-hard, meaning that the time required to find the perfect solution grows explosively with the size of the problem. A fog network might contain dozens of heterogeneous nodes, each with different processing speeds, memory capacities, energy budgets and network conditions, while the tasks arriving at those nodes vary wildly in size, deadline sensitivity and dependencies on other tasks. Classical heuristics and metaheuristics, such as ant colony optimization or grey wolf optimization, have long been used to find good-enough solutions quickly. But these approaches typically rely on static assumptions about the environment, and edge and fog networks are anything but static. Devices join and leave, wireless links fluctuate, and workloads surge unpredictably, which is precisely where learning-based methods promise an advantage.

Reinforcement learning reframes scheduling as a sequential decision game. An agent observes the state of the system, such as queue lengths, resource availability and task characteristics, selects an action like assigning a task to a particular node, and receives a numerical reward reflecting outcomes such as reduced latency or lower energy consumption. Over many iterations, the agent learns a policy that maximizes cumulative reward. Deep reinforcement learning extends this idea by using deep neural networks to approximate the value of states or actions, allowing the agent to cope with enormous, continuous state spaces that would overwhelm tabular methods. The survey traces how this family of techniques, from foundational Q-learning through deep Q-networks, double deep Q-networks, actor-critic methods such as A2C and SAC, and policy gradient approaches like deep deterministic policy gradient, has been adapted to the specific demands of edge and fog infrastructures.

What sets the new survey apart is the breadth of its comparison framework. Rather than simply listing algorithms, the authors evaluate them across a systematic set of dimensions: the case study context, the type of tasks being scheduled, how the optimization problem is formally formulated, the specific reinforcement learning technique employed, the simulation or evaluation tools used, the performance metrics reported, and the learning and execution architecture, whether centralized, distributed, or federated. They also catalog advanced features such as security awareness, fault tolerance, energy optimization and privacy preservation, alongside the limitations each algorithm admits. This multidimensional lens reveals patterns that a simple performance comparison would miss, for instance that the choice between value-based and actor-critic methods often hinges on whether the action space is discrete, as in choosing one of several servers, or continuous, as in tuning transmission power levels.

Among the most consequential trends the survey documents is the shift toward multi-agent and federated learning architectures. In a centralized scheme, a single agent observes everything and decides everything, which becomes a bottleneck and a single point of failure at scale. Multi-agent deep reinforcement learning distributes the intelligence, letting individual nodes or device groups learn cooperatively or independently. Federated reinforcement learning goes further, allowing agents to share learned knowledge without exchanging raw data, a property that matters enormously in privacy-sensitive settings such as healthcare and smart cities. The reviewed literature includes federated deep Q-networks paired with clustering techniques, federated deep recurrent Q-learning for satellite-assisted industrial IoT, and multi-agent approaches for vehicular fog networks, where cars themselves act as fleeting computing nodes whose positions change by the second.

Vehicular computing emerges as one of the most demanding and active application domains in the surveyed corpus. Vehicles move at high speed, producing tasks with hard latency deadlines for safety-critical functions like collision avoidance, while connectivity to fog nodes is intermittent. Studies cited in the survey apply asynchronous deep reinforcement learning to secure offloading in vehicular edge networks, priority-aware offloading based on deep Q-learning, and distributed twin delayed deep deterministic policy gradient, known as TD3, for multi-objective optimization across mobile edge and vehicular-fog systems. Other domains represented include industrial IoT, where decentralized multi-agent systems coordinate partial task offloading across factories, augmented reality offloading in mobile edge networks, smart agriculture, power grid IoT, and unmanned aerial vehicles that serve as airborne edge servers with their own energy constraints.

The survey also shines a light on the unglamorous but critical question of how these algorithms are actually tested. The authors catalog the dominant evaluation platforms, including iFogSim, EdgeCloudSim, CloudSim, EdgeSimPy, SimPy, OMNeT++, the FogBus framework, the COSCO container orchestration system and the AirFogSim simulator for UAV-integrated vehicular fog. On the machine learning side, implementations typically rely on PyTorch, TensorFlow and Keras, with OpenAI Gym and Stable-Baselines3 providing standardized training environments and reliable algorithm implementations. This tooling inventory matters because reproducibility remains a weak point in the field: results obtained in one simulator often fail to transfer cleanly to another, and the survey’s accounting of which studies used which tools gives researchers a common baseline for fair comparison. Performance metrics cluster around makespan, response time, energy consumption, load balance, cost, throughput and quality-of-service violation rates, with recent work increasingly optimizing several of these simultaneously through weighted or Pareto-based multi-objective formulations.

Despite the evident progress, the survey is candid about the field’s open problems. Many proposed algorithms are trained and evaluated under simplified assumptions that ignore security threats, node failures and the full heterogeneity of real hardware. The gap between simulation and deployment remains wide, and the computational cost of training deep agents can itself conflict with the resource constraints of edge devices. Scalability of centralized training looms large, and the survey highlights emerging directions meant to close these gaps: transformer-enhanced distributed deep reinforcement learning, meta-reinforcement learning that lets agents adapt rapidly to unseen environments, hybrid schemes combining fuzzy logic or graph attention networks with learned policies, and privacy-preserving hierarchical frameworks for low-altitude vehicular fog. The authors also point toward better handling of dependent tasks, where directed acyclic graphs of interlinked computations must be placed jointly rather than one at a time.

For the broader technology landscape, the stakes of this research line are hard to overstate. The number of IoT devices continues to climb, and the latency-sensitive applications they enable, from autonomous driving to remote surgery to real-time industrial control, simply cannot tolerate the round trip to a distant cloud. Edge and fog computing supply the physical infrastructure, but intelligence about where and when to run each computation is what turns that infrastructure into a functioning system. By consolidating and comparing the deep reinforcement learning literature across environments, task types, algorithms, tools and metrics, the survey provides both a status report and a research agenda. It suggests that the next generation of schedulers will be distributed, privacy-aware, energy-conscious and capable of learning on the fly, qualities that will determine whether the promised era of ubiquitous, responsive computing actually arrives on schedule.

Subject of Research: Deep reinforcement learning-based task scheduling and offloading in edge and fog computing

Article Title: A comparative analysis of deep reinforcement learning based task scheduling and offloading in edge and fog computing: a comprehensive survey

Article References: Bouafia, Z., Mededjel, M., Ghalem, B., & Mokadem, R. (2026). A comparative analysis of deep reinforcement learning based task scheduling and offloading in edge and fog computing: a comprehensive survey. Cluster Computing, 29(14), Article 795. https://doi.org/10.1007/s10586-026-06601-z

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06601-z

Keywords: edge computing, fog computing, deep reinforcement learning, task scheduling, task offloading, Internet of Things, multi-agent reinforcement learning, federated learning, vehicular edge computing, NP-hard optimization, resource allocation, Cluster Computing

The core problem the researchers tackle is a trio of persistent headaches in vehicular edge computing. First, traffic conditions are notoriously difficult to characterize precisely, which means offloading decisions are often made with imperfect information. Second, electric vehicles face acute energy constraints, and wasteful task allocation can drain batteries that drivers need for the road. Third, the conventional approach of pooling vehicle data into a centralized server to train decision-making models raises serious privacy concerns, since driving trajectories and task profiles can reveal sensitive personal information. EFF-FedRL addresses all three simultaneously by weaving together two complementary branches of artificial intelligence: adaptive fuzzy logic for interpreting messy, real-world conditions, and federated deep reinforcement learning for making smart offloading choices without exposing raw data.

The fuzzy logic component acts as the framework’s local perception layer. Inside each participating system, a lightweight fuzzy inference system evaluates current traffic conditions, variables such as congestion density, vehicle speed distributions, and communication quality, using linguistic rules rather than brittle binary thresholds. Because fuzzy systems can gracefully handle vague and noisy inputs, they are well suited to the chaotic reality of urban traffic. The output of this inference step is not a decision itself; instead, it dynamically tunes the reward function of the reinforcement learning agent downstream. In other words, the fuzzy system tells the learning agent how to weigh competing objectives like speed versus energy under the prevailing conditions. In dense rush-hour traffic the reward weighting shifts one way; on a quiet late-night corridor it shifts another. This adaptivity is what the authors call the framework’s energy-aware conscience.

At the heart of the decision engine sits a Duelling Double Deep Q-Network, commonly abbreviated D3QN, running independently at each Road Side Unit. Deep Q-networks learn a value function that estimates the long-term benefit of each possible action, here meaning which offloading target should receive a given task. The duelling architecture separates the estimation of the overall value of a state from the relative advantage of each action, which improves learning stability, while the double Q-learning trick decouples action selection from action evaluation to dampen the overestimation bias that plagues standard Q-learning. Crucially, the D3QN agents in EFF-FedRL are equipped with an energy-aware reward mechanism tailored to the traffic scenario identified by the fuzzy layer, so each RSU’s agent learns offloading policies that reflect the specific energy and latency trade-offs of its own environment rather than a one-size-fits-all average.

Privacy protection enters through federated learning. Rather than shipping raw task and traffic data to a central server, each RSU trains its agent locally, and only the resulting model gradients are shared. Those gradients are first protected with differential privacy, a mathematical technique that injects carefully calibrated noise so that the contribution of any single vehicle’s data cannot be reverse-engineered, and then aggregated using the FedAvg algorithm, which averages the locally updated models into a shared global model. The combined effect is that roadside units can collectively benefit from one another’s learning experience, achieving the generalization power of a centralized model, without any participant ever surrendering raw data. The authors emphasize that this design maintains meaningful privacy guarantees while imposing minimal computational overhead relative to traditional centralized training methodologies.

Validation was carried out with a simulation stack that researchers in the connected-vehicle community regard as a de facto standard. Traffic mobility was generated with SUMO, the Simulation of Urban MObility package, version 1.18.0, integrated with the Veins framework, version 5.2, running on OMNeT++ version 6.0. Importantly, the mobility traces were not synthetic abstractions: they are based on a realistic six-by-six kilometer area of Bologna’s city center, drawn from the publicly available iTETRIS project and the Monaco SUMO Traffic scenario. Anchoring the experiments to real urban traffic data lends considerable weight to the reported improvements, because vehicular networks are famously sensitive to the idiosyncrasies of actual road geometry, signal timing, and driver behavior. The authors state that processed datasets and simulation scripts are available from the corresponding author upon reasonable request, and the full framework code, including the fuzzy inference engine, the PyTorch-based D3QN implementation, and the privacy-preserving federated averaging module, will be released publicly on GitHub.

The headline results speak to the framework’s practical promise. Across the simulations, EFF-FedRL cut energy consumption by 41.3 percent compared with baseline approaches, a figure with direct consequences for electric vehicle range, since every joule saved on computation is a joule available for propulsion. Latency fell by 33.8 percent, which matters enormously for delay-sensitive applications such as collision avoidance and real-time video analytics, where even tens of milliseconds can separate a safe maneuver from a dangerous one. Meanwhile, the task completion rate of 99.4 percent indicates that the energy savings did not come at the cost of leaving work undone, a trade-off that has undermined many earlier optimization schemes. The framework also preserved its privacy protections and kept computational overhead low, suggesting it could be deployed on real roadside hardware without prohibitive cost.

The significance of this work extends beyond a single set of benchmarks. Task offloading in vehicular edge computing has historically been treated as either a scheduling problem solved with heuristics or a learning problem solved with centralized deep reinforcement learning, each approach carrying well-known liabilities. Heuristics adapt poorly to shifting traffic regimes, while centralized learning creates both a privacy bottleneck and a communication burden. By combining a fuzzy perception layer with federated reinforcement learning, EFF-FedRL sketches a blueprint for edge intelligence that is simultaneously adaptive, energy-conscious, and privacy-preserving. The work sits within a rapidly growing literature; the authors’ references span surveys of vehicular edge computing and networking, differentially private federated learning for the Internet of Vehicles, fuzzy-logic-assisted Q-learning for 6G V2X resource allocation, and energy-aware federated methods for edge computing, positioning the study at the confluence of several active research streams.

Challenges remain before such systems reach production. The results derive from simulation, however realistic the underlying traces, and real deployments will add radio interference, hardware heterogeneity, and adversarial conditions that no simulator fully captures. Differential privacy inevitably involves a trade-off between privacy budgets and model accuracy, and the optimal calibration for live traffic systems remains an open question. Nevertheless, the direction is clear. As autonomous driving and connected vehicle services proliferate, the demand for distributed, energy-efficient, privacy-respecting computation at the network edge will only intensify. EFF-FedRL demonstrates that machines can learn to make energy-wise offloading decisions collectively, locally, and discreetly, and it offers a compelling preview of how the smart cities of the coming decade may manage the computational life of their streets. The research was supported by the Education Department of Hunan Province and the Guiding Science and Technology Plan Project of Changsha City.

Subject of Research: Energy-conscious task offloading in vehicular edge computing using adaptive fuzzy logic and federated deep reinforcement learning

Article Title: Energy-conscious task offloading for vehicular edge computing via adaptive fuzzy logic and federated learning

Article References: Liu, X., Liu, F., Shao, S., & Li, E. (2026). Energy-conscious task offloading for vehicular edge computing via adaptive fuzzy logic and federated learning. Cluster Computing, 29(13), Article 778. https://doi.org/10.1007/s10586-026-06618-4

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06618-4

Keywords: vehicular edge computing, task offloading, energy efficiency, fuzzy logic, federated learning, deep reinforcement learning, D3QN, differential privacy, FedAvg, roadside units, SUMO simulation, intelligent transportation