Seyyed Amir Asghari
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
Seyyed Amir Asghari has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Mohammadreza Binesh Marvasti
Kharazmi University
4 shared publications - Amir M. Rahmani
University of California, Irvine, Irvine, California, USA
2 shared publications Mohammadreza Binesh Marvasti
Department of Electrical and Computer Engineering, Kharazmi University, Tehran, Iran
2 shared publications- Morteza Nabavi
Department of Electrical and Computer Engineering, Polytechnique Montral, Montreal, QC, Canada
2 shared publications - Yvon Savaria
Department of Electrical Engineering, Polytechnique Montreal, Montreal, QC H3T lJ4, Canada
2 shared publications - Ali Forghani Elah Abadi
Department of Electrical and Computer Engineering, Kharazmi University, Tehran, Iran
1 shared publication
Latest Publications
- Open Access
- 5 September 2026
- Published by Elsevier in SSRN Electronic Journal
Cluster Stabilization and Cluster Head Oscillation Reduction Protocol for Stable Vehicular Ad Hoc Networks
Vehicular Ad Hoc Networks (VANETs) represent a transformative technology that optimizes traffic flow, enables efficient communication, and enhances road safety. However, their highly dynamic nature and rapid changes in vehicle mobility present significant challenges for maintaining reliable communication. Clusters have been perceived as a solution; however, some disadvantages of common clustering algorithms include excessive cluster head (CH) alterations and unstable cluster membership, which reduce network efficiency. In this paper, we design a novel rule-based clustering algorithm, CORP (Cluster-head Oscillation Reduction Protocol with Sustained Throughput), to reduce CH changes while improving network efficiency and topology stability in vehicular networks. CORP introduces: a weight formula to measure the reliability score of each vehicle to become a CH, a CH selection mechanism based on the previous behavioral history to decrease unnecessary CH transmutations, a K-means algorithm with the silhouette score to dynamically determine the optimal number of clusters, and a variance-based adaptive mechanism for splitting large clusters with stability-based boundary CH to achieve sufficient connectivity. The performance of the CORP was measured using SUMO-generated mobility traces under both highway and intersection scenarios with different vehicle densities. The results indicates agaings four state-of-the-art clustering protocols, including IMICLiVAN, EKSGA, Zone, and DNoV. Simulation outcomes show that the proposed solution significantly lowers the rate of cluster head switching, extends cluster lifetime, and improves throughput while maintaining competitive packet delivery performance with limited control overhead. These findings indicate that CORP provides a more stable and efficient clustering solution for highly dynamic vehicular networks.
- 5 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessCluster Stabilization and Cluster Head Oscillation Reduction Protocol for Stable Vehicular Ad Hoc Networks
Vehicular Ad Hoc Networks (VANETs) represent a transformative technology that optimizes traffic flow, enables efficient communication, and enhances road safety. However, their highly dynamic nature and rapid changes in vehicle mobility present significant challenges for maintaining reliable communication. Clusters have been perceived as a solution; however, some disadvantages of common clustering algorithms include excessive cluster head (CH) alterations and unstable cluster membership, which reduce network efficiency. In this paper, we design a novel rule-based clustering algorithm, CORP (Cluster-head Oscillation Reduction Protocol with Sustained Throughput), to reduce CH changes while improving network efficiency and topology stability in vehicular networks. CORP introduces: a weight formula to measure the reliability score of each vehicle to become a CH, a CH selection mechanism based on the previous behavioral history to decrease unnecessary CH transmutations, a K-means algorithm with the silhouette score to dynamically determine the optimal number of clusters, and a variance-based adaptive mechanism for splitting large clusters with stability-based boundary CH to achieve sufficient connectivity. The performance of the CORP was measured using SUMO-generated mobility traces under both highway and intersection scenarios with different vehicle densities. The results indicates agaings four state-of-the-art clustering protocols, including IMICLiVAN, EKSGA, Zone, and DNoV. Simulation outcomes show that the proposed solution significantly lowers the rate of cluster head switching, extends cluster lifetime, and improves throughput while maintaining competitive packet delivery performance with limited control overhead. These findings indicate that CORP provides a more stable and efficient clustering solution for highly dynamic vehicular networks.
- 18 January 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (2) , 1-23
Improve accuracy in CNNs while using approximate computing methods
- 18 January 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (2) , 1-23
Improve accuracy in CNNs while using approximate computing methods
- Open Access
- 1 January 2025
- Published by KMAN Publication Incorporation in Management Strategies and Engineering Sciences
- Vol. 7 (4) , 81-95
A Review of Game Theory-Based Trust Modeling Approaches in Infrastructure-Free Social Networks
This study aims to review and classify game theory-based trust modeling approaches in infrastructure-free social networks, highlighting their mechanisms, applications, and limitations. A narrative review methodology with a descriptive analysis approach was employed to examine peer-reviewed literature published between 2015 and 2025. The review focused on trust modeling strategies within infrastructure-free networks such as MANETs, VANETs, DTNs, and UAV/IoT systems. Game-theoretic models were categorized into non-cooperative, cooperative, evolutionary, and Bayesian/repeated frameworks. Relevant articles were identified through targeted searches in leading academic databases using defined inclusion criteria. The models were compared based on theoretical assumptions, game mechanisms, trust evaluation metrics, scalability, computational overhead, and security resilience. Non-cooperative models prioritize individual rationality and minimal overhead but struggle against strategic deception. Cooperative models emphasize coalition formation and fairness in resource sharing, offering improved trust propagation at the cost of increased communication. Evolutionary approaches enable adaptation and learning through repeated interactions but require longer convergence times. Repeated and Bayesian games facilitate historical learning and probabilistic trust estimation, showing strong potential in dynamic and uncertain environments. Across all types, trade-offs were observed between robustness, scalability, and complexity. Key challenges identified include computational cost, dynamic topology, vulnerability to collusion, and limited real-world deployment. The integration of AI, privacy-preserving mechanisms, and cross-layer modeling remains underexplored but promising. Game theory offers a versatile and strategic foundation for trust modeling in decentralized, infrastructure-free networks. While existing models address various trust challenges effectively, further research is needed to enhance scalability, incorporate intelligent adaptation, and ensure practical deployment in real-world applications. The future lies in hybrid, context-aware, and privacy-focused trust systems that combine the strengths of game-theoretic reasoning with emerging technologies.
- 1 January 2025
- Published by KMAN Publication Incorporation in Management Strategies and Engineering Sciences
- Vol. 7 (4) , 81-95
Open AccessA Review of Game Theory-Based Trust Modeling Approaches in Infrastructure-Free Social Networks
This study aims to review and classify game theory-based trust modeling approaches in infrastructure-free social networks, highlighting their mechanisms, applications, and limitations. A narrative review methodology with a descriptive analysis approach was employed to examine peer-reviewed literature published between 2015 and 2025. The review focused on trust modeling strategies within infrastructure-free networks such as MANETs, VANETs, DTNs, and UAV/IoT systems. Game-theoretic models were categorized into non-cooperative, cooperative, evolutionary, and Bayesian/repeated frameworks. Relevant articles were identified through targeted searches in leading academic databases using defined inclusion criteria. The models were compared based on theoretical assumptions, game mechanisms, trust evaluation metrics, scalability, computational overhead, and security resilience. Non-cooperative models prioritize individual rationality and minimal overhead but struggle against strategic deception. Cooperative models emphasize coalition formation and fairness in resource sharing, offering improved trust propagation at the cost of increased communication. Evolutionary approaches enable adaptation and learning through repeated interactions but require longer convergence times. Repeated and Bayesian games facilitate historical learning and probabilistic trust estimation, showing strong potential in dynamic and uncertain environments. Across all types, trade-offs were observed between robustness, scalability, and complexity. Key challenges identified include computational cost, dynamic topology, vulnerability to collusion, and limited real-world deployment. The integration of AI, privacy-preserving mechanisms, and cross-layer modeling remains underexplored but promising. Game theory offers a versatile and strategic foundation for trust modeling in decentralized, infrastructure-free networks. While existing models address various trust challenges effectively, further research is needed to enhance scalability, incorporate intelligent adaptation, and ensure practical deployment in real-world applications. The future lies in hybrid, context-aware, and privacy-focused trust systems that combine the strengths of game-theoretic reasoning with emerging technologies.
- 27 July 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80 (2) , 2128-2163
A stochastic multi-objective optimization method for railways scheduling: a NSGA-II-based hybrid approach
- 27 July 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80 (2) , 2128-2163
A stochastic multi-objective optimization method for railways scheduling: a NSGA-II-based hybrid approach
- 7 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Canadian Journal of Electrical and Computer Engineering
- Vol. 45 (3) , 318-327
Silent Data Corruption Estimation and Mitigation Without Fault Injection
Silent data corruptions (SDCs) have been always regarded as the serious effect of radiation-induced faults. Traditional solutions based on redundancies are very expensive in terms of chip area, energy consumption, and performance. Consequently, providing low-cost and efficient approaches to cope with SDCs has received researchers’ attention more than ever. On the other hand, identifying SDC-prone data and instruction in a program is a very challenging issue, as it requires time-consuming fault injection processes into different parts of a program. In this article, we present a cost-efficient approach to detecting and mitigating the rate of SDCs in the whole program with the presence of multibit faults without a fault injection process. This approach uses a combination of machine learning and a metaheuristic algorithm that predicts the SDC event rate of each instruction. The evaluation results show that the proposed approach provides a high level of detection accuracy of 99% while offering a low-performance overhead of 58%.
- 7 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Canadian Journal of Electrical and Computer Engineering
- Vol. 45 (3) , 318-327
Silent Data Corruption Estimation and Mitigation Without Fault Injection
Silent data corruptions (SDCs) have been always regarded as the serious effect of radiation-induced faults. Traditional solutions based on redundancies are very expensive in terms of chip area, energy consumption, and performance. Consequently, providing low-cost and efficient approaches to cope with SDCs has received researchers’ attention more than ever. On the other hand, identifying SDC-prone data and instruction in a program is a very challenging issue, as it requires time-consuming fault injection processes into different parts of a program. In this article, we present a cost-efficient approach to detecting and mitigating the rate of SDCs in the whole program with the presence of multibit faults without a fault injection process. This approach uses a combination of machine learning and a metaheuristic algorithm that predicts the SDC event rate of each instruction. The evaluation results show that the proposed approach provides a high level of detection accuracy of 99% while offering a low-performance overhead of 58%.
- Open Access
- 13 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 44123-44135
RLBEEP: Reinforcement-Learning-Based Energy Efficient Control and Routing Protocol for Wireless Sensor Networks
One of the most important topics in the field of wireless sensor networks is the development of approaches to improve network lifetime. In this paper, an energy-efficient control and routing protocol for wireless sensor networks is presented. This algorithm is based on reinforcement learning for energy management in the network. This protocol seeks to optimize routing policies to maximize the long-term reward received by each node, using reinforcement learning, which is a machine learning approach. In order to improve the lifetime of wireless sensor network, three energy management approaches have been proposed. The first approach is to navigate correctly using reinforcement learning to reduce the length of the routes and to improve energy consumption. The second approach is to exploit a sleep scheduling technique to improve node energy consumption. The last approach is used to restrict data transmission of each node based on the received data change rate. Simulation results show that in terms of network lifespan, the proposed method significantly outperforms previous reported methods.
- 13 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 44123-44135
Open AccessRLBEEP: Reinforcement-Learning-Based Energy Efficient Control and Routing Protocol for Wireless Sensor Networks
One of the most important topics in the field of wireless sensor networks is the development of approaches to improve network lifetime. In this paper, an energy-efficient control and routing protocol for wireless sensor networks is presented. This algorithm is based on reinforcement learning for energy management in the network. This protocol seeks to optimize routing policies to maximize the long-term reward received by each node, using reinforcement learning, which is a machine learning approach. In order to improve the lifetime of wireless sensor network, three energy management approaches have been proposed. The first approach is to navigate correctly using reinforcement learning to reduce the length of the routes and to improve energy consumption. The second approach is to exploit a sleep scheduling technique to improve node energy consumption. The last approach is used to restrict data transmission of each node based on the received data change rate. Simulation results show that in terms of network lifespan, the proposed method significantly outperforms previous reported methods.
- 1 January 2022
- Published by Zarqa University in The International Arab Journal of Information Technology
- Vol. 19 (4) , 652-659
An Improved Process Supervision and Control Method for Malware Detection
- 1 January 2022
- Published by Zarqa University in The International Arab Journal of Information Technology
- Vol. 19 (4) , 652-659
An Improved Process Supervision and Control Method for Malware Detection
- Open Access
- 27 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 4934-4947
IBU: An In-Block Update Address Mapping Scheme for Solid-State Drives
One of the most important features of solid-state drives (SSDs) is the ability to update data sectors out of place, performing garbage collection operations within its physical blocks, to mitigate limited flash memory lifespan. In SSDs, a firmware called the Flash Translation Layer (FTL) is used to hide such features from the operating system. One way to extend the lifespan of flash memory is to use data compression at the FTL level. In compression-based FTLs, the address mapping type has a significant effect on the efficiency and read/write speed. The type of address mapping in previous similar schemes is based on page-level address translation and requires high memory for the mapping table. In this paper, we propose a compression-based hybrid FTL called In Block Update Address Mapping, in which the pages of each logical block are compressed, and fewer physical pages are written in physical blocks. Therefore, a small number of free pages remain. In the proposed scheme, the required memory of the mapping table has been reduced by 78% when compared to similar schemes. Moreover, extensive simulation results reported in this paper show that the proposed FTL scheme outperforms other FTL schemes in the read and write operations under realistic benchmark workloads.
- 27 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 4934-4947
Open AccessIBU: An In-Block Update Address Mapping Scheme for Solid-State Drives
One of the most important features of solid-state drives (SSDs) is the ability to update data sectors out of place, performing garbage collection operations within its physical blocks, to mitigate limited flash memory lifespan. In SSDs, a firmware called the Flash Translation Layer (FTL) is used to hide such features from the operating system. One way to extend the lifespan of flash memory is to use data compression at the FTL level. In compression-based FTLs, the address mapping type has a significant effect on the efficiency and read/write speed. The type of address mapping in previous similar schemes is based on page-level address translation and requires high memory for the mapping table. In this paper, we propose a compression-based hybrid FTL called In Block Update Address Mapping, in which the pages of each logical block are compressed, and fewer physical pages are written in physical blocks. Therefore, a small number of free pages remain. In the proposed scheme, the required memory of the mapping table has been reduced by 78% when compared to similar schemes. Moreover, extensive simulation results reported in this paper show that the proposed FTL scheme outperforms other FTL schemes in the read and write operations under realistic benchmark workloads.
- 16 March 2020
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 76 (12) , 10186-10211
A novel method for victim block selection for NAND flash-based solid state drives based on scoring
- 16 March 2020
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 76 (12) , 10186-10211
A novel method for victim block selection for NAND flash-based solid state drives based on scoring
- Open Access
- 1 January 2020
- Published by Tech Science Press in Computer Systems Science and Engineering
- Vol. 35 (2) , 69-79
A Model to Create Organizational Value with Big Data Analytics
Value creation is a major factor not only in the sustainability of organizations but also in the maximization of profit, customer retention, business goals fulfillment, and revenue. When the value is intended to be created from Big Data scenarios, value creation entails being understood over a broader range of complexity. A question that arises here is how organizations can use this massive quantity of data and create business value? The present study seeks to provide a model for creating organizational value using Big Data Analytics (BDA). To this end, after reviewing the related literature and interviewing experts, the BDA-based organizational value creation model is developed. Accordingly, five hypotheses are formulated, and a questionnaire is prepared. Then, the respective questionnaire is given to the research statistical population (i.e., IT managers and experts, particularly those specializing in data analysis) to test the research hypotheses. In next phase, connections between model variables are scrutinized using the structural equation modeling (measurement and structural models). The results of the study indicate that investigating the infrastructures of the Big Data Analytics, as well as the capabilities of the organization and those of Big Data Analytics is the initial requirement to create organizational value using BDA. Thereby, the Big Data Analytics strategy is formulated, and ultimately, the organizational value is created as well.
- 1 January 2020
- Published by Tech Science Press in Computer Systems Science and Engineering
- Vol. 35 (2) , 69-79
Open AccessA Model to Create Organizational Value with Big Data Analytics
Value creation is a major factor not only in the sustainability of organizations but also in the maximization of profit, customer retention, business goals fulfillment, and revenue. When the value is intended to be created from Big Data scenarios, value creation entails being understood over a broader range of complexity. A question that arises here is how organizations can use this massive quantity of data and create business value? The present study seeks to provide a model for creating organizational value using Big Data Analytics (BDA). To this end, after reviewing the related literature and interviewing experts, the BDA-based organizational value creation model is developed. Accordingly, five hypotheses are formulated, and a questionnaire is prepared. Then, the respective questionnaire is given to the research statistical population (i.e., IT managers and experts, particularly those specializing in data analysis) to test the research hypotheses. In next phase, connections between model variables are scrutinized using the structural equation modeling (measurement and structural models). The results of the study indicate that investigating the infrastructures of the Big Data Analytics, as well as the capabilities of the organization and those of Big Data Analytics is the initial requirement to create organizational value using BDA. Thereby, the Big Data Analytics strategy is formulated, and ultimately, the organizational value is created as well.