An efficient Ad Hoc On-Demand Distance Vector routing protocol

In this paper, we propose a method to improve fault tolerance and load balancing in Ad hoc On-Demand Distance Vector (AODV) routing protocol. This is desirable because in ad hoc settings, mobility may cause routes to break frequently and hence alternative paths are needed. The original AODV only maintains one path for a source-destination pair. This has three disadvantages. First, it will result in frequent path discovery processes and huge broadcast traffic in highly dynamic environment. Second, it cannot support asymmetric network, in which upstream and downstream path are different. Third, it has no load balancing support. To solve these problems, we propose an Efficient AODV (EAODV) by maintaining multiple paths in route tables to achieve fault tolerance and load balancing.