Routing Algorithm Limiting Next Hop Selection Distance in Multi Hop Ad Hoc Networks

Mobile ad hoc network consists of nodes with mobility thus resulting in frequent route breakage. Considering this problem, in this paper, we propose a novel routing algorithm which constrains the distance to next relay node to increase route life time in mobile ad hoc networks (MANET). By limiting the distance to next relay node, our algorithm lengthened route lifetime and enhanced the throughput. In the simulation part, we analyzed the impact of node speed and node density on the proposed algorithm and we used LAR for comparison. Simulation results showed that the proposed algorithm have a longer lifetime and higher throughput than LAR. However, our algorithm has a longer latency than LAR due to the increased hop count.