ABSTRACT

In Mobile Ad hoc Network [MANET] many routing protocols have been proposed
using different techniques to create maintain and repair paths between nodes. As varied
as the routing problems for MANETs are none of the common proactive or reactive
schemes are very efficient under all traffic-load scenarios. In both Table driven and on-
demand routing protocols, overhead packets can be propagated to regions where they
have no significance but nonetheless consume scarce network resources. In particular,
on-demand routing protocols can initiate a BFS by flooding the entire network to
discover a node that may only be a few hops away. Such an inefficient use of network
resources cannot be part of an efficient routing in MANETs. So the improvement of the
routing protocol is necessary for making efficient routing, for that we created a new
routing protocol using hybrid search algorithm.

The hybrid search algorithm is the combination of breath first search and depth
first search. Hybrid routing protocol uses depth first search to establish and repair paths
from the source to the destination with minimal signaling overhead and fast convergence
it uses Breath first search to approximate the construction of a minimum depth spanning
tree rooted at the source.

It takes advantage of the smaller time complexity of breath first search and
combines it with the low communication complexity of depth first search to further
improve the efficiency of the search through the use of known path information. Hybrid
routing protocol is an on-demand routing protocol, which means that paths are
established only when needed. However, it uses a proactive component to maintain up-to-
date neighborhood information.
 Hybrid routing protocol is an alternate solution for routing using the flooding so it
reduces the overhead of the resources. Simulation experiments are used to compare the
performance of hybrid search routing protocol against that of well-known MANET
routing protocols based on BFS (e.g., DSR and AODV). The results show that hybrid
search protocol can achieve a performance comparable to traditional protocols in terms of
packet delivery ratio and end-to-end delays. Hybrid routing protocol produces less
overhead when comparing with traditional protocols.