FACES:

FRIEND BASED ADHOC ROUTING USING CHALLENGES TO

ESTABLISH SECURITY IN MANET SYSTEMS

Presented by:Nandhitha.M

Under the guidance of:Mrs. Suma. R

Associate profesor and Hod Dept of Computer Science and Engineering

CONTENTS Objective Abstract Introduction Problem definition Literature survey Proposed System Advantges and 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 is based on trust establishment of friends for secure routing in ad-hoc networks.

Friend rating scheme is a continuous process. Authentication of nodes by posing challenges.

ABSTRACT Uses Challenges to establish security is an algorithm

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

MANETS Collection of mobile nodes forming a temporary

network

No centralized administration or standard support services

Each Host is an independent router

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.

Intruder is not detected

Active attacks: Intruder can affect the communication by modifying the data, misleading the nodes in the network.

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

PROPOSED SYSTEM FACES algorithm divided into 4 stages

  Challenge Your Neighbour

Rate Friends periodic

Share Friends

Route Through Friends - on Demand

Establishment of friend networks in MANET

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 pubic 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 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 behaviour, 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.

ADVANTAGES & LIMITATIONS

Challenge based authentication helps to isolate malicious node with ease

Continuous rating of friends helps to secure networks which are dynamic

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 as a feedback mechanism will help increase 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 inMANETs 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 pathtransmission 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 networksusing soft encryption and trust based multipath routing,”Sci. Direct Comput. Commun., vol. 31,pp. 760– 769, 2008.

[5] S. K. Dhurandher and V. Mehra,“Multi-path and message trust-based secure routing in ad hocnetworks,” in Proc. Int. Conf. Advances in Computing, Control and TelecommunicationTechnologies (ACT 2009), Trivandrum, India, Dec. 28  –  29, 2009, pp. 189 – 194.

ANYQuestions?