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.
In this work, a single pile is physically modeled and embedded in an upper liquefiable loose sand layer overlying a non-liquefiable dense layer. A laminar soil container is adopted to simulate the coupled static-dynamic loading pile response during earthquake motions: Ali Algharbi, Halabjah, El-Centro, and Kobe earthquakes. During seismic events with combined loading, the rotation along the pile, the lateral and vertical displacements at the pile head as well as the pore pressure ratio in loose sandy soil were assessed. According to the experimental findings, combined loading that ranged from 50 to 100% of axial load would alter the pile reaction by reducing the pile head peak ground acceleration, rotation of the pile, and lateral displacem
... Show MoreReal life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. In this paper, we consider the multi-criteria scheduling problem of n jobs on single machine to minimize a function of five criteria denoted by total completion times (∑), total tardiness (∑), total earliness (∑), maximum tardiness () and maximum earliness (). The single machine total tardiness problem and total earliness problem are already NP-hard, so the considered problem is strongly NP-hard.
We apply two local search algorithms (LSAs) descent method (DM) and simulated annealing method (SM) for the 1// (∑∑∑
... Show MoreThe issue of increasing the range covered by a wireless sensor network with restricted sensors is addressed utilizing improved CS employing the PSO algorithm and opposition-based learning (ICS-PSO-OBL). At first, the iteration is carried out by updating the old solution dimension by dimension to achieve independent updating across the dimensions in the high-dimensional optimization problem. The PSO operator is then incorporated to lessen the preference random walk stage's imbalance between exploration and exploitation ability. Exceptional individuals are selected from the population using OBL to boost the chance of finding the optimal solution based on the fitness value. The ICS-PSO-OBL is used to maximize coverage in WSN by converting r
... Show MoreBackground: The main objective was to compare the outcome of single layer interrupted extra-mucosal sutures with that of double layer suturing in the closure of colostomies.
Subjects and Methods: Sixty-seven patients with closure colostomy were assigned in a prospective randomized fashion into either single layer extra-mucosal anastomosis (Group A) or double layer anastomosis (Group B). Primary outcome measures included mean time taken for anastomosis, immediate postoperative complications, and mean duration of hospital stay. Secondary outcome measures assessed the postoperative return of bowel function, and the overall mean cost. Chi-square test and student t-test did the statistical analysis..
Resu
... Show MoreBackground: The bonded orthodontic retainer constructed from multistrand wire and composite is an efficient esthetic retainer, which can be maintained long-term. Clinical failures of bonded orthodontic retainers, most commonly at the wire/composite interface, have been reported. This in vitro investigation aimed to evaluate the tensile forces of selected multistrand wires and composite materials that are available for use in the construction of bonded fixed retainers. Materials and Methods: The study sample includes 120 wires with three types of retainer wires (3 braided strands\ Orthotechnology, 8 braided strands\ G&H Orthodontics, 6 coaxial strands\ Orthoclassic wires), two types of adhesive (flowable\ Orthotechnology, non flowable\ G&H O
... Show MoreBaghdad and the other Iraqis provinces have witnessed many of celebrations which have the significant effect on the souls of Arabic and Islamic people in general , and Iraqi people, especially the birthday and death of two al-kadhimen Imams(peace upon them) and others .From here the researcher begin to study the visiting of imam kadhimen (peace upon him) on 25 Rajab the commemoration of his sacrifice, simply because have implications of religious, ideological and cultural sectors which represents in finding the greatest flow of visitors .the problem of research appeared due to the clear difference in number of visitors during one day, beside the significant increase in number of visitors throu
... Show MoreIn this paper, a cognitive system based on a nonlinear neural controller and intelligent algorithm that will guide an autonomous mobile robot during continuous path-tracking and navigate over solid obstacles with avoidance was proposed. The goal of the proposed structure is to plan and track the reference path equation for the autonomous mobile robot in the mining environment to avoid the obstacles and reach to the target position by using intelligent optimization algorithms. Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC) Algorithms are used to finding the solutions of the mobile robot navigation problems in the mine by searching the optimal paths and finding the reference path equation of the optimal
... Show MoreThe transmitting and receiving of data consume the most resources in Wireless Sensor Networks (WSNs). The energy supplied by the battery is the most important resource impacting WSN's lifespan in the sensor node. Therefore, because sensor nodes run from their limited battery, energy-saving is necessary. Data aggregation can be defined as a procedure applied for the elimination of redundant transmissions, and it provides fused information to the base stations, which in turn improves the energy effectiveness and increases the lifespan of energy-constrained WSNs. In this paper, a Perceptually Important Points Based Data Aggregation (PIP-DA) method for Wireless Sensor Networks is suggested to reduce redundant data before sending them to the
... Show MoreIn recent years, the number of applications utilizing mobile wireless sensor networks (WSNs) has increased, with the intent of localization for the purposes of monitoring and obtaining data from hazardous areas. Location of the event is very critical in WSN, as sensing data is almost meaningless without the location information. In this paper, two Monte Carlo based localization schemes termed MCL and MSL* are studied. MCL obtains its location through anchor nodes whereas MSL* uses both anchor nodes and normal nodes. The use of normal nodes would increase accuracy and reduce dependency on anchor nodes, but increases communication costs. For this reason, we introduce a new approach called low communication cost schemes to reduce communication
... Show More