Path Set Selection in Mobile Ad Hoc Networks

Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS-driven services. A promising technique for addressing this problem is to use multiple redundant paths between the source and the destination. However,while multipath routing algorithms can tolerate network failures well,their failure resilience only holds if the paths are selected judiciously. In particular,the correlation between the failures of the paths in a redundant path set should be as small as possible. However,selecting an optimal path set is an NPcomplete problem. Heuristic solutions proposed in the literature are either too complex to be performed in real-time, or too ineffective,or both. This paper proposes a multipath routing algorithm,called Disjoint Pathset Selection Protocol (DPSP),based on a novel heuristic that, in nearly linear time on average,pic ks a set of highly reliable paths. The convergence to a highly reliable path set is very fast, and the protocol provides flexibility in path selection and routing algorithm. Furthermore,DPSP is suitable for real-time execution,with nearly no message exchange overhead and with minimal additional storage requirements. This paper presents evidence that multipath routing can mask a substantial number of failures in the network compared to single path routing protocols,and that the selection of paths according to DPSP can be beneficial for mobile ad hoc networks, since it dramatically reduces the rate of route discoveries

Fuzzy based load and energy aware multipath routing for mobile ad hoc networks

Routing is a challenging task in Mobile Ad hoc Networks (MANET) due to their dynamic topology and lack of central administration. As a consequence of un-predictable topology changes of such networks, routing protocols employed need to accurately capture the delay, load, available bandwidth and residual node energy at various locations of the network for effective energy and load balancing. This paper presents a fuzzy logic based scheme that ensures delay, load and energy aware routing to avoid congestion and minimise end-to-end delay in MANETs. In the proposed approach, forwarding delay, average load, available bandwidth and residual battery energy at a mobile node are given as inputs to a fuzzy inference engine to determine the traffic distribution possibility from that node based on the given fuzzy rules. Based on the output from the fuzzy system, traffic is distributed over fail-safe multiple routes to reduce the load at a congested node. Through simulation results, we show that our approach reduces end-to-end delay, packet drop and average energy consumption and increases packet delivery ratio for constant bit rate (CBR) traffic when compared with the popular Ad hoc On-demand Multipath Distance Vector (AOMDV) routing protocol

NEW APPROACH FOR NEIGHBOR DISCOVERY IN MOBILE AD HOC NETWORKS

Multipath directing permits building and utilization of numerous ways meant for routing among a resource and destination pair. The resource repetition misuses and difference in the primary network to give profit, for example, fault tolerance, load balancing, data transfer aggregation, as well as change in QoS measurements, for example, interruption. The three components to a path discovery, multipath routing, path maintenance and traffic distribution. Path discovery includes discovering accessible ways utilizing predefined criteria. A well known metric is way disjointness, a measure of resource contrasting qualities between paths. Traffic dispersion system describes how simultaneously accessible ways are utilized, and how data to the same goal is part and flowed over diverse ways. Path support specifies when and how new paths are procured if the states of at present accessible paths change. We display a choice of these protocols and give a discussion on how multipath strategies might be stretched out to wireless mesh networks. In conclusion we quickly portray the path selection structure in the current proposal for IEEE 802.11s mesh standard. Despite the fact that the proposal does not characterize utilization of multipath routing, its extensible system for path selection gives procurement to such protocols to be implemented

Reducing Congestion Effects by Multipath Routing in Wireless Networks

We propose a solution to improve fairness and increasethroughput in wireless networks with location information.Our approach consists of a multipath routing protocol, BiasedGeographical Routing (BGR), and two congestion controlalgorithms, In-Network Packet Scatter (IPS) and End-to-EndPacket Scatter (EPS), which leverage BGR to avoid the congestedareas of the network. BGR achieves good performancewhile incurring a communication overhead of just 1 byte perdata packet, and has a computational complexity similar togreedy geographic routing. IPS alleviates transient congestion bysplitting traffic immediately before the congested areas. In contrast,EPS alleviates long term congestion by splitting the flow atthe source, and performing rate control. EPS selects the pathsdynamically, and uses a less aggressive congestion controlmechanism on non-greedy paths to improve energy efficiency.Simulation and experimental results show that our solutionachieves its objectives. Extensive ns-2 simulations show that oursolution improves both fairness and throughput as compared tosingle path greedy routing. Our solution reduces the variance ofthroughput across all flows by 35%, reduction which is mainlyachieved by increasing throughput of long-range flows witharound 70%. Furthermore, overall network throughput increasesby approximately 10%. Experimental results on a 50-node testbed are consistent with our simulation results, suggestingthat BGR is effective in practice