Internet of Things (IoT) is one of the newest matters in both industry and academia of the communication engineering world. On the other hand, wireless mesh networks, a network topology that has been debate for decades that haven’t been put into use in great scale, can make a transformation when it arises to the network in the IoT world nowadays. A Mesh IoT network is a local network architecture in which linked devices cooperate and route data using a specified protocol. Typically, IoT devices exchange sensor data by connecting to an IoT gateway. However, there are certain limitations if it involves to large number of sensors and the data that should be received is difficult to analyze. The aim of the work here is to implement a self-

In the name of God, the Most Gracious, the Most Merciful

Praise be to God who revived Balu. And the good word brought hard hearts after removing from them what had almost killed them of ignorance, injustice, hatred, hostility, estrangement, and irritation... So God replaced for them what was best with what was best in terms of knowledge and fairness, and what was corrupt, love, and altruism. So the example of a believer and a good word is like a tree with good roots and branches. Then I pray and greet the one who watered it from the pure and inexhaustible spring of Islam, our Master Muhammad, so that the valleys flowed in their capacity, and the crops grew, then they became thicker and became even, and their good fruits in behavi

Abstracts

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 algorith

In today's world, the science of bioinformatics is developing rapidly, especially with regard to the analysis and study of biological networks. Scientists have used various nature-inspired algorithms to find protein complexes in protein-protein interaction (PPI) networks. These networks help scientists guess the molecular function of unknown proteins and show how cells work regularly. It is very common in PPI networks for a protein to participate in multiple functions and belong to many complexes, and as a result, complexes may overlap in the PPI networks. However, developing an efficient and reliable method to address the problem of detecting overlapping protein complexes remains a challenge since it is considered a complex and har

In this study, the kinematic analysis including the forward and inverse kinematic developed for a 5 degree of freedom robotic arm. The forward kinematic is elaborated using Denavit-Hartenberg (DH) convention. Inverse Kinematic is established using Deep Neural Network (DNN) model with five hidden layer each contain 50 neurons fully connected using ReLu activation. A data of inputs and outputs are created and trained. The inputs are the end-effector position and orientation. The outputs are the joint angles of the manipulator. The data is generated by the forward kinematics, where a set of joint angles that limited by their corresponding ranges are inserted to the forward kinematic equations to result the end-effector positions and or