Security challenges in mobile ad hoc networks:a survey <s> Worm Hole Attack: <s> We have implemented a fully-functional wormhole attack in an IPv6 802.11b wireless Mobile Ad Hoc Network (MANET) test bed running a proactive routing protocol. Using customised analysis tools we study the traffic collected from the MANET at three different stages: i) regular operation, ii) with a "benign" wormhole joining distant parts of the network, and iii) under stress from wormhole attackers who control a link in the MANET and drop packets at random. Our focus is on detecting anomalous behaviour using timing analysis of routing traffic within the network. We first show how to identify intruders based on the protocol irregularities that their presence creates once they begin to drop traffic. More significantly, we go on to demonstrate that the mere existence of the wormhole itself can be identified, before the intruders begin the packet-dropping phase of the attack, by applying simple signal-processing techniques to the arrival times of the routing management traffic. This is done by relying on a property of proactive routing protocols? that the stations must exchange management information on a specified, periodic basis. This exchange creates identifiable traffic patterns and an intrinsic "valid station" fingerprint that can be used for intrusion detection. <s> BIB001 </s> Security challenges in mobile ad hoc networks:a survey <s> Worm Hole Attack: <s> To secure a mobile ad hoc network (MANET) in adversarial environments, a particularly challenging problem is how to feasibly detect and defend possible attacks on routing protocols, particularly internal attacks, such as a Byzantine attack. In this paper, we propose a novel algorithm that detects internal attacks by using both message and route redundancy during route discovery. The route-discovery messages are protected by pairwise secret keys between a source and destination and some intermediate nodes along a route established by using public key cryptographic mechanisms. We also propose an optimal routing algorithm with routing metric combining both requirements on a node's trustworthiness and performance. A node builds up the trustworthiness on its neighboring nodes based on its observations on the behaviors of the neighbor nodes. Both of the proposed algorithms can be integrated into existing routing protocols for MANETs, such as ad hoc on-demand distance vector routing (AODV) and dynamic source routing (DSR). As an example, we present such an integrated protocol called secure routing against collusion (SRAC), in which a node makes a routing decision based on its trust of its neighboring nodes and the performance provided by them. The simulation results have demonstrated the significant advantages of the proposed attack detection and routing algorithm over some known protocols. <s> BIB002 </s> Security challenges in mobile ad hoc networks:a survey <s> Worm Hole Attack: <s> The increasing popularity and usage of wireless technology is creating a need for more secure wireless networks. Wireless networks are particularly vulnerable to a powerful attack known as the wormhole attack. An attacker records packets at one location in the network and tunnels them to another location. Routing can be disrupted when routing control messages are tunneled. This tunnel between two colluding attackers is referred as a wormhole. Wormhole attacks are severe threats to MANET routing protocols. For example, when a wormhole attack is used against an on-demand routing protocol such as DSR or AODV, the attack could prevent the discovery of any routes other than through the wormhole. This project designed and developed a new protocol that prevents wormhole attacks on wireless networks. The design of this protocol is based on the use of asymmetric and symmetric key cryptography and a Global Positioning System (GPS). It was evaluated using simulations under realistic ad-hoc network settings. The simulations identified the strengths and weaknesses of this protocol under different distributions of GPS and non-GPS nodes, network areas and network structures. Within a set of requirements and assumptions, this wireless security protocol can detect nearly half of wormhole attacks by relying on each node's relative location. <s> BIB003 </s> Security challenges in mobile ad hoc networks:a survey <s> Worm Hole Attack: <s> The advancement in wireless technologies and the high availability of wireless equipment in everyday devices is a factor in the success of infrastructure-less networks. MANETs are becoming more and more common due to their ease of deployment. The high availability of such networks and the lack in security measures of their routing protocols are alluring a number of attackers to intrude. A particular type of DoS attack; known as Wormhole is the topic of discussion in this paper. A number of solutions have been proposed catering a wide range of possibilities for detection and prevention of wormholes. Literature review shows that the paths in the routing table have not been used for the detection of the wormhole attack; with a little modification to the structure of the routing table we can be able to detect suspicious links. In this paper we have proposed the use of the modified routing table for detection of the suspicious links, confirmation of wormhole existence, at the end isolating the confirmed wormhole nodes. The approach has been applied to DSDV and the detection of self-sufficient wormhole nodes and attacks. Our future work will involve the use of our own approach for detection and prevention of wormhole attacks in other protocols as well as comparison the technique with other techniques present in literature. <s> BIB004 </s> Security challenges in mobile ad hoc networks:a survey <s> Worm Hole Attack: <s> MANETs are collection of mobile hosts which are self-configurable. Nodes in MANET communicate with each other through wireless channels with no centralized control. MANET nodes rely on multi-hop communication. Security in MANETs is always a very big issue. There are many attacks in MANET due to which the legitimacy of a network is compromised. Many approaches already existed to address these security issues. In this paper an algorithm was proposed for data transmission by using RSA algorithm for authentication purpose, and a blacklist to prevent sending data packets to those nodes which are malicious. Because of this data security is improved. The proposed routing algorithm is more secure as compared to AODV routing algorithm. The performance is analyzed on the basis of various performance metrics like Packets Received and Network Routing Overhead in the network by using the NS2 Simulator. <s> BIB005
In worm hole attack, malicious node records packets at one location of the network and tunnels them to another location BIB001 . Fault routing information could disrupt routes in network BIB003 . Authors in BIB004 presented a way to secure MANET against this attack by using encryption and node location information. But as mentioned before, key distribution is a challenge in MANET. Byzantine attack: In this attack, malicious node injects fault routing information to the network, in order to locate packets into a loop BIB002  . One way to protect network against this attack is using authentication. Authors in BIB005 presented a mechanism to defeat against this attack using RSA authentication.