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

Multipath optimized link state routing for mobile ad hoc networks

International audienceMultipath routing protocols for Mobile Ad hoc NETwork (MANET) address the problem of scalability, security (confidentiality and integrity), lifetime of networks, instability of wireless transmissions, and their adaptation to applications. Our protocol, called MP-OLSR (MultiPath OLSR), is a multipath routing protocol based on OLSR. The Multipath Dijkstra Algorithm is proposed to obtain multiple paths. The algorithm gains great flexibility and extensibility by employing different link metrics and cost functions. In addition, route recovery and loop detection are implemented in MP-OLSR in order to improve quality of service regarding OLSR. The backward compatibility with OLSR based on IP source routing is also studied. Simulation based on Qualnet simulator is performed in different scenarios. A testbed is also set up to validate the protocol in real world. The results reveal that MP-OLSR is suitable for mobile, large and dense networks with large traffic, and could satisfy critical multimedia applications with high on time constraints

Effective link operation duration: a new routing metric for mobile ad hoc networks

The dynamic topology of mobile ad hoc networks (MANETs) is caused by node mobility and fading of the wireless link. Link reliability is often measured by the estimated lifetime and the stability of a link. In this paper we propose that the stability of a link can be represented by the time duration in which the two nodes at each end of a link are within each other’s transmission range and the fading is above an acceptable threshold. A novel routing metric, called effective link operation duration (ELOD), is proposed and implemented into AODV (AODV-ELOD). Simulation results show that proposed AODVELOD outperforms both AODV and the Flow Oriented Routing Protocol (FORP)

Local heuristic for the refinement of multi-path routing in wireless mesh networks

We consider wireless mesh networks and the problem of routing end-to-end traffic over multiple paths for the same origin-destination pair with minimal interference. We introduce a heuristic for path determination with two distinguishing characteristics. First, it works by refining an extant set of paths, determined previously by a single- or multi-path routing algorithm. Second, it is totally local, in the sense that it can be run by each of the origins on information that is available no farther than the node's immediate neighborhood. We have conducted extensive computational experiments with the new heuristic, using AODV and OLSR, as well as their multi-path variants, as underlying routing methods. For two different CSMA settings (as implemented by 802.11) and one TDMA setting running a path-oriented link scheduling algorithm, we have demonstrated that the new heuristic is capable of improving the average throughput network-wide. When working from the paths generated by the multi-path routing algorithms, the heuristic is also capable to provide a more evenly distributed traffic pattern

Identifying Design Requirements for Wireless Routing Link Metrics

In this paper, we identify and analyze the requirements to design a new routing link metric for wireless multihop networks. Considering these requirements, when a link metric is proposed, then both the design and implementation of the link metric with a routing protocol become easy. Secondly, the underlying network issues can easily be tackled. Thirdly, an appreciable performance of the network is guaranteed. Along with the existing implementation of three link metrics Expected Transmission Count (ETX), Minimum Delay (MD), and Minimum Loss (ML), we implement inverse ETX; invETX with Optimized Link State Routing (OLSR) using NS-2.34. The simulation results show that how the computational burden of a metric degrades the performance of the respective protocol and how a metric has to trade-off between different performance parameters