Oday D. Jerew
Research Subjects
Oday D. Jerew has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Nizar Al Bassam
Middle East College, Muscat, Oman
4 shared publications - Abeer Alsadoon
Western Sydney University (WSU)
3 shared publications - Kim Blackmore
Australian National University
3 shared publications - Omar Hisham Alsadoon
Department of Islamic Sciences, Al Iraqia University, Baghdad, Iraq
3 shared publications - Tarik Ahmed Rashid
University of Kurdistan Hewler
3 shared publications P.W.C. Prasad
School of Computing Mathematics and Engineering, Charles Sturt University (CSU), Wagga Wagga, Australia
2 shared publications
Latest Publications
- Open Access
- 22 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 19819-19835
Reinforcement Learning for Delay Tolerance and Energy Saving in Mobile Wireless Sensor Networks
Reinforcement Learning (RL) has emerged as a promising approach for improving the performance of Wireless Sensor Networks (WSNs). The Q-learning technique is one approach of RL in which the algorithm continuously learns by interacting with the environment, gathering information to take certain actions. It maximizes performance by determining the optimal result from that environment. In this paper, we propose a data gathering algorithm based on a Q-learning approach named Bounded Hop Count - Reinforcement Learning Algorithm (BHC-RLA). The proposed algorithm uses a reward function to select a set of Cluster Heads (CHs) to balance between the energy-saving and data-gathering latency of a mobile Base Station (BS). In particular, the proposed algorithm selects groups of CHs to receive sensing data of cluster nodes within a bounded hop count and forward the data to the mobile BS when it arrives. In addition, the CHs are selected to minimize the BS tour length. Extensive experiments by simulation were conducted to evaluate the performance of the proposed algorithm against another traditional heuristic algorithm. We demonstrate that the proposed algorithm outperforms the existing work in the mean of the length of a mobile BS tour and a network’s lifetime.
- 22 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 19819-19835
Open AccessReinforcement Learning for Delay Tolerance and Energy Saving in Mobile Wireless Sensor Networks
Reinforcement Learning (RL) has emerged as a promising approach for improving the performance of Wireless Sensor Networks (WSNs). The Q-learning technique is one approach of RL in which the algorithm continuously learns by interacting with the environment, gathering information to take certain actions. It maximizes performance by determining the optimal result from that environment. In this paper, we propose a data gathering algorithm based on a Q-learning approach named Bounded Hop Count - Reinforcement Learning Algorithm (BHC-RLA). The proposed algorithm uses a reward function to select a set of Cluster Heads (CHs) to balance between the energy-saving and data-gathering latency of a mobile Base Station (BS). In particular, the proposed algorithm selects groups of CHs to receive sensing data of cluster nodes within a bounded hop count and forward the data to the mobile BS when it arrives. In addition, the CHs are selected to minimize the BS tour length. Extensive experiments by simulation were conducted to evaluate the performance of the proposed algorithm against another traditional heuristic algorithm. We demonstrate that the proposed algorithm outperforms the existing work in the mean of the length of a mobile BS tour and a network’s lifetime.
- Open Access
- 8 August 2022
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 82 (5) , 6605-6624
Deep learning neural network for lung cancer classification: enhanced optimization function
- 8 August 2022
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 82 (5) , 6605-6624
Open AccessDeep learning neural network for lung cancer classification: enhanced optimization function
- 25 April 2022
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 81 (27) , 38569-38592
A novel solution of deep learning for sleep apnea detection: enhancement of SC and elimination of GVICS
- 25 April 2022
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 81 (27) , 38569-38592
A novel solution of deep learning for sleep apnea detection: enhancement of SC and elimination of GVICS
- 5 September 2021
- Published by Taylor & Francis in Journal of Experimental & Theoretical Artificial Intelligence
- Vol. 35 (6) , 807-829
A novel solution of an elastic net regularisation for dementia knowledge discovery using deep learning
Accurate classification of Magnetic Resonance Images (MRI) is essential to accurately predict Mild Cognitive Impairment (MCI) to Alzheimer’s Disease (AD) conversion. Meanwhile, deep learning has been successfully implemented to classify and predict dementia disease. However, the accuracy of MRI image classification is low. This paper aims to increase the accuracy and reduce the processing time of classification through Deep Learning Architecture by using Elastic Net Regularisation in Feature Selection. The proposed system consists of Convolutional Neural Network (CNN) to enhance the accuracy of classification and prediction by using Elastic Net Regularisation. Initially, the MRI images are fed into CNN for features extraction through convolutional layers alternate with pooling layers, and then through a fully connected layer. After that, the features extracted are subjected to Principle Component Analysis (PCA) and Elastic Net Regularisation for feature selection. Finally, the selected features are used as an input to Extreme Machine Learning (EML) for the classification of MRI images. The result shows that the accuracy of the proposed solution is better than the current system. In addition to that, the proposed method has improved the classification accuracy by 5% on average and reduced the processing time by 30 ~ 40 seconds on average. The proposed system is focused on improving the accuracy and processing time of MCI converters/non-converters classification. It consists of features extraction, feature selection, and classification using CNN, FreeSurfer, PCA, Elastic Net, and Extreme Machine Learning. Finally, this study enhances the accuracy and the processing time by using Elastic Net Regularisation, which provides important selected features for classification.
- 5 September 2021
- Published by Taylor & Francis in Journal of Experimental & Theoretical Artificial Intelligence
- Vol. 35 (6) , 807-829
A novel solution of an elastic net regularisation for dementia knowledge discovery using deep learning
Accurate classification of Magnetic Resonance Images (MRI) is essential to accurately predict Mild Cognitive Impairment (MCI) to Alzheimer’s Disease (AD) conversion. Meanwhile, deep learning has been successfully implemented to classify and predict dementia disease. However, the accuracy of MRI image classification is low. This paper aims to increase the accuracy and reduce the processing time of classification through Deep Learning Architecture by using Elastic Net Regularisation in Feature Selection. The proposed system consists of Convolutional Neural Network (CNN) to enhance the accuracy of classification and prediction by using Elastic Net Regularisation. Initially, the MRI images are fed into CNN for features extraction through convolutional layers alternate with pooling layers, and then through a fully connected layer. After that, the features extracted are subjected to Principle Component Analysis (PCA) and Elastic Net Regularisation for feature selection. Finally, the selected features are used as an input to Extreme Machine Learning (EML) for the classification of MRI images. The result shows that the accuracy of the proposed solution is better than the current system. In addition to that, the proposed method has improved the classification accuracy by 5% on average and reduced the processing time by 30 ~ 40 seconds on average. The proposed system is focused on improving the accuracy and processing time of MCI converters/non-converters classification. It consists of features extraction, feature selection, and classification using CNN, FreeSurfer, PCA, Elastic Net, and Extreme Machine Learning. Finally, this study enhances the accuracy and the processing time by using Elastic Net Regularisation, which provides important selected features for classification.
- Open Access
- 12 February 2019
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2019, 1-12
Delay Tolerance and Energy Saving in Wireless Sensor Networks with a Mobile Base Station
Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile devices. A mobile device roams sensing fields and collects data from sensors through a short transmission range. Multihop communication is used to improve data gathering by reducing the tour length of the mobile device. In this paper we study the trade-off between energy saving and data gathering latency in wireless sensor networks. In particular, we examine the balance between the relay hop count and the tour length of a mobile Base Station (BS). We propose two heuristic algorithms, Adjacent Tree-Bounded Hop Algorithm (AT-BHA) and Farthest Node First-Bounded Hop Algorithm (FNF-BHA), to reduce energy consumption of sensor nodes. The proposed algorithms select groups of Collection Trees (CTs) and a subset of Collection Location (CL) sensor nodes to buffer and forward data to the mobile BS when it arrives. Each CL node receives sensing data from its CT nodes within bounded hop count. Extensive experiments by simulation are conducted to evaluate the performance of the proposed algorithms against another heuristic. We demonstrate that the proposed algorithms outperform the existing work with the mean of the length of mobile BS tour.
- 12 February 2019
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2019, 1-12
Open AccessDelay Tolerance and Energy Saving in Wireless Sensor Networks with a Mobile Base Station
Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile devices. A mobile device roams sensing fields and collects data from sensors through a short transmission range. Multihop communication is used to improve data gathering by reducing the tour length of the mobile device. In this paper we study the trade-off between energy saving and data gathering latency in wireless sensor networks. In particular, we examine the balance between the relay hop count and the tour length of a mobile Base Station (BS). We propose two heuristic algorithms, Adjacent Tree-Bounded Hop Algorithm (AT-BHA) and Farthest Node First-Bounded Hop Algorithm (FNF-BHA), to reduce energy consumption of sensor nodes. The proposed algorithms select groups of Collection Trees (CTs) and a subset of Collection Location (CL) sensor nodes to buffer and forward data to the mobile BS when it arrives. Each CL node receives sensing data from its CT nodes within bounded hop count. Extensive experiments by simulation are conducted to evaluate the performance of the proposed algorithms against another heuristic. We demonstrate that the proposed algorithms outperform the existing work with the mean of the length of mobile BS tour.
- Open Access
- 3 August 2017
- Published by Wiley in Journal of Engineering
- Vol. 2017, 1-9
Analysis and Design of an Energy Efficient Differential Coherent Chaos Based System in Additive White Gaussian Noise Environment
A new differential coherent chaos based scheme is proposed and named as Differential Chaos ON-OFF Keying (DCOOK). The proposed scheme provides reduction in bit energy and better bit error performance at large spreading factor. This is achieved by presenting each transmitted bit by either identical segment or no transmission within same bit duration. The receiver performs simple correlation between the received signal and its delayed version to determine the transmitted information utilizing the low correlation between the noise signals. The bit error rate (BER) performance of the proposed scheme is evaluated analytically using Gaussian Approximation (GA) method and compared with the simulation results. The results show excellent agreement between the derived expression and simulation. Moreover, the BER of DCOOK scheme is compared with the standard chaos systems: Chaos ON-OFF Keying (COOK), Differential Chaos Shift Keying (DCSK), and Correlation Delay Shift Keying (CDSK). The comparison results show that DCOOK scheme can always achieve superior performance compared to COOK and CDSK schemes and even exceeds the performance of DCSK scheme at typical spreading factor values.
- 3 August 2017
- Published by Wiley in Journal of Engineering
- Vol. 2017, 1-9
Open AccessAnalysis and Design of an Energy Efficient Differential Coherent Chaos Based System in Additive White Gaussian Noise Environment
A new differential coherent chaos based scheme is proposed and named as Differential Chaos ON-OFF Keying (DCOOK). The proposed scheme provides reduction in bit energy and better bit error performance at large spreading factor. This is achieved by presenting each transmitted bit by either identical segment or no transmission within same bit duration. The receiver performs simple correlation between the received signal and its delayed version to determine the transmitted information utilizing the low correlation between the noise signals. The bit error rate (BER) performance of the proposed scheme is evaluated analytically using Gaussian Approximation (GA) method and compared with the simulation results. The results show excellent agreement between the derived expression and simulation. Moreover, the BER of DCOOK scheme is compared with the standard chaos systems: Chaos ON-OFF Keying (COOK), Differential Chaos Shift Keying (DCSK), and Correlation Delay Shift Keying (CDSK). The comparison results show that DCOOK scheme can always achieve superior performance compared to COOK and CDSK schemes and even exceeds the performance of DCSK scheme at typical spreading factor values.
- 18 February 2015
- Published by BCS Learning & Development Ltd
Number of Paths and Neighbours Effect on Multipath Routing in Mobile Ad Hoc Networks
- 18 February 2015
- Published by BCS Learning & Development Ltd
Number of Paths and Neighbours Effect on Multipath Routing in Mobile Ad Hoc Networks
- Open Access
- 1 January 2012
- Published by Wiley in Journal of Electrical and Computer Engineering
- Vol. 2012 (1)
Mobile Base Station and Clustering to Maximize Network Lifetime in Wireless Sensor Networks
Using a mobile base station (BS) in a wireless sensor network can alleviate nonuniform energy consumption among sensor nodes and accommodate partitioned networks. In the work of Jerew and Liang (2009) we have proposed a novel clustering‐based heuristic algorithm for finding a trajectory of the mobile BS that strikes a nontrivial tradeoff between the traffic load among sensor nodes and the tour time constraint of the mobile BS. In this paper, we first show how to choose the number of clusters to ensure there is no packet loss as the BS moves between clusters. We then provide an analytical solution to the problem in terms of the speed of the mobile BS. We also provide analytical estimates of the unavoidable packet loss as the network size increases. We finally conduct experiments by simulation to evaluate the performance of the proposed algorithm. The results show that the use of clustering in conjunction with a mobile BS for data gathering can significantly prolong network lifetime and balance energy consumption of sensor nodes.
- 1 January 2012
- Published by Wiley in Journal of Electrical and Computer Engineering
- Vol. 2012 (1)
Open AccessMobile Base Station and Clustering to Maximize Network Lifetime in Wireless Sensor Networks
Using a mobile base station (BS) in a wireless sensor network can alleviate nonuniform energy consumption among sensor nodes and accommodate partitioned networks. In the work of Jerew and Liang (2009) we have proposed a novel clustering‐based heuristic algorithm for finding a trajectory of the mobile BS that strikes a nontrivial tradeoff between the traffic load among sensor nodes and the tour time constraint of the mobile BS. In this paper, we first show how to choose the number of clusters to ensure there is no packet loss as the BS moves between clusters. We then provide an analytical solution to the problem in terms of the speed of the mobile BS. We also provide analytical estimates of the unavoidable packet loss as the network size increases. We finally conduct experiments by simulation to evaluate the performance of the proposed algorithm. The results show that the use of clustering in conjunction with a mobile BS for data gathering can significantly prolong network lifetime and balance energy consumption of sensor nodes.
- Open Access
- 14 December 2009
- Published by Association for Computing Machinery (ACM)
- Vol. 2, 170-178
Prolonging network lifetime through the use of mobile base station in wireless sensor networks
Prolonging network lifetime is one of the most important design objectives in energy-constrained wireless sensor networks (WSNs). Using a mobile instead of a static base station (BS) to reduce or alleviate the non-uniform energy consumption among sensor nodes is an efficient mechanism to prolong the network lifetime. In this paper, we deal with the problem of prolonging network lifetime in data gathering by employing a mobile BS. To achieve that, we devise a novel clustering-based heuristic algorithm for finding a trajectory of the mobile BS that strikes the trade-off between the traffic load among sensor nodes and the tour time constraint of the mobile BS. We also conduct experiments by simulations to evaluate the performance of the proposed algorithm. The experimental results show that the use of clustering in conjunction with a mobile BS for data gathering can prolong network lifetime significantly.
- 14 December 2009
- Published by Association for Computing Machinery (ACM)
- Vol. 2, 170-178
Open AccessProlonging network lifetime through the use of mobile base station in wireless sensor networks
Prolonging network lifetime is one of the most important design objectives in energy-constrained wireless sensor networks (WSNs). Using a mobile instead of a static base station (BS) to reduce or alleviate the non-uniform energy consumption among sensor nodes is an efficient mechanism to prolong the network lifetime. In this paper, we deal with the problem of prolonging network lifetime in data gathering by employing a mobile BS. To achieve that, we devise a novel clustering-based heuristic algorithm for finding a trajectory of the mobile BS that strikes the trade-off between the traffic load among sensor nodes and the tour time constraint of the mobile BS. We also conduct experiments by simulations to evaluate the performance of the proposed algorithm. The experimental results show that the use of clustering in conjunction with a mobile BS for data gathering can prolong network lifetime significantly.