Article Per Year (5 Year)
p-Index From 2020 - 2025
0.553
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering TELKOMNIKA (Telecommunication Computing Electronics and Control)
Israa Ezzat Salem
Baghdad College of Economic Sciences University
Computer Science & IT Electrical & Electronics Engineering

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Flight-schedule using Dijkstra's algorithm with comparison of routes findings Israa Ezzat Salem; Maad M. Mijwil; Alaa Wagih Abdulqader; Marwa M. Ismaeel
International Journal of Electrical and Computer Engineering (IJECE) Vol 12, No 2: April 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v12i2.pp1675-1682

Abstract

The Dijkstra algorithm, also termed the shortest-route algorithm, is a model that is categorized within the search algorithms. Its purpose is to discover the shortest-route, from the beginning node (origin node) to any node on the tracks, and is applied to both directional and undirected graphs. However, all edges must have non-negative values. The problem of organizing inter-city flights is one of the most important challenges facing airplanes and how to transport passengers and commercial goods between large cities in less time and at a lower cost. In this paper, the authors implement the Dijkstra algorithm to solve this complex problem and also to update it to see the shortest-route from the origin node (city) to the destination node (other cities) in less time and cost for flights using simulation environment. Such as, when graph nodes describe cities and edge route costs represent driving distances between cities that are linked with the direct road. The experimental results show the ability of the simulation to locate the most cost-effective route in the shortest possible time (seconds), as the test achieved 95% to find the suitable route for flights in the shortest possible time and whatever the number of cities on the tracks application.
A new algorithm for implementing message authentication and integrity in software implementations Alaa Wagih Abdul Qader; Israa Ezzat Salem; Haider Rasheed Abdulshaheed
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 18, No 5: October 2020
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v18i5.15276

Abstract

IT systems and data that you store, and process are valuable resources that need protection. Validation and reliability of information are essential in networks and computer systems. The communicating is done by two parties via an unsafe channel require a way to validate the data spent by one party as valid (or unaltered) by the other party. In our study, we suggest new one-way defragmentation algorithm to implement message authentication and integration in program execution. These software applications are readily available and freely available because most of the hash functions are faster than their existing radioactive blocks.
Co-Authors Alaa Wagih Abdul Qader Alaa Wagih Abdulqader Haider Rasheed Abdulshaheed Maad M. Mijwil Marwa M. Ismaeel