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 algorithms are proposed in this work with a discussion on the difference between them. These algorithms find the shortest route through finding the optimal rate between two nodes in the wireless networks but with bounded end-to-end delay. The Dijkstra-based algorithm is especially favorable in terms of processing time. We also present a comparison between our proposed single-constraint Dijkstra-based routing algorithm and the mesh routing algorithm (MRA) existing in the literature to clarify the merits of the former.
Recently, microalgae have become a promising source in the production of biofuel. However, the cost of production is still the main obstacle to develop of this type of source. Although there are many extensive studies on the requirements provided for the cultivation of the microalgae, the study of the process, via the variables that affect the cultivation of microalgae, being still one of the important tasks to improve the production of biofuel. The present article is a serious attempt to investigate of use commercial fertilizer NPK (20:20:20+TE N: P: K) as considered a cheap nutrient medium in growth Chlorella vulgaris by comparison with traditional nutrient (Chu.10 medium). In addition, the current study addresses effect of different spar
... Show MoreBackground: to evaluate the effect of different dentifrices on the surface roughness of two composite resins (nanofilled-based and nanoceramic – based composite resins). Materials and methods: Forty specimens (diameter 12 mm and height of 2mm) prepared from different composite resin materials: Z350 (nanofilled composite, and Ceram-X (nanoceramic) .they were subjected to brushing simulation equivalent to the period of 1 year. The groups assessed were a control group brushed with distilled water (G1), Opalescence whitening toothpasteR (G2), Colgate sensitive pro-relief (G3) and Biomed Charcoal Toothpaste (G4). The initial and final roughness of each group was tested by surface roughness tester. The results were statistically analyzed using
... Show MoreThe research aims to shed light on the role of artificial intelligence in achieving Ambidexterity performance, as banks work to take advantage of modern technologies, artificial intelligence is an innovation that is expected to have a long-term impact, as well as banks can improve the quality of their services and analyze data to ensure that customers' future needs are understood. . The Bank of Baghdad and the Middle East Bank were chosen as a community for the study because they had a role in the economic development of the country as well as their active role in the banking market. A sample of department managers was highlighted in collecting data and extracting results based on the checklist, which is the main tool for the stu
... Show MoreThis study investigates the possibility of removing ciprofloxacin (CIP) using three types of adsorbent based on green-prepared iron nanoparticles (Fe.NPs), copper nanoparticles (Cu. NPS), and silver nanoparticles (Ag. NPS) from synthesized aqueous solution. They were characterized using different analysis methods. According to the characterization findings, each prepared NPs has the shape of a sphere and with ranges in sizes from of 85, 47, and 32 nanometers and a surface area of 2.1913, 1.6562, and 1.2387 m2/g for Fe.NPs, Cu.NPs and Ag.NPs, respectively. The effects of various parameters such as pH, initial CIP concentration, temperature, NPs dosage, and time on CIP removal were investigated through batch experiments. The res
... Show MoreThe problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.