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.
Research includes three axes, the first is the average estimate time of achievement (day) to work oversight, to five supervisory departments in the Office of Financial Supervision Federal and then choose the three control outputs and at the level of each of the five departments above, and after analyzing the data statistically back to us that the distribution of the times of achievement It is the exponential distribution (Exponential Distribution) a parameter (q), and the distribution of normal (Normal Distribution) with two parameters (μ, σ2), and introduced four methods of parameter estimation (q) as well as four modalities parameter to estimate (
... Show MoreIn 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 f
... Show MoreIn this paper, a Modified Weighted Low Energy Adaptive Clustering Hierarchy (MW-LEACH) protocol is implemented to improve the Quality of Service (QoS) in Wireless Sensor Network (WSN) with mobile sink node. The Quality of Service is measured in terms of Throughput Ratio (TR), Packet Loss Ratio (PLR) and Energy Consumption (EC). The protocol is implemented based on Python simulation. Simulation Results showed that the proposed protocol provides better Quality of Service in comparison with Weighted Low Energy Cluster Hierarchy (W-LEACH) protocol by 63%.
Nowadays, the robotic arm is fast becoming the most popular robotic form used in the industry among others. Therefore, the issues regarding remote monitoring and controlling system are very important, which measures different environmental parameters at a distance away from the room and sets various condition for a desired environment through a wireless communication system operated from a central room. Thus, it is crucial to create a programming system which can control the movement of each part of the industrial robot in order to ensure it functions properly. EDARM ED-7100 is one of the simplest models of the robotic arm, which has a manual controller to control the movement of the robotic arm. In order to improve this control s
... Show MoreA cost-effective and efficient detector was created to conduct thorough turbidimetric measurements by reaction of Co (II) ion with calcium ferro cyanide to form bright green particulate, using the method of continuous flow injection analysis, the use of NAG-5SX1-1D-SSP Analyzer in determining cobalt (II) ion in a test for the validity of the new design. The NAG-5SX1-1D-SSP Analyzer is composed of five irradiation sources of white snow leds having the diameter of 10 mm with one solar cell of 55 mm length, 13.5 mm width. Using a selector switch to select the optimum voltage to be used which was 2.7 VDC. Under conditions of optimization, cobalt (II) ion was determined at 0.005–20 mmol. L–1(n = 23) while linearity dynamic range 0.005–7 mm
... Show MoreThe goals of endodontic preparation were to shape and clean the space of the root canal and remove microorganisms, affected dentin and pulp, the apical foramen and the canal curve should be protected from being transported during endodontic canal preparation. The aim of this study was to evaluate the curve straightening of curved root canals and apical transportation after preparation with four rotary systems. Forty mesial roots of the lower 1st molars teeth only the mesiobuccal canals were used, these roots were immersed into cold clear acrylic , the teeth roots divided into four groups according to rotary system used for preparation of the canals (ten roots for each group):. group I: ProTaper Next rotary system, group II: IRaCe Plus rotar
... Show MoreIn this study, dynamic encryption techniques are explored as an image cipher method to generate S-boxes similar to AES S-boxes with the help of a private key belonging to the user and enable images to be encrypted or decrypted using S-boxes. This study consists of two stages: the dynamic generation of the S-box method and the encryption-decryption method. S-boxes should have a non-linear structure, and for this reason, K/DSA (Knutt Durstenfeld Shuffle Algorithm), which is one of the pseudo-random techniques, is used to generate S-boxes dynamically. The biggest advantage of this approach is the production of the inverted S-box with the S-box. Compared to the methods in the literature, the need to store the S-box is eliminated. Also, the fabr
... Show More