Mobile-based Routes Network Analysis for Emergency Response Using an Enhanced Dijkstra’s Algorithm and AHP

Abstract

In emergencies cases, the main problem is how to arrive to an incident location in a minimum time. In such cases, using the classical distance based routing techniques does not always provide the optimal path in the time needed. In this paper, we present an enhanced routing technique which is based on Dijkstra's algorithm and Analytical Hierarchical Processing (AHP). Eight impendence factors that cause latency in emergency situations are analyzed using the AHP technique to give an overall weight for every road in Greater Cairo Region (GCR) road network. Then, the classical Dijkstra's algorithm applied on the weighted road network to give the best path between any two nodes in the network. The eight impedance factors considered are: Road Length, Travel Time, Road Type, Road Width, Velocity Limits, Traffic Volume, Mass Density, and Junction Delay. The suggested routing approach is implemented as a mobile application, and a comparison with the classical Dijkstra's algorithm is performed. The results show that the enhanced routing technique is more reliable than the classical one and more suitable for emergencies situations.

Modified Floyd Warshall Algorithm for Cache Management in Information Centric Network

“…In this experimental section, the proposed system was simulated by using python with 3.5 GHz, Intel i5 processor, 4 GB RAM and 1 TB hard disc. The developed GEANT network topology consists To evaluate the efficiency of proposed system, the performance of proposed shortest path estimation approach (MFWA) was compared with a few existing shortest path estimation algorithms (FWA, DA [21], and EDA [22]) and also tested with five dissimilar cache management policies like HR-SYMM, HR-ASYMM, HR-MULTICAST, HR-HYBRID-AM, and HR-HYBRID-SM. In this research, the proposed system performance was validated by means of link load, latency, and cache hit ratio.…”

“…In this scenario, the experimental investigation is validated with five dissimilar network caches (0.01, 0.05, 0.1, 0.5, and 1). The validation outcome shows that the proposed shortest path estimation approach: MFWA gives better outcome in all cache management policies; HR-SYMM, HR-ASYMM, HR-MULTICAST, HR-HYBRID-AM, and HR-HYBRID-SM compared to the existing shortest path estimation algorithms (FWA DA [21], and EDA [22]). The graphical depiction of cache hit ratio is shown in the Fig.…”

“…Ibrahim, and H.A. Hefny, [22] developed an enhanced routing technique: Dijkstra's algorithm and Analytical Hierarchical Processing (AHP) for mobile based route network analysis. Initially, classical Dijkstra's algorithm was applied to the weighted road network to give the best path between any two nodes in the network.…”

“…In this subsection, the quantitative analysis of existing and proposed work is carried out in terms of latency and link load performance. Here, the efficiency of proposed method is validated with two exiting shortest path estimation approaches (FWA, DA [21], and EDA [22]) and five cache management policies (HR-SYMM, HR-ASYMM, HR-MULTICAST, HR-HYBRID-AM, and HR-HYBRID-SM). Also, the proposed and existing shortest path estimation approach is validated with different network caches.…”

“…Graphical comparison of proposed and existing methodology in terms of latency and 2, the proposed shortest path estimation approach: MFWA shows better link load and latency performance as compared to the existing shortest path estimation approaches (FWA, DA[21], and EDA[22]). Generally, the cache load in forward and backward path is different, due to traffic of interest and data flow.…”