A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Load Balancing in MANETs <s> This paper presents a new, simple and bandwidth-efficient distributed routing protocol to support mobile computing in a conference size ad-hoc mobile network environment. Unlike the conventional approaches such as link-state and distance-vector distributed routing algorithms, our protocol does not attempt to consistently maintain routing information in every node. In an ad-hoc mobile network where mobile hosts (MHs) are acting as routers and where routes are made inconsistent by MHs‘ movement, we employ an associativity-based routing scheme where a route is selected based on nodes having associativity states that imply periods of stability. In this manner, the routes selected are likely to be long-lived and hence there is no need to restart frequently, resulting in higher attainable throughput. Route requests are broadcast on a per need basis. The association property also allows the integration of ad-hoc routing into a BS-oriented Wireless LAN (WLAN) environment, providing the fault tolerance in times of base stations (BSs) failures. To discover shorter routes and to shorten the route recovery time when the association property is violated, the localised-query and quick-abort mechanisms are respectively incorporated into the protocol. To further increase cell capacity and lower transmission power requirements, a dynamic cell size adjustment scheme is introduced. The protocol is free from loops, deadlock and packet duplicates and has scalable memory requirements. Simulation results obtained reveal that shorter and better routes can be discovered during route re-constructions. <s> BIB001 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Load Balancing in MANETs <s> Alternate path routing (APR) can provide load balancing and route failure protection by distributing traffic among a set of diverse paths. These benefits make APR appear to be an ideal candidate for the bandwidth limited and mobile ad-hoc networks. However, we find that APR's potential is not fully realized in ad-hoc networks because of route coupling resulting from the geographic proximity of candidate paths between common endpoints. In multiple channel networks, coupling occurs when paths share common intermediate nodes. The coupling problem is much more serious in single channel networks, where coupling also occurs where one path crosses the radio coverage area of another path. The network's inherent route coupling is further aggravated by the routing protocol, which may provide an incomplete view of current network connectivity.Through analysis and simulation, we demonstrate the impact of route coupling on APR's delay performance in ad-hoc networks. In multiple channel environments, APR is able to provide a 20% reduction in end-to-end delay for bursty data streams. Though these gains are appreciable, they are about half what we would expect from APR with independently operating routes. Route coupling is so severe in single channel networks that APR provides only negligible improvements in quality of service. <s> BIB002 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Load Balancing in MANETs <s> An ad hoc wireless mobile network is an infrastructure-less mobile network that has no fixed routers; instead, all nodes are capable of movement and can be connected dynamically in an arbitrary manner. In order to facilitate communication of mobile nodes that may not be within the wireless range of each other, an efficient routing protocol is used to discover routes between nodes so that messages may be delivered in a timely manner. In this paper, we present a novel Load-Balanced Ad hoc Routing (LBAR) protocol for communication in wireless ad hoc networks. LBAR defines a new metric for routing known as the degree of nodal activity to represent the load on a mobile node. In LBAR routing information on all paths from source to destination are forwarded through setup messages to the destination. Setup messages include nodal activity information of all nodes on the traversed path. After collecting information on all possible paths, the destination then makes a selection of the path with the best-cost value and sends an acknowledgement to the source node. LBAR also provides efficient path maintenance to patch up broken links by detouring traffic to the destination. A comprehensive simulation study was conducted to evaluate the performance of the proposed scheme. Performance results show that LBAR outperforms existing ad hoc routing protocols in terms of packet delivery and average end-to-end delay. <s> BIB003 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Load Balancing in MANETs <s> Ad hoc networks are deployed in situations where no base station is available and a network has to be built impromptu. Since there is no wired backbone, each host is a router and a packet forwarder. Each node may be mobile, and topology changes frequently and unpredictably. Routing protocol development has received much attention because mobility management and efficient bandwidth and power usage are critical in ad hoc networks. No existing protocol however, considers the load as the main route selection criteria. This routing philosophy can lead to network congestion and create bottlenecks. We present dynamic load-aware routing (DLAR) protocol that considers intermediate node routing loads as the primary route selection metric. The protocol also monitors the congestion status of active routes and reconstructs the path when nodes of the route have their interface queue overloaded. We describe three DLAR algorithms and show their effectiveness by presenting and comparing simulation results with an ad hoc routing protocol that uses the shortest paths. <s> BIB004 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Load Balancing in MANETs <s> Most current routing protocols for mobile ad hoc networks consider the shortest path with minimum hop counts at the optimal route. However, the minimum end-to-end delay from source to destination may not always be achieved through this shortest path. In this paper, we propose an efficient delay-based load-aware on-demand routing (D-LAOR) protocol, which determines the optimal path based on the estimated total path delay and the hop count. We demonstrate the effectiveness of D-LAOR by integrating it with the ad hoc on-demand distance vector (AODV) routing protocol. Simulation results obtained suing the ns-2 network simulation platform, show that D-LAOR scheme increases packet delivery fraction and decreases end-to-end delay by more than 10% in a moderate network scenario when compared with the original AODV ad the other LAOR protocols. <s> BIB005 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Load Balancing in MANETs <s> We introduce the virtual paths routing (VPR) protocol for ad hoc wireless networks. VPR provides highly dynamic, correct, and efficient paths creation and maintenance between nodes. Innovatively, the protocol utilizes a technique to monitor the mobility of the nodes, and factorizes it in its operations. VPR is a distributed, on-demand, and adaptive protocol that comprises two phases. The first phase is path discovery, in which VPR discovers and creates a virtual path between source and destination nodes. The second phase is path maintenance, in which the protocol monitors the usability of all active paths. <s> BIB006 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Load Balancing in MANETs <s> Most existing routing protocols for mobile ad hoc networks are designed to search for the shortest path with minimum hop counts. However, the shortest routes do not always provide the best performance, especially when there are congested nodes along these routes. We investigate a load-aware routing protocol using three load metrics for route selection, which include MAC layer channel contention information, the number of packets in the interface queue, and the traditional hop count. Among these metrics, MAC layer contention information provides an accurate estimation of neighbor node activities, and queue length provides a measure of traffic load at the mobile node itself. Combined with the number of hops, this load-aware routing protocol can effectively balance the traffic and improve throughput within the ad hoc network. The impact of these three load metrics on the routing performance are studied, and simulations are conducted to validate our conclusions. <s> BIB007 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Load Balancing in MANETs <s> Routing protocols for ad hoc wireless networks consider the path with the minimum number of hops as the optimal path to any given destination. However, this strategy does not balance the traffic load over the network, and may create congested areas. These congested areas greatly degrade the performance of the routing protocols. In this paper, we propose a routing scheme that balances the load over the network by selecting a path based on traffic sizes. We present a simulation study to demonstrate the effectiveness of the proposed scheme. <s> BIB008 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Load Balancing in MANETs <s> We present a new protocol called Load Aware Routing in Ad hoc (LARA) networks protocol for efficient data transmission in mobile ad hoc networks. We also define a new metric for routing called traffic density to represent the degree of contention at the medium access control layer. During the route setup, this metric is used to select the route with the minimum traffic load. We have carried out extensive simulation studies to evaluate the performance of our proposed protocol vis-a-vis the existing protocols. Performance results show that our LARA protocol outperforms existing routing protocols in terms of end-to-end delay, throughput, packet delivery fraction, and battery power consumption at the nodes. <s> BIB009 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Load Balancing in MANETs <s> In this paper, we investigate the load distribution in ad hoc networks for reducing the possibility of power depletion and queuing delay at a node with heavy load environments. We examine the efficiency of dominant ad hoc routing protocols from a point of load balancing. Based on the results from various simulations, we design a new Correlated Load-Aware Routing (CLAR) protocol that considers the traffic load, through and around neighboring nodes, as the primary route selection metric. Simulation results show that CLAR outperforms other popular protocols and is better suited for the heady load networks with low mobility. <s> BIB010 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Load Balancing in MANETs <s> Of existing ad-hoc protocols, on-demand routing protocol is suitable to wireless networks that have frequent mobility of nodes. Besides, when network is stable, data is transmitted after choosing shortest path without any consideration of any particular node's traffic, and then traffic is concentrated on a particular node, which raises the problem of delay of transmission and huge energy consuming. In this paper, load-balancing routing method, which considers power conversation, is suggested. The proposed method improves (complements) the function of router discovery by adding energy factor to the existing DSR (dynamic source routing) <s> BIB011 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Load Balancing in MANETs <s> In this paper, we propose a prediction based adaptive load balancing mechanism for mobile ad hoc networks. This mechanism can cooperate with any kind of multipath source routing protocol. It distributes traffic load among multiple disjoint paths based on the measurement and prediction of network traffic. In order to predict network traffic accurately, we first analyze the traffic data collected in our mobile ad hoc network testbed and find out that ad hoc networks traffic is self-similar. Then, we propose a traffic predictor based on wavelet analysis. The simulation results show that our loading balancing approach can distribute traffic properly and lead to a decrease of traffic load imbalance of multiple paths and network congestion. As a result, it reduces the end-to-end packet delay and packet dropping probability and balances the energy consumption of the network. <s> BIB012 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Load Balancing in MANETs <s> A novel load-balancing technique for ad hoc on-demand routing protocols is presented. Currently, ad hoc routing protocols lack load-balancing capabilities, and thus, they often fail to provide good performance especially in the presence of a large volume of traffic. We present a simple but very effective method to achieve load balance and congestion alleviation. The new scheme is motivated by the observation that ad hoc on-demand routing protocols flood route request (RREQ) messages to acquire routes, and only nodes that respond to those messages have a potential to serve as intermediate forwarding nodes. If a node ignores RREQ messages within a specific period, it can completely be excluded from the additional communications that might have occurred for that period otherwise. Thus, a node can decide not to serve a traffic flow by dropping the RREQ for that flow. In the new scheme, RREQ messages are forwarded selectively according to the load status of each node so that overloaded nodes can be excluded from the requested paths. Each node begins to allow additional traffic flows again whenever its overloaded status is dissolved. The new scheme utilizes interface queue occupancy and workload to control RREQ messages adaptively. The enhanced versions of protocols with this scheme are compared to the base protocols. Simulation results reveal that the new scheme greatly reduces packet latency as well as routing overhead without adversely affecting the network throughput, and it successfully balances the network load among nodes. <s> BIB013 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Load Balancing in MANETs <s> It is expected that future ITS (Intelligent Transport System) network will involve a lot of mobile equipments and form a complex network. Maintaining the good performance of this complex network is a complicated task, and efficient load balancing plays an important role. In this paper, a new load balancing solution is proposed. In this solution, the load balancing is performed by the source node based on the probe packets sent by the destination node. Doing so will reduce the number of probe packets to half. A new formula for available bandwidth estimation of 802.11 ad hoc network is also presented. The simulation results show that the proposed solution has improved the connection throughput significantly. <s> BIB014 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Load Balancing in MANETs <s> Mobile ad hoc networks are collections of mobile nodes that can dynamically form temporary networks without the need for pre-existing network infrastructure or centralized administration. These nodes can be arbitrarily located and can move freely at any given time. Hence, the network topology can change rapidly and unpredictably. Because wireless link capacities are usually limited, congestion is possible in MANETs. Hence, balancing the load in a MANET is important since nodes with high loads will deplete their batteries quickly, thereby increasing the probability of disconnecting or partitioning the network. This article discusses the various load metrics and summarizes the principles behind several existing load balanced ad hoc routing protocols. Finally, a qualitative comparison of the various load metrics and load balanced routing protocols is presented. <s> BIB015 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Load Balancing in MANETs <s> Properties of mobile ad hoc networks (MANET) like dynamic topology and decentralized connectivity make routing a challenging task. Moreover, overloaded nodes may deplete their energy in forwarding others pack-ets resulting in unstable network and performance degradation. In this paper we propose load-balancing schemes that distribute the traffic on the basis of three important metrics -residual battery capacity, average interface queue length and hop count along with the associated weight values. It helps to achieve load bal-ancing and to extend the entire network lifetime. Simulation results show that the proposed load-balancing schemes significantly enhance the network performance and outperform one of the most prominent ad hoc routing protocols AODV and previously proposed load balanced ad hoc routing protocols including DLAR and LARA in terms of average delay, packet delivery fraction and jitter. <s> BIB016 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Load Balancing in MANETs <s> Nodes in ad hoc networks can be unfairly burdened to support many packet-relaying functions, resulting in excessive loads on these hot spots. This load on nodes appears in two major aspects: traffic and power consumption. Unbalanced traffic may lead to more delay, packet dropping, and decreasing packet delivery ratio (PDR). Unbalanced energy consumption leads to node failure, network partitioning and decreases network lifetime and route reliability. Existing approaches try to improve the performance of routing protocols with respect to traffic balancing or energy consumption balancing, but most lead to drawbacks such as more delay, blocking, or dependence on global information from all nodes. In this paper we improve the well known Dynamic Source Routing (DSR) protocol to the so called Load Balanced DSR (LBDSR) protocol. We modify the RREQ (Route Request) and RREP (Route Reply) messages in DSR in order to maintain the remaining energy of intermediate nodes which forward RREQ and RREP. Route structure, available in the nodes cache, is modified so that the remaining energy of nodes can be calculated. LBDSR shows better traffic balancing and energy consumption balancing, end-to-end delay and route reliability metrics than DSR. Furthermore, LBDSR can also be customized to achieve better performance with respect to each of these metrics instead of being a trade-off between them. <s> BIB017 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Load Balancing in MANETs <s> Mobile ad hoc networks (MANET) are infrastructure-less networks, dynamically formed by an independent system of mobile nodes that are connected via wireless links. Because routing is performed by nodes with limited resources, load should be efficiently distributed through the network. Otherwise, heavily-loaded nodes may make up a bottleneck that lowers the network performances by congestion and larger delays. Regrettably, load-balancing is a critical deficiency in MANET shortest-path routing protocols, as nodes at the center of the network are much heavily-loaded than the others. Thus, we propose, in this paper, load-balancing mechanisms that push the traffic further from the center of the network. Basically, we provide novel routing metrics that take into account nodes degree of centrality, for both proactive and reactive routing protocols. Simulations show that the proposed mechanisms improve the load distribution and significantly enhance the network performances in terms of average delay and reliability. <s> BIB018
Over the years, several on-demand load balanced ad hoc routing protocols have been proposed. These routing protocols can generally be categorized BIB015 into three perspectives: delay based, traffic based, and combing the two. Delay-based protocols achieve load balancing by attempting to avoid nodes with high link delay. An example protocol is load-aware on-demand routing (LAOR) BIB005 . Traffic-based protocols achieve load balancing by evenly distributing traffic load among network nodes. Associativity based routing (ABR) BIB001 , load balanced ad hoc routing (LBAR) BIB003 , and traffic-size aware (TSA) scheme BIB006 fall under this category. In hybrid technique, load balancing is achieved by combining the features of traffic-and delay-based techniques. Examples are content sensitive load-aware routing (CSLAR) BIB007 and load-aware routing in ad hoc (LARA) BIB008 . Alternate path routing BIB002 provides load balancing by distributing the data traffic along the set of alternative paths. By using set of alternate paths, APR also provides failure protection. Therefore this protocol is only applicable for multichannel networks. Dynamic load-aware routing (DLAR) BIB004 makes use of the number of packets buffered as load in route selection. The mobile nodes attach their load information and broadcast the RREQ packet. To minimize the overlapped routes this protocol does not allow other intermediate nodes from replying to RREQ except the destination. If the route is congested, a new and lightly loaded route is selected to replace the overloaded path. Routes are hence reconstructed dynamically in advance. Load-balanced ad hoc routing (LBAR) BIB003 is an ondemand routing protocol developed for delay-sensitive applications. LBAR defines degree of nodal activity to represent load on a metric node. The main idea here is to find optimal paths, which would reflect least traffic load, so that data packets can be routed with least delay. Load sensitive routing (LSR) protocol  is based on the DSR protocol. This protocol utilizes network load information as the main path selection criterion. In LBAR and DLAR, destination nodes have to wait until the source identifies every possible route available. Rather, LSR does not require the destination nodes to wait for all possible routes. Instead, LSR can search for better paths dynamically if the active path becomes congested. Thus it uses a redirection method to find better paths effectively. This method can let the source node obtain better path without any increase in flooding cost and waiting delay on the destination nodes. The above-mentioned routing protocols neither reflect burst traffic nor transient congestion. To solve this problem, weighted load-aware protocol (WLAR)  is proposed. This protocol selects the route based on the information from the neighbor nodes which are in the route to the destination. This protocol adopts basic AODV procedure and packet format. In WLAR, traffic load is defined as the product of average queue size of the interface at the node and the number of sharing nodes which are declared to influence the transmission of their neighbors. The average number of packets queued in interface is calculated by exponentially weighted moving average (EWMA). In MANETs, since nodes have limited resources, the message overhead for load balancing is more critical. Simple load-balancing ad hoc routing (SLAR)  protocol attempts to reduce the overhead introduced by load balancing and is prevented from severe battery power consumption caused by forwarding packets. In SLAR, each node determines whether it is under heavy forwarding load condition, and in that case it leaves forwarding packets and lets some other nodes take that role. Simple load-balancing approach (SLA)  tries to extend the expiration of mobile node power by preventing the traffic concentration on a few nodes, which may frequently occur under low mobility situations. This protocol resolves the traffic concentration problem by allowing each node to give up packet forwarding depending upon its own traffic load. However, there may be some selfish nodes that may deliberately give up packet forwarding to save their own energy, if an appropriate compensation is not given to them. Therefore, in SLA a credit-based scheme called protocolindependent fairness algorithm (PIFA) for urging nodes to voluntarily participate in forwarding packets is proposed. Load-aware routing (LARA) BIB009 networks use traffic density (i.e., overall sum of traffic queue of node and its neighbors) to represent the degree of contention at the MAC layer. This density value is assumed from the self-maintained neighborhood table. The traffic queue of a node is defined as the average value of the interface queue length measured over a period of time. During route discovery, the destination selects the route with the minimum traffic cost. Delay-based load-aware on-demand routing (D-LAOR) BIB005 protocol utilizes both the estimated total path delay and the hop count for route selection. The protocol can route around a congested node and thus can reduce the control overhead. In load-aware routing protocol (LARA) BIB016 a new metric for routing called traffic density which represents the degree of contention at the MAC layer is proposed. During the route setup, this metric is used to select the route with the minimum traffic load. Correlated load-aware routing (CLAR) BIB010 protocol is a kind of on-demand routing protocol. Similar to traffic density of LARA, this protocol utilizes node traffic load as the primary route selection metric. The fundamental assumption is that the traffic load of a node depends on the traffic passing through this node as well as the traffic in the neighboring nodes. Since CLAR supports multipaths between the source and the destination, the destination node must select the best route among multipaths after analyzing the traffic load, the shortest hop distance, and the earliest path to arrive, respectively. Most load balanced routing protocols measure the traffic size in number of packets. However, this is inaccurate since the size of the packets may differ. Load balanced routing through virtual path (LBRVP) protocol BIB006 , an extension to the virtual path routing protocol (VPR) BIB008 , uses the size of the traffic, through and around the network nodes, as the main route selection criterion. For any path that consists of multiple hops, the load metric of the path is the sum of all the traffic that is routed through all the hops that make up that path. In any existing on-demand routing method, message transmission is initiated after forming the optimal route; however, successive message transmission occurs with particular nodes acting as routes when the network topology alteration is small. When network topology is relatively stable, the energy deficient nodes are included in the routing path, which could shorten the lifespan of the whole network. To solve this problem, a routing method which concerns power consumption rate is proposed. Energy consumption load balancing (ECLB) BIB011 makes balanced energy consumption available by calculating energy consumption rate of each node and choosing alternative route using the result to exclude the overburden-traffic conditioned node in route directory. Instead of analyzing the history of traffic and deciding upon the packet routes, route decision based on traffic prediction would be more appealing. Prediction based adaptive load balancing (PALB) BIB012 is based on multipath routing protocol and traffic prediction. This protocol works on the assumption that several disjoint paths between source and destination node have been established by any existing multiple path routing protocols. The objective is to minimize traffic congestion and load imbalance by adaptively distributing the traffic among multiple disjoint paths based on traffic prediction. Source node periodically predicts the cross traffic of every node in the multiple disjoint paths. The packet distribution model distributes the traffic from packet filtering model across the multiple paths. The distribution of traffic is based on load balancing model which decides when and how to shift traffic among the multiple paths. The load balancing model operates based on evaluation of path. Stability and measurement of path statistics. Therefore, the source node is able to adjust traffic distribution across multiple disjoint paths. In energy-efficient load balancing protocol (EELBR)  , the energy constrains related to routing protocols and workload balancing techniques are considered. This protocol employs adaptive load balancing technique to the MANET routing protocols with node caching enhancement. Hoang et al. BIB014 propose load balancing which is performed by the source node based on the probe packets sent by the destination node. Doing so will reduce the number of probe packets to half. Workload-based adaptive load balancing (WBALB) BIB013 protocol makes each node react to the environment by analyzing their workloads. In this protocol, a node can chose to include or exclude itself from the forwarding activity. In other words, this protocol enables a node to join the route request (RREQ) forwarding action selectively. It utilizes interface queue occupancy and workload to make the selective forwarding decision. Each node maintains a threshold value (some arbitrary value initially) which varies according to the load status of a node. Overloading decreases the threshold value and vice versa. Periodically the node checks the threshold and, if it is found that the load has been low for a long enough period, its threshold value returns to the initial value. Immediately, the node is ready to handle additional communications until it gets overloaded. Generally, the QoS of MANET is mostly affected by the congestion at any intermediate node in a selected routing path. Therefore, routing protocols handling congestion avoidance would be of high research interest. Congestion avoidance based load balanced routing (CALBR)  is a scheme designed to take route decisions considering the traffic congestion. In this protocol every node tracks the The Scientific World Journal 7 volume of packets successfully transmitted by self and by its one hop neighbors. Through this, the protocol attempts to select disjoint paths where there is no or less congestion. Existing approaches try to improve the performance of routing protocols with respect to traffic balancing or energy consumption balancing. In load balanced dynamic source routing (LBDSR) BIB017 the authors improve the well-known dynamic source routing (DSR) protocol to the so-called load balanced DSR (LBDSR) protocol. LBDSR shows better traffic balancing and energy consumption balancing, end-to-end delay, and route reliability metrics than DSR. In addition, LBDSR can also be customized to achieve better performance with respect to each of these metrics instead of being a trade-off between them. There is yet another variation to load balancing. Mechanisms BIB018 to push the traffic further from the center of the network to achieve load balancing would equally be a wise decision in route selection. Such protocols should take into account nodes' degree of centrality, for both proactive and reactive means of route selection decision. AODV fundamentally does not support the quality of service (QoS) as well as load balancing. Pradeep and Soumya  propose some enhancements to AODV. The new protocol, referred to as Qos AODV, provides QoS and load balancing features by adding two extensions to the messages used during route discovery. Distributed load balanced routing (DLBR)  is intended for a variety of traffic classes, fundamentally multimedia and nonmultimedia traffic, to establish the best routing paths. Multimedia traffic is given the highest priority. The algorithm calculates the cost metric on the basis of the load on the links. In the presence of high priority traffic, the routing of high priority traffic is performed over the lightly loaded links. In addition, the resources can be shared between the high priority traffic's path and low priority traffic. The Fibonacci multipath load balancing protocol (FMLB)  is yet another distribution based load balancing approach where transmitted packets are distributed over multiple paths using the Fibonacci sequence. Such distribution increases the delivery ratio because the congestion is reduced by the distribution activity. The overhead lies in balancing the packet transmission over the selected paths and ordering them according to hop count. However, the shortest path is used frequently more than the other ones. Node centric load balanced routing protocol (NCLBR)  is similar to how AODV operates. There are three distinct roles for nodes in NCLBR protocol, namely, terminal (nodes that are connected to the rest of the network by a single link), trunk (nodes that connect two different network segments), and normal (nodes other than trunk or terminal). Here each node itself avoids congestion in a greedy manner. It is the node's responsibility to divert congestion away from itself onto other alternative paths that may exist in the network. The main objective here is to avoid new path formation through a congested node. In dynamic congestion detection and control routing (DCDR)  , the routing decision is based on the estimations of the average queue length at the node level using which the current congestion level shall be detected. Based on this, every node generates a warning message to its neighbors. It is then the responsibility of neighbors to locate a congestionfree alternative path to the destination. Since congestion free route selection involves the neighboring nodes as well, this protocol ensures reliable communication within the MANET. However, high coordination is required between the nodes to operate at reduced overhead due to alternate path finding. Ant based algorithm for load balancing (AntLBR)  is more robust as routing information is based on direct measurement of real-world network situations. This algorithm is hybrid in nature, that is, proactive some time and reactive other time. Data packets are routed stochastically according to pheromone tables (which are stored locally at each node). Each node also maintains a neighbor node table to keep track of nodes having wireless links. Load balancing is achieved by making use of multiple paths and then selecting optimal path mostly for transmission of packets from source to destination.