faces o review

7/29/2019 Faces o Review

1/14


2/14

An ad hoc network is a group of wireless mobile computers

(or nodes), in which individual nodes cooperate byforwarding packets for each other to allow nodes tocommunicate beyond direct wireless transmission range.

Prior research in ad hoc networking has generally studiedthe routing problem in a non-adversarial setting, assuminga trusted environment. In this paper, we present attacksagainst routing in ad hoc networks, and we present thedesign and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne.

Ariadne prevents attackers or compromised nodes fromtampering with uncompromised routes consisting ofuncompromised nodes, and also prevents many types ofDenial-of-Service attacks. In addition, Ariadne is efficient,using only highly efficient symmetric cryptographicprimitives.


3/14

Friend based Ad hoc routing usingChallenges to Establish Security (FACES) is analgorithm to provide secure routing in adhoc mobile networks.This scheme has been drawn from a network of friends in real life scenarios. The algorithmworks by sending challenges and sharing

friend Lists to provide a list of trusted nodes tothe source node through which datatransmission finally takes place.


4/14

The nodes in the friend list are rated on the basis of theamount 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 Friendsprocess 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 leftwith 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.


5/14

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 on-demand secure ad hoc network routing protocol, called Ariadne, thatwithstands node compromise and relies only on highly efficient symmetriccryptography.Relative to previous work in securing ad hoc network routing protocols,

Ariadne is more secure, more efficient, or more general (e.g., Ariadnedoes not require trusted hardware and does not require powerful

processors).Our goal is to design simple and efficient mechanisms achieving highattack robustness.High security is maintained due to the encryption in every word using thisAriadne Protocol method with eavesdropping.


6/14

Hardware Requirements PROCESSOR : PENTIUM III 866 MHz

RAM : 128 MD SD RAMMONITOR : 15 COLOR HARD DISK : 20 GBFLOPPY DRIVE : 1.44 MBCD DRIVE : LG 52XKEYBOARD : STANDARD 102 KEYSMOUSE : 3 BUTTONS


7/14

Software Requirements Operating system : Windows XP

ProfessionalEnvironment : Visual Studio .NET2008/2005.NET framework : Version 3.5Language : C#.NETBackend : SQL SERVER2005


8/14


9/14

Data payload processingGraph Analysis

Transmit packet Generator function Packet Loss


10/14

The multiple routes that have beendiscovered from source node to a

destination node using MTMR algorithmand there corresponding RouteDiscovery time as well.The user is also entering the datapayload that has to be sent from sourcenode to destination node.


11/14

The route discovery time taken fromsource to destination for all the three

algorithms.It is observed from the graph that theroute discovery time for the MTMRalgorithm is least.


12/14

Packet Formed using the Triple DesEncryption for the data fragments.These data fragments would be sentover multiple independent routes fromsource node to destination node.DMR will select best four routes which ishaving a less route discovery time.


13/14

Here trust levels are generated randomlyusing random generator function.If the route contains the malicious node

then the trust level of the node isdecremented otherwise the trust levelsof all the nodes in the best route will be

incremented by 1.


14/14

Routing algorithms namely DMR, TMRand MTMR have their own way in order to establish the trust and transmit packetsecurely.But message trust based multipathrouting protocol proved to be best interms of number of malicious nodesdetected, number of hops, routediscovery time and packet loss

faces o review

Documents