A Survey on Attacks and Defense Metrics of Routing Mechanism in Mobile Ad hoc Networks
---
paper_title: A study of recent research trends and experimental guidelines in mobile ad-hoc network

paper_content:

This work investigates and analyzes recent research trends and presents experimental guidelines on MANETs. More than 1,300 MANET related papers in IEEE/IEE Electronic Library (IEL Online) from 1998 to 2003 were collected and surveyed. The research trends, qualitative analysis and simulation guidelines from fifteen major MANET issues are investigated to assist the user in conducting MANET research. Based on recent six year trends we found that some issues such as routing and power management attracted much attention. We also found that some issues have potential study value, such as IP addressing and fault tolerance. In the qualitative analysis, we found that some factors such as scalability, stability, and reliability attracted much attention in major MANET issues. The essential simulation metrics for various MANET issues are identified and listed for experimental guidelines. The analysis results demonstrate the utilization trends for various MANET simulators.
---
paper_title: Scalable routing strategies for ad hoc wireless networks

paper_content:

We consider a large population of mobile stations that are interconnected by a multihop wireless network. The applications of this wireless infrastructure range from ad hoc networking (e.g., collaborative, distributed computing) to disaster recovery (e.g., fire, flood, earthquake), law enforcement (e.g., crowd control, search-and-rescue), and military (automated battlefield). Key characteristics of this system are the large number of users, their mobility, and the need to operate without the support of a fixed (wired or wireless) infrastructure. The last feature sets this system apart from existing cellular systems and in fact makes its design much more challenging. In this environment, we investigate routing strategies that scale well to large populations and can handle mobility. In addition, we address the need to support multimedia communications, with low latency requirements for interactive traffic and quality-of-service (QoS) support for real-time streams (voice/video). In the wireless routing area, several schemes have already been proposed and implemented (e.g., hierarchical routing, on-demand routing, etc.). We introduce two new schemes-fisheye state routing (FSR) and hierarchical state routing (HSR)-which offer some competitive advantages over the existing schemes. We compare the performance of existing and proposed schemes via simulation.
---
paper_title: The Optimized Link State Routing Protocol Evaluation through Experiments and Simulation

paper_content:

In this paper, we describe the Optimized Link State Routing Protocol (OLSR) [1] for Mobile Ad-hoc NETworks (MANETs) and the evaluation of this protocol through experiments and simulations. In particular, we emphasize the practical tests and intensive simulations, which have been used in guiding and evaluating the design of the protocol, and which have been a key to identifying both problems and solutions. OLSR is a proactive link-state routing protocol, employing periodic message exchange for updating topological information in each node in the network. I.e. topological information is flooded to all nodes in the network. Conceptually, OLSR contains three elements: Mechanisms for neighbor sensing based on periodic exchange of HELLO messages within a node’s neighborhood. Generic mechanisms for efficient flooding of control traffic into the network employing the concept of multipoint relays (MPRs) [5] for a significant reduction of duplicate retransmissions during the flooding process. And a specification of a set of control-messages providing each node with sufficient topological information to be able to compute an optimal route to each destination in the network using any shortest-path algorithm. Experimental work, running a test-network of laptops with IEEE 802.11 wireless cards, revealed interesting properties. While the protocol, as originally specified, works quite well, it was found, that enforcing “jitter” on the interval between the periodic exchange of control messages in OLSR and piggybacking said control messages into a single packet, significantly reduced the number of messages lost due to collisions. It was also observed, that under certain conditions a “naive” neighbor sensing mechanism was insufficient: a bad link between two nodes (e.g. when two nodes are on the edge of radio range) might on occasion transmit a HELLO message in both directions (hence enabling the link for routing), while not being able to sustain continuous traffic. This would result in “route-flapping” and temporary loss of connectivity. With the experimental results as basis, we have been deploying simulations to reveal the impact of the various algorithmic improvements, described above.
---
paper_title: Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

paper_content:

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.
---
paper_title: Ad-hoc on-demand distance vector routing

paper_content:

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.
---
paper_title: A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks

paper_content:

A new global positioning system (GPS)-based routing protocol for ad hoc networks, called zone-based hierarchical link state (ZHLS) routing protocol, is proposed. In this protocol, the network is divided into nonoverlapping zones. Each node only knows the node connectivity within its zone and the zone connectivity of the whole network. The link state routing is performed on two levels: focal node and global zone levels. Unlike other hierarchical protocols, there is no cluster head in this protocol. The zone level topological information is distributed to all nodes. This "peer-to-peer" manner mitigates traffic bottleneck, avoids single point of failure, and simplifies mobility management. Since only zone ID and node ID of a destination are needed for routing, the route from a source to a destination is adaptable to changing topology. The zone ID of the destination is found by sending one location request to every zone. Simulation results show that our location search scheme generates less overhead than the schemes based on flooding. The results also confirm that the communication overhead for creating and maintaining the topology in the proposed protocol is smaller than that in the flat LSR protocol. This new routing protocol provides a flexible, efficient, and effective approach to accommodate the changing topology in a wireless network environment.
---
paper_title: CEDAR: a core-extraction distributed ad hoc routing algorithm

paper_content:

CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infrastructure called the core for performing route computations, (b) the propagation of the link-state of stable high-bandwidth links in the core through increase/decrease waves, and (c) a QoS route computation algorithm that is executed at the core nodes using only locally available state. But preliminary performance evaluation shows that CEDAR is a robust and adaptive QoS routing algorithm that reacts effectively to the dynamics of the network while still approximating link-state performance for stable networks.
---
paper_title: Security in mobile ad hoc networks: challenges and solutions

paper_content:

Security has become a primary concern in order to provide protected communication between mobile nodes in a hostile environment. Unlike the wireline networks, the unique characteristics of mobile ad hoc networks pose a number of nontrivial challenges to security design, such as open peer-to-peer network architecture, shared wireless medium, stringent resource constraints, and highly dynamic network topology. These challenges clearly make a case for building multifence security solutions that achieve both broad protection and desirable network performance. In this article we focus on the fundamental security problem of protecting the multihop network connectivity between mobile nodes in a MANET. We identify the security issues related to this problem, discuss the challenges to security design, and review the state-of-the-art security proposals that protect the MANET link- and network-layer operations of delivering packets over the multihop wireless channel. The complete security solution should span both layers, and encompass all three security components of prevention, detection, and reaction.
---
paper_title: A Survey on Security in Wireless Mesh Networks

paper_content:

AbstractWireless mesh networks is a new emerging field with its potential applications in extremely unpredictable and dynamic environments. However, it is particularly vulnerable due to its features of open medium, dynamic changing topology, and cooperative routing algorithms. The article surveys the state of the art in security for wireless mesh networks. First, we analyze various possible threats to security in wireless mesh networks. Second, we introduce some representative solutions to these threats, including solutions to the problems of key management, secure network routing, and intrusion detection. We also provide a comparison and discussion of their respective merits and drawbacks, and propose some improvements for these drawbacks. Finally, we also discuss the remaining challenges in the area.
---
paper_title: Secure Routing Protocol for Ad hoc Networks

paper_content:

To provide an effective method for verifying security of secure dynamic source routing(DSR) protocols,a sufficient-and-necessary condition against active-1-y(y≥1) adversary for secure DSR protocols is proposed.Then a new secure DSR protocol,named effective secure DSR(ESDSR),which is proved to meet this sufficient-and-necessary condition is presented.Compared with the existing secure DSR protocols,the proposed protocol ESDSR can not only defend against active-1-y adversary,but also consume less resource.
---
paper_title: A Survey on Security in Wireless Mesh Networks

paper_content:

AbstractWireless mesh networks is a new emerging field with its potential applications in extremely unpredictable and dynamic environments. However, it is particularly vulnerable due to its features of open medium, dynamic changing topology, and cooperative routing algorithms. The article surveys the state of the art in security for wireless mesh networks. First, we analyze various possible threats to security in wireless mesh networks. Second, we introduce some representative solutions to these threats, including solutions to the problems of key management, secure network routing, and intrusion detection. We also provide a comparison and discussion of their respective merits and drawbacks, and propose some improvements for these drawbacks. Finally, we also discuss the remaining challenges in the area.
---
paper_title: A Survey on Security in Wireless Mesh Networks

paper_content:

AbstractWireless mesh networks is a new emerging field with its potential applications in extremely unpredictable and dynamic environments. However, it is particularly vulnerable due to its features of open medium, dynamic changing topology, and cooperative routing algorithms. The article surveys the state of the art in security for wireless mesh networks. First, we analyze various possible threats to security in wireless mesh networks. Second, we introduce some representative solutions to these threats, including solutions to the problems of key management, secure network routing, and intrusion detection. We also provide a comparison and discussion of their respective merits and drawbacks, and propose some improvements for these drawbacks. Finally, we also discuss the remaining challenges in the area.
---
paper_title: A Survey on Security in Wireless Mesh Networks

paper_content:

AbstractWireless mesh networks is a new emerging field with its potential applications in extremely unpredictable and dynamic environments. However, it is particularly vulnerable due to its features of open medium, dynamic changing topology, and cooperative routing algorithms. The article surveys the state of the art in security for wireless mesh networks. First, we analyze various possible threats to security in wireless mesh networks. Second, we introduce some representative solutions to these threats, including solutions to the problems of key management, secure network routing, and intrusion detection. We also provide a comparison and discussion of their respective merits and drawbacks, and propose some improvements for these drawbacks. Finally, we also discuss the remaining challenges in the area.
---
paper_title: Routing security in wireless ad hoc networks

paper_content:

A mobile ad hoc network consists of a collection of wireless mobile nodes that are capable of communicating with each other without the use of a network infrastructure or any centralized administration. MANET is an emerging research area with practical applications. However, wireless MANET is particularly vulnerable due to its fundamental characteristics, such as open medium, dynamic topology, distributed cooperation, and constrained capability. Routing plays an important role in the security of the entire network. In general, routing security in wireless MANETs appears to be a problem that is not trivial to solve. In this article we study the routing security issues of MANETs, and analyze in detail one type of attack-the "black hole" problem-that can easily be employed against the MANETs. We also propose a solution for the black hole problem for ad hoc on-demand distance vector routing protocol.
---
paper_title: Cost-sensitive intrusion responses for mobile ad hoc networks

paper_content:

This paper addresses how to perform cost-sensitive responses to routing attacks on Mobile Ad Hoc Networks (MANET). There have been numerous research efforts on securing MANET protocols using cryptography or intrusion detection techniques. However, few writings have addressed MANET intrusion response. Most research on automated response for wired networks focuses on how to select the best response action to improve the security posture and availability of the system in a cost effective manner. We borrow this cost sensitive concept and develop a cost model for MANET. Two indices, Topology Dependency Index (TDI) and Attack Damage Index (ADI), are developed to reflect the response cost and attack damage, respectively. TDI measures the positional relationship between nodes and the attacker and ADI represents the routing damage caused by the attacker. Response cost, routing damage brought by the isolation response, can be calculated from TDI. Comparing TDI with ADI helps the response agents ("RA") to perform Adaptive Isolation while maintaining good network throughput. The simulation results show that launching adaptive isolations according to the comparison of TDI and ADI gives better network throughput than direct isolation. Therefore, the main contribution of our solution is to keep network connectivity when launching isolation responses and to do so such that good quality of network routing services is maintained.
---
paper_title: SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks

paper_content:

An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vector approaches, they have generally assumed a trusted environment. We design and evaluate the Secure Efficient Ad hoc Distance vector routing protocol (SEAD), a secure ad hoc network routing protocol based on the design of the Destination-Sequenced Distance-Vector routing protocol (DSDV). In order to support use with nodes of limited CPU processing capability, and to guard against denial-of-service (DoS) attacks in which an attacker attempts to cause other nodes to consume excess network bandwidth or processing time, we use efficient one-way hash functions and do not use asymmetric cryptographic operations in the protocol. SEAD performs well over the range of scenarios we tested, and is robust against multiple uncoordinated attackers creating incorrect routing state in any other node, even in spite of any active attackers or compromised nodes in the network.
---
paper_title: Ariadne: a secure on-demand routing protocol for ad hoc networks

paper_content:

An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents a large number of types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.
---
paper_title: Secure Routing Protocol for Ad hoc Networks

paper_content:

To provide an effective method for verifying security of secure dynamic source routing(DSR) protocols,a sufficient-and-necessary condition against active-1-y(y≥1) adversary for secure DSR protocols is proposed.Then a new secure DSR protocol,named effective secure DSR(ESDSR),which is proved to meet this sufficient-and-necessary condition is presented.Compared with the existing secure DSR protocols,the proposed protocol ESDSR can not only defend against active-1-y adversary,but also consume less resource.
---
paper_title: The Optimized Link State Routing Protocol Evaluation through Experiments and Simulation

paper_content:

In this paper, we describe the Optimized Link State Routing Protocol (OLSR) [1] for Mobile Ad-hoc NETworks (MANETs) and the evaluation of this protocol through experiments and simulations. In particular, we emphasize the practical tests and intensive simulations, which have been used in guiding and evaluating the design of the protocol, and which have been a key to identifying both problems and solutions. OLSR is a proactive link-state routing protocol, employing periodic message exchange for updating topological information in each node in the network. I.e. topological information is flooded to all nodes in the network. Conceptually, OLSR contains three elements: Mechanisms for neighbor sensing based on periodic exchange of HELLO messages within a node’s neighborhood. Generic mechanisms for efficient flooding of control traffic into the network employing the concept of multipoint relays (MPRs) [5] for a significant reduction of duplicate retransmissions during the flooding process. And a specification of a set of control-messages providing each node with sufficient topological information to be able to compute an optimal route to each destination in the network using any shortest-path algorithm. Experimental work, running a test-network of laptops with IEEE 802.11 wireless cards, revealed interesting properties. While the protocol, as originally specified, works quite well, it was found, that enforcing “jitter” on the interval between the periodic exchange of control messages in OLSR and piggybacking said control messages into a single packet, significantly reduced the number of messages lost due to collisions. It was also observed, that under certain conditions a “naive” neighbor sensing mechanism was insufficient: a bad link between two nodes (e.g. when two nodes are on the edge of radio range) might on occasion transmit a HELLO message in both directions (hence enabling the link for routing), while not being able to sustain continuous traffic. This would result in “route-flapping” and temporary loss of connectivity. With the experimental results as basis, we have been deploying simulations to reveal the impact of the various algorithmic improvements, described above.
---
paper_title: An effective intrusion detection approach for OLSR MANET protocol

paper_content:

The optimized link state routing (OLSR) protocol is a proactive mobile ad hoc network (MANET) routing protocol. Security aspects have not been designed into the OLSR protocol and therefore make it vulnerable to various kinds of attacks. Recent research efforts have focused on providing authentication and encryption techniques to secure the OLSR protocol against attacks from outside intruders. A second line of defense is required to provide intrusion detection and response techniques in protecting the OLSR protocol against attacks from inside intruders. In this paper, we describe security threats to the OLSR MANET routing protocol and present an intrusion detection solution based on protocol semantics checking. Our approach is based on semantic properties that are implied in the protocol definition and specify the correct OLSR routing update behavior. Conflict checking based on semantic properties is applied in every MANET node. Any abnormal protocol semantics triggers an intrusion alarm. While we use OLSR as an example, we argue that the presented approach can be applied to any multi-point relay (MPR) proactive MANET protocol.
---
paper_title: Routing security in wireless ad hoc networks

paper_content:

A mobile ad hoc network consists of a collection of wireless mobile nodes that are capable of communicating with each other without the use of a network infrastructure or any centralized administration. MANET is an emerging research area with practical applications. However, wireless MANET is particularly vulnerable due to its fundamental characteristics, such as open medium, dynamic topology, distributed cooperation, and constrained capability. Routing plays an important role in the security of the entire network. In general, routing security in wireless MANETs appears to be a problem that is not trivial to solve. In this article we study the routing security issues of MANETs, and analyze in detail one type of attack-the "black hole" problem-that can easily be employed against the MANETs. We also propose a solution for the black hole problem for ad hoc on-demand distance vector routing protocol.
---
paper_title: A Collusion Attack Against OLSR-based Mobile Ad Hoc Networks

paper_content:

Rapid advances in wireless networking technologies have made it possible to construct a Mobile Ad hoc Network (MANET) which can be applied in infrastructureless situations. However, due to their inherent characteristics, MANETs are vulnerable to various kinds of attacks which aim at disrupting their routing operations. To develop a strong security scheme to protect against these attacks it is necessary to understand the possible form of attacks that may be launched. Recently, researchers have proposed and investigated several possible attacks against MANET. However, there are still unanticipated or sophisticated attacks that have not been well studied. In this paper, we present a collusion attack model against Optimized Link State Routing (OLSR) protocol which is one of the four standard routing protocols for MANETs. After analyzed the attack in detail and demonstrated the feasibility of the attack through simulations, we present a technique to detect the attack by utilizing information of two hops neighbors.
---
paper_title: A study of a routing attack in OLSR-based mobile ad hoc networks

paper_content:

A mobile ad hoc network (MANET) is a collection of mobile nodes which are able to communicate with each other without relying on predefined infrastructures or central administration. Due to their flexibilities and easy deployment, MANET can be applied in situation where network infrastructures are not available. However, due to their unique characteristics such as open medium and the lack of central administration, they are much more vulnerable to malicious attacks than a conventional infrastructured wireless network. MANET employs routing to provide connectivity for mobile nodes that are not within direct wireless transmission range. Existing routing protocols in MANET assume a trusted and cooperative environment. However, in hostile environment, mobile nodes are susceptible to various kinds of routing attacks. In this paper, we show that an OLSR MANET node is prone to be isolated by malicious attack called Node Isolation attack. After analysing the attack in detail, we present a technique to mitigate the impact of the attack and improve the performance of the network when the attack is launched. The results of our implementations illustrate that the proposed solution can mitigate the attack efficiently. Copyright © 2007 John Wiley & Sons, Ltd.
---
paper_title: DEMEM : Distributed evidence-driven message exchange intrusion detection model for MANET

paper_content:

A Mobile Ad Hoc Network (MANET) is a distributed communication platform for mobile wireless nodes. Because of the lack of a centralized monitoring point, intrusion detection systems (IDS) for MANET are usually developed using a distributed architecture where detectors are deployed at each node to cooperatively detect attacks. However, most of these distributed IDS simply assume that each detector exchanges complete information with their peers instead of establishing an efficient message exchanging protocol among detectors. We propose a Distributed Evidence-driven Message Exchanging intrusion detection Model (DEMEM) for MANET that allows the distributed detector to cooperatively detect routing attacks with minimal communication overhead. The framework allows detectors to exchange evidences only when necessary. Under a few practical assumptions, we implement DEMEM to detect routing attacks the Optimal Link State Routing (OLSR) protocol. The example scenarios and performance metrics in the experiment demonstrate that DEMEM can detect routing attacks with low message overhead and delay, no false negatives, and very low false positives under various mobility conditions with message lost. Our ongoing works include implementing DEMEM in AODV, DSR and TBRPF, and a reputation-based cooperative intrusion response model.
---

Title: A Survey on Attacks and Defense Metrics of Routing Mechanism in Mobile Ad hoc Networks

Section 1: INTRODUCTION
Description 1: Introduce the background and importance of Mobile Ad hoc Networks (MANETs) and outline the paper's objectives in discussing ad hoc routing security.

Section 2: ROUTING PROTOCOLS IN MANETS
Description 2: Discuss various routing protocols in MANETs, categorized into proactive, reactive, and hybrid protocols.

Section 3: TYPES OF SECURITY ATTACKS
Description 3: Explain the different types of security attacks in MANETs, including passive and active attacks, along with their subtypes.

Section 4: TYPES OF ROUTING ATTACKS AND DEFENSE METRICS ON MANET
Description 4: Describe the specific routing attacks and the corresponding defense metrics employed to mitigate them.

Section 5: RELATED WORK
Description 5: Review the related work and studies on routing protocols and security attacks in MANETs.

Section 6: CONCLUSION
Description 6: Summarize the key findings and insights presented in the paper and suggest future research directions for enhancing MANET security.