A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Routing Protocols in MANETs <s> An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each mobile host operates as a specialized router, and routes are obtained as needed (i.e., on-demand) with little or no reliance on periodic advertisements. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks. AODV provides loop-free routes even while repairing broken links. Because the protocol does not require global periodic routing advertisements, the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that do necessitate such advertisements. Nevertheless we can still maintain most of the advantages of basic distance vector routing mechanisms. We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm. <s> BIB001 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Routing Protocols in MANETs <s> In this paper we propose and discuss an optimized link state routing protocol, named OLSR, for mobile wireless networks. The protocol is based on the link state algorithm and it is proactive (or table-driven) in nature. It employs periodic exchange of messages to maintain topology information of the network at each node. OLSR is an optimization over a pure link state protocol as it compacts the size of information sent in the messages, and furthermore, reduces the number of retransmissions to flood these messages in an entire network. For this purpose, the protocol uses the multipoint relaying technique to efficiently and economically flood its control messages. It provides optimal routes in terms of number of hops, which are immediately available when needed. The proposed protocol is best suitable for large and dense ad hoc networks. <s> BIB002 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Routing Protocols in MANETs <s> We provide a comparative analysis of various routing strategies that affect the end-to-end performance in wireless mesh networks. We first improve well-known link quality metrics and routing algorithms to enhance performance in wireless mesh environments. We then investigate the route optimality, i.e., whether the best end-to-end route with respect to a given link quality metric is established, and its impact on the network performance. Network topologies, number of concurrent flows, and interference types are varied in our evaluation and we find that a non-optimal route is often established because of the routing protocol's misbehavior, inaccurate link metric design, interflow interference, and their interplay. Through extensive simulation analysis, we present insights on how to design wireless link metrics and routing algorithms to enhance the network capacity and provide reliable connectivity. <s> BIB003
Providing reliable high-throughput network connectivity to wireless clients is the most important property for wireless networks. Routing protocols satisfying specific network requirements have become the status symbol in the recent literature. Very less focus is being given to the improvement of existing routing algorithms BIB003 . We revisit routing protocols ad hoc on-demand distance vector routing (AODV) BIB001 and OLSR BIB002 and consider which properties should be carefully utilized and enhanced.