The congestion-aware route selection selects the smallest-cost route based on the estimated traveling time of each road.
In addition to the incorporation of multiple user preferences in route selection, the planner is unique amongst cycling route planners in its use of topology to minimize data storage redundancy, its reliance on node/vertex index tables to increase efficiency of the route selection process, and the use of web services and asynchronous technologies for quick data delivery.
Initially, a communication-aware route selection strategy selects the optimal route by integrating the routing decisions with the link quality.
Hence, the route with high percentage of route selection probability is selected as the optimal route, which will be stable and energy efficient.
As for the shortest-distance based route selection, each evacuee selects the shortest-distance route, thus route concentration among evacuees frequently occurs.
These improvements include tuning the route selection screen to make it easier to select among the multiple route choices, improving the readability of road labels on the map and expanding the night mode color scheme across more menus for glare reduction.
Like any intermediate node I, the destination node D processes multiple RREQs before selecting an optimal wormhole-free path, satisfying the route selection criteria.
In contrast, improving the efficiency of the route selection scheme in a MANET can be achieved by combining multiple routing metrics using an adaptive intelligent tool to choose the most trustworthy nodes from which the best route to a destination can be constructed [2, 3].
The developed model integrates AHP as a multiple criteria decision-making method to determine priorities among route selection criteria, and TOPSIS method to obtain the ranking of all possible alternative routes between a source and destination.
Similarly, the requester selects route k ' according to the following modified route selection logic route k ′ = arg max route j ∈ V ′ ( P j ) ∃ route j : 1 ρ j min < R arg max route j ∈ U ′ ( C j ) Otherwise, (4).
