AMAmir Mahdi Hosseini Monazzah

Amir Mahdi Hosseini Monazzah

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Amir Mahdi Hosseini Monazzah has a total of 68 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Convolutional Neural Network-Based Workload and Resource-Aware Task Management in Fog Networks

    by Mahdi Siamaki, Bardia Safaei, Amir Mahdi Hosseini Monazzah, Alireza Ejlali

    As latency-sensitive IoT applications proliferate, fog computing must meet stringent real-time requirements by performing computation near the edge. However, existing task assignment and offloading approaches are predominantly reactive, relying on current system states without anticipating future load fluctuations—leading to frequent congestion, suboptimal resource utilization, and missed task deadlines under bursty workloads. Although a few studies have explored workload prediction, most employ simplistic statistical models or heavy recurrent networks (e.g., LSTM) that are unsuitable for real-time deployment on resource-constrained fog nodes. To address these limitations, this paper introduces Convolutional Assignment Strategy for Tasks (CAST), a Convolutional Neural Network (CNN)-based, predictive task assignment framework designed for resource-constrained fog networks, enabling proactive, deadline-aware, and load-balanced decision-making. CAST operates within a three-layer architecture consisting of IoT devices, fog nodes, and a centralized controller. At the IoT layer, tasks are executed locally or offloaded to fog nodes based on task size, deadline, and device constraints. Fog nodes queue tasks using Earliest Deadline First (EDF) scheduling while periodically reporting workload to the controller. The centralized controller predicts future workload using a CNN trained on time-series workload matrices representing all fog nodes. Unlike Recurrent Neural Networks (RNNs) or Transformers, which incur higher computational latency due to sequential processing or quadratic self-attention complexity, the CNN leverages the spatio-temporal grid of workload matrices to efficiently extract hierarchical features capturing both temporal dynamics and spatial correlations between nodes. Its computational efficiency and parallelizable nature make it suitable for real-time execution on resource-constrained networks. Predicted workloads guide the controller in classifying nodes as crowded or uncrowded, enabling deadline-aware task assignment and dynamic load balancing. Tasks are then offloaded among fog nodes or, if necessary, to the cloud to prevent congestion, minimize queuing delays, and maximize the number of tasks completed within their deadlines. CAST is a robust mechanism, because the CNN model can be periodically retrained to adapt to evolving workload patterns. Simulation results show that CAST reduces average task response time by 30%, improves the deadline-hit ratio by 48%, and achieves more balanced workload distribution compared to state-of-the-art heuristic and modern Deep Reinforcement Learning (DRL) baselines, while maintaining low prediction and decision overhead. Furthermore, Pareto efficiency analysis confirms that CAST represents the optimal solution for latency-critical applications, occupying the high-performance frontier compared to energy-conservative baselines.


  • Open Access

    FUSION: A Fuzzy-Based Multi-Objective Task Management for Fog Networks

    by Arya Motamedhashemi, Bardia Safaei, Amir Mahdi Hosseini Monazzah, Jörg Henkel, Alireza Ejlali

    While the Guarantee Ratio (GR) is critically important in delay-sensitive fog applications, the existing deadline-aware task assignment strategies prioritize the balance of utilization over this criterion. Therefore, this paper introduces FUSION: a fuzzy-based task management policy, which provides a high GR with the least possible makespan. FUSION considers the effect of propagation, uplink/downlink delays, and also the bandwidth between the layers on the tasks’ completion time during offloading. It benefits from a fuzzy offloader, along with a VM-ranking strategy based on a fuzzy quantified proposition. Hence, it uses two simple and efficient fuzzy ranking approaches, i.e., Decomposition and OWA. By employing fuzzy-based models, FUSION can handle uncertainty in rapidly changing fog environments with time-varying task sets with minimal computation complexity against existing meta-heuristic algorithms. FUSION considers tasks’ size with respect to VM’s processing capacity (MIPS), arrival rate, length, deadline, processing time, and execution time. In addition to VMs’ load, and busy time, FUSION considers laxity as one of its VM-ranking objectives. FUSION also conducts load-balancing, but only when it can improve the rankings to not affect the GR. Based on the iFogSim simulations, FUSION provides a higher GR in 63% of the scenarios compared to state-of-the-art. Furthermore, evaluations of the offloader algorithm indicate that FUSION provides higher GR in more than 55% of the scenarios.


  • LANTERN: Learning-Based Routing Policy for Reliable Energy-Harvesting IoT Networks

    by Hossein Taghizadeh, Bardia Safaei, Amir Mahdi Hosseini Monazzah, Elyas Oustad, Sahar Rezagholi Lalani, Alireza Ejlali

    RPL is introduced to conduct path selection in Lowpower 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, learningbased 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.7x, 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%.


  • TVTAC: Triple Voltage Threshold Approximate Cache for Energy Harvesting Nonvolatile Processors

    by Mohammad Hosseininia, Arash Salahvarzi, Amir Mahdi Hosseini Monazzah

    Energy harvesting is considered to be a substitute for batteries in many modern systems. Systems based on energy harvesting receive environmental energies from sources such as sun, radio frequency, wind, vibration, etc, and convert them to electrical energy to be used by the capacitor of the system or feed the CPS system directly. Despite its advantages, energy harvesting comes with some limitations, such as the instability of the received energy, which means that the energy may not be received for a moment due to environmental conditions during energy harvesting. Therefore, due to not receiving enough energy, the system function may face problems, which can lead to system shutdown and data loss. To prevent program execution interruption caused by frequent power interruptions in systems based on energy harvesting, these systems use NVP. Saving the state in the NVP is done through non-volatile registers and memories that can hold the contents until the power is restored. However, systems based on energy harvesting and NVPs also have challenges such as frequent backups’ energy consumption, slow program forward progress, and loss of data. In this paper, we propose TVTAC, a framework for energy harvesting-based NVP CPS systems. TVTAC modifies conventional NVP’s cache architecture to efficiently work with newly introduced operational mode to prevent unnecessary backup operations. Furthermore, TVTAC is equipped with an NVP’s specific approximation unit that controls the approximation knobs during the approximate data cache accesses in order to save more energy. The simulation results show that TVTAC improves forward progress by 28% in the best case and 12% on average, compared to similar methods. From an energy consumption perspective, TVTAC reduces energy consumption by 43.5% in the best case and 28.5% on average.

  • QUERA: Q-Learning RPL Routing Mechanism to Establish Energy Efficient and Reliable Communications in Mobile IoT Networks

    by Sahar Rezagholi Lalani, Bardia Safaei, Amir Mahdi Hosseini Monazzah, Hossein Taghizadeh, Jörg Henkel, Alireza Ejlali

    Resource-limited mobile IoT networks are a dynamic, and uncertain wireless communicating system. In such systems, the standard RPL routing protocol cannot select long-lasting communication links due to not employing mobility-aware metrics, e.g., direction and speed of movements. While several classical heuristic approaches exist to improve PDR in RPL-based mobile networks, their solutions cannot adapt to alterations of the mobile topology. Hence, in this paper, by mapping the routing problem in mobile and resource-limited networks into an infinite-time horizon MDP, an energy-aware and reliable RPL-based routing mechanism based on Q-learning is proposed to improve PDR in mobile IoT networks. This routing mechanism, which is called QUERA, utilizes mobility and quality-aware metrics, including Time-to-Reside (TTR), ETX, and RSSI. Furthermore, QUERA probes and maintains stable candidates based on its neighbor table management policy. These two aspects mitigate the need for retransmissions due to packet loss leading to less energy dissipation. According to evaluations, QUERA improves energy consumption by up to 50% against the state-of-the-art. The efficiency of QUERA is also evaluated in terms of power distribution diagram, which shows significant improvement in the lifetime of IoT devices. It has also been observed that QUERA improves PDR in mobile networks by up to 12%.


  • DATA: Throughput and Deadline-Aware Genetic Approach for Task Scheduling in Fog Networks

    by Arya Motamedhashemi, Bardia Safaei, Amir Mahdi Hosseini Monazzah, Alireza Ejlali

    Fog devices in fog computing frameworks are responsible for fetching and executing the tasks submitted by the deployed resource-constraint embedded edge devices. Based on the availability of resources, tasks are offloaded to the virtual machines hosted by the fog devices. These tasks may then get scheduled to guarantee a number of efficiency-related metrics. While throughput has a decisive impact on the timely execution of tasks, the appropriate utilization of this metric has not been considered in the existing mechanisms. In this letter, we first discuss the proper use of this objective in the fitness function of meta-heuristic algorithms. Then, we explain that adopting throughput by the fitness functions in the form of two conventionally used weighted-sum, and fractional techniques may ignore solutions with a better guarantee ratio. Consequently, we propose a novel approach called DATA to be replaced with these two old approaches. DATA is a throughput, and deadline-aware task scheduling mechanism for time-sensitive fog frameworks, which its fitness function utilizes genetic optimization by encoding the solutions into chromosomes. It uses single gene mutation and two-point crossover. In this approach, two populations are considered to search the problem space. The main population is evaluated based on the guarantee ratio, while the helper population is evaluated based on the throughput. Furthermore, the helper population uses weighted-sum. The initial population is generated randomly by the uniform distribution, to provide a load-balancing. Based on our extensive evaluations, the selected solution by DATA provides the highest guarantee ratio, while having the lowest possible makespan.


  • Introduction and Evaluation of Attachability for Mobile IoT Routing Protocols With Markov Chain Analysis

    by Bardia Safaei, Hossein Taghizade, Amir Mahdi Hosseini Monazzah, Kimia Talaei Khoosani, Parham Sadeghi, Aliasghar Mohammadsalehi, Jorg Henkel, Alireza Ejlali

    Reliability of routing mechanisms in wireless networks is typically measured with Packet Delivery Ratio (PDR). Basically, PDR is reported with an optimistic assumption that the topology is fully constructed, and the nodes have started their packet transmission. This is despite the fact that prior to being able to transmit packets, nodes must first join the network, and then try to keep connected as much as possible. This is a key factor in the overall reliability provided by the routing protocols, especially in mobile IoT applications, where disconnections occur frequently. Nevertheless, there is a lack of appropriate metrics, which could evaluate the routing mechanisms from this perspective. Accordingly, this paper introduces attachability; a new metric for evaluating the capability of routing protocols in assisting the mobile or stationary nodes in joining, and maintaining their connections to the network. Our newly proposed metric is calculated via Markov chain analysis along with the sample frequency-based estimating technique. To evaluate attachability, we have simulated a mobile IoT infrastructure, and conducted a comprehensive set of experiments on different versions of the IPv6 Routing Protocol for Low-power and lossy networks (RPL). Based on our observations, attachability is significantly dependent on the employed metrics and path selection policies in the routing mechanisms. Among the three different versions of RPL, including the original version (ORPL), which is standardized for stationary IoT applications, and two mobility-aware versions, i.e., MARPL, and OMARPL, OMARPL showed up to 42%, and 10% of improvement in terms of attachability against ORPL, and MARPL, respectively.


  • WiSE: When Learning Assists Resolving STT-MRAM Efficiency Challenges

    by Arash Salahvarzi, Mohsen Khosroanjam, Amir Mahdi Hosseini Monazzah, Hakem Beitollahi, Umit Y. Ogras, Mahdi Fazeli

    Spin Transfer Torque Magnetic RAM (STT-MRAM) is one of the most promising on-chip technologies, which delivers high density, non-volatility, and near-zero leakage power. However, STT-MRAM suffers from three reliability issues, namely, read disturbance, write failure, and retention failure, that present significant challenges to its use as a reliable on-chip memory. All of these three reliability challenges become even more threatening with any increase in STT-MRAM cell temperature. Write operations are regarded as the main source of heat generation and temperature increase in STT-MRAM on-chip memories. This paper first presents experiments to show how the heat generated by consecutive writes affects the reliability of an STT-MRAM on-chip cache. Then, it proposes the WiSE framework, an approach to reduce the STT-MRAM-based cache memory temperature and improve its reliability. WiSE utilizes the Reinforcement Learning (RL) technique to detect high-density write operation patterns in STT-MRAM cache. To manage the write operations across the STT-MRAM caches, WiSE introduces a new temperature-aware replacement policy. The simulation results show that while WiSE imposes only about 1% performance overhead, it improves retention failure rate, read disturbance rate and write failure rate by 64%, 57%, and 47%, respectively, compared to Least Recently Used (LRU) replacement policy.