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.
Background: 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 MoreIn this paper, new method have been investigated using evolving algorithms (EA's) to cryptanalysis one of the nonlinear stream cipher cryptosystems which depends on the Linear Feedback Shift Register (LFSR) unit by using cipher text-only attack. Genetic Algorithm (GA) and Ant Colony Optimization (ACO) which are used for attacking one of the nonlinear cryptosystems called "shrinking generator" using different lengths of cipher text and different lengths of combined LFSRs. GA and ACO proved their good performance in finding the initial values of the combined LFSRs. This work can be considered as a warning for a stream cipher designer to avoid the weak points, which may be f
... Show MoreSensing insole systems are a promising technology for various applications in healthcare and sports. They can provide valuable information about the foot pressure distribution and gait patterns of different individuals. However, designing and implementing such systems poses several challenges, such as sensor selection, calibration, data processing, and interpretation. This paper proposes a sensing insole system that uses force-sensitive resistors (FSRs) to measure the pressure exerted by the foot on different regions of the insole. This system classifies four types of foot deformities: normal, flat, over-pronation, and excessive supination. The classification stage uses the differential values of pressure points as input for a feedforwar
... Show MoreFeature selection, a method of dimensionality reduction, is nothing but collecting a range of appropriate feature subsets from the total number of features. In this paper, a point by point explanation review about the feature selection in this segment preferred affairs and its appraisal techniques are discussed. I will initiate my conversation with a straightforward approach so that we consider taking care of features and preferred issues depending upon meta-heuristic strategy. These techniques help in obtaining the best highlight subsets. Thereafter, this paper discusses some system models that drive naturally from the environment are discussed and calculations are performed so that we can take care of the prefe
... Show MoreA Mobile Ad hoc Network (MANET) is a collection of mobile nodes, that forms on the fly a temporary wireless multi-hop network in a self-organizing way, without relying on any established infrastructure. In MANET, a pair of nodes exchange messages either over a direct wireless link, or over a sequence of wireless links including one or more intermediate nodes. For this purpose, an efficient routing protocol is required. This paper introduced performance study of three of MANET protocols (AODV, GRP and OSPFv3). This study was one of the newer studies because wireless communication played an important role in today’s application and the field of mobile ad hoc network becomes very popular for the researchers in the last years. This study w
... 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).
Reliable data transfer and energy efficiency are the essential considerations for network performance in resource-constrained underwater environments. One of the efficient approaches for data routing in underwater wireless sensor networks (UWSNs) is clustering, in which the data packets are transferred from sensor nodes to the cluster head (CH). Data packets are then forwarded to a sink node in a single or multiple hops manners, which can possibly increase energy depletion of the CH as compared to other nodes. While several mechanisms have been proposed for cluster formation and CH selection to ensure efficient delivery of data packets, less attention has been given to massive data co