ThMany existing reactive routing algorithms for mobile ad-hoc networks use a simple broadcasting mechanism for route discovery which  can lead to a high redundancy of route-request messages,contention, and collision. Position-based routing algorithms address this problem but require every node to know the position and velocity of every other node at some point in time so that route requests can be propagated towards the destination without flooding the entire network. In a general ad-hoc network, each node maintaining the position information of every other node is expensive or impossible.
In this talk, I will present  a routing algorithm that addresses these drawbacks. Our algorithm, based on one-hop neighborhood information, allows each node to select a subset of its neighbors to forward route requests. This algorithm greatly reduces the number of route-request packets transmitted in the route-discovery process. I will also discuss the results of its performance compared to an existing well-known routing algorithm.

This is a joint work with Qiangfeng Jiang, Raphael Finkel and Mukesh Singhal.