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.
The right to property is one of the most fundamental rights enjoyed by individuals, and most national constitutions and laws, as well as international conventions, have to be respected and protected only in accordance with the economic and social development of the country (the so-called public benefit) and in return for just compensation. What is fair compensation?
The paper presents an original method to make the geometric synthesis of the rotary cam and translated tappet with roll. Classical method uses to the geometric synthesis and the reduced tappet velocity, and in this mode the geometric classic method become a geometric and kinematic synthesis method. The new geometric synthesis method uses just the geometric parameters (without velocities), but one utilizes and a condition to realize at the tapped the velocities predicted by the tapped movement laws imposed by the cam profile. Then, it makes the dynamic analyze for the imposed cam profile, and one modify the cam profile geometric parameters to determine a good dynamic response (functionality). In this mode it realizes the dynamic synthesis
... Show MoreThe bandwidth requirements of telecommunication network users increased rapidly during the last decades. Optical access technologies must provide the bandwidth demand for each user. The passive optical access networks (PONs) support a maximum data rate of 100 Gbps by using the Orthogonal Frequency Division Multiplexing (OFDM) technique in the optical access network. In this paper, the optical broadband access networks with many techniques from Time Division Multiplexing Passive Optical Networks (TDM PON) to Orthogonal Frequency Division Multiplex Passive Optical Networks (OFDM PON) are presented. The architectures, advantages, disadvantages, and main parameters of these optical access networks are discussed and reported which have many ad
... Show MoreIn this work, the switching nonlinear dynamics of a Fabry-Perot etalon are studied. The method used to complete the solution of the differential equations for the nonlinear medium. The Debye relaxation equations solved numerically to predict the behavior of the cavity for modulated input power. The response of the cavity filled with materials of different response time is depicted. For a material with a response time equal to = 50 ns, the cavity switches after about (100 ns). Notice that there is always a finite time delay before the cavity switches. The switch up time is much longer than the cavity build-up time of the corresponding linear cavity which was found to be of the order of a few round-trip ti
... Show MoreThis article proposes a new strategy based on a hybrid method that combines the gravitational search algorithm (GSA) with the bat algorithm (BAT) to solve a single-objective optimization problem. It first runs GSA, followed by BAT as the second step. The proposed approach relies on a parameter between 0 and 1 to address the problem of falling into local research because the lack of a local search mechanism increases intensity search, whereas diversity remains high and easily falls into the local optimum. The improvement is equivalent to the speed of the original BAT. Access speed is increased for the best solution. All solutions in the population are updated before the end of the operation of the proposed algorithm. The diversification f
... Show MoreThe health care industry is witnessing an increasing trend in the use of generic medicines because of their presumed low cost compared with innovator medicines. The aim of this study was to determine and compare the performance of the copy drug Osveral®and its innovator drug deferasirox (Exjade®).
A prospective observational study including 223 patients receiving the branded medicine Exjade®and 101 patients receiving the copy Osveral®was carried out. Data were assessed for a 1-year period and included clinical symptoms, serum ferrit
NeighShrink is an efficient image denoising algorithm based on the discrete wavelet
transform (DWT). Its disadvantage is to use a suboptimal universal threshold and identical
neighbouring window size in all wavelet subbands. Dengwen and Wengang proposed an
improved method, which can determine an optimal threshold and neighbouring window size
for every subband by the Stein’s unbiased risk estimate (SURE). Its denoising performance is
considerably superior to NeighShrink and also outperforms SURE-LET, which is an up-todate
denoising algorithm based on the SURE. In this paper different wavelet transform
families are used with this improved method, the results show that Haar wavelet has the
lowest performance among
Transportability refers to the ease with which people, goods, or services may be transferred. When transportability is high, distance becomes less of a limitation for activities. Transportation networks are frequently represented by a set of locations and a set of links that indicate the connections between those places which is usually called network topology. Hence, each transmission network has a unique topology that distinguishes its structure. The most essential components of such a framework are the network architecture and the connection level. This research aims to demonstrate the efficiency of the road network in the Al-Karrada area which is located in the Baghdad city. The analysis based on a quantitative evaluation using graph th
... Show MoreIn this article, results have been shown via using a general quasi contraction multi-valued mapping in Cat(0) space. These results are used to prove the convergence of two iteration algorithms to a fixed point and the equivalence of convergence. We also demonstrate an appropriate conditions to ensure that one is faster than others.