Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith

Recently, the theory of Complex Networks gives a modern insight into a variety of applications in our life. Complex Networks are used to form complex phenomena into graph-based models that include nodes and edges connecting them. This representation can be analyzed by using network metrics such as node degree, clustering coefficient, path length, closeness, betweenness, density, and diameter, to mention a few. The topology of the complex interconnections of power grids is considered one of the challenges that can be faced in terms of understanding and analyzing them. Therefore, some countries use Complex Networks concepts to model their power grid networks. In this work, the Iraqi Power Grid network (IPG) has been modeled, visua

This paper presents a proposed neural network algorithm to solve the shortest path problem (SPP) for communication routing. The solution extends the traditional recurrent Hopfield architecture introducing the optimal routing for any request by choosing single and multi link path node-to-node traffic to minimize the loss. This suggested neural network algorithm implemented by using 20-nodes network example. The result shows that a clear convergence can be achieved by 95% valid convergence (about 361 optimal routes from 380-pairs). Additionally computation performance is also mentioned at the expense of slightly worse results.

Background: The Covid-19 pandemic changed the world; its most important achievement for education was changing the approach from traditional to virtual education. The present study aimed to investigate the role of virtual education networks on mental health of students including personality, beliefs, scientific, and cultural dimensions, in selected countries.Methods: This was an exploratory and applied study. According to the phenomenology strategy, theoretical saturation occurred after 24 semi-structured and targeted qualitative interviews with teachers from Iran, Iraq, Syria and Lebanon, in 2023. Quantitative data was collected through a researcher-made online questionnaire with 423 participants. Teachers with at least a Bachelor’s degr

Abstract\

In this research, estimated the reliability of water system network in Baghdad was done. to assess its performance during a specific period. a fault tree through static and dynamic gates was belt and these gates represent logical relationships between the main events in the network and analyzed using dynamic Bayesian networks . As it has been applied Dynamic Bayesian networks estimate reliability by translating dynamic fault tree to Dynamic Bayesian networks and reliability of the system appreciated. As was the potential for the expense of each phase of the network for each gate . Because there are two parts to the Dynamic Bayesian networks and two part of gate (AND), which includes the three basic units of the

The Next-generation networks, such as 5G and 6G, need capacity and requirements for low latency, and high dependability. According to experts, one of the most important features of (5 and 6) G networks is network slicing. To enhance the Quality of Service (QoS), network operators may now operate many instances on the same infrastructure due to configuring able slicing QoS. Each virtualized network resource, such as connection bandwidth, buffer size, and computing functions, may have a varied number of virtualized network resources. Because network resources are limited, virtual resources of the slices must be carefully coordinated to meet the different QoS requirements of users and services. These networks may be modifie

     Cloth simulation and animation has been the topic of research since the mid-80's in the field of computer graphics. Enforcing incompressible is very important in real time simulation. Although, there are great achievements in this regard, it still suffers from unnecessary time consumption in certain steps that is common in real time applications.   This research develops a real-time cloth simulator for a virtual human character (VHC) with wearable clothing. This research achieves success in cloth simulation on the VHC through enhancing the position-based dynamics (PBD) framework by computing a series of positional constraints which implement constant densities. Also, the self-collision and collision wit