An Enhanced Light-weight Proactive Source Routing Protocol using BFS and DFS for MANET

Abstract

Abstract-MANET is a self organized and self configurable network without existing infrastructure. It consists of several mobile wireless nodes. A routing protocol provides an efficient route between mobile nodes within the network. The discovery and maintenance of route should consume minimum overhead and bandwidth. In this paper, we introduce a novel Proactive Source Routing protocol that has a very small communication overhead. The proposed work is an efficient and improved light-weight proactive source routing protocol for MANETs that utilizes two common searching algorithms, called breadth first search (BFS) and depth first search (DFS) to discover the route. In such method, every node of the wireless network contains a neighbour table. Such table contains each node and its neighbours with distance between them. Therefore, each node has a full topology of the wireless network which is useful to discover the route. Periodic information exchange is used to update such table. We analyze the solution of routing in MANET and evaluate its performance using Network Simulator-2 (NS-2) under different network parameters.