Mobile Ad Hoc Network Routing Protocols Research Articles

Comparison of DYMO, AODV, DSR MANET Routing Protocols

Routing in Mobile Ad-Hoc Networks (MANET) is a challenging task. Routing protocols used in mobile ad hoc networks (MANET) must adapt to frequent or continual changes of topology. This paper presents a comprehensive summarization and a comparative study simulation analysis of existing protocols AODV, DSR &DYMO. This paper present performance comparison of three mobile ad-hoc network routing protocols i.e. Ad-hoc On Demand Distance Vector (AODV), (DYMO), DSR using Qualnet 6.1 version on the basis of performance such as throughput, end to end delay, packet delivery ratio and jitter.

A one-hop information based geographic routing protocol for delay tolerant MANETs

Delay and disruption tolerant networks (DTNs) may lack continuous network connectivity. Routing in DTNs is thus a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, a geographic routing protocol is proposed for MANETs in delay tolerant situations, by using no more than one-hop information. A utility function is designed for implementing the under-controlled replication strategy. To reduce the overheads caused by message flooding, we employ a criterion so as to evaluate the degree of message redundancy. Consequently a message redundancy coping mechanism is added to our routing protocol. Extensive simulations have been conducted and the results show that when node moving speed is relatively low, our routing protocol outperforms the other schemes such as Epidemic, Spray and Wait, FirstContact in delivery ratio and average hop count, while introducing an acceptable overhead ratio into the network.

Energy Competent Routing Protocol Design in MANET with Real Time Application Provision

With the increase of mobile activities in technological environment, it is a challenge to develop and maintain robust networking system with provision of high connectivity. In this context, Mobile Adhoc Network (MANET) is a feasible solution because it is dynamic in nature and the self-configured nodes of MANET can communicate intelligently in adverse and dynamic mobile situations. Though Adhoc on Demand Distance Vector (AODV) Routing protocol handles the networking issues efficiently, still power and delay efficiency has always been a challenging task in MANET due to the resource constrained nodes which are supplied with limited battery power during the operation in the network. Hence while performing various networking activities; gradually the battery power reduces resulting in delay in processing of packet and forwarding them to the next node during transmission. This causes overall end to end delay in the total transmission. Therefore many researches are still going on in the direction of designing robust and reliable protocols. In this paper the authors have developed a robust and energy efficient routing protocol for MANET with real time support. Their approach is different as it calculates the remaining residual battery power, bounded delay and packet processing rate of the intermediate node before selecting a node to forward the packet in the direction of destination. The cost function calculated using the above three factors along with the condition of congested node is also checked to correctly choose a load balanced path from source to destination. Simulation results show that the proposed protocol performs better than the conventional AODV protocol in terms of better network life time, throughput, delay and packet delivery ratio.

Secure Lightweight Routing Protocol with Confidentiality Redundancy in Wireless Ad Hoc Networks (SLRCR)

Mobile ad hoc networks (MANETs) are independent self-organizing systems of mobile nodes or computers connected by wireless links and without using of any infrastructure like base stations or access points. Routing is a critical function in multi-hop mobile ad hoc networks. The most important requirement for MANET routing protocols is the ability to operate in adversarial environments. In this paper, we proposed Secure Lightweight Routing protocol with Confidentiality Redundancy in wireless ad hoc networks (SLRCR). This protocol consists of two phases: 1) Using of MAC and symmetric cryptography for nodes authentication and 2) using of µTESLA for Confidentiality redundancy. This protocol is lightweight and robust; also, it is able to prevent large number types of routing attacks.

Detection and Removal of Gray, Black and Cooperative Black Hole Attacks in AODV Technique

Mobile ad hoc network (MANET) is an autonomous self-configuring infrastructure-less wireless network. MANET is vulnerable to a lot of routing security threats due to unreliability of its nodes that are highly involved in the routing process. In this paper, a new technique is proposed to enhance the security of one of the most popular MANET routing protocols that is called Ad hoc on Demand Distance Vector (AODV) with minimum routing overhead and high packet delivery ratio. The proposed technique intends to detect and remove black, gray, and cooperative black hole AODV attacks depending on a mobile backbone network constructed from randomly moving regular MANET nodes based on their trust value, location, and power. The backbone network monitors regular nodes as well as each other to periodically estimate monitoring trust values which represent the reliability of each node in the network. The drop in the monitoring trust value of any node is used as a clue to its malicious behavior. The backbone network also tries to bait the malicious nodes to reply to a request for a route to fake destination address. The proposed technique uses the control packets of the AODV to exchange its control information which highly reduces the overhead. The simulation results show that the performance of the proposed technique is more secure than AODV and the other recently introduced techniques.

Investigating on Mobile Ad-Hoc Network to Transfer FTP Application

Mobile Ad-hoc Network (MANET) is the collection of mobile nodes without requiring of any infrastructure. Mobile nodes in MANET are operating as a router and MANET network topology can change quickly. Due to nodes in the network are mobile and thus can move randomly and organize arbitrarily regardless of the directions that generate great complexity in routing traffic from source to destination. To communicate with other nodes MANET nodes contain multiple applications and it needs the different level of data traffic. While data communicate different routing protocols require whereas every node must act as a router. Nowadays, different routing protocols have available for MANET. MANET protocols designed and implemented at the network layer have vital roles that affect the application running at the application layer. In this paper, the performance of On Demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Geographic Routing Protocol (GRP) will be evaluated. The main purpose of this research is to analyze the performance of MANET routing protocols to identify “Which routing protocol has ability to provide the best performance to transfer FTP Application in high mobility case under low, medium and high density scenario?”. The performance analyze with respect to Average End-to-End Delay, Media Access Delay, Network Load, Retransmission Attempt and Throughput. All simulations have been done using OPNET. On the basis of results show that the GRP gives better performance in End-to-End Delay, Media Access Delay, and Retransmission Attempt when varying network size and provide the best Throughput in small and medium network size. Simulation results verify that AODV gives better Throughput in a large network and lower Network Load in small and medium network size compared to GRP. DSR produces low Average Network load as compared to other protocols. The overall study of the FTP application shows that the performance of theses routing protocols differences by varying number of nodes and node speed. This paper results will produce enough information to identify the best routing protocol for MANET to transfer FTP application.

Energy-Efficient Inter-Domain Routing Protocol for MANETs

In the last seven years, the focus of researchers in ad hoc networks field has shifted to inter-domain routing. Researchers used several methods to enhance the efficiency of routing between different mobile ad hoc networks (MANETs). These routing methods were based on clustering techniques, virtual coordinates, Ant Colony Optimization., etc. Inter-domain routing in MANETs relies on gateways. When a packet is sent from a source to a destination, it follows a route of internal and external connected gateways in different domains and as the MANETs are mobile (both individual nodes within a domain as well as whole domains relative to each other), the topology of the whole network composed of different domains can change in an intermittent way. Therefore, gateways belonging to different MANETs must know each other to be reconnected. In this paper we introduce our inter-domain routing proposal based on bees’ communication to handle a dynamic topology in inter-Ad Hoc networks. The goal is to design an energy efficient inter-domain routing protocol for MANETs with low overhead.

Simulation Analysis of Ad-Hoc On-Demand Distance Vector Routing Protocol Performance in Mobile Ad Hoc Network Using Taguchi Design Approach

Mobile ad-hoc network routing protocol performance is evaluated mostly through simulative studies. One-factor-at-atime approach is commonly used to quantify the effect of various factors on the protocol performance. In this work, the effect of several factors was investigated simultaneously and speedily with the application of Taguchi design of experiments. The effect of the factors which include terrain size, node speed, network size, transmission range, transmission rates, pause time, and maximum connection on routing overhead was quantified. Analysis signal-to-noise ratio was performed to determine the best possible combination of factors and analysis of variance (ANOVA) was carried out to identify the significant factors that affect the routing overhead. The results showed that network size, transmission range and maximum connection play a significant role in minimizing routing overhead. The results were confirmed experimentally at 95% confidence interval.

An Energy Level Based Routing Protocol in Ad Hoc Networks

The study of energy constrained routing protocols in mobile Ad Hoc Networks (MANET) is attracting more attention recently. The typical MANET routing protocols of IETF are shortest routing protocols, that is, the least hops but do not consider the energy aware problem. Because the ad hoc networks is an energy constrained system with the portable devices, it is a very important metric to evaluate the routing protocols whether which have a longer network lifetime or not. Based on the mobile node energy level and using the different forward tactics, this paper presents an energy level based routing protocol-ELBRP. The routing protocol not only makes the system energy consumption low but also prolongs the system lifetime and improves the delay characteristic. In this paper, the proof of correctness and complexity analysis of ELBRP are given. This paper compares the performance of existing protocols AODV, RDRP and proposed ELBRP via simulation. The simulation result shows that ELBRP has a better delay performance, a lower energy consumption and longer network lifetime than the other two and provides an available approach to as hoc networks routing.

A Simulation Based Performance Evaluation of AODV, R-AODV and PHR-AODV Routing Protocols for Mobile Ad Hoc Networks

Mobile Ad hoc Networks (MANETs) are characterized by open structure, lack of standard infrastructure and un-accessibility to the trusted servers. The performance of various MANET routing protocols is significantly affected due to frequently changing network topology, confined network resources and security of data packets. In this paper, a simulation based performance comparison of one of the most commonly used on-demand application oriented routing protocols, AODV (Ad hoc on-demand Distance Vector) and its optimized versions R-AODV (Reverse AODV) and PHR-AODV (Path hopping based Reverse AODV) has been presented. Basically the paper evaluates these protocols based on a wide set of performance metrics by varying both the number of nodes and the nodes maximum speed. A NS-2 based simulation study shows that, as compared to AODV and PHR-AODV, R-AODV enhances the packet delivery fraction by 15-20% and reduces the latency approximately by 50%. R-AODV requires lesser node energy for data transmission .

IJARCCE - Computer and Communication Engineering

This paper evaluates the performance of two different mobile ad-hoc networks (MANET) routing protocols based upon one of the Mobility Model: Manhattan Grid (MG) with varying Speed of the mobile nodes in two different traffic Patterns. We have considered CBR and an Exponential Traffic Pattern (which is based on Exponential distribution). Simulations have been carried out by using Network Simulator Version 2.35 (NS-2) and its associated tools for analysis of results. Comparative analysis of simulation results includes the value of Packet Delivery Ratio (PDR), Throughput and Normalized Routing Load (NRL). It is found that the Exponential Traffic pattern gives better results as comparative to CBR Traffic pattern. A Mobile Ad-Hoc Network (MANET) is a self-configuring network of mobile nodes connected by wireless links, to form an arbitrary topology. The nodes are free to move randomly. Thus the network's wireless topology may be unpredictable and may change rapidly. Each node in the MANET is equipped with a wireless transmitter and receiver, with the aid of which it communicates with the other nodes in its wireless vicinity. The nodes which are not in wireless vicinity, communicate with each other hop by hop following a set of rules (routing protocol) for the hopping sequence to be followed. Routing protocols will need to perform four important functions of determination of network topology,

Impact of the Mobility Models, Route and Link connectivity on the performance of Position based routing protocols

This paper investigate the fundamental factors “mobility models, route and link connectivity” in Mobile Ad hoc networks (MANET) which have a major impact on the performance of position based routing protocols. In addition, a new measurement method called probability of communication process is proposed. The method is used to measure the success rate of established path by a MANET routing protocol, which allow to stress test and inspect the stability, scalability and adaptability of MANET routing protocols. We analysed the effect of “route and link connectivity” on the performance of protocols under two different mobility models. Results show the evaluation and performance of the proposed protocol under a unified simulation environment for different scenarios.

Energy efficient zone based routing protocol for MANETs

Mobile Ad Hoc Networks (MANET) are self-configuring infrastructureless networks of mobile devices connected via wireless links. Each device can send and receive data, but it should also forward traffic unrelated to its own use. All need to maintain their autonomy, and effectively preserve their resources (e.g. battery power). Moreover, they can leave the network at any time. Their intrinsic dynamicity and fault tolerance makes them suitable for applications, such as emergency response and disaster relief, when infrastructure is nonexistent or damaged due to natural disasters, such as earthquakes and flooding, as well as more mundane, day-to-day, uses where their flexibility would be advantageous.Routing is the fundamental research issue for such networks and refers to finding and maintaining routes between nodes. Moreover, it involves selecting the best route where many may be available. However, due to the freedom of movement of nodes, new routes need to be constantly recalculated. Most routing protocols use pure broadcasting to discover new routes, which takes up a substantial amount of bandwidth. Intelligent rebroadcasting reduces these overheads by calculating the usefulness of a rebroadcast, and the likelihood of message collisions. Unfortunately, this introduces latency and parts of the network may become unreachable. This paper discusses the Zone based Routing with Parallel Collision Guided Broadcasting Protocol (ZCG) that uses parallel and distributed broadcasting technique (Basurra et al., 2010) [8] to reduce redundant broadcasting and to accelerate the path discovery process, while maintaining a high reachability ratio as well as keeping node energy consumption low.ZCG uses a one hop clustering algorithm that splits the network into zones led by reliable leaders that are mostly static and have plentiful battery resources. The performance characteristics of the ZCG protocol are established through simulations by comparing it to other well-known routing protocols, namely the: AODV and DSR. It emerges that ZCG performs well under many circumstances.

English

Mobile Ad-hoc Networks (MANETs) can form a network by allowing the wireless nodes without any fixed infrastructure. For MANET’s, early routing protocols are not accounted because of security issues. Further, cryptographic methods were revised to secure the routing information. These protocols had created new avenues for denial of service (DoS) as a part of the process. Thus, the trade-off between security strength and DoS vulnerability has become an emerging area, which required further investigation. Therefore, Different trust methods can be used for the protocol development at various levels during trade-off. To gain the knowledge on this, real world testing which evaluates the cost of existing proposals is mandatory. Without this, the protocol design in the future will be difficult. Thus, in the present paper, the comparison of two MANET routing protocols, namely SAODV and TAODV are carried. This addresses the routing security through cryptographic and trust-based means, and also the performance comparisons on actual resource-limited hardware. Based on this, the design decisions are evaluated for routing protocols in near future. Keywords— ad-hoc, security, routing, trust-based,

The Effect of Mobility Models and Traffic Patterns on the Performance of Routing Protocols in MANETs

Mobile ad-hoc networks (MANETs) are self-organizing networks which can form a communication network without any fixed infrastructure. Constant bit rate (CBR) traffic pattern is very well known traffic model for MANETs which generates data packets at a constant rate. Transmission Control Protocol (TCP) provides reliability to data transferring in all end-to-end data stream services on the MANETs. There are several TCP traffic patterns such as TCP Reno, TCP New Reno, TCP Vegas, and TCP Selective Acknowledgment (Sack). The traffic pattern plays an important role in so far as the performance of a routing protocol is concerned. In this paper, we study the effect of impact of mobility models and traffic patterns on the behavior of Reactive (AODV) and Proactive (DSDV, OLSR) routing protocols used in MANETs considering both CBR and TCP traffic patterns with different mobility models namely, Reference Point Group Mobility (RPGM) and Manhattan Grid (MG). The performance metrics used to evaluate the efficiency of the considered protocols are packet delivery ratio, average throughput and End-to-End Delay. The experimental results conducted using NS2 simulator show that the relative ranking of routing protocols may vary depending on both mobility models and traffic patterns.

Cooperation Aware Layer Three Multi Path Routing using QoS Approach for MANET

protocols in Mobile Ad-Hoc Networks need to accommodate its dynamic characteristics such as node mobility, non-availability of central control etc. Node mobility increase challenges to the routing protocols with respect to attainment of the desired level of Quality of services. Apart from own communication, MANET nodes have to participate in packets forwarding to other nodes. Node cooperation is a crucial characteristic for smooth performance in Mobile Ad Hoc Network (MANET). During the network run, the node run of resources in turn brought down the network. It is therefore, a safer policy to preserve its resources for further communications. Resource preservation of a node will not be the best choice of other nodes seeking the node cooperation for communication. While nodes refuse to collaborate, delivery of local, alternate (backup) routes to achieve proper communication becomes a better choice. This paper proposes a novel, alternate routing protocol that is an extension of AOMDV. This protocol ventures to explore supplementary back up routes, which are more helpful in the situations of non-cooperation of nodes by exploiting subsequently received RREP packets. The novel protocol performance evaluated and analyzed by means of simulations across a wide range of probabilities of non-cooperative nodes. The outcomes indicate that the novel routing protocol outperforms the best (or at least is comparable) with respect to the widely adopted MANET routing protocols in all considered scenarios.

Agent-based trusted on-demand routing protocol for mobile ad-hoc networks

The routing performance in mobile ad hoc networks (MANETs) relies on the co-operation of the individual nodes that constitute the network. The existence of misbehaving nodes may paralyze the routing operation in MANETs. To overcome this behavior, the trustworthiness of the network nodes should be considered in the route selection process combined with the hop count. The trustworthiness is achieved by measuring the trust value for each node in the network. In this paper, a new protocol based on self monitoring (agent-based) and following the dynamic source routing (DSR) algorithm is presented. This protocol is called agent-based trusted dynamic source routing protocol for MANETs. The objective of this protocol is to manage trust information locally with minimal overhead in terms of extra messages and time delay. This objective is achieved through installing in each participated node in the network a multi-agent system (MAS). MAS consists of two types of agents: monitoring agent and routing agent. A new mathematical and more realistic objective model for measuring the trust value is introduced. This model is weighted by both number and size of routed packets to reflect the "selective forwarding" behavior of a node. The performance evaluation via simulation shows that our protocol is better than standard and trusted DSR. The simulation is done over a variety of environmental conditions such as number of malicious nodes, host density and movement rates.

A Secure Intrusion-Detection System Using an Acknowledgment-Based Approach for the Detection of Routing Misbehavior in MANETS

The migration to wireless network from wired network has been a global trends in the past few decades. The mobility and scalability brought by wireless network made it possible in many applications. Among all the contemporary wireless networks, Mobile Ad hoc NETwork (MANET) is one of the most important and unique applications. On the contrary to traditional network architecture, MANET does not require a fixed network infrastructure; every single node works as both a transmitter and a receiver. In general, routing protocols for MANETs are designed based on the assumption that all participating nodes are fully cooperative. Nodes communicate directly with each other when they are both within the same communication range. Otherwise, they rely on their neighbors to relay messages. One such routing misbehavior is that some selfish nodes will participate in the route discovery and maintenance processes but refuse to forward data packets. In this paper, we propose the 2ACK scheme and a new intrusion-detection system named Enhanced Adaptive ACKnowledgment (EAACK) specially designed for MANETs that serves as an add-on technique for routing schemes to detect routing misbehavior and to mitigate their adverse effect. The main idea of the 2ACK scheme is to send two-hop acknowledgment packets in the opposite direction along with the EAACK demonstrates higher malicious behavior detection rates in certain circumstances while does not greatly affect the network performances of the routing path. In order to reduce additional routing overhead, only a fraction of the received data packets are acknowledged in the 2ACK scheme. Analytical and simulation results are presented to evaluate the performance of the proposed scheme.

A Survey on DHT-Based Routing for Large-Scale Mobile Ad Hoc Networks

Mobile ad hoc networks (MANETs) are infrastructureless and distributed communication systems that require sophisticated approaches to routing to cope with node mobility and heterogeneous application requirements. In the past few years, distributed hash table (DHT) has come forth as a useful additional technique to the design and specification of spontaneous and self-organized networks. Researchers have exploited its advantages by implementing it at the network layer and developing scalable routing protocols for MANETs. The implementation of DHT-based routing in a MANET requires different algorithms and specifications compared to routing in the Internet because a MANET has its unique characteristics, such as node mobility, spontaneous networking, decentralized architecture, limited transmission range, dynamic topology, and frequent network partitioning/merging. In this article, we present a comprehensive survey of research related to DHT-based routing that aims at enhancing the scalability of MANETs. We present a vivid taxonomy of DHT-based routing protocols and the guidelines to design such protocols for MANETs. We compare the features, strengths, and weaknesses of existing DHT-based routing protocols and highlight key research challenges that are vital to address. The outcome of the analysis serves as a guide for anyone willing to delve into research on DHT-based routing in MANETs.

A Survey on Scalable Multicasting in Mobile Ad Hoc Networks

Mobile ad hoc networks (MANETs) have gained significant interest and popularity since they have enormous potential in several fields of applications. Infrastructure-free, self-configuring and mobility are the main reasons behind this popularity. Recently, group-oriented applications over MANET gains high popularity. Multicast communication is the ideal communication technique for supporting these types of applications. However, multicast routing in large-scale networks faces several difficulties and challenges that need to be addressed. These challenges include dynamic MANET topology, multicast packet forwarding and shared wireless medium. During the last years, active research work resulted in a variety of proposals. A number of protocols, each with a particular property and often optimized for a specific application area, have been designed. They follow different design principles and exhibit substantial variations in performance depending on various parameters. In this paper, most of the existing scalable multicast routing protocols in MANETs are briefly discussed and analyzed to provide a comprehensive understanding of these protocols and pave the way for further research.