By Topic

A Proficient Path Selection for Wireless Ad Hoc Routing Protocol

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. N. Al-Khwildi ; Wireless Network and Communications Group (WNCG), School of Engineering and Design, Brunel University, Uxbridge, UB8 3PH, Email: Ali.Al-khwildi@brunel.ac.uk ; H. S. Al-Raweshidy

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

Published in:

2006 8th International Conference Advanced Communication Technology  (Volume:1 )

Date of Conference:

20-22 Feb. 2006