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 ondemand 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 many types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.

 Friend

based Ad hoc routing using Challenges to Establish Security (FACES) is an algorithm to provide secure routing in ad hoc mobile networks. This scheme has been drawn from a network of friends in real life scenarios. The algorithm works by sending challenges and sharing friend Lists to provide a list of trusted nodes to the source node through which data transmission finally takes place.

The nodes in the friend list are rated on the basis of the amount of data transmission they accomplish and their friendship with other nodes in the network. The account of friendship of a node with other nodes in the network is obtained through the Share Your Friends process which is a periodic event in the network. The result of this scheme of operation, the network is able to effectively isolate the malicious nodes which are left with no role to play in the ad hoc network. No proper security provided. cryptography is used for high security, the hackers can hack the data of single letter encryption. Time Delay is high.

In this paper, we make two contributions to the area of secure routing protocols for ad hoc networks. First, we give a model for the types of attacks possible in such a system, and we describe several new attacks on ad hoc network routing protocols. Second, we present the design and performance evaluation of a new ondemand secure ad hoc network routing protocol, called Ariadne, that withstands node compromise and relies only on highly efficient symmetric cryptography. Relative to previous work in securing ad hoc network routing protocols, Ariadne is more secure, more efficient, or more general (e.g., Ariadne does not require trusted hardware and does not require powerful processors). Our goal is to design simple and efficient mechanisms achieving high attack robustness. High security is maintained due to the encryption in every word using this Ariadne Protocol method with eavesdropping.

Hardware Requirements PROCESSOR : RAM : MONITOR : HARD DISK : FLOPPY DRIVE : CD DRIVE : KEYBOARD : MOUSE :

PENTIUM III 866 MHz 128 MD SD RAM 15 COLOR 20 GB 1.44 MB LG 52X STANDARD 102 KEYS 3 BUTTONS

Software Requirements Operating system : Windows XP Professional Environment : Visual Studio .NET 2008/2005 .NET framework : Version 3.5 Language : C#.NET Backend : SQL SERVER 2005

Data payload processing Graph Analysis Transmit packet Generator function Packet Loss

The multiple routes that have been discovered from source node to a destination node using MTMR algorithm and there corresponding Route Discovery time as well. The user is also entering the data payload that has to be sent from source node to destination node.

The route discovery time taken from source to destination for all the three algorithms. It is observed from the graph that the route discovery time for the MTMR algorithm is least.

Packet Formed using the Triple Des Encryption for the data fragments. These data fragments would be sent over multiple independent routes from source node to destination node. DMR will select best four routes which is having a less route discovery time.

Here trust levels are generated randomly using random generator function. If the route contains the malicious node then the trust level of the node is decremented otherwise the trust levels of all the nodes in the best route will be incremented by 1.

Routing algorithms namely DMR, TMR and MTMR have their own way in order to establish the trust and transmit packet securely. But message trust based multipath routing protocol proved to be best in terms of number of malicious nodes detected, number of hops, route discovery time and packet loss