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.
Contemporary life is racing against time in its temptations and variables, and it has become shaped and changed in an amazing way in its various aspects and fields. This was facilitated by intellectual and scientific communication between civilizations, and the rapid progression in successive inventions and discoveries in the fields of science and arts of knowledge. This contributed to a great economic and commercial renaissance. Then, these economic developments entered the world into a very strong competition, which forced producers to calculate all production costs, to reach the highest profits by reducing the price of the produced commodity on the one hand, and achieving quality in appearance (especially) on the other hand. Since the ma
... Show MoreFour different spectrophotometric methods are used in this study for the determination of Sulfamethoxazole and sulfanilamide drugs in pharmaceutical compounds, synthetic samples, and in their pure forms. The work comprises four chapters which are shown in the following: Chapter One: Includes a brief for Ultraviolet-Visible (UV-VIS) Absorption spectroscopy, antibacterial drugs and sulfonamides with some methods for their determination. The chapter lists two methods for optimization; univariate method and multivariate method. The later includes different types, two of these were mentioned; simplex method and design of experiment method. Chapter Two: Includes reaction of the two studied drugs with sodium nitrite and hydrochloric acid for diazo
... Show MoreThe ultimate goal of any sale contract is to maximize the combined returns of the parties, knowing that these returns are not realized (in long-term contracts) except in the final stages of the contract. Therefore, this requires the parties to the contract to leave some elements open, including the price, because the adoption of a fixed price and inflexible will not be appropriate to meet their desires when contracting, especially with ignorance of matters beyond their will and may affect the market conditions, and the possibility of modifying the fixed price through The elimination is very limited, especially when the parties to the contract are equally in terms of economic strength. Hence, in order to respond to market uncertainties, the
... Show MoreThis research include building mathematical models for aggregating planning and shorting planning by using integer programming technique for planning master production scheduling in order to control on the operating production for manufacturing companies to achieve their objectives of increasing the efficiency of utilizing resources and reduce storage and improving customers service through deliver in the actual dates and reducing delays.
In this paper, a new technique is offered for solving three types of linear integral equations of the 2nd kind including Volterra-Fredholm integral equations (LVFIE) (as a general case), Volterra integral equations (LVIE) and Fredholm integral equations (LFIE) (as special cases). The new technique depends on approximating the solution to a polynomial of degree and therefore reducing the problem to a linear programming problem(LPP), which will be solved to find the approximate solution of LVFIE. Moreover, quadrature methods including trapezoidal rule (TR), Simpson 1/3 rule (SR), Boole rule (BR), and Romberg integration formula (RI) are used to approximate the integrals that exist in LVFIE. Also, a comparison between those
... Show MoreCommunity detection is useful for better understanding the structure of complex networks. It aids in the extraction of the required information from such networks and has a vital role in different fields that range from healthcare to regional geography, economics, human interactions, and mobility. The method for detecting the structure of communities involves the partitioning of complex networks into groups of nodes, with extensive connections within community and sparse connections with other communities. In the literature, two main measures, namely the Modularity (Q) and Normalized Mutual Information (NMI) have been used for evaluating the validation and quality of the detected community structures. Although many optimization algo
... Show More