A Proficient Path Selection for Wireless Ad Hoc Routing Protocol

Usually, routing protocols which are based on link-state information such as (OSPF, OLSR, and FSR) compute the shortest routes to each reachable destination using a path-selection algorithm like Dijkstra's algorithm or the Bellman-Ford algorithm. However, in an on-demand link-state routing protocol, there is no need to know the path to every other node. Accordingly, when a node chooses a next hop for a given destination, it must be true that the next hop has reported a path to the same destination; otherwise, packets sent through that node would be dropped. Traditional path selection algorithms does not consider this constraint and cannot be used for computing shortest paths in emerging on-demand link-state routing protocols. In this paper, we present a new path-selection algorithm that provides a faster communication path between the source and destination, which depends on the link state information (delay, throughput). Although the route based on the shorter number of hops seems to be a good idea, it is not necessarily efficient in all conditions, since the shortest path may be congested while the longest path may not