Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Elyas Oustad

dblp:394/1236 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2026
0009-0006-1456-356XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Edge and fog computing · 50% Internet of things and sensor networks · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › energy efficiency
energy-efficient scheduling
0.912025
DIST: Distributed Learning-Based Energy-Efficient and Reliable Task Scheduling and Resource Allocation in Fog Computing · IEEE Trans. Serv. Comput. 2025
Edge and fog computing
task scheduling and resource allocation
0.912025
DIST: Distributed Learning-Based Energy-Efficient and Reliable Task Scheduling and Resource Allocation in Fog Computing · IEEE Trans. Serv. Comput. 2025
Distributed systems › distributed machine learning
distributed reinforcement learning
0.312025
DIST: Distributed Learning-Based Energy-Efficient and Reliable Task Scheduling and Resource Allocation in Fog Computing · IEEE Trans. Serv. Comput. 2025

Methods — techniques the papers use, named apart from their topics

dynamic voltage and frequency scaling · 1.7distributed q-learning · 1.7
YearPublicationVenuePosition
2026 MOFCO: Mobility- and Migration-Aware Task Offloading in Three-Layer Fog Computing Environments
abstract
Task offloading in three-layer fog computing environments presents a critical challenge due to user equipment (UE) mobility, which frequently triggers costly service migrations and degrades overall system performance. This paper addresses this problem by proposing MOFCO, a novel Mobility- and Migration-aware Task Offloading algorithm for Fog Computing environments. The proposed method formulates task offloading and resource allocation as a Mixed-Integer Nonlinear Programming (MINLP) problem and employs a heuristic-aided evolutionary game theory approach to solve it efficiently. To evaluate MOFCO, we simulate mobile users using SUMO, providing realistic mobility patterns. Experimental results show that MOFCO reduces system cost—defined as a combination of latency and energy consumption—by an average of 23% and up to 67% in certain scenarios compared to state-of-the-art methods.
Soheil Mahdizadeh, Elyas Oustad, Mohsen Ansari
IEEE Internet Things J.2
2025 DIST: Distributed Learning-Based Energy-Efficient and Reliable Task Scheduling and Resource Allocation in Fog Computing
abstract
This paper presents DIST, a novel distributed reinforcement learning-based (DRL) framework for energyefficient and reliable task scheduling and resource allocation in fog computing, low-latency computing solutions driven by the rapid deployment of IoT devices, and time-sensitive applications. DIST is built based on a novel distributed Q-learning to enable fog nodes to learn an optimal strategy to balance energy consumption, task execution time, and system reliability. The main novelty includes a cooperative Dynamic Voltage and Frequency Scaling-enabled task scheduling policy that dynamically adjusts node energy level to ensure power consumption reduction without sacrificing deadline adherence or reliability. The results demonstrate that DIST reduces energy consumption by up to 52.26%, realizes 38% higher success rates, and reduces task wait times by up to 46.77%, compared with state-of-the-art algorithms.
Elyas Oustad, Abolfazl Younesi, Mohsen Ansari, Sepideh Safari, Mohammad Arman Soleimani, Jörg Henkel, Alireza Ejlali
IEEE Trans. Serv. Comput.1
2025 MoTiCPS: Energy Optimization on Multi-Objective Task Scheduling in IoT-Integrated Cyber-Physical Systems
abstract
Fog computing enhances cyber-physical systems (CPS) by processing data closer to the network edge. However, the performance of fog nodes is critical for maintaining system responsiveness and quality of service (QoS). This paper introduces MoTiCPS, a novel task scheduling and resource allocation method built on the Osprey Optimization Algorithm (OOA). MoTiCPS improves task reliability and balances resource use across edge devices, optimizing fog node performance under real-time constraints. Simulation results show that MoTiCPS increases task success rates by 32% and reduces energy consumption by 39%, significantly outperforming benchmark methods. These improvements highlight MoTiCPS's potential to enhance the efficiency and scalability of CPSs in various application domains.
Abolfazl Younesi, Elyas Oustad, Mohammad Abolnejadian, Mohsen Ansari, Alireza Ejlali
IEEE Trans. Sustain. Comput.2
2024 LANTERN: Learning-Based Routing Policy for Reliable Energy-Harvesting IoT Networks
abstract
RPL is introduced to conduct path selection in Low-power and Lossy Networks (LLN), including IoT. A routing policy in RPL is governed by its objective function, which corresponds to the requirements of the IoT application, e.g., energy-efficiency, and reliability in terms of Packet Delivery Ratio (PDR). In many applications, it is not possible to connect the nodes to the power outlet. Also, since nodes may be geographically inaccessible, replacing the depleted batteries is infeasible. Hence, harvesters are an admirable replacement for traditional batteries to prevent energy hole problem, and consequently to enhance the lifetime and reliability of IoT networks. Nevertheless, the unstable level of energy absorption in harvesters necessitates developing a routing policy, which could consider harvesting aspects. Furthermore, since the rates of absorption, and consumption are incredibly dynamic in different parts of the network, learning-based techniques could be employed in the routing process to provide energy-efficiency. Accordingly, this paper introduces LANTERN; a learning-based routing policy for improving PDR in energy-harvesting IoT networks. In addition to the rate of energy absorption, and consumption, LANTERN utilizes the remaining energy in its routing policy. In this regard, LANTERN introduces a novel routing metric called Energy Exponential Moving Average (EEMA) to perform its path selection. Based on diversified simulations conducted in Cooja, with prolonging the lifetime of the network by$5.7\times $, and mitigating the probability of energy hole problem, LANTERN improves the PDR by up to 97%, compared to the state-of-the-art. Also, the consumed energy per successfully delivered packet is reduced by 76%.
Hossein Taghizadeh, Bardia Safaei 0001, Amir Mahdi Hosseini Monazzah, Elyas Oustad, Sahar Rezagholi Lalani, Alireza Ejlali
IEEE Trans. Netw. Serv. Manag.4