A survey of survivability in mobile ad hoc networks <s> A. Route discovery <s> 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. <s> BIB001 </s> A survey of survivability in mobile ad hoc networks <s> A. Route discovery <s> This article gives an overview of different approaches to provide security features to routing protocols in mobile ad hoc networks (MANET). It also describes Secure AODV (an extension to AODV that provides security features) giving a summary of its operation and talking about future enhancements to the protocol. <s> BIB002 </s> A survey of survivability in mobile ad hoc networks <s> A. Route discovery <s> To date, most solutions proposed for secure routing in mobile ad-hoc networks (MANETs), assume that secure associations between pairs of nodes can be established on-line; e.g., by a trusted third party, by distributed trust establishment. However, establishing such security associations, with or without trusted third parties, requires reliance on routing layer security. In this paper, we eliminate this apparent cyclic dependency between security services and secure routing in MANETs and show how to bootstrap security for the routing layer. We use the notion of statistically unique and cryptographically verifiable (SUCV) identifiers to implement a secure binding between IP addresses and keys that is independent of any trusted security service. We illustrate our solution with the dynamic source routing (DSR) protocol and compare it with other solutions for secure routing. <s> BIB003 </s> A survey of survivability in mobile ad hoc networks <s> A. Route discovery <s> Architecture Technology Corporation (ATC) has developed a new approach for building intrusion resistant ad hoc networks called TIARA (Techniques for Intrusion-Resistant Ad Hoc Routing Algorithms). The approach, developed with funding from DARPA's Fault Tolerant Networks program, relies on extending the capabilities of existing ad hoc routing algorithms to handle intruders without modifying these algorithms. TIARA implements new network layer survivability mechanisms for detecting and recovering from intruder induced malicious faults that work in concert with existing ad hoc routing algorithms and augment their capabilities. The TIARA implementation architecture is designed to allow these survivability mechanisms to be "plugged" into existing wireless routers with little effort. <s> BIB004 </s> A survey of survivability in mobile ad hoc networks <s> A. Route discovery <s> Buttyan L.et al.found out a security flaw in Aridane and proposed a secure routing protocol,EndairA, which can resist attacks of active-1-1 according to ref[9].But unfortunately we discover an as yet unknown active-0-1 attack,"man-in-the-middle attack",which EndairA can't resist.So we propose a new secure routing protocol,En- dairALoc.Analysis shows that EndairALoc can not only inherit security of EndairA,but also resist"man-in-the-mid- dle attack"and even wormhole attack.Furthermore EndairALoc uses pairwise secret keys instead of public keys Endai- rA used,so compared with EndairA,EndairALoc can save more energy in the process of routing establishment. <s> BIB005 </s> A survey of survivability in mobile ad hoc networks <s> A. Route discovery <s> Current algorithms for distributed applications, such as the wireless GRID, for wireless ad hoc networks (WAHN) contain a few mechanisms for providing robust/tolerant network operation in the face of security attacks launched on the network by intruders. One approach to address thus issue is to design these applications for WAHNs in a way that they can handle intruder-induced malicious faults. However, this presents several drawbacks, including the considerable investment that it can induce. We present a new approach for building intrusion tolerant WAHN. The approach relies on extending the capabilities of existing applications to handle intruders without modifying their structure. We describe a new network mechanism for resource allocation using capabilities for detecting and recovering from intruder induced malicious faults. We also present a wireless router component that allows these mechanisms to be added to existing wireless nodes. <s> BIB006
Routing is essential for the correct operation of MANETs, and many routing protocols have been proposed in the literature, including proactive (table-driven), reactive (demanddriven), and hybrid solutions. Most of the existing protocols have assumed MANETs as a trust environment. However, as shown in previous sections, MANETs are highly vulnerable to attacks due to their characteristics. Secure routing protocols have been proposed BIB001 ,  , BIB003 , such as SRP BIB005 , SAODV BIB002 , SAR  . These secure protocols are mostly based on authentication and encryption algorithms, being inefficient to put all intruders and attacks off. In this way, some research groups have built intrusion tolerant routing approaches, such as TIARA (Techniques for Intrusion-resistant Ad Hoc Routing Algorithms) BIB004 , BFTR (Best-Effort Fault Tolerant Routing)  , ODSBR (An OnDemand Secure Byzantine Routing Protocol)  and BA (Boudriga's Approach) BIB006 . In the FLAC technique, distributed wireless firewall and a limited resource allocation are applied together to control packet flows and to prevent attacks based on resource overload. Each node participating in the ad hoc network contains an access control list, where authorized flows are defined. A threshold is defined for allocating limited amount of network resources for a given flow. Many routes are discovered and maintained, but only one route is chosen to data forwarding.