## Related Works
In [51], authors proposed the swarm intelligence based Ant-based Energy Aware Disjoint Multipath Routing Algorithm (AEADMRA), which consider \"node's energy consumption\" as one of node selection criterion. The proposed algorithm is a subset of swarm intelligence, which utilizes the ability of ants to solve complex problems by cooperating among themselves. The results show that it delivers better performance in terms of reducing routing complexity and improving route discovery process. A scalable routing protocol named Link-stability and energy Aware Routing protocol (LAER) has been proposed in [52], which is based on the joint metric of link stability and energy drain rate. A Biobjective Integer Programming (BIP) model is adopted to achieve optimal solution in the route selection process. The BIP model selects next hop node among the neighbor nodes, which has better link stability and less energy consumption rate. The LAER scheme prolongs the network lifetime and maintains the robustness of the network. A parallel Disjointed Multipoint routing algorithm-based OLSR called DMP-EOLSR is proposed in [53], which is a hybrid routing protocol that involves both reactive and proactive routing protocols. The DMP-EOLSR considers living time of node as well as living time of links between nodes based on energy consumption and moving state of mobile nodes during route computation. The living time of nodes depends on the residual energy of the nodes, whereas the living time of links between nodes depends on speed and direction of the movement. Moreover, in order to find multiple parallel disjoint paths or link disjoint paths, assessment factors of node energy and an iterative is used based on the modified Dijkstra algorithm. The Dijkstra algorithms are well-known schemes for exploring multiple disjointed paths between source and destination nodes based on topology information of the network. The proposed algorithm not only improves the stability of the selected paths with better parallel transmission capacity, but also reduces the computation cost of intermediate nodes in route selection and route recovery mechanism. Another approach proposes a MP-OLSR routing protocol in [54], where the Dijkstra algorithm has been modified in order to find multiple routes for sparse and dense network. It utilized two cost function to generate node disjoint and link disjoint paths. Results proved that the proposed algorithm is able to achieve great flexibility by using different link cost metrics and cost function. In addition, two new concepts were introduced, namely; route recovery and loop detection in order to improve the packet delivery ratio and reduce the chance of optimal link failure for network topology that changes frequently. The MP-OLSR routing improves overall network performance, especially in high mobility and heavy loaded network scenarios. [PERSON] et al. [55] proposed multipath extension version of MP-OLSR stated as MP-OLSRv2, which belongs to the category of hybrid multipath routing protocol that involves proactive and reactive routing concepts for data transmission. The MP-OLSRv2 uses two incremental cost functions for the link cost between the nodes to generate multiple node-disjoint and link disjoint paths. It discovers multiple disjointed paths instead of single disjointed path for data transmission with the multipath Dijkstra algorithm in a frequently changing network topology. The MP-OLSRv2 mechanism is divided into two phases (topology sensing and route computation) to maintain the multiple routes from source to destination pairs. It delivers reliable communication and facilitates traffic load distribution into multiple paths, thereby ensuring load balancing among the nodes of the network. Multipath data transmission is a way of increasing network throughput while maintaining robust link with reliable transmission in the network. The selection of highly qualified intermediate nodes in the route mapping process still remains one of the most important and critical issues for efficient data transmission in MANET networks.