AODV-F: A New on Demand Enhanced Distance Vector Routing in Wireless Network

Abstract

Routing process is the main role in wireless ad-hoc networks. It is a very tedious task to complete successfully in mobile ad-hoc networks. Nodes are frequently changing their positions in mobile ad-hoc networks. In such a challenging environment, there are more chances of packet loss. So many routing protocols have been proposed to recover this loss. In this work, we have proposed a new distance vector routing algorithm that is an enhancement of existing routing protocol in mobile ad-hoc networks. We consider node power, hop count, and maximum speed to decide the next hop during the routing process. Trust values have been calculated by applying the rule based system. This trust value will decide the next hop in the network. To evaluate our proposed algorithm, we have simulated this in a network simulator-2 environment. Normalized routing load, throughput, packet delivery fraction, and delay are considered as the performance metrics to evaluate the proposed work