Professional Documents
Culture Documents
Optimal Path Finding Using Sequential Intermediate Destinations and Randomized Routing Algorithms
Optimal Path Finding Using Sequential Intermediate Destinations and Randomized Routing Algorithms
Keywords: Randomized routing algorithms, Sequential intermediate destinations, Optimal path finding
Abstract: Routing algorithms are protocols which are most commonly used in efficiently directing internetwork traffic.
There are a number of deterministic and randomized routing algorithms proposed in existing literature, partic-
ularly in mobile ad hoc networks. In this paper, we take these routing algorithms and test their effectiveness
when implemented in road transport networks. Our simulation results show that internet routing protocols
are effective in finding an optimal path in a road network given an origin-destination pair, and a set of land-
mark nodes referred to as intermediate nodes. Results also show that implementing sector-based algorithms
significantly improves the path finding ability of these algorithms.
a 2D graph with the edges representing roads of vary- (node labels start from the bottom-left at (0, 0)). Ori-
ing hierarchies was presented. A list of the road hier- gin and destination nodes were fixed at (0, 0) and
archies with their corresponding scores along with an (n − 1, n − 1) respectively for all runs. Finally, all
the speed limit associated with the road hierarchy was roads in the network were assigned random hierar-
also presented in the study (see Table 1). chies.
After representing the given road transport net-
work as a nxn graph, a subraph containing the po-
tential path area described in Section 2.4 is gener-
3 Methodology ated. As in (Carigma et al., 2019), the detour fac-
tor was assumed to be an inverse function of the dis-
3.1 Simulation environment tance between the given origin and destination nodes,
instead of the corresponding travel time. Using the
method described in Section 2.5, nodal affinity scores
for each node were calculated. The set of candidate
intermeiate nodes was then generated by selecting the
200 top-scoring nodes. Figure 4 illustrates the graph
representing the road network, the ellipse determined
by the detour factor, and the set of candidate interme-
diate nodes for the given origin and destination nodes.
some modifications to the algorithms were made. As 4.2 Average stretch factor
in (Fevens et al., 2005), transmission radius was ini-
tially set to 15m. In the event that an algorithm is un- The average stretch factor of each algorithm is pre-
able to select the next intermediate node given its cur- sented in Table 2. From the results we can clearly see
rent transmission radius, the radius is incremented by that the stretch factor for all the algorithms increases
one meter and the process of selecting the next node as n increases. Moreover, the deterministic routing
is restarted. This step is repeated until the algorithm algorithms (Greedy, GreedyInSector, and Compass)
successfully finds the next viable intermediate node. performed better than the randomized algorithms in
This ensures that a path is found from the given origin general.
and destination pair. A shortest path is then generated It is important to note that the sector-based routing
from the current node to the determined intermediate algorithms (GreedyInSector, RadnomInSector) per-
node. The whole process is then repeated until the formed significantly better than all the non sector-
destination node is reached. The optimal path is con- based algorithms, both deterministic and random-
catenated shortest paths generated by the algorithm. ized, especially on networks having higher number of
Figure 5 illustrates the path given by the algorithm nodes. This is because the Sector restricts the extent
and the actual shortest path in the network. to which the path strays away from the directoin of
For each of the network sizes given, each algo- the destination. Furthermore, the deterministic sector-
rithm was ran 10 times. Average delivery rates and based GreedyInSector algorithm performed slightly
average stretch factors were then computed. A tabu- better than the randomized sector-based RandomIn-
lation and interpretation of the results is presented in Sector algorithm. A sample run of the GreedyInSec-
the next section. tor algorithm in different test networks is shown in
Figure 6.