Joby Thattil

Overview

Objective Abstract Introduction Problem definition Literature survey Comparison Proposed System Applications Limitations Future Work Conclusion References

Objective
The main purpose of this paper is to establish secure routing in

mobile ad hoc networks.

An effective de-centralised algorithm against malicious attacks FACES algorithm based on trust establishment of friends for

secure routing in ad-hoc networks.

Friend rating scheme as a continuous process. Authentication

of nodes by posing challenges.

Abstract
Friend based Ad hoc routing uses Challenges to establish security is an algorithm to provide secure routing in ad hoc mobile networks. The scheme proposed has been drawn from a network of friends in real life scenarios. The algorithm is divided into

four stages, viz. Challenge Your Neighbour, Rate Friends, Share Friends and Route
through Friends. One of the major advantages of this scheme is that the nodes do not need to promiscuously listen to the traffic passing through their neighbours. The information about the malicious nodes is gathered effectively by using Challenges, which reduces the overhead on networks.

Introduction
Mobile Ad Hoc Network (MANET)

Challenges in MANETs

Attacks in MANETs

Goals of any Secure Routing

MANET
Type of wireless ad hoc networks

Self-configuring infrastructure
less network of mobile devices connected by wireless links

No need for existing infrastructure

Typical MANET

Challenges in MANETs
Easier to Tap Limited Capacity Dynamic Nature

Susceptible to Attacks

Attacks in MANETs
Passive attacks

No change in data content

Active attacks

Intruder/attacker can affect the communication by modifying the data, misleading the nodes in the network.

Goals of any secure routing

Authentication Confidentiality

Integrity
Non repudiation Authorization

Problem Definition
MANETs are vulnerable to attacks because of their structure

less property.
Due to this dynamic topology they are prone to active and

passive attacks.
Prevention against these attacks, enabling secure routing is a

primary need in mobile Ad Hoc networks.

Literature Survey
DMR
Security enhancement through multiple path transmission in ad hoc networks
by T.Haniotakis, S. Tragoudas, and C. Kalapodas

TMR
Security in mobile ad-hoc networks using soft encryption and trust based multipath routing by P. Narula, S. K. Dhurandher, S. Misra, and I. Woungang

MTMR
Multi-path and message trust-based secure routing in ad hoc networks
by S. K. Dhurandher and V. Mehra

Comparison
Parameter for comparison Routing Message Disjoint Multipath Routing Multipath Message broken into 4 parts No check Trust based Multipath Routing Multipath Message broken into 4 parts No check Message Trust based Multipath Routing Depends on the trust of the message Depends on the trust of the message(not always broken) Cyclic Redundancy Check used

Checking employed

Encryption/Decryption
Reliability Route selection

XOR
Non trust used Route selection is difficult, as disjoint paths may not be always found Not available Non-promiscuous mode

XOR
Trust based Takes more time in route selection as it is trust based Not available Promiscuous mode

Cipher block chaining

Trust based Easier in route selection as mostly lesser paths may be needed for routing Available Promiscuous mode

Trust based updating Mode

Proposed System
FACES algorithm
o

Establishment of friend networks in MANET

 FACES algorithm is divided into 4 stages

Challenge Your Neighbor Rate Friends Share Friends Route Through Friends

periodic
-

on Demand

Stages

Challenge your neighbour

Each node incorporates its neighbours in UL initially Node A picks B &performs share friends stage B sends either its FL / UL A picks 1 node which it can reach on its own ,C

2 ways to reach C
A initiates challenge & encrypts with pub key of C (pub key of A) B forwards it to C, C decrypts, respond to challenge &encrypt with

pub key of A
C Computes c^d mod n and sends the result to the two paths. A receives result from 2 routes, compares & if same, add B to FL(A)

B challenges C Through E

Contd

Contd

Rate friends
Rated on scale of 0 to 10 Three classes of ratings for each node in FL

Data Rating (DR)

Friend Rating (FR)

Net Rating (NR)

Friend sharing stage

Periodic process Use control packet FREQ

After friend sharing, challenges are initiated for those nodes

which were not in FL.

If a node is already in the friend list the node updates its FL. After friend sharing , a node start data session/sit idle

Routing through friends

When a node wants to transmit data, it initiates Route

request message within the network also sends the no: of data packets
Source node Evaluates route reply messages from

networks with public key of destination

Routes data through best possible route & waits for an

acknowledgement of the no: of data packets received by destination

If no: of packets sent= received, then data rating of

nodes included in transmission will be increased

Contd..
If packets are dropped/no acknowledgement from destination,

source initiates sequential challenge

Result of sequential challenge ->misbehaving nodes(removed

from FL & added to QL )

If all nodes completes sequential challenge successfully ->

data loss due to unintended behavior, initiates packets from destination

On receiving packets, source evaluate

that packets loss occurred at which all nodes, decreases rating of those nodes

Application
Military communication devices or police communication

devices.
Bank communications across secure networks.

Limitations
Packet delivery ratio is less for less number of nodes. Multiple path discovery for friend rating is time consuming.

Future work
Comparison of FACES protocol with Aradine, ARAN can be

investigated to improve the performance.

An algorithm to increase packet sending ratio (lamda) as a

feedback mechanism will help increase to PDR.

Conclusion
Challenge based authentication helps to isolate malicious nodes

with ease.
Continuous rating of friends helps secure ad hoc mobile

networks which are dynamic.

References
[1] Sanjay K. Dhurandher, Mohammad S. Obaidat, Karan Verma, Pushkar Gupta, and Pravina Dhurandher,FACES: Friend-Based Ad Hoc Routing Using Challenges to Establish Security in MANETs Systems, ieee systems journal, vol. 5, no. 2, june 2011. [2] D. P. Agrawal and Q.-A. Zeng, Introduction to Wireless and Mobile Systems. Pacific Grove, CA: Brooks/Cole, Thomson, 2002. [3] T.Haniotakis, S. Tragoudas, and C. Kalapodas, Security enhancement through multiple path transmission in ad hoc networks, in 2004 IEEE Int. Conf. Communications, Jun. 2004, vol. 7, pp. 41874191. [4] P. Narula, S. K. Dhurandher, S. Misra, and I. Woungang, Security in mobile ad-hoc networks using soft encryption and trust basedmultipath routing, Sci. Direct Comput. Commun., vol. 31, pp. 760769, 2008. [5] S. K. Dhurandher and V. Mehra, Multi-path and message trust-based secure routing in ad hoc networks, in Proc. Int. Conf. Advances in Computing, Control and Telecommunication Technologies (ACT 2009), Trivandrum, India, Dec. 2829, 2009, pp. 189194.