Preferred Language
Articles
/
XRbZlocBVTCNdQwCs1fL
An intersection-based segment aware algorithm for geographic routing in VANETs
...Show More Authors

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route for the transmission of the packets of data in the direction of their destination by taking into consideration the status of the traffic segment when selecting the next intersection. Through this algorithm, a new formula for assessing the status of the segment is presented based on three elements: density, connectivity, and distance. To evaluate this routing algorithm, simulations are performed, once the results are obtained, they are compared with the existing routing algorithms. The evaluation of results offered evidence that our routing algorithm did well in terms of packet delivery ratio and packet delivery delay.

Scopus Crossref
View Publication
Publication Date
Wed May 10 2023
Journal Name
Journal Of Engineering
A Proposal Algorithm to Solve Delay Constraint Least Cost Optimization Problem
...Show More Authors

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Mon Sep 30 2013
Journal Name
International Journal Of Network Security & Its Applications
Evaluating the Performance of the Secure Block Permutation Image Steganography Algorithm
...Show More Authors

Recently, a new secure steganography algorithm has been proposed, namely, the secure Block Permutation Image Steganography (BPIS) algorithm. The new algorithm consists of five main steps, these are: convert the secret message to a binary sequence, divide the binary sequence into blocks, permute each block using a key-based randomly generated permutation, concatenate the permuted blocks forming a permuted binary sequence, and then utilize a plane-based Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file format. The performance of algorithm was given a preliminary evaluation through estimating the PSNR (Peak Signal-to-Noise Ratio) of the stego image for limited number of experiments comprised hiding

... Show More
View Publication Preview PDF
Crossref
Publication Date
Thu Jan 20 2022
Journal Name
Webology
Red Monkey Optimization and Genetic Algorithm to Solving Berth Allocation Problems
...Show More Authors

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Wed Mar 16 2022
Journal Name
2022 Muthanna International Conference On Engineering Science And Technology (micest)
A hybrid feature selection technique using chi-square with genetic algorithm
...Show More Authors

View Publication
Scopus (2)
Crossref (1)
Scopus Crossref
Publication Date
Fri May 05 2017
Journal Name
International Journal Of Science And Research (ijsr)
Automatic brain tumor segmentation from MRI images using region growing algorithm
...Show More Authors

LK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2

View Publication
Publication Date
Sun May 28 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
On-Line Navigational Problem of a Mobile Robot Using Genetic Algorithm
...Show More Authors

  Manufacturing systems of the future foresee the use of intelligent vehicles, optimizing and navigating. The navigational problem is an important and challenging problem in the field of robotics. The robots often find themselves in a situation where they must find a trajectory to another position in their environment, subject to constraints posed by obstacles and the capabilities of the robot itself. On-line navigation is a set of algorithms that plans and executes a trajectory at the same time.         The system adopted in this research searches for a robot collision-free trajectory in a dynamic environment in which obstacles can move while the robot was moving toward the target. So, the ro

... Show More
View Publication Preview PDF
Publication Date
Sun May 28 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Science
On-Line Navigational Problem of a Mobile Robot Using Genetic Algorithm
...Show More Authors

Publication Date
Sun Feb 10 2019
Journal Name
Journal Of The College Of Education For Women
PERSUASION IN BLURBS AS AN ADVERTISING DISCOURSE (AN EXTRACTED RESEARCH OF MASTER DEGREE LETTER)
...Show More Authors

It is a well-known fact that publishing companies spend much money, time and energy in designing their book covers to attract potential customers. As the first thing people do when they buy or intend to buy a book is looking at its front cover. However, if there is a need to know more about the book, people usually look at the information on its back cover. This paper attempts to explore the persuasive function of blurbs beyond the constraints of the academic domain and consequently their connection with advertising discourse in two main sections: The first presents the concept of blurb and its structure while the second defines persuasion and shows the most prominent strategiesused in blurbs. Finally, this paper gives the conclusion tha

... Show More
View Publication Preview PDF
Publication Date
Thu May 18 2023
Journal Name
Journal Of Engineering
Optimal Dimensions of Small Hydraulic Structure Cutoffs Using Coupled Genetic Algorithm and ANN Model
...Show More Authors

A genetic algorithm model coupled with artificial neural network model was developed to find the optimal values of upstream, downstream cutoff lengths, length of floor and length of downstream protection required for a hydraulic structure. These were obtained for a given maximum difference head, depth of impervious layer and degree of anisotropy. The objective function to be minimized was the cost function with relative cost coefficients for the different dimensions obtained. Constraints used were those that satisfy a factor of safety of 2 against uplift pressure failure and 3 against piping failure.
Different cases reaching 1200 were modeled and analyzed using geo-studio modeling, with different values of input variables. The soil wa

... Show More
View Publication Preview PDF
Crossref (10)
Crossref
Publication Date
Wed Jan 25 2023
Journal Name
Molecular Simulation
Engineering promising A-π-D type molecules for efficient organic-based material solar cells
...Show More Authors

Within this work, to promote the efficiency of organic-based solar cells, a series of novel A-π-D type small molecules were scrutinised. The acceptors which we designed had a moiety of N, N-dimethylaniline as the donor and catechol moiety as the acceptor linked through various conjugated π-linkers. We performed DFT (B3LYP) as well as TD-DFT (CAM-B3LYP) computations using 6-31G (d,p) for scrutinising the impact of various π-linkers upon optoelectronic characteristics, stability, and rate of charge transport. In comparison with the reference molecule, various π-linkers led to a smaller HOMO–LUMO energy gap. Compared to the reference molecule, there was a considerable red shift in the molecules under study (A1–A4). Therefore, based on

... Show More
View Publication
Crossref (1)
Scopus Clarivate Crossref