Hassan Al-Mahdi
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
Research Subjects
Hassan Al-Mahdi has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Hamed Nassar
Computer Science Department, Suez Canal University, Ismailia, Egypt
2 shared publications - Osama Rezk Shahin
Department of Computer Science, College of Computer and Information Sciences, Jouf University, Sakaka 72388, Saudi Arabia
2 shared publications - Ahmed Ibrahim Taloba
Department of Computer Science, College of Computer and Information Sciences, Jouf University, Sakaka, Saudi Arabia
1 shared publication - Eman Reda
Suez Canal University
1 shared publication Khalid Alkhaldi
Computer Science and Information, Jouf University Faculty of Science & Arts, Saudi Arabia
1 shared publicationMagdy Shayboub
Suez Canal University
1 shared publication
Latest Publications
- Open Access
- 18 March 2024
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2024, 1-20
An Intelligent Energy-Efficient Data Routing Scheme for Wireless Sensor Networks Utilizing Mobile Sink
Data collection and energy consumption are critical concerns in Wireless sensor networks (WSNs). To address these issues, both clustering and routing algorithms are utilized. Therefore, this paper proposes an intelligent energy-efficient data routing scheme for WSNs utilizing a mobile sink (MS) to save energy and prolong network lifetime. The proposed scheme operates in two major modes: configure and operational modes. During the configure mode, a novel clustering mechanism is applied once, and a prescheduling cluster head (CH) selection is introduced to ensure uniform energy expenditure among sensor nodes (SNs). The scheduling technique selects successive CHs for each cluster throughout the WSNs’ lifetime rounds, managed at the base station (BS) to minimize SN energy consumption. In the operational mode, two main objectives are achieved: sensing and gathering data by each CH with minimal message overhead, and establishing an optimal path for the MS using the genetic algorithm. Finally, the MS uploads the gathered data to the BS. Extensive simulations are conducted to verify the efficiency of the proposed scheme in terms of stability period, network lifetime, average energy consumption, data transmission latency, message overhead, and throughput. The results demonstrate that the proposed scheme outperforms the most recent state-of-the-art methods significantly. The results are substantiated through statistical validation via hypothesis testing utilizing ANOVA, as well as post hoc analysis.
- 18 March 2024
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2024, 1-20
Open AccessAn Intelligent Energy-Efficient Data Routing Scheme for Wireless Sensor Networks Utilizing Mobile Sink
Data collection and energy consumption are critical concerns in Wireless sensor networks (WSNs). To address these issues, both clustering and routing algorithms are utilized. Therefore, this paper proposes an intelligent energy-efficient data routing scheme for WSNs utilizing a mobile sink (MS) to save energy and prolong network lifetime. The proposed scheme operates in two major modes: configure and operational modes. During the configure mode, a novel clustering mechanism is applied once, and a prescheduling cluster head (CH) selection is introduced to ensure uniform energy expenditure among sensor nodes (SNs). The scheduling technique selects successive CHs for each cluster throughout the WSNs’ lifetime rounds, managed at the base station (BS) to minimize SN energy consumption. In the operational mode, two main objectives are achieved: sensing and gathering data by each CH with minimal message overhead, and establishing an optimal path for the MS using the genetic algorithm. Finally, the MS uploads the gathered data to the BS. Extensive simulations are conducted to verify the efficiency of the proposed scheme in terms of stability period, network lifetime, average energy consumption, data transmission latency, message overhead, and throughput. The results demonstrate that the proposed scheme outperforms the most recent state-of-the-art methods significantly. The results are substantiated through statistical validation via hypothesis testing utilizing ANOVA, as well as post hoc analysis.
- Open Access
- 22 June 2023
- Published by Springer Nature in Research Square
An Efficient Framework for Sensor Data Collection by UAV Based on Clustering, Two-Fold Ant Colony Optimization and Node Grouping
Unmanned Aerial Vehicles (UAVs) are a promising solution for sensor data collection (DC) in large-scale area. The challenge is to minimize the DC route, which will reduce UAV energy consumption and data latency. We propose a three-phase efficient solution with innovative algorithms to address this challenge. First, an initial shortest route that traverses all SNs is established based on the ant colony optimization (ACO) and the $K$-means algorithms. Second, we group the sensor nodes (SNs) along the initial route using the footprint of the UAV, so that the latter can collect the data of the group in one stop, instead of stopping at each SN. By sequencing the hovering locations, we obtain a (shorter) intermediate route. Third, we shorten this route even further, by applying ACO to the set of hovering locations of the intermediate route. The solution has been implemented fully in Python. The results show that the route length gets shorter progressively with each phase. To evaluate the performance of the solution objectively, we have compared it with four states of the art solutions. The results show vividly that the proposed solution produces a DC route 19.28\% shorter than the shortest route produced by the four competitive solutions. Moreover, it demonstrates a remarkable improvement by retaining 44\% of energy in most SNs while over 99\% energy depletion observed in the five state-of-the-art competitive solutions.
- 22 June 2023
- Published by Springer Nature in Research Square
Open AccessAn Efficient Framework for Sensor Data Collection by UAV Based on Clustering, Two-Fold Ant Colony Optimization and Node Grouping
Unmanned Aerial Vehicles (UAVs) are a promising solution for sensor data collection (DC) in large-scale area. The challenge is to minimize the DC route, which will reduce UAV energy consumption and data latency. We propose a three-phase efficient solution with innovative algorithms to address this challenge. First, an initial shortest route that traverses all SNs is established based on the ant colony optimization (ACO) and the $K$-means algorithms. Second, we group the sensor nodes (SNs) along the initial route using the footprint of the UAV, so that the latter can collect the data of the group in one stop, instead of stopping at each SN. By sequencing the hovering locations, we obtain a (shorter) intermediate route. Third, we shorten this route even further, by applying ACO to the set of hovering locations of the intermediate route. The solution has been implemented fully in Python. The results show that the route length gets shorter progressively with each phase. To evaluate the performance of the solution objectively, we have compared it with four states of the art solutions. The results show vividly that the proposed solution produces a DC route 19.28\% shorter than the shortest route produced by the four competitive solutions. Moreover, it demonstrates a remarkable improvement by retaining 44\% of energy in most SNs while over 99\% energy depletion observed in the five state-of-the-art competitive solutions.
- 10 April 2021
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- p. 1-17
Asymmetric DNA encryption and decryption technique for Arabic plaintext
- 10 April 2021
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- p. 1-17
Asymmetric DNA encryption and decryption technique for Arabic plaintext
- Open Access
- 30 June 2018
- Published by ENGG Journals Publications in International Journal of Engineering and Technology
- Vol. 10 (3) , 699-706
Design and analysis of DNA Binary Cryptography Algorithm for Plaintext
IJET is an international journal for the engineers and technologists. IJET publishes scholarly peer-reviewed research journal. The journal can be available online with full-text content freely.
- 30 June 2018
- Published by ENGG Journals Publications in International Journal of Engineering and Technology
- Vol. 10 (3) , 699-706
Open AccessDesign and analysis of DNA Binary Cryptography Algorithm for Plaintext
IJET is an international journal for the engineers and technologists. IJET publishes scholarly peer-reviewed research journal. The journal can be available online with full-text content freely.
- 1 May 2009
- Published by Elsevier in Computer Communications
- Vol. 32 (7-10) , 1200-1206
Design and analysis of a TDMA call assignment scheme for cellular networks
- 1 May 2009
- Published by Elsevier in Computer Communications
- Vol. 32 (7-10) , 1200-1206
Design and analysis of a TDMA call assignment scheme for cellular networks