Operational research science aims to find the optimal solution
to many problems in various life domains. One of the most famous
is the network analysis. Problem. In this paper we introduce an
effective algorithm with linear time O ( n + k ) within it all network
activities are executed within determined period and with a
minimum cost.
In this paper, we introduce an Effective algorithm to find the
shortest path in Multiple – Source Graph, by choosing the path
between the source and the distance that gives at least the length of
the path down to the sink. This algorithm is based
on the principle
of iteration to access the optimal solution of the shortest-path
problem, Where the algorithm steps are repeated for all the darts in
the Graph. We proved that the time of implementation of the
proposed algorithm in this paper is linear time O(n+L) and This is
considered the best times of the algorithms at all.
The shortest path problem can be categorized in to two
different problems; single source shortest path problem (SSSP) and
all pair shortest algorithm (APSP). In this paper, analysis and
comparison between complexity of the famous shortest path
al
gorithms have been made, and the obtained results have shown
that researchers have got remarkable success in designing better
algorithms in the terms of time complexity to solve shortest path
algorithms.
As a result of the expansion of system of sewerage and rain water networks to serve all areas in Tartous city especially its industrial area, it was not associated with proper wastewater treatment including the separation of rainwater from sewage and
building wastewater treatment plants. With the increased number of factories in the industrial area , the population growth in the city of Tartous, the demand for industrial needs, the poor investment for networks, the clogged lines and insulting them by mixing municipal, industrial and rainwater sewage and large precipitation for Tartous city Basin, and the difficulty of discharging wastewater according with gravity to the treatment plant And the lack of possibility to drain rain water with large flows, the study of the current situation of municipal, industrial and rainwater sewage to develop solutions for it.
Handover technique in LTE networks suffers from Ping-pong Handover, which can be defined as a call is handed over to a new eNB and it then is handed back to the source eNB (evolved NodeB) within pre-defined and short time. Ping-pong handover can redu
ce the quality connection and
increases the number of handovers which in turn raise the network load and generally degrade the network performance. The work aims to present a novel approach to reduce the undesirable effects of ping-pong handover in beyond third Generation Mobile Networks.
The study guided to suggest an algorithm to select whether the user movement belongs to ping-pong type of movement or not and propose a technique to reduce the number of ping-pong handovers in Networks.
The suggested algorithm is based on performing the handover process in two steps (separated by timer). First step starts the handover preparation and execution as soon as the received signal strength from the target eNodeB becomes higher than that received from the source eNodeB. And delay the completion part of the HO technique for a time equal to the timer value. The research focused on the ping-ping phenomenon taking into account maintained the dropped calls rates at lowest levels. The optimal timer values are determined based on the width of overlapping area, user velocity and type of eNodeB. Moreover, the effects of tilting antennae on the probability of ping-pong handover are studied. Analysed and simulated results (using Matlab and TRIAS) showed that the timer values of the proposed algorithm reconciled with the mathematical results. Also, results clarified that tilting eNBs’ antennas decrease the probability of dropped calls. Comparison results illustrated that there is a significant reduction in the probability of ping-pong HOs, without any increasing in the probability of dropped calls for different scenarios. In future work, the proposed algorithm can be evolved and applied to heterogeneous networks and LTE advanced.
Three dimensional modeling of utility networks is an important mean of networks design, implementation, management and maintenance. During the modeling process, we face a wide range of processes and procedures to arrive at the correct final model.
T
his research proposes a semi-automatic methodology for 3D modeling of infrastructure networks in GIS environment. This methodology is based on the ModelBuilder in ArcGIS software by developing two tools to automate the construction processes of 3D networks.
The first presents a tool to create a 3D Manhole layer from points, and the second is a tool to create a 3D pipe layer. For both tools, a work algorithm has been built, in addition to designing user interfaces elements. These tools are stored in a Toolbox called “3D Manhole & Pipe.tbx”.
The proposed methodology is an easy and an effective way to build 3D network models, and the developed tools allow the implementation of a set of necessary processes needed to build 3D networks.
