FD-AOMDV: fault-tolerant disjoint ad-hoc on-demand multipath distance vector routing algorithm in mobile ad-hoc networks

Mobile ad-hoc network (MANET) plays a significant role in the field of communication. Due to the dynamic movement of nodes, the network infrastructure is frequently changed. All nodes have the capacity to configure themselves and are communicated either directly through some intermediate nodes based on signal strength or through multi-hop routing. However, selection of the intermediate nodes will increase the routing overload in the route discovery procedure. Destination nodes are selected using intermediate nodes for broadcasting data packets with link scalability. The previous works for this problem have limitations such as they are not flexible to deliver the Quality of Service in the network model, and the possibility of packet delivery is less. In this paper, we propose Fault-Tolerant Disjoint Multipath Distance Vector Routing Algorithm (FD-AOMDV) that sprints path discovery phase with a reduced amount of delay. It finds disjoint paths in a way that routing overloads decrease considerably. FD-AOMDV can increase the scalability by reducing the routing overload when the latest route is established. Moreover, owing to the mobility of the node in MANETs, subsequent breakages of a link will cause the active path disconnection and also enlarge the routing overload. The simulation results prove that the proposed work reduces the routing overload, decreases the end-to-end delay, and reduces the packet delivery ratio compared with AOMDV and ZD-AOMDV on Network Simulator 2.