Skip to Main Content
A mobile ad-hoc network consists of hosts that may often move. Location based routing between the mobile hosts require three phases: (1) getting the location of the destination host (2) discovering the route to the destination and (3) forwarding the packet to the given destination. This paper introduces a scheme to reduce the overhead involved in the route discovery to the destination knowing its location information. The flooding of the packets to the intermediate nodes is reduced since the route discovery packets are only forwarded to certain nodes, which fall into a determined region (calculated using an angle, which can dynamically change for the nodes). From a node, the packet is forwarded only to two nodes in the region determined. These 2 nodes are selected based on the location of the final destination and the location of the intermediate node, which needs to select the 2 nodes. This reduces the number of packets flooded into the network and also reduces the processing time, since the nodes involved into the forwarding of packets are reduced. This protocol is a variation of the LAR (location-aided routing in mobile ad-hoc networks), in the sense that, it limits the search for the destination to a much smaller (area wise) and focused (shorter path) region. The protocol also introduces a concept of dynamic angle selection at each node, which helps in optimizing the flooding, processing time and enabling the chances of finding the intermediate nodes with a better probability.