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.
<p><span>Medium access control (MAC) protocol design plays a crucial role to increase the performance of wireless communications and networks. The channel access mechanism is provided by MAC layer to share the medium by multiple stations. Different types of wireless networks have different design requirements such as throughput, delay, power consumption, fairness, reliability, and network density, therefore, MAC protocol for these networks must satisfy their requirements. In this work, we proposed two multiplexing methods for modern wireless networks: Massive multiple-input-multiple-output (MIMO) and power domain non-orthogonal multiple access (PD-NOMA). The first research method namely Massive MIMO uses a massive numbe
... Show More<span lang="EN-US">Diabetes is one of the deadliest diseases in the world that can lead to stroke, blindness, organ failure, and amputation of lower limbs. Researches state that diabetes can be controlled if it is detected at an early stage. Scientists are becoming more interested in classification algorithms in diagnosing diseases. In this study, we have analyzed the performance of five classification algorithms namely naïve Bayes, support vector machine, multi layer perceptron artificial neural network, decision tree, and random forest using diabetes dataset that contains the information of 2000 female patients. Various metrics were applied in evaluating the performance of the classifiers such as precision, area under the c
... Show MoreThe consumption of dried bananas has increased because they contain essential nutrients. In order to preserve bananas for a longer period, a drying process is carried out, which makes them a light snack that does not spoil quickly. On the other hand, machine learning algorithms can be used to predict the sweetness of dried bananas. The article aimed to study the effect of different drying times (6, 8, and 10 hours) using an air dryer on some physical and chemical characteristics of bananas, including CIE-L*a*b, water content, carbohydrates, and sweetness. Also predicting the sweetness of dried bananas based on the CIE-L*a*b ratios using machine learn- ing algorithms RF, SVM, LDA, KNN, and CART. The results showed that increasing the drying
... Show MoreBackground:sThe aims of this study were to evaluate and compare the ability of three different techniques to obdurate simulated lateral canals, evaluate the effect of the main canal curvature on obturation of lateral canals and compare the gutta-percha penetration between coronal and apical lateral canals. Materials and methods: Resin blocks with 30 straight and 30 curved were used in this study. Each canal has two parallel lateral canals. The main canal has 0.3 mm apical diameter and 0.04 taper. The canals were divided into six groups according to canal curvature and obturation techniques used (n=10): Groups C1 and C2: straight and curved canals obturated with continuous wave technique using E&Q masterTM system. Groups O1 and O2: straight
... Show MoreBackground: One of the major problems in endodontics is micro-leakage of root canal fillings which might contribute to the failure of endodontic treatment. To avoid this problem, a variety of sealers have been tested. The objective of this, in vitro, study was to evaluate the shear bond strength of four resin based sealers (AH plus, silver free AH26, RealSeal SE and Perma Evolution permanent root canal filling material) to dentin. Materials and Methods: Forty non-carious extracted lower premolars were used. The 2mm of the occlusal surfaces of teeth were sectioned, to expose the dentin surface. The exposed dentin surfaces of teeth were washed with 5ml of 2.5% NaOCl solution followed by 5ml of 17 % EDTA then rinsed by deionized water to remov
... Show MoreTransport is a problem and one of the most important mathematical methods that help in making the right decision for the transfer of goods from sources of supply to demand centers and the lowest possible costs, In this research, the mathematical model of the three-dimensional transport problem in which the transport of goods is not homogeneous was constructed. The simplex programming method was used to solve the problem of transporting the three food products (rice, oil, paste) from warehouses to the student areas in Baghdad, This model proved its efficiency in reducing the total transport costs of the three products. After the model was solved in (Winqsb) program, the results showed that the total cost of transportation is (269,
... Show MoreThe parametric programming considered as type of sensitivity analysis. In this research concerning to study the effect of the variations on linear programming model (objective function coefficients and right hand side) on the optimal solution. To determine the parameter (θ) value (-5≤ θ ≤5).Whereas the result، the objective function equal zero and the decision variables are non basic، when the parameter (θ = -5).The objective function value increases when the parameter (θ= 5) and the decision variables are basic، with the except of X24, X34.Whenever the parameter value increase, the objectiv
... Show MoreTraditionally, 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).