Ad Hoc Mobile Wireless Networks Routing Protocols - A Review
TL;DR: Routing protocols used in wired network cannot be used for mobile ad-hoc networks because of node mobility, so these protocols are divided into two classes: table driven and demand based.
Abstract: Mobile ad hoc networks(MANET) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically self organize into arbitrary and temporary ad-hoc network topologies, allowing people and devices to seamlessly internet work in areas with no preexisting communication infrastructure e.g., disaster recovery environments. An ad-hoc network is not a new one, having been around in various forms for over 20 years. Traditionally, tactical networks have been the only communication networking application that followed the ad-hoc paradigm. Recently the introduction of new technologies such as Bluetooth, IEEE 802.11 and hyperlan are helping enable eventual commercial MANET deployments outside the military domain. These recent revolutions have been generating a renewed and growing interest in the research and development of MANET. To facilitate communication within the network a routing protocol is used to discover routes between nodes. The goal of the routing protocol is to have an efficient route establishment between a pair of nodes, so that messages can be delivered in a timely manner. Bandwidth and power constraints are the important factors to be considered in current wireless network because multi-hop ad-hoc wireless relies on each node in the network to act as a router and packet forwarder. This dependency places bandwidth, power computation demands on mobile host to be taken into account while choosing the protocol. Routing protocols used in wired network cannot be used for mobile ad-hoc networks because of node mobility. The ad-hoc routing protocols are divided into two classes: table driven and demand based. This paper reviews and discusses routing protocol belonging to each category.
Citations
More filters
TL;DR: This paper proposes and implements a new intrusion-detection system named Enhanced Adaptive ACKnowledgment (EAACK) specially designed for MANETs, which demonstrates higher malicious-behavior-detected rates in certain circumstances while does not greatly affect the network performances.
Abstract: The migration to wireless network from wired network has been a global trend 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. Nodes communicate directly with each other when they are both within the same communication range. Otherwise, they rely on their neighbors to relay messages. The self-configuring ability of nodes in MANET made it popular among critical mission applications like military use or emergency recovery. However, the open medium and wide distribution of nodes make MANET vulnerable to malicious attackers. In this case, it is crucial to develop efficient intrusion-detection mechanisms to protect MANET from attacks. With the improvements of the technology and cut in hardware costs, we are witnessing a current trend of expanding MANETs into industrial applications. To adjust to such trend, we strongly believe that it is vital to address its potential security issues. In this paper, we propose and implement a new intrusion-detection system named Enhanced Adaptive ACKnowledgment (EAACK) specially designed for MANETs. Compared to contemporary approaches, EAACK demonstrates higher malicious-behavior-detection rates in certain circumstances while does not greatly affect the network performances.
365 citations
13 Apr 2010
TL;DR: This paper reviews some of the state-of-the-art and widely investigated MANET routing strategies in the literature and a performance comparison of discussed routing protocol strategies is provided and suggestions are made to achieve improvement in performance of these protocols.
Abstract: Mobile Ad Hoc Networks (MANETs) are generating a lot of interests due to 3G and 4G activities. The dynamic nature of these networks demands new set of network routing strategy protocols to be implemented in order to provide efficient end-to-end communication. Due to the diverse applications that use MANETs, such as battlefield, emergency services, and disaster discovery, MANETs offer many advantages to many organizations that need wireless roaming. For efficient and timely use, routing and synchronization are essential. Both are hot research topics in MANETs. This paper concentrates on routing, which is a challenging task and has seen a huge number of different strategies proposed, each claiming to provide an improvement over other strategies. These competing strategies make it quite difficult to determine which one may perform optimally under a number of different sets of network conditions as defined by their Quality of Service (QoS) offerings. This paper reviews some of the state-of-the-art and widely investigated MANET routing strategies in the literature. Moreover, a performance comparison of discussed routing protocol strategies is provided and suggestions are made to achieve improvement in performance of these protocols. This research is followed by presenting further research that will be pursued to define a radically most optimum set of strategies to satisfy different types of application domains.
123 citations
Cites background from "Ad Hoc Mobile Wireless Networks Rou..."
...The importance of this type of research is proven by increasing number of survey researches which try to compare different protocols, some of these up-to-date surveys are presented in [25] [26] [27]....
[...]
01 Jan 2007
TL;DR: This paper examines two on demand routing protocols AODV and DSR based on packet delivery ratio, normalized routing load, normalized MAC load, average end to end delay by varying the number of sources, speed and pause time.
Abstract: Summary Ad hoc networks are characterized by multi-hop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols plays an important role. We compare the performance of two prominent on-demand routing protocols for mobile ad hoc networks: Dynamic Source Routing (DSR), Ad Hoc Ondemand distance Vector Routing (AODV). A detailed simulation model with MAC and physical layer models is used to study the interlayer interactions and their performance implications. We demonstrate that even though DSR and AODV share similar on-demand behavior, the differences in the protocol mechanisms can lead to significant performance differentials. In this paper we examine two on demand routing protocols AODV and DSR based on packet delivery ratio, normalized routing load, normalized MAC load, average end to end delay by varying the number of sources, speed and pause time.
115 citations
Cites background from "Ad Hoc Mobile Wireless Networks Rou..."
...The simulation results bring out some important characteristic of differences between the two on demand routing protocols....
[...]
08 Nov 2010
TL;DR: A new IDS called Enhanced Adaptive ACKnowledgement (EAACK) is proposed that solves four significant problems of Watchdog mechanism, which are ambiguous collisions, receiver collisions, limited transmission power and false misbehavior report.
Abstract: There has been a tremendous growth in the use of wireless communication in the past few decades Mobile Ad hoc NETwork (MANET) is one of the most important one among various wireless communication mechanisms In MANET, each node in a network performs as both a transmitter and a receiver They rely on each other to store and forward packets Its unique infrastructureless network and self-configuring capability makes it ideal for many mission critical applications, including military use and remote exploration However, these characteristics also make MANET vulnerable to passive and active attacks due to its open medium, changing topology and lack of centralized monitoring To address the new security challenges, Intrusion Detection System (IDS) is required to detect the malicious attackers before they can accomplish any significant damages to the network Many existing IDSs for MANETs are based upon Watchdog mechanism In this paper, we propose a new IDS called Enhanced Adaptive ACKnowledgement (EAACK) that solves four significant problems of Watchdog mechanism, which are ambiguous collisions, receiver collisions, limited transmission power and false misbehavior report We use Network Simulator 2 to simulate the proposed mechanism and compare the results with existing mechanisms
90 citations
Cites background from "Ad Hoc Mobile Wireless Networks Rou..."
...Among various wireless networks, MANET is of its unique importance....
[...]
TL;DR: This paper simulates the environment used for analyzing, evaluating and implementing AODV, DSDV and TORA routing protocols in MANET, to analyze the performance of above said protocols based on Packet Delivery Ratio, Average End-to-End Delay and Throughput.
Abstract: The primary objective of this research work is to study and investigate the performance measures of Reactive protocols (AODV, TORA) and Proactive protocols (DSDV) routing protocols of MANET using TCP & CBR based traffic models. In this paper we will simulate the environment used for analyzing, evaluating and implementing AODV, DSDV and TORA routing protocols in MANET, to analyze the performance of above said protocols based on Packet Delivery Ratio, Average End-to-End Delay and Throughput. We will investigate the effect of change in number of nodes on MANET routing protocols. Here, we will analyze and compare the performance of MANET routing protocols based on both CBR and TCP based traffic patterns. We have used the NS-2 simulator for performing various simulations and used awk scripts for analyzing the results.
48 citations
References
More filters
25 Feb 1999
TL;DR: 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 and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Abstract: 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.
11,360 citations
"Ad Hoc Mobile Wireless Networks Rou..." refers background in this paper
...AODV minimizes the number of route broadcasts by creating routes on-demand ([17]), as opposed to maintaining a complete list of routes as in the DSDV algorithm....
[...]
01 Jan 1994
TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Abstract: An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.
8,614 citations
01 Oct 1994
TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
Abstract: An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such ad-hoc networks. The basic idea of the design is to operate each Mobile Host as a specialized router, which periodically advertises its view of the interconnection topology with other Mobile Hosts within the network. This amounts to a new sort of routing protocol. We have investigated modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP [5], to make it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad hoc networks. Our modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile Hosts. Finally, we describe the ways in which the basic network-layer routing can be modified to provide MAC-layer support for ad-hoc networks.
6,877 citations
01 Oct 2003
TL;DR: The Optimized Link State Routing protocol is an optimization of the classical link state algorithm tailored to the requirements of a mobile wireless LAN and provides optimal routes (in terms of number of hops).
Abstract: This document describes the Optimized Link State Routing (OLSR) protocol for mobile ad hoc networks. The protocol is an optimization of the classical link state algorithm tailored to the requirements of a mobile wireless LAN. The key concept used in the protocol is that of multipoint relays (MPRs). MPRs are selected nodes which forward broadcast messages during the flooding process. This technique substantially reduces the message overhead as compared to a classical flooding mechanism, where every node retransmits each message when it receives the first copy of the message. In OLSR, link state information is generated only by nodes elected as MPRs. Thus, a second optimization is achieved by minimizing the number of control messages flooded in the network. As a third optimization, an MPR node may chose to report only links between itself and its MPR selectors. Hence, as contrary to the classic link state algorithm, partial link state information is distributed in the network. This information is then used for route calculation. OLSR provides optimal routes (in terms of number of hops). The protocol is particularly suitable for large and dense networks as the technique of MPRs works well in this context.
5,442 citations
TL;DR: Routing protocols for ad hoc networks are examined by providing an overview of eight different protocols by presenting their characteristics and functionality, and then a comparison and discussion of their respective merits and drawbacks are provided.
Abstract: An ad hoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. In order to facilitate communication within the network, a routing protocol is used to discover routes between nodes. The primary goal of such an ad hoc network routing protocol is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This article examines routing protocols for ad hoc networks and evaluates these protocols based on a given set of parameters. The article provides an overview of eight different protocols by presenting their characteristics and functionality, and then provides a comparison and discussion of their respective merits and drawbacks.
4,278 citations