Reactive Routing Protocols For Mobile Research Articles

Comparative Study of AODV and DSR Routing Protocols for MANET: Performance Analysis

An ad hoc network is an assortment of wireless mobile nodes dynamically forming a transitory network lacking the use of any presented network communications or centralized management. A number of routing protocols like Dynamic Source Routing (DSR), Ad Hoc on-Demand Distance Vector Routing (AODV) and Temporally Ordered Routing Algorithm (TORA) have been projected. In this work an attempt has been ended to evaluate the performance of two outstanding on demand reactive routing protocols for mobile ad hoc networks: DSR and AODV. The performance differentials are analyzed using varying time, packet delivery ratio, throughput and end-to-end delay. These simulations are carried out using the ns-2 network simulator, which is used to run ad hoc simulations.

BAMR: a novel bandwidth aware multipath reactive routing protocol for mobile ad hoc network

Increasing traffic in mobile ad hoc networks (MANETs) demands high bandwidth. Mobility of communicating nodes is another crucial concern for such type of networks. Providing successful end to end communication in mobile ad hoc networks is a challenging task. In this paper, we aim at providing a bandwidth aware multipath reactive routing protocol for mobile ad hoc networks. The proposed protocol is an extension of ad hoc on demand multipath distance vector (AOMDV) routing protocol for mobile ad hoc networks. The proposed protocol, named as BAMR, attempts to discover paths with sufficient bandwidth and less link failures. The performance comparison of BAMR routing protocol is done with AOMDV and BAOMDV, an another bandwidth aware on demand multipath distance vector routing protocol for MANETs. Simulation results exhibit that proposed protocol BAMR significantly improves the performance of other two routing protocols and can be used more effectively for data transmissions in MANETs.

BAMR: a novel bandwidth aware multipath reactive routing protocol for mobile ad hoc network

Increasing traffic in mobile ad hoc networks (MANETs) demands high bandwidth. Mobility of communicating nodes is another crucial concern for such type of networks. Providing successful end to end communication in mobile ad hoc networks is a challenging task. In this paper, we aim at providing a bandwidth aware multipath reactive routing protocol for mobile ad hoc networks. The proposed protocol is an extension of ad hoc on demand multipath distance vector (AOMDV) routing protocol for mobile ad hoc networks. The proposed protocol, named as BAMR, attempts to discover paths with sufficient bandwidth and less link failures. The performance comparison of BAMR routing protocol is done with AOMDV and BAOMDV, an another bandwidth aware on demand multipath distance vector routing protocol for MANETs. Simulation results exhibit that proposed protocol BAMR significantly improves the performance of other two routing protocols and can be used more effectively for data transmissions in MANETs.

SMRRP: scalable multipath reactive routing protocol for mobile ad hoc networks

Routing scalability is a prime issue in a large mobile ad hoc network (MANET) and has a direct impact on the performance of the network. The performance of MANET degrades appreciably for a poorly scaled network. The present work aims at proposing a new routing protocol scalable multipath reactive routing protocol (SMRRP) for MANETs which aims at reducing the routing overhead incurred in recovering from route breaks. The SMRRP computes stable multiple disjoint paths from source node to destination node. The proposed routing protocol is suitable for a dynamic self-starting network and scales well to large populations of mobile nodes wishing to form mobile ad hoc networks.

SMRRP: scalable multipath reactive routing protocol for mobile ad hoc networks

Routing scalability is a prime issue in a large mobile ad hoc network (MANET) and has a direct impact on the performance of the network. The performance of MANET degrades appreciably for a poorly scaled network. The present work aims at proposing a new routing protocol scalable multipath reactive routing protocol (SMRRP) for MANETs which aims at reducing the routing overhead incurred in recovering from route breaks. The SMRRP computes stable multiple disjoint paths from source node to destination node. The proposed routing protocol is suitable for a dynamic self-starting network and scales well to large populations of mobile nodes wishing to form mobile ad hoc networks.

Analyzing Reactive Routing Protocols for Mobile Ad Hoc Networks

Mobile ad hoc networks (MANETs) are ad hoc networks in which the nodes co-operatively route the traffic to the destination nodes which are beyond the wireless range of source nodes. The nodes in the network act as both end devices and routers. The routing mechanism in MANETs differentiates it from other wireless networks. Developing a routing protocol which is light on resources and efficient is a challenging task. Several routing protocols have been developed but the reactive routing protocols have found favor in most applications since these obtain the route when a node has data to send. This results in lower routing load and better conservation of meagre resources of the nodes. The two prominent reactive routing protocols for mobile ad hoc networks-Dynamic Source Routing (DSR) and Ad-hoc On-demand Distance Vector (AODV) routing. Both the protocols have similar on-demand behavior, but the differences in the protocol mechanism can lead to significant performance differentials. The performance differentials are analyzed using varying network load and mobility.

Black-Hole and Wormhole Attack in Routing Protocol AODV in MANET

Mobile ad hoc network (MANET) is a self-configuring network that is formed automatically via wireless links by a collection of mobile nodes without the help of a fixed infrastructure or centralized management. The mobile nodes allow communication among the nodes outside the wireless transmission range by hop to hop and the forward packets to each other. Due to dynamic infrastructure-less nature and lack of centralized monitoring points, the ad hoc networks are vulnerable to attacks. The network performance and reliability is break by attacks on ad hoc network routing protocols. AODV is a important on-demand reactive routing protocol for mobile ad hoc networks. There is no any security provision against a “Black Hole” and “Wormhole” attacks in existing AODV protocol. Black hole nodes are those malicious nodes that conform to forward packet to destination. But they do not forward packet intentionally to the destination node. The black hole nodes degrade the performance of network eventually by participating in the network actively. The propose watchdog mechanism detect the black hole nodes in a MANET. This method first detects a black hole attack in the network and then provide a new route to this node. In this, the performance of original AODV and modified AODV in the presence of multiple black hole nodes is find out on the basis of throughput and packet delivery ratio. In a wormhole attack, intruders tunnel the data from one end of the network to the other, leading distant network nodes to trust they are neighbors’ and making them communicate through the wormhole link.

Analytical Studies of Energy–Time Efficiency of Blocking Expanding Ring Search

This paper investigates the energy–time efficiency of the Blocking Expanding Ring Search algorithms (BERS) using an extended graph model. BERS is an energy efficient alternative that was developed recently based on the Expanding Ring Search (ERS). ERS is widely applied in reactive routing protocols for mobile ad hoc networks. Most studies in this area focus on minimising either energy consumption or search latency, but few look into the strong correlation between the energy saving and the increased latency incurred. We analyse, in this study, the concurrency mechanism of BERS and have developed BERS*, an enhanced scheme based on BERS. Our results show that, among the three schemes (BERS*, BERS and ERS), BERS* incurs the least latency when the hop number of the route nodes is greater than 3, and has achieved the best performance in terms of energy–time efficiency when the hop number of the route nodes is greater than 7. We have also discovered the conditions that allow collective optimisation of BERS* and ERS.

Analysis of reactive routing protocols for mobile ad hoc networks in Markov models

Mobile ad hoc networks (MANETs) have become a hot issue in the area of wireless networks for their non-infrastructure and mobile features. In this paper, a MANET is modeled so that the length of each link in the network is considered as a birth-death process and the space is reused for n times in the flooding process, which is named as an n-spatial reuse birth-death model (n-SRBDM). We analyze the performance of the network under the dynamic source routing protocol (DSR) which is a famous reactive routing protocol. Some performance parameters of the route discovery are studied such as the probability distribution and the expectation of the flooding distance, the probability that a route is discovered by a query packet with a hop limit, the probability that a request packet finds a τ-time-valid route or a symmetric-valid route, and the average time needed to discover a valid route. For the route maintenance, some parameters are introduced and studied such as the average frequency of route recovery and the average time of a route to be valid. We compare the two models with spatial reuse and without spatial reuse by evaluating these parameters. It is shown that the spatial reuse model is much more effective in routing.

Distributed QoS Scheme for Multimedia Communication in Mobile Ad Hoc Network

In this paper we present a network layer based admission control and simple class based service differentiation model to support QoS in mobile ad hoc network. Our distributed admission control procedure works along with the route finding phase of reactive routing protocols for mobile ad hoc network (AODV, DSR etc). We also propose a simple class based distributed service differentiation system to support QoS once a traffic is admitted by our admission control mechanism. The proposed service differentiation is based on DiffServ model and includes modifications like configuration of each node with edge and core functionality, dynamic selection of edge/core functionality, use of minimal and simple classes. Simulation results show that our system allows seven times more real time traffic in the network than the proposed QoS for AODV model while satisfying the demanded end-to-end delay and providing low jitter.