BIDIRECTIONAL SEARCH ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS
Muhammed Zaharadeen Ahmed, Sufian Yousef, Sattar J. Aboud · 2013
Ad hoc Network is self-configurable, infrastructure-less multi-hop wireless networks, characterized by their frequent topology changes and the need for dynamic routing protocols capable of coping with these characteristics. A new reactive ad hoc routing protocol is proposed in this paper, which relies on the Artificial Intelligence Bidirectional Search Algorithm in discovering routes from source to destination of communication process in a balanced and mutual search mechanism. This allows both source and destination to simultaneously discover the routes to each other reducing the discovery time of reactive routing strategy up to 53% in small and medium scale networks, while this value starts to decrease by increasing the size of the network. The new Bidirectional Search Routing protocol then is compared to both Dynamic Source Routing and Ad-hoc On-Demand Distance Vector Routing in terms of performance metrics of reactive routing strategy such route discovery time and average delay showing promising results.