Preferred Language
Articles
/
joe-274
Enhanced Chain-Cluster Based Mixed Routing Algorithm for Wireless Sensor Networks
...Show More Authors

Energy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorithm that combines the full advantages of both cluster and chain techniques such as CCM (Chain-Cluster based Mixed routing). In this paper, introduce a routing algorithm relying on CCM algorithm called (Enhanced Chain-Cluster based Mixed routing) algorithm E-CCM. Simulation results show that E-CCM algorithm improves the performance of CCM algorithm in terms of three performance metrics which are: energy consumption, network lifetime, and (FND and LND). MATLAB program is used to develop and test the simulation process in a computer with the following specifications: windows 7 (32-operating system), core i5, RAM 4 GB, hard 512 GB.

 

 

View Publication Preview PDF
Quick Preview PDF
Publication Date
Sat Dec 17 2022
Journal Name
Iraqi Journal Of Laser
PDF S and U shape offset studying of the refractive index sensor based on coreless fiber: Aya R. Mejble* Hanan J.Taher
...Show More Authors

Abstract:  Two different shapes of offset optical fiber was studied based on coreless fiber for refractive index (RI)/concentration (con.) measurement, and compare them. These shapes are U and S-shapes, both shapes structures were formed by one segment of coreless fiber (CF) was joined between two single mode (SMF) lead in /lead out with the same displacement (12.268µm) at both sides, the results shows the high sensitive was achieved in a novel S-shape equal 98.768nm/RIU, to our knowledge, no one has ever mentioned or experienced it, it’s the best shape rather than the U-shape which equal 85.628nm/RIU. In this research, it was proved that the offset form has a significant effect on the sensitivity of the sensor. Addi

... Show More
View Publication Preview PDF
Publication Date
Sun Jan 01 2023
Journal Name
Computers, Materials & Continua
An Optimal Algorithm for Resource Allocation in D2D Communication
...Show More Authors

View Publication
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Tue Oct 01 2013
Journal Name
2013 Ieee International Conference On Systems, Man, And Cybernetics
AWSS: An Algorithm for Measuring Arabic Word Semantic Similarity
...Show More Authors

View Publication
Scopus (24)
Crossref (12)
Scopus Clarivate Crossref
Publication Date
Sun Jan 01 2012
Journal Name
International Journal Of Cyber-security And Digital Forensics (ijcsdf)
Genetic Algorithm Approach for Risk Reduction of Information Security
...Show More Authors

Nowadays, information systems constitute a crucial part of organizations; by losing security, these organizations will lose plenty of competitive advantages as well. The core point of information security (InfoSecu) is risk management. There are a great deal of research works and standards in security risk management (ISRM) including NIST 800-30 and ISO/IEC 27005. However, only few works of research focus on InfoSecu risk reduction, while the standards explain general principles and guidelines. They do not provide any implementation details regarding ISRM; as such reducing the InfoSecu risks in uncertain environments is painstaking. Thus, this paper applied a genetic algorithm (GA) for InfoSecu risk reduction in uncertainty. Finally, the ef

... Show More
Publication Date
Sat Jul 31 2021
Journal Name
Iraqi Journal Of Science
A Decision Tree-Aware Genetic Algorithm for Botnet Detection
...Show More Authors

     In this paper, the botnet detection problem is defined as a feature selection problem and the genetic algorithm (GA) is used to search for the best significant combination of features from the entire search space of set of features. Furthermore, the Decision Tree (DT) classifier is used as an objective function to direct the ability of the proposed GA to locate the combination of features that can correctly classify the activities into normal traffics and botnet attacks. Two datasets  namely the UNSW-NB15 and the Canadian Institute for Cybersecurity Intrusion Detection System 2017 (CICIDS2017), are used as evaluation datasets. The results reveal that the proposed DT-aware GA can effectively find the relevant features from

... Show More
Scopus (6)
Crossref (2)
Scopus Crossref
Publication Date
Sat Dec 02 2017
Journal Name
Al-khwarizmi Engineering Journal
Direction Finding Using GHA Neural Networks
...Show More Authors

 This paper adapted the neural network for the estimating of the direction of arrival (DOA). It uses an unsupervised adaptive neural network with GHA algorithm to extract the principal components that in turn, are used by Capon method to estimate the DOA, where by the PCA neural network we take signal subspace only and use it in Capon (i.e. we will ignore the noise subspace, and take the signal subspace only).

 

 

View Publication Preview PDF
Publication Date
Mon Apr 01 2024
Journal Name
Academic Science Journal
Comparison between MDDV and VADD routing protocols in VANET (Case Study)
...Show More Authors

Routing is the process of delivering a packet from a source to a destination in the network using a routing algorithm that tries to create an efficient path. The path should be created with minimum overhead and bandwidth consumption. In literature, routing protocols in VANET were categorized in many ways, according to different aspects. In the present study, we prefer the classification based on the number of hops to reach the destination node. In literature, these are single-hop and multi-hops protocols. We first discuss the two types and then compare the MDDV (multi-hops protocol) with VADD (single-hop protocol). The comparison is theoretically and experimentally implemented by providing a network environment consisting of SUMO, VIENS and

... Show More
View Publication
Crossref
Publication Date
Tue Oct 13 2020
Journal Name
2020 Ieee International Conference On Mechatronics And Automation (icma)
A Robust Multi-Channel EEG Signals Preprocessing Method for Enhanced Upper Extremity Motor Imagery Decoding
...Show More Authors

View Publication
Scopus (3)
Scopus Crossref
Publication Date
Fri Feb 24 2023
Journal Name
Membranes
Enhanced Antifouling in Flat-Sheet Polyphenylsulfone Membranes Incorporating Graphene Oxide–Tungsten Oxide for Ultrafiltration Applications
...Show More Authors

In this study tungsten oxide and graphene oxide (GO-WO2.89) were successfully combined using the ultra-sonication method and embedded with polyphenylsulfone (PPSU) to prepare novel low-fouling membranes for ultrafiltration applications. The properties of the modified membranes and performance were investigated using Fourier-transform infrared spectroscopy (FT-IR), scanning electron microscopy (SEM), contact angle (CA), water permeation flux, and bovine serum albumin (BSA) rejection. It was found that the modified PPSU membrane fabricated from 0.1 wt.% of GO-WO2.89 possessed the best characteristics, with a 40.82° contact angle and 92.94% porosity. The permeation flux of the best membrane was the highest. The pure water permeation f

... Show More
View Publication
Scopus (20)
Crossref (18)
Scopus Clarivate Crossref
Publication Date
Thu Apr 03 2025
Journal Name
Engineering, Technology & Applied Science Research
Application of the One-Step Second-Derivative Method for Solving the Transient Distribution in Markov Chain
...Show More Authors

Markov chains are an application of stochastic models in operation research, helping the analysis and optimization of processes with random events and transitions. The method that will be deployed to obtain the transient solution to a Markov chain problem is an important part of this process. The present paper introduces a novel Ordinary Differential Equation (ODE) approach to solve the Markov chain problem. The probability distribution of a continuous-time Markov chain with an infinitesimal generator at a given time is considered, which is a resulting solution of the Chapman-Kolmogorov differential equation. This study presents a one-step second-derivative method with better accuracy in solving the first-order Initial Value Problem

... Show More
View Publication
Scopus Crossref