YOU ARE DOWNLOADING DOCUMENT

Please tick the box to continue:

Transcript
Page 1: Manet

Detection of Routing Misbehavior in MANETs

Prepared by:

Batch 03

Anusha B

C.M.Sateesh Kumar M

N.V.S.D.Jagadish Kumar M

Coordinated By:

Md Mir Khasim

Guided BY:

K Shirin Bhanu

Page 2: Manet

Contents Abstract

Introduction

Objectives

Routing Misbehavior

Existing System

Proposed System

How to work

Design

Features

Algorithm

Conclusion

Page 3: Manet

Abstract In general, routing protocols for MANETs are designed based on the assumption that all participating nodes are fully cooperative.

However, due to the open structure and scarcely available battery- based energy, node misbehaviors may exist.

One such routing misbehavior is that some selfish nodes will participate in the route discovery and maintenance processes but refuse to forward data packets.

We propose the2ACK scheme that serves as an add-on technique for routing schemes to detect routing misbehavior and to mitigate their adverse effect.

Page 4: Manet

Introduction Mobile Ad Hoc Network (MANET) is a collection of mobile nodes (hosts) which communicate with each other via wireless links either directly or relying on other nodes as routers.

The operation of MANETs does not depend on preexisting infrastructure or base stations.

All network activities, such as discovering the topology and delivering data packets, have to be executed by the nodes themselves, either individually or collectively.

Depending on its application, the structure of a MANET may vary from a small static network that is highly power-constrained to a large-scale, mobile, highly dynamic network.

Page 5: Manet

Objectives

The main aim of the system is detection of routing misbehavior in a complex large scale heterogeneous mobile dynamic network in transmitting data packets from source to destination

It also aims to detect misbehavior of routing more efficiently, accurately and fastly.

It implements 2ACK scheme in order to detect the misbehavior, in which two hop acknowledgement packets are transmitted in the opposite direction of the routing path.

It also reduces the routing overhead in the process of acknowledgement by acknowledging only fraction of data packet.

Page 6: Manet

Routing Misbehavior

An individual mobile node may attempt to benefit from other nodes, but refuse to share its own resources.

A selfish node may refuse to forward data packets for other nodes in order to conserve its own energy

This misbehavior degrades the performance of the network.

Page 7: Manet

Existing System Our system is implemented as an add on technique to the DSR protocol.

In this a selfish node does not perform the packet forwarding function.

DSR involves two phases route discovery and route maintenance .

If it involves any misbehavior nodes then it tries to include another route or starts new discovery for route which in turn includes misbehavior nodes that leads to performance degradation.

Then in order to eliminate such degradation of performance we introduce a new model with 2ACK scheme.

Page 8: Manet

Proposed System

Our proposed system is mainly based on 2ACK scheme to detect misbehavior.

In this scheme the acknowledgement is sent back to sender node.

Page 9: Manet

How to work ?

In the above scenario we observe the Cmis, Cpkt and Rmis values and calculate the Cmis/Cpkts ratio and compare with the Rmis value.

If the ratio is greater than Rmis then that link is declared as misbehaior link and sends out report.

Later when a node starts its own data traffic it will avoid using such misbehaving links.

Page 10: Manet

Design

Page 11: Manet

Use Case Model

TCP connection UDP connection

Route discovery

Route maintenance

Establish n/w connection

Sharing resources

Compute routing tables

Send pkt

Receive pkt

send and receive ack

Destination node

Authenticating pkts

Partial data forwarding

Source node

Detect misbehavior

Intermediate node

Buffering

Page 12: Manet

Sequence Diagram for Connection Establishment

s:Source n:Network i:IntermediateNode

d:Destination

request to establish connection to intermediate node

connection to destination node

change connection

disconnectdisconnect

Page 13: Manet

Sequence diagram for data transmission

s:Source n:Network i:IntremediateNode

d:destination a:Acknowledgement

1.request for network 2.connecting to intermediate

3.connecting to

4.send data packet 5.forward packet

6.receive packet

7.req to generate ack

8.ack prepared9.send ack10.if no ack report to

source

Page 14: Manet

Sequence diagram for routing packets: 

s;Source r:Rroute i:IntermediateNode

d:Destinationn:Network

1.request for connection establishment2.route discovery

3.connect to intermediate

4.connect to destination

5.change route

6.update routing

7.change the connection

Page 15: Manet

Features of 2ACK The 2ACK scheme avoids the following:

Ambiguous Collisions Receiver Collisions Limited Transmission Power Limited Overhearing Range

Page 16: Manet

Authenticating 2ACK packets

One way to stop a node from forging the 2ACK packets is to use the digital signature algorithm.

A digital signature is a small number of extra bits of information attached by sender node.

One way hash chain was used to guard against security attacks.

Page 17: Manet

2ACK Packet Sender Side

1: publish hn 2: Cpkts <- 0, Cack <- 0, I <- n 3: while true do 4: if (data packet received) then 5: Cpkts ++ 6: if (Cack/Cpkts < Rack) then 7: prepare MAC with hi-1 8: prepare 2ACK with ID, MAC, hi 9: send 2ACK10: Cack ++, i - - 11: end12: end13: end

Algorithm

Page 18: Manet

Receiver Side

Parallel process 1 (receiving hn)

1: While true do 2: if receive hn from the 2ACK packet sender then 3: record hn, i <- n 4: end 5: end

Page 19: Manet

Parallel process 2 (receiving 2ACK packets) 6: while true do 7: randomly select Tstart > current time 8: while current time < Tstart do9: end10: LIST <- Ф, Cpkts <-0, Cmis <- 0 11: while current time < Tstart + Tobs do 12: if (data packet forwarded) then13: LIST <- LIST Ú data ID14: Cpkts ++ 15: setup timer (τ) for data ID16: end17: if (2ACK packet received) then

Page 20: Manet

18: search data ID carried by 2ACK from LIST19: if (found) then 20: check validity of hi21: LIST <- LIST - data ID 22: clear timer for ID23: end24: end25: if (timeout event happens) then 26: LIST <- LIST - data ID 27: Cmis ++28: end29: end30: if (Cmis/Cpkts > Rmis) then31: send link misbehavior report32: end33: end

Page 21: Manet

Home PageOutput Screens

Page 22: Manet
Page 23: Manet
Page 24: Manet
Page 25: Manet
Page 26: Manet
Page 27: Manet
Page 28: Manet
Page 29: Manet
Page 30: Manet

Conclusion

In this we have proposed and evaluated a technique termed 2ACK to detect and mitigate the effect of routing misbehavior.

The 2ACK technique is based on a simple 2 hop acknowledgement packet that is sent back by the receiver of the next hop link.

2ACK scheme maintains up to 91 percent packet delivery ratio even when there are 40 percent misbehaving nodes in the MANETs.

Page 31: Manet

Thank You

Page 32: Manet

QUERIES ?