Abdelfattah Amamra
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Abdelfattah Amamra has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Abdelkader Laouid
LIAP Laboratory, University of El Oued, El Oued, Algeria
1 shared publication - Adam Cheung
Department of Computer Science, California State Polytechnic University, Pomona, CA 91768, USA
1 shared publication - Ahcene Bounceur
College of Computing and Informatics, University Of Sharjah, Sharjah, United Arab Emirates
1 shared publication - Brahim Laouid
LIAP Laboratory, El Oued University, P.O. Box 789, El Oued 39000, Algeria
1 shared publication - Habib Louafi
Université du Québec
1 shared publication - Jeremy C. Anunwah
Department of Computer Science, California State Polytechnic University, Pomona, CA 91768, USA
1 shared publication
Latest Publications
- Open Access
- 12 February 2026
- Published by MDPI AG in Electronics
- Vol. 15 (4) , 786
Wavelet-Based IoT Device Fingerprinting
Accurate fingerprinting of Internet of Things (IoT) devices is essential for network security, management, and anomaly detection. Existing machine-learning-based approaches can be broadly classified into two categories. The first are time-domain-based approaches that infer device identity from aggregated traffic statistics, while effective in dense communication environments, they perform poorly for devices that generate sparse, low-volume, or irregular traffic, which restricts behavioral visibility. The second, radio frequency fingerprinting (RFF), extracts hardware-specific traits from radio frequency signals but is limited in wired or mixed-connectivity IoT networks and lacks behavioral or functional insights. To overcome these limitations, this paper proposes a hybrid fingerprinting framework that integrates network traffic analysis with frequency-domain representations using wavelet transform techniques. This approach captures both temporal and spectral characteristics, combining behavioral and structural perspectives to enable robust and accurate IoT device identification. The proposed system is evaluated on three real-world datasets under multiple experimental scenarios, including (1) device identification, (2) device type classification, (3) scalability with dataset size and complexity, and (4) performance under Distributed Denial-of-Service (DDoS) attack conditions. Experimental results show that wavelet-based features consistently outperform conventional time-domain features across all evaluation metrics, achieving higher accuracy, resilience, and generalization.
- 12 February 2026
- Published by MDPI AG in Electronics
- Vol. 15 (4) , 786
Open AccessWavelet-Based IoT Device Fingerprinting
Accurate fingerprinting of Internet of Things (IoT) devices is essential for network security, management, and anomaly detection. Existing machine-learning-based approaches can be broadly classified into two categories. The first are time-domain-based approaches that infer device identity from aggregated traffic statistics, while effective in dense communication environments, they perform poorly for devices that generate sparse, low-volume, or irregular traffic, which restricts behavioral visibility. The second, radio frequency fingerprinting (RFF), extracts hardware-specific traits from radio frequency signals but is limited in wired or mixed-connectivity IoT networks and lacks behavioral or functional insights. To overcome these limitations, this paper proposes a hybrid fingerprinting framework that integrates network traffic analysis with frequency-domain representations using wavelet transform techniques. This approach captures both temporal and spectral characteristics, combining behavioral and structural perspectives to enable robust and accurate IoT device identification. The proposed system is evaluated on three real-world datasets under multiple experimental scenarios, including (1) device identification, (2) device type classification, (3) scalability with dataset size and complexity, and (4) performance under Distributed Denial-of-Service (DDoS) attack conditions. Experimental results show that wavelet-based features consistently outperform conventional time-domain features across all evaluation metrics, achieving higher accuracy, resilience, and generalization.
- Open Access
- 15 August 2025
- Published by MDPI AG in Electronics
- Vol. 14 (16) , 3248
IoT Device Fingerprinting via Frequency Domain Analysis
The rapid proliferation of heterogeneous Internet of Things (IoT) devices has introduced a wide range of operational and security challenges, particularly in the domains of device identification and behavior profiling. Traditional fingerprinting methods, which rely primarily on time domain features, often fail to capture the complex, periodic, and often bursty nature of IoT communication—especially in environments characterized by sparse, irregular, or noisy traffic patterns. To address these limitations, two novel frequency-based fingerprinting techniques have been proposed: Spectral-Only Frequency Fingerprint (SFF) and Spectro-Correlative Frequency Fingerprint (SCFF). These approaches shift the analysis from the time domain to the frequency domain, enabling the extraction of richer and more robust behavioral signatures from network traffic. While SFF focuses on capturing the core spectral features of device traffic, SCFF extends this by incorporating inter-feature correlations, offering a more nuanced and comprehensive representation of device behavior. The effectiveness of SFF and SCFF is evaluated across multiple publicly available IoT datasets using a range of machine learning classifiers. Experimental results demonstrate that both fingerprinting methods significantly outperform traditional time domain approaches in terms of accuracy, precision, recall, and F1-score—across all tested classifiers and datasets.
- 15 August 2025
- Published by MDPI AG in Electronics
- Vol. 14 (16) , 3248
Open AccessIoT Device Fingerprinting via Frequency Domain Analysis
The rapid proliferation of heterogeneous Internet of Things (IoT) devices has introduced a wide range of operational and security challenges, particularly in the domains of device identification and behavior profiling. Traditional fingerprinting methods, which rely primarily on time domain features, often fail to capture the complex, periodic, and often bursty nature of IoT communication—especially in environments characterized by sparse, irregular, or noisy traffic patterns. To address these limitations, two novel frequency-based fingerprinting techniques have been proposed: Spectral-Only Frequency Fingerprint (SFF) and Spectro-Correlative Frequency Fingerprint (SCFF). These approaches shift the analysis from the time domain to the frequency domain, enabling the extraction of richer and more robust behavioral signatures from network traffic. While SFF focuses on capturing the core spectral features of device traffic, SCFF extends this by incorporating inter-feature correlations, offering a more nuanced and comprehensive representation of device behavior. The effectiveness of SFF and SCFF is evaluated across multiple publicly available IoT datasets using a range of machine learning classifiers. Experimental results demonstrate that both fingerprinting methods significantly outperform traditional time domain approaches in terms of accuracy, precision, recall, and F1-score—across all tested classifiers and datasets.
- Open Access
- 27 December 2024
- Published by MDPI AG in Electronics
- Vol. 14 (1) , 80
Multiple Kernel Transfer Learning for Enhancing Network Intrusion Detection in Encrypted and Heterogeneous Network Environments
Conventional supervised machine learning is widely used for intrusion detection without packet payload inspection, showing good accuracy in detecting known attacks. However, these methods require large labeled datasets, which are scarce due to privacy concerns, and struggle with generalizing to real-world traffic and adapting to domain shifts. Additionally, they are ineffective against zero-day attacks and need frequent retraining, making them difficult to maintain in dynamic network environments. To overcome the limitations of traditional machine learning methods, we propose novel Deterministic (DetMKTL) and Stochastic Multiple-Kernel Transfer Learning (StoMKTL) algorithms that are based on transfer learning. These algorithms leverage multiple kernel functions to capture complex, non-linear relationships in network traffic, enhancing adaptability and accuracy while reducing dependence on large labeled datasets. The proposed algorithms demonstrated good accuracy, particularly in cross-domain evaluations, achieving accuracy rates exceeding 90%. This highlights the robustness of the models in handling diverse network environments and varying data distributions. Moreover, our models exhibited superior performance in detecting multiple types of cyber attacks, including zero-day threats. Specifically, the detection rates reached up to 87% for known attacks and approximately 75% for unseen attacks or their variants. This emphasizes the ability of our algorithms to generalize well to novel and evolving threat scenarios, which are often overlooked by traditional systems. Additionally, the proposed algorithms performed effectively in encrypted traffic analysis, achieving an accuracy of 86%. This result demonstrates the possibility of our models to identify malicious activities within encrypted communications without compromising data privacy.
- 27 December 2024
- Published by MDPI AG in Electronics
- Vol. 14 (1) , 80
Open AccessMultiple Kernel Transfer Learning for Enhancing Network Intrusion Detection in Encrypted and Heterogeneous Network Environments
Conventional supervised machine learning is widely used for intrusion detection without packet payload inspection, showing good accuracy in detecting known attacks. However, these methods require large labeled datasets, which are scarce due to privacy concerns, and struggle with generalizing to real-world traffic and adapting to domain shifts. Additionally, they are ineffective against zero-day attacks and need frequent retraining, making them difficult to maintain in dynamic network environments. To overcome the limitations of traditional machine learning methods, we propose novel Deterministic (DetMKTL) and Stochastic Multiple-Kernel Transfer Learning (StoMKTL) algorithms that are based on transfer learning. These algorithms leverage multiple kernel functions to capture complex, non-linear relationships in network traffic, enhancing adaptability and accuracy while reducing dependence on large labeled datasets. The proposed algorithms demonstrated good accuracy, particularly in cross-domain evaluations, achieving accuracy rates exceeding 90%. This highlights the robustness of the models in handling diverse network environments and varying data distributions. Moreover, our models exhibited superior performance in detecting multiple types of cyber attacks, including zero-day threats. Specifically, the detection rates reached up to 87% for known attacks and approximately 75% for unseen attacks or their variants. This emphasizes the ability of our algorithms to generalize well to novel and evolving threat scenarios, which are often overlooked by traditional systems. Additionally, the proposed algorithms performed effectively in encrypted traffic analysis, achieving an accuracy of 86%. This result demonstrates the possibility of our models to identify malicious activities within encrypted communications without compromising data privacy.
- 23 October 2024
- Published by Springer Nature
- p. 51-62
Integrating Non-encrypted and Encrypted Features for Enhanced Detection of Encrypted Network Attacks
- 23 October 2024
- Published by Springer Nature
- p. 51-62
Integrating Non-encrypted and Encrypted Features for Enhanced Detection of Encrypted Network Attacks
- 28 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
Enhancing Network Intrusion Detection Systems: A Review of Feature Selection Algorithms for Streaming Data Processing
The proliferation of Internet of Things (loT) devices has precipitated a substantial expansion in network size and data volume, concurrently giving rise to heightened security concerns. Consequently, there has been a concerted effort in research to augment the execution and prediction performance of Network Intrusion Detection Systems (NIDS). The efficacy of machine learning (ML) models crucially hinges on judicious choices in algorithms and feature sets. While much of the previous research on feature selection algorithms concentrated on static datasets, real-world network intrusion detection systems grapple with the challenges posed by streaming data. This study comprehensively reviews feature selection algorithms, shedding light on their merits, drawbacks, and practical applications, with a specific emphasis on prerequisites for effective processing of streaming data. Noteworthy contributions include bridging gaps in prior research by delineating requirements tailored to the challenges of streaming data and conducting experimental analyses using contemporary datasets.
- 28 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
Enhancing Network Intrusion Detection Systems: A Review of Feature Selection Algorithms for Streaming Data Processing
The proliferation of Internet of Things (loT) devices has precipitated a substantial expansion in network size and data volume, concurrently giving rise to heightened security concerns. Consequently, there has been a concerted effort in research to augment the execution and prediction performance of Network Intrusion Detection Systems (NIDS). The efficacy of machine learning (ML) models crucially hinges on judicious choices in algorithms and feature sets. While much of the previous research on feature selection algorithms concentrated on static datasets, real-world network intrusion detection systems grapple with the challenges posed by streaming data. This study comprehensively reviews feature selection algorithms, shedding light on their merits, drawbacks, and practical applications, with a specific emphasis on prerequisites for effective processing of streaming data. Noteworthy contributions include bridging gaps in prior research by delineating requirements tailored to the challenges of streaming data and conducting experimental analyses using contemporary datasets.
- Open Access
- 22 July 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (15) , 6750
A Compute and Wait in PoW (CW-PoW) Consensus Algorithm for Preserving Energy Consumption
Several trusted tasks use consensus algorithms to solve agreement challenges. Usually, consensus agreements are used to ensure data integrity and reliability in untrusted environments. In many distributed networking fields, the Proof of Work (PoW) consensus algorithm is commonly used. However, the standard PoW mechanism has two main limitations, where the first is the high power consumption and the second is the 51% attack vulnerability. In this paper, we look to improve the PoW consensus protocol by introducing several proof rounds. Any given consensus node should resolve the game of the current round before participating in the next round . Any node that resolves the game of can only pass to the next round if a predetermined number of solutions has been found by other nodes. The obtained evaluation results of this technique show significant improvements in terms of energy consumption and robustness against the 51% and Sybil attacks. By fixing the number of processes, we obtained an energy gain rate of 15.63% with five rounds and a gain rate of 19.91% with ten rounds.- 22 July 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (15) , 6750
Open AccessA Compute and Wait in PoW (CW-PoW) Consensus Algorithm for Preserving Energy Consumption
Several trusted tasks use consensus algorithms to solve agreement challenges. Usually, consensus agreements are used to ensure data integrity and reliability in untrusted environments. In many distributed networking fields, the Proof of Work (PoW) consensus algorithm is commonly used. However, the standard PoW mechanism has two main limitations, where the first is the high power consumption and the second is the 51% attack vulnerability. In this paper, we look to improve the PoW consensus protocol by introducing several proof rounds. Any given consensus node should resolve the game of the current round before participating in the next round . Any node that resolves the game of can only pass to the next round if a predetermined number of solutions has been found by other nodes. The obtained evaluation results of this technique show significant improvements in terms of energy consumption and robustness against the 51% and Sybil attacks. By fixing the number of processes, we obtained an energy gain rate of 15.63% with five rounds and a gain rate of 19.91% with ten rounds.