Mohammad Shurman
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mohammad Shurman has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Mamoun F. Al-Mistarihi
Electrical Engineering Department, Faculty of Engineering, Jordan University of Science and Technology, Irbid, Jordan
3 shared publications - Moawiah Alhulayil
Department of Electrical Engineering, Applied Science Private University, Amman, Jordan
2 shared publications - Sharhabeel H. Alnabelsi
Al-Balqa Applied University,Computer Eng. Dept.,Amman,Jordan
2 shared publications Abdallah Alma’aItah
Network Engineering and Security Department, Jordan University of Science and Technology, Irbid, Jordan
1 shared publication- Abdallah Y. Alma’aitah
Department of Network Engineering and Security, Jordan University of Science and Technology, Irbid 22110, Jordan
1 shared publication - Abdulmughni Hamzah
Department of Computer Engineering, Jordan University of Science and Technology, P.O. Box 3030, Irbid 22110, Jordan
1 shared publication
Latest Publications
- Top Cited PapersOpen Access
- 7 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 113049-113071
Exploring Deep Learning-Based Visual Localization Techniques for UAVs in GPS-Denied Environments
Unmanned Aerial Vehicles (UAVs) have proliferated across diverse domains. However, optimal UAV operations necessitate precise and reliable navigation systems. UAVs predominantly rely on the Global Navigation Satellite System (GNSS), such as the Global Positioning System (GPS), for navigation. Nevertheless, GNSS signals are susceptible to blockage, reflection, and spoofing, introducing significant risks, including navigation loss and potential UAV loss. This research investigates cutting-edge navigation solutions, emphasizing deep learning-based visual localization approaches tailored for UAVs. Our focus is on scenarios characterized by GPS-denied environments where GPS signals may be absent or unreliable. We provide a comprehensive review of contemporary deep learning-based visual localization approaches and compare them to traditional aerial visual localization methods, such as template matching and feature matching. This comparison highlights both the potential benefits and challenges associated with these approaches. Furthermore, we systematically evaluate and classify recent deep learning-based methods based on main criteria, including model type/architecture, reference imagery, operational context, and resultant accuracy levels. Our findings underscore the substantial promise inherent in various approaches while also shedding light on their unique deployment challenges. Finally, we discuss potential research directions, to inspire further innovations and progress in this domain. The ultimate goal is to develop more accurate, dependable, and secure navigation solutions for UAVs.
- 7 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 113049-113071
Top Cited PapersOpen AccessExploring Deep Learning-Based Visual Localization Techniques for UAVs in GPS-Denied Environments
Unmanned Aerial Vehicles (UAVs) have proliferated across diverse domains. However, optimal UAV operations necessitate precise and reliable navigation systems. UAVs predominantly rely on the Global Navigation Satellite System (GNSS), such as the Global Positioning System (GPS), for navigation. Nevertheless, GNSS signals are susceptible to blockage, reflection, and spoofing, introducing significant risks, including navigation loss and potential UAV loss. This research investigates cutting-edge navigation solutions, emphasizing deep learning-based visual localization approaches tailored for UAVs. Our focus is on scenarios characterized by GPS-denied environments where GPS signals may be absent or unreliable. We provide a comprehensive review of contemporary deep learning-based visual localization approaches and compare them to traditional aerial visual localization methods, such as template matching and feature matching. This comparison highlights both the potential benefits and challenges associated with these approaches. Furthermore, we systematically evaluate and classify recent deep learning-based methods based on main criteria, including model type/architecture, reference imagery, operational context, and resultant accuracy levels. Our findings underscore the substantial promise inherent in various approaches while also shedding light on their unique deployment challenges. Finally, we discuss potential research directions, to inspire further innovations and progress in this domain. The ultimate goal is to develop more accurate, dependable, and secure navigation solutions for UAVs.
- Open Access
- 28 December 2022
- Published by MDPI AG in Electronics
- Vol. 12 (1) , 124
Performance Analysis of Dual-Hop AF Cognitive Relay Networks with Best Selection and Interference Constraints
In this paper, a dual-hop underlay cognitive relay network (CRN) with a best-relay selection (BRS) scheme under spectrum-sharing constraints from the primary user (PU) is investigated. The system model in this work consists of one PU, one secondary user (SU) and a few SU relays. Both users exchange the information using a half-duplex mode through amplify-and-forward (AF) SU relays. Moreover, all channels are modelled using the Nakagami-m fading model. In this work, the outage probabilities (OPs) are derived for the proposed system model under several scenarios to investigate the network performance under interference power constraint at the PU receiver. In addition, the impacts of the number of relays and the channel fading severity parameters are investigated as well. Furthermore, the system performance is investigated for several PU locations. The various numerical results are verified using a Monte Carlo simulation. Overall, the obtained results show that several factors such as the number of relays, channel fading severity parameters and PU location have a major impact on the outage performance of the SU. The simulation and analytical results are perfectly matched, confirming the accuracy of the analytical derivations.- 28 December 2022
- Published by MDPI AG in Electronics
- Vol. 12 (1) , 124
Open AccessPerformance Analysis of Dual-Hop AF Cognitive Relay Networks with Best Selection and Interference Constraints
In this paper, a dual-hop underlay cognitive relay network (CRN) with a best-relay selection (BRS) scheme under spectrum-sharing constraints from the primary user (PU) is investigated. The system model in this work consists of one PU, one secondary user (SU) and a few SU relays. Both users exchange the information using a half-duplex mode through amplify-and-forward (AF) SU relays. Moreover, all channels are modelled using the Nakagami-m fading model. In this work, the outage probabilities (OPs) are derived for the proposed system model under several scenarios to investigate the network performance under interference power constraint at the PU receiver. In addition, the impacts of the number of relays and the channel fading severity parameters are investigated as well. Furthermore, the system performance is investigated for several PU locations. The various numerical results are verified using a Monte Carlo simulation. Overall, the obtained results show that several factors such as the number of relays, channel fading severity parameters and PU location have a major impact on the outage performance of the SU. The simulation and analytical results are perfectly matched, confirming the accuracy of the analytical derivations. - 23 July 2021
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 64 (10) , 1575-1583
A Collaborative Learning-Based Algorithm for Task Offloading in UAV-Aided Wireless Sensor Networks
Recently, unmanned aerial vehicles (UAVs) have emerged to enhance data processing, network monitoring, disaster management and other useful applications in many different networks. Due to their flexibility, cost efficiency and powerful capabilities, combining these UAVs with the existing wireless sensor networks (WSNs) could improve network performance and enhance the network lifetime in such networks. In this research, we propose a task offloading mechanism in UAV-aided WSN by implementing a utility-based learning collaborative algorithm that will enhance the service satisfaction rate, taking into account the delay requirements of the submitted tasks. The proposed learning algorithm predicts the queuing delays of all UAVs instead of having a global overview of the system, which reduces the communication overhead in the network. The simulation results showed the effectiveness of our proposed work in terms of service satisfaction ratio compared with the non-collaborative algorithm that only processes the task locally in the WSN cluster.
- 23 July 2021
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 64 (10) , 1575-1583
A Collaborative Learning-Based Algorithm for Task Offloading in UAV-Aided Wireless Sensor Networks
Recently, unmanned aerial vehicles (UAVs) have emerged to enhance data processing, network monitoring, disaster management and other useful applications in many different networks. Due to their flexibility, cost efficiency and powerful capabilities, combining these UAVs with the existing wireless sensor networks (WSNs) could improve network performance and enhance the network lifetime in such networks. In this research, we propose a task offloading mechanism in UAV-aided WSN by implementing a utility-based learning collaborative algorithm that will enhance the service satisfaction rate, taking into account the delay requirements of the submitted tasks. The proposed learning algorithm predicts the queuing delays of all UAVs instead of having a global overview of the system, which reduces the communication overhead in the network. The simulation results showed the effectiveness of our proposed work in terms of service satisfaction ratio compared with the non-collaborative algorithm that only processes the task locally in the WSN cluster.
- 24 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 234-238
Cooperation-based Interference Mitigation in Heterogeneous Cloud Radio Access Networks without Requiring CSI
Researchers have developed the development of a Heterogeneous Cloud Radio Access Network (HCRAN) consists of a Small Remote Radio Head (S-RRH) for the secondary users (Small Cell Users SUEs) and macro RRH for the primary users (multiple macrocell users MUEs), to meet the continuous increase in the number of mobile phone users and the change in traffic patterns. However, H-CRAN layers may overlap each other. Researches were able to reduce internal interference between RRHs through central collaborative processing in the BBU group. Layer interference between small RRHs cells (S-RRHs) and RRH Macrocell (RRH macros) was resolved by proposing a framework to reduce interference between Microcell networks and small cellular networks by suggesting a two-way collaborative algorithm. But they assumed that the channel status information (CSI) was available. This assumption makes no sense in the wireless communication environment, due to the possible interruption of specific ranges, which results in devices not obtaining or delaying the information. The study was also limited to fixed users or infantry subjects. They did not predict the movement of people moving at high speeds. In this paper, we will use the frequency hopping (FH) orthogonal frequency division multiplexing-aided differential chaos shift keying (OFDM-DCSK) modulation to overcome an inaccurate or unknown CSI problem, In addition to the ability to predict the movement of users who move between cells, and provide services within the cell in which the user is located.
- 24 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 234-238
Cooperation-based Interference Mitigation in Heterogeneous Cloud Radio Access Networks without Requiring CSI
Researchers have developed the development of a Heterogeneous Cloud Radio Access Network (HCRAN) consists of a Small Remote Radio Head (S-RRH) for the secondary users (Small Cell Users SUEs) and macro RRH for the primary users (multiple macrocell users MUEs), to meet the continuous increase in the number of mobile phone users and the change in traffic patterns. However, H-CRAN layers may overlap each other. Researches were able to reduce internal interference between RRHs through central collaborative processing in the BBU group. Layer interference between small RRHs cells (S-RRHs) and RRH Macrocell (RRH macros) was resolved by proposing a framework to reduce interference between Microcell networks and small cellular networks by suggesting a two-way collaborative algorithm. But they assumed that the channel status information (CSI) was available. This assumption makes no sense in the wireless communication environment, due to the possible interruption of specific ranges, which results in devices not obtaining or delaying the information. The study was also limited to fixed users or infantry subjects. They did not predict the movement of people moving at high speeds. In this paper, we will use the frequency hopping (FH) orthogonal frequency division multiplexing-aided differential chaos shift keying (OFDM-DCSK) modulation to overcome an inaccurate or unknown CSI problem, In addition to the ability to predict the movement of users who move between cells, and provide services within the cell in which the user is located.
- Open Access
- 1 February 2020
- Published by Institute of Advanced Engineering and Science in International Journal of Electrical and Computer Engineering (IJECE)
- Vol. 10 (1) , 296-307
Cooperative-hierarchical based edge-computing approach for resources allocation of distributed mobile and IoT applications
Using mobile and Internet of Things (IoT) applications is becoming very popular and obtained researchers’ interest and commercial investment, in order to fulfill future vision and the requirements for smart cities. These applications have common demands such as fast response, distributed nature, and awareness of service location. However, these requirements’ nature cannot be satisfied by central systems services that reside in the clouds. Therefore, edge computing paradigm has emerged to satisfy such demands, by providing an extension for cloud resources at the network edge, and consequently, they become closer to end-user devices. In this paper, exploiting edge resources is studied; therefore, a cooperative-hierarchical approach for executing the pre-partitioned applications’ modules between edges resources is proposed, in order to reduce traffic between the network core and the cloud, where this proposed approach has a polynomial-time complexity. Furthermore, edge computing increases the efficiency of providing services, and improves end-user experience. To validate our proposed cooperative-hierarchical approach for modules placement between edge nodes’ resources, iFogSim toolkit is used. The obtained simulation results show that the proposed approach reduces network’s load and the total delay compared to a baseline approach for modules’ placement, moreover, it increases the network’s overall throughput.
- 1 February 2020
- Published by Institute of Advanced Engineering and Science in International Journal of Electrical and Computer Engineering (IJECE)
- Vol. 10 (1) , 296-307
Open AccessCooperative-hierarchical based edge-computing approach for resources allocation of distributed mobile and IoT applications
Using mobile and Internet of Things (IoT) applications is becoming very popular and obtained researchers’ interest and commercial investment, in order to fulfill future vision and the requirements for smart cities. These applications have common demands such as fast response, distributed nature, and awareness of service location. However, these requirements’ nature cannot be satisfied by central systems services that reside in the clouds. Therefore, edge computing paradigm has emerged to satisfy such demands, by providing an extension for cloud resources at the network edge, and consequently, they become closer to end-user devices. In this paper, exploiting edge resources is studied; therefore, a cooperative-hierarchical approach for executing the pre-partitioned applications’ modules between edges resources is proposed, in order to reduce traffic between the network core and the cloud, where this proposed approach has a polynomial-time complexity. Furthermore, edge computing increases the efficiency of providing services, and improves end-user experience. To validate our proposed cooperative-hierarchical approach for modules placement between edge nodes’ resources, iFogSim toolkit is used. The obtained simulation results show that the proposed approach reduces network’s load and the total delay compared to a baseline approach for modules’ placement, moreover, it increases the network’s overall throughput.
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 278-282
Zero-Day Attack Detection and Prevention in Software-Defined Networks
The zero-day attack in networks exploits an undiscovered vulnerability, in order to affect/damage networks or programs. The term “zero-day” refers to the number of days available to the software or the hardware vendor to issue a patch for this new vulnerability. Currently, the best-known defense mechanism against the zero-day attacks focuses on detection and response, as a prevention effort, which typically fails against unknown or new vulnerabilities. To the best of our knowledge, this attack has not been widely investigated for Software-Defined Networks (SDNs). Therefore, in this work we are motivated to develop anew zero-day attack detection and prevention mechanism, which is designed and implemented for SDN using a modified sandbox tool, named Cuckoo. Our experiments results, under UNIX system, show that our proposed design successfully stops zero-day malwares by isolating the infected client, and thus, prevents these malwares from infesting other clients.
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 278-282
Zero-Day Attack Detection and Prevention in Software-Defined Networks
The zero-day attack in networks exploits an undiscovered vulnerability, in order to affect/damage networks or programs. The term “zero-day” refers to the number of days available to the software or the hardware vendor to issue a patch for this new vulnerability. Currently, the best-known defense mechanism against the zero-day attacks focuses on detection and response, as a prevention effort, which typically fails against unknown or new vulnerabilities. To the best of our knowledge, this attack has not been widely investigated for Software-Defined Networks (SDNs). Therefore, in this work we are motivated to develop anew zero-day attack detection and prevention mechanism, which is designed and implemented for SDN using a modified sandbox tool, named Cuckoo. Our experiments results, under UNIX system, show that our proposed design successfully stops zero-day malwares by isolating the infected client, and thus, prevents these malwares from infesting other clients.
- Open Access
Energy-Efficient Fuzzy-Logic-Based Clustering Technique for Hierarchical Routing Protocols in Wireless Sensor Networks
In wireless sensor networks, the energy source is limited to the capacity of the sensor node’s battery. Clustering in WSN can help with reducing energy consumption because transmission energy is related to the distance between sender and receiver. In this paper, we propose a fuzzy logic model for cluster head election. The proposed model uses five descriptors to determine the opportunity for each node to become a CH. These descriptors are: residual energy, location suitability, density, compacting, and distance from the base station. We use this fuzzy logic model in proposing the Fuzzy Logic-based Energy-Efficient Clustering for WSN based on minimum separation Distance enforcement between CHs (FL-EEC/D). Furthermore, we adopt the Gini index to measure the clustering algorithms’ energy efficiency in terms of their ability to balance the distribution of energy through WSN sensor nodes. We compare the proposed technique FL-EEC/D with a fuzzy logic-based CH election approach, a k-means based clustering technique, and LEACH. Simulation results show enhancements in energy efficiency in terms of network lifetime and energy consumption balancing between sensor nodes for different network sizes and topologies. Results show an average improvement in terms of first node dead and half nodes dead.
Open AccessEnergy-Efficient Fuzzy-Logic-Based Clustering Technique for Hierarchical Routing Protocols in Wireless Sensor Networks
In wireless sensor networks, the energy source is limited to the capacity of the sensor node’s battery. Clustering in WSN can help with reducing energy consumption because transmission energy is related to the distance between sender and receiver. In this paper, we propose a fuzzy logic model for cluster head election. The proposed model uses five descriptors to determine the opportunity for each node to become a CH. These descriptors are: residual energy, location suitability, density, compacting, and distance from the base station. We use this fuzzy logic model in proposing the Fuzzy Logic-based Energy-Efficient Clustering for WSN based on minimum separation Distance enforcement between CHs (FL-EEC/D). Furthermore, we adopt the Gini index to measure the clustering algorithms’ energy efficiency in terms of their ability to balance the distribution of energy through WSN sensor nodes. We compare the proposed technique FL-EEC/D with a fuzzy logic-based CH election approach, a k-means based clustering technique, and LEACH. Simulation results show enhancements in energy efficiency in terms of network lifetime and energy consumption balancing between sensor nodes for different network sizes and topologies. Results show an average improvement in terms of first node dead and half nodes dead.
- Open Access
- 1 March 2016
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 10 (5) , 594-605
Performance analysis of amplify‐and‐forward cognitive relay networks with interference power constraints over Nakagami‐m fading channels
With the wide‐spread wireless applications and services, the spectrum scarcity has become a challenging problem. Thus, it is necessary to find a solution to have more spectrum bands. One from these solutions is the cognitive relay network, where we can increase the spectrum utilization by combining the cognitive radio (CR) with cooperative spectrum sharing systems. In this paper, the performance of cognitive relay networks under interference power constraints from the primary user (PU) is studied. Here, the system models are studied by utilizing different scenarios. The first scenario is by using a single amplify‐and‐forward (AF) relay, and the second one is by using a single AF relay with selection diversity. Tabulated expressions for the outage probability (OP) are derived over independent and non‐identically distributed Nakagami‐m fading channels. Numerical results show that the cooperative spectrum sharing transmission with a single AF relay and selection diversity outperforms both the direct transmission and the transmission using a single AF relay for the underlay cognitive relay networks. Furthermore, the results show that the outage performance depends on the minimum fading severity parameters of the two hops of the secondary user (SU) and the OP decreases as the PU moves away from the SU network.
- 1 March 2016
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 10 (5) , 594-605
Open AccessPerformance analysis of amplify‐and‐forward cognitive relay networks with interference power constraints over Nakagami‐m fading channels
With the wide‐spread wireless applications and services, the spectrum scarcity has become a challenging problem. Thus, it is necessary to find a solution to have more spectrum bands. One from these solutions is the cognitive relay network, where we can increase the spectrum utilization by combining the cognitive radio (CR) with cooperative spectrum sharing systems. In this paper, the performance of cognitive relay networks under interference power constraints from the primary user (PU) is studied. Here, the system models are studied by utilizing different scenarios. The first scenario is by using a single amplify‐and‐forward (AF) relay, and the second one is by using a single AF relay with selection diversity. Tabulated expressions for the outage probability (OP) are derived over independent and non‐identically distributed Nakagami‐m fading channels. Numerical results show that the cooperative spectrum sharing transmission with a single AF relay and selection diversity outperforms both the direct transmission and the transmission using a single AF relay for the underlay cognitive relay networks. Furthermore, the results show that the outage performance depends on the minimum fading severity parameters of the two hops of the secondary user (SU) and the OP decreases as the PU moves away from the SU network.
- 1 May 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 521-525
Outage probability of amplify-and-forward underlay cognitive relay networks with selection diversity over Nakagami-m fading channels
In this paper, the outage performance is investigated for cognitive dual-hop relay networks with amplify-and-forward (AF) relay and selection combining (SC) receiver at the destination under spectrum sharing constraints on primary user (PU) over independent and identically distributed (i.i.d.) Nakagami-m fading channels. We derive an exact closed-form expression for the outage probability (OP) of the considered system under the peak interference power Ip at the primary user, and the impact of the PU location on the OP performance is studied also. Moreover; the effects fading severity for the two hops on the OP is investigated also for this cognitive relay network (CRN).
- 1 May 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 521-525
Outage probability of amplify-and-forward underlay cognitive relay networks with selection diversity over Nakagami-m fading channels
In this paper, the outage performance is investigated for cognitive dual-hop relay networks with amplify-and-forward (AF) relay and selection combining (SC) receiver at the destination under spectrum sharing constraints on primary user (PU) over independent and identically distributed (i.i.d.) Nakagami-m fading channels. We derive an exact closed-form expression for the outage probability (OP) of the considered system under the peak interference power Ip at the primary user, and the impact of the PU location on the OP performance is studied also. Moreover; the effects fading severity for the two hops on the OP is investigated also for this cognitive relay network (CRN).
- 6 February 2011
- Published by Elsevier in Computer Networks
- Vol. 55 (8) , 1894-1908
Tree based dynamic address autoconfiguration in mobile ad hoc networks
- 6 February 2011
- Published by Elsevier in Computer Networks
- Vol. 55 (8) , 1894-1908
Tree based dynamic address autoconfiguration in mobile ad hoc networks