Taleb, Anas Abu
Unknown Affiliation

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Indonesian Journal of Electrical Engineering and Computer Science

Utilizing minimum spanning trees for effective mobile sink routing in wireless sensor networks Taleb, Anas Abu; Odeh, Ammar
Indonesian Journal of Electrical Engineering and Computer Science Vol 36, No 3: December 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v36.i3.pp1938-1949

Abstract

With many practical applications, wireless sensor networks (WSNs) represent an important field of study. Real-world applications of WSNs include smart home automation, healthcare, agriculture, industrial automation, and environmental monitoring. WSNs present countless chances for creative solutions across various industries as they develop and become more sophisticated. But because they are unattended, we must devise ways to make them work better without using the sensor nodes’ most important resource—battery power. A unique sink mobility model from a deployed WSN is proposed in this paper, based on constructing a minimal Spanning tree. The proposed approach derives a controlled movement model for the mobile sink based on minimal spanning tree (MST) features. Consequently, fixed nodes will be scheduled and visited to save routing overhead and improve network efficiency. Using the properties of the minimal spanning tree, the moving sink node can visit immobile sensor nodes, which is the most effective approach to gather data and send it to the base station. The effectiveness of WSNs was examined when implementing this mobility model, and we used the NS-2 simulator to run simulations to assess how efficiently the suggested strategy performed. Our findings demonstrate that WSN performance can be significantly enhanced by implementing the proposed method.
Ensemble learning techniques against structured query language injection attacks Odeh, Ammar; Taleb, Anas Abu
Indonesian Journal of Electrical Engineering and Computer Science Vol 35, No 2: August 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v35.i2.pp1004-1012

Abstract

Structured query language (SQL) injection threats pose severe risks to web applications, necessitating robust detection measures. This study introduced DSQLIA, employing ensemble learning algorithms-Bagging, Stacking, and AdaBoost classifiers-for SQL injection detection. Results unveiled the bagging classifier's 84% accuracy with perfect precision (100%) but moderate recall (68%). The stacking classifier achieved 85% accuracy, exceptional precision (99%), and balanced memory (72%), yielding an 83% F1-Score. Remarkably, the AdaBoost classifier outperformed, achieving 99% accuracy, high precision (98%), and outstanding recall (99%), leading to a remarkable 99% F1-Score. These findings highlight AdaBoost's superior ability to identify malicious queries with minimal false positives accurately. Overall, this research underscores the potential of ensemble learning in fortifying web application security against SQL injection attacks, emphasizing the AdaBoost classifier's exceptional performance in achieving precise and comprehensive detection.