Efficient Location-aided Route Discovery Mechanism for Ad-hoc networks

The location-based routing protocols of Mobile Ad hoc Networks (MANETs) are very important and useful in terms of energy saving and prolonging network lifetime, especially in emergency situations without an IP address. Previous approaches do not work efficiently or well. They may produce a large overhead of packets, which affects their scalability. Moreover, the reachability from source to destination is low in existing methods because route discovery fails and long end-to-end delays may occur due to inefficient route discovery. To solve these problems, we propose route discovery based on location-aided two-hop neighbor information. In this paper, we introduce a pair of approaches to enhance route discovery. The first approach considers the minimum average distance to the destination from two-hop neighbors of the source, and the second approach considers the relation between the source-neighbors’ distances from the destination and the number of two-hop neighbor nodes from the source. Furthermore, we compare our approaches with existing algorithms through computer simulation and analysis. The simulation results show that our approaches can achieve higher performance than existing algorithms.