NJNastooh Taheri Javan

Nastooh Taheri Javan

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Nastooh Taheri Javan has a total of 34 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    RMEFL: A Matrix-Based Framework for Real-Time Client Contribution Evaluation in Federated Learning

    by Nastooh Taheri Javan

    Federated learning (FL) enables collaborative training of a global model across distributed clients while preserving data privacy. A central challenge in FL is to accurately evaluate client contributions in order to ensure convergence toward highquality global solutions. This challenge is commonly addressed through cooperative game-theoretic approaches, most notably the Shapley value, or through empirical strategies such as leave-oneout (LOO) evaluation. Although Shapley value-based methods provide a principled foundation for contribution assessment, their exponential computational complexity, O(2 K), makes them impractical for real-world, large-scale FL systems. The leaveone-out strategy offers a more tractable alternative; however, it introduces significant retraining overhead. In this paper, we propose RMEFL, a matrix-based framework that efficiently captures all leave-one-out scenarios in a single training pass, eliminating the need for repeated retraining. RMEFL constructs a structured gradient interaction matrix that models client update relationships, and further applies spectral analysis to reveal geometric diversity and pairwise alignment among client gradients. This design enables principled and computationally efficient client selection while preserving training stability. Extensive experiments across diverse heterogeneity settings-including homogeneous data, class imbalance, data quantity variation, and combined non-IID scenarios-demonstrate that RMEFL outperforms most of the evaluated approaches. In terms of contribution estimation accuracy, RMEFL improves cosine similarity by 13.8%-49.4%, reduces Euclidean estimation error by 16.6%-34.4%, and lowers maximum deviation by 3.9%-36.6% compared to recent methods. Moreover, it reduces final training loss by 6.2%-29.9% and achieves up to 3.4% higher test accuracy, while maintaining significantly lower computational overhead.

  • Open Access

    EDAP: An Efficient Data-gathering Protocol for Wireless Sensor Networks

    by Arash Nasiri Eghbali, Nastooh Taheri Javan, Mehdi Dehghan

    Directed Diffusion (DD), uses mechanisms such as data aggregation and in-network processing to suppress the additional data overhead however there is no guarantee that paths from nearby sources join after a few hops. Also for path construction, each source floods a distinct exploratory data (ED) packet through the network which is not necessary for nearby sources. In this paper an efficient data-gathering protocol (EDAP) is proposed to address the problems of late-aggregation and distinct ED-flooding through using a virtual sink (VS) node nearby the sources which plays the role of sink node and broadcasts local interest messages and routed gathered data toward destination. Also in this protocol, multiple paths are constructed between virtual sink and the sink node which leads to load-balancing and increase in the lifetime of the network nodes. Our routing protocol can produce more than one disjoint or braided path and spread the gathered data properly between constructed paths according to their length and remaining energy. Simulation results shows that in this way a significant amount of energy can be saved and the network lifetime will be increased considerably (up to 75% better than DD).

  • Open Access

    A Mobile Agent-Based Hierarchical Reinforcement Learning Framework for Energy-Balanced Data Collection and Wireless Charging in WSNs

    by Nastooh Taheri Javan, Ali Heidaripour

    Energy imbalance remains a key challenge in Wireless Sensor Networks (WSNs), as nodes near the base station deplete their energy faster due to heavy forwarding loads. While mobile agents (MAs) have been employed for either data collection or sensor charging, existing approaches lack adaptability and fail to integrate both functions under realistic hardware constraints. This paper introduces a unified mobile agent framework that performs both data collection and wireless charging sequentially under single-antenna limitations. The agent's decision-making is formulated as a two-layer Hierarchical Reinforcement Learning (HRL) problem, where the upper layer optimizes movement planning and the lower layer determines the appropriate service based on real-time network states. This hierarchical structure enables the agent to learn adaptive task scheduling policies without predefined rules. Extensive simulations demonstrate that the proposed method achieves up to 15% longer network lifetime and more balanced energy distribution compared with state-of-the-art mobile agent and deep RL approaches.

  • Open Access

    Mobility Enhancement of Patients Body Monitoring based on WBAN with Multipath Routing

    by Nastooh Taheri Javan

    One of the promising applications of wireless sensor networks (WSNs) is monitoring of the human body for health concerns. For this purpose, a large number of small sensors are implanted in the human body. These sensors altogether provide a network of wireless sensors (WBANs) and monitor the vital signs and signals of the human body; these sensors will then send this information to the doctor. The most important application of the WBAN is the implementation of the monitoring network for patient safety in the hospital environment. In this case, supporting patients' mobility is one of the basic needs, which has been underestimated in recent studies. The problem that involves providing the required energy for the units used in this type of network is challenging; for this reason, sent/ received units with very low power consumption and with a very small radius are used in order to save energy. The resulting small sending range, leads to the lack of support for patients' mobility. In this paper, the AD HOC mode is suggested for use to establish a network and a multi-path routing algorithm, for the purpose of importing patients' mobility in hospital setting. The results of the simulation show that in addition to supporting patients' mobility, the use of the proposed idea instead of previously presented protocols, reduces delays in data transmission and energy consumption; and it also increases the delivery rate depending on the destination and the lifetime of the network, while on the other hand, it increases routing overhead.

  • Open Access

    Enhancing Malicious Code Detection With Boosted N-Gram Analysis and Efficient Feature Selection

    by Nastooh Taheri Javan

    A fundamental challenge in virology research lies in effectively detecting malicious code. N-gram analysis has become a cornerstone technique, but selecting the most informative features, especially for longer n-grams, remains crucial for efficient detection. This paper addresses this challenge by introducing a novel feature extraction method that leverages both adjacent and non-adjacent bi-grams, providing a richer set of information for malicious code identification. Additionally, we propose a computationally efficient feature selection approach that utilizes a genetic algorithm combined with Boosting principles. Our experimental results show that this detection system significantly outperforms existing methods in virus detection accuracy. The system improves detection accuracy by 15% and reduces false positives by 20% compared to traditional n-gram techniques. Additionally, it cuts computational overhead by about 30%, making it suitable for real-time applications. These advancements demonstrate the effectiveness and practicality of our approach. Future research will focus on applying our methods to polymorphic viruses and other malware to further enhance their robustness and applicability.

  • Open Access

    Trustworthy Mobile Edge Caching: A Blockchain Approach to Mitigate Malicious Nodes and Incentivize Cache Sharing

    by Motahare Ebrahimi, Nastooh Taheri Javan, Seyedakbar Mostafavi, Fatemeh Pakzaban

    As mobile network traffic continues to grow, content caching on edge servers is critical for reducing latency. However, challenges such as malicious edge servers that may delete or manipulate cached content, along with the limited capacity of these servers, need to be addressed. To overcome the capacity limitations, helper mobile nodes can contribute their cache resources. However, due to their selfish behavior, an incentive mechanism is necessary to encourage resource sharing. Additionally, these helper nodes can also be malicious. This paper proposes a blockchain-based trust management mechanism that addresses these challenges by accurately identifying trustworthy edge servers and mobile nodes. The proposed mechanism calculates both direct and indirect trust using smart contracts, ensuring that malicious nodes are effectively filtered out. Trustworthiness is determined based on mobile node satisfaction with the quality of service, and trust data is securely stored on the blockchain. To combat node selfishness, a reward mechanism is introduced to incentivize cache sharing. Furthermore, a blockchain-based authentication mechanism protects against node impersonation. Our approach optimizes trust, cache capacity, and cost efficiency while considering mobile node mobility, energy consumption, and computational power constraints during the consensus process. Simulation results show that the proposed method can accurately distinguish between honest and malicious servers, even with a 10% noise in data.

  • Trustworthy mobile edge caching: a blockchain approach to mitigate malicious nodes and incentivize cache sharing

    by Motahare Ebrahimi, Nastooh Taheri Javan, Seyedakbar Mostafavi, Fatemeh Pakzaban