LAR2P: A Location Aided Reactive Routing Protocol for near-optimal route discovery in MANET

The problem being addressed in this work is to design a new, location-aided, robust, reactive routing protocol for discovery of the shortest route or near-shortest route in a mobile, ad-hoc network with in a small set-up period by considering only the nodes towards the destination from a give source node. Shortest path finding algorithm by Dijkstra or Bellman-Ford has been used in many of the existing routing protocols for MANET. Such approaches have limited usage for reactive or on-demand routing due to high set-up time. Again, most of the reactive protocols suffer from the drawback of flooding as no route table is maintained in the nodes. In this paper, LAR2P a new flooding-free, location aided, robust, reactive routing protocol has been proposed that reduces the set-up time and number of control messages as compared to other reactive protocols like ORRP, DSR, LAR or LBRP.