Multiple-Path Routing Using Portfolio

Selectionfor Congestion

Avoidance

Presented By, Biruntha.T (50808104006) Keerthiga.T.S (50808104028) Lilly Sara.A (50808104037) Mahalakshmi.N (50808104038)

Guided By,M.Nalini ,ME(CSE)

AgendaAgendaAbstractExisting SystemProposed SystemAlgorithmSystem ArchitectureSystem RequirementsModulesScreen shotsConclusionFuture EnhancementReference Papers

AbstractThe jammer controls the probability of jamming

and the transmission range.The jammer action ceases when it is detected by

the network, and a notification message is transferred out of the jammed region.

The network defends itself by computing the channel access probability to minimize the jamming detection plus notification time.

Existing SystemExisting System

Need prompt response.Network Intrusion Detection Systems (NIDS)

attempt to detect such behavior and flag these port scanners as malicious.

The sooner a NIDS detects malice, the lower the resulting damage.

DisadvantageDisadvantage

Disturb wireless communications Smaller number of connection Outsider / Insider Time Delay

Proposed SystemProposed SystemJamming attacks that are easy to launch but are

difficult to detect and confront, since they differ from brute force attacks.

To cause maximal damage to the network in terms of corrupted communication links.

jammer action ceases when it is detected by one or more monitoring nodes, and a notification message is transferred out of the jamming region

AdvantageAdvantage

Easy to launch Notification message is transferredCapture the attacker

Literature SurveyLiterature Survey1.Jamming Sensor Networks Attack and Defense

Strategies.

2.JAM: A Jammed-Area Mapping Service for Sensor Networks.

3.Denial Of Service in Sensor Networks.

4.Attacks and Network Defense Policies in Wireless Sensor Networks.

5.Denial Of Service in Wireless Sensor Networks:Attacks and Defences

AlgorithmHeuristic algorithm for an efficient jamming

strategy. 1.INSERT(initial-node, FRINGE)

2.Repeat: If FRINGE is empty then return failuren REMOVE (FRINGE)S STATE(n) IF GOAL(s) then return path or goal state For every state s in SUCCESSOR(s)

Create a node ‘n’

INSERT(n,FRINGE)

System ArchitectureSystem ArchitectureClient

A

Client B

Client C

Server

Monitoring the traffic

Algorithm

Node capturing attack

Data communication

processing

System RequirementsSystem RequirementsHARDWARE REQUIREMENTS:Hard Disk : 40 GB.System : Pentium IV 2.4 GHz.Floppy Drive : 1.44 Mb.Monitor : 15 VGA Colour.Mouse : Logitech.RAM : 256 Mb.

SOFTWARE REQUIREMENTS:Operating system : - Windows XP Professional.Coding Language: - Java.Tool Used : - Eclipse.

  ModulesModules1. Network module

2. Channel Access module

3. Control Message Access module

4. Control Channel Jamming module

5. Port Number Assignment

Modules DescriptionModules Description

1. Network module

Partitions tasks or workloads between service providers (servers) and service requesters, called clients.

Server machine is running one or more server programs which share its resources with clients

2. Channel Access module

Maintaining a degree of independence between the hopping sequences held by different users.

Designing schemes which are robust to control channel jamming attacks by malicious colluding insiders or compromised users.

3. Control Message Access module

Providing probabilistic availability of control messages using random key assignment.

We develop a correspondence between the problems of key establishment and control channel access in wireless networks and develop a framework

4. Control Channel Jamming module 

Channel access protocol can perform a DoS attack. Access protocol uses a fixed predetermined schedule for data and control messages

A control channel jamming attack focusing only on the control channels

5. Port Number Assignment

The monitor checks if the node is having any process running or any attacker has attached the node.

Monitor assigns a port number for the node which is connected and the transmission is done.

SnapshotsSnapshots: Giving: Giving InputsInputs

Nodes MonitoringNodes Monitoring

Sending Data From Sending Data From Node1 to Node2 in Node1 to Node2 in Normal modeNormal mode

Showing Notification Showing Notification MessageMessage

Sending File from Sending File from Node1 to Node2Node1 to Node2

Shows Received DataShows Received Data

SendingSending Data from Data from node3 to node2 in node3 to node2 in Attacker ModeAttacker Mode

Original Data is Original Data is ReceivedReceived

Raw dataRaw data

ConclusionConclusionData’s can be transmitted from Source to

Destination successfully.(Client_Server communication)

Congestion can be avoided based up on the Empirical Statistics method..

Future EnhancementFuture EnhancementThe network aims at alleviating the effect of the

attack and exposing the attacker to detection. Jamming and defending strategies under these

composite channel access protocols are left as a future research direction.

Payoff functions will likely result in different optimal jamming and anti jamming strategies.

Back-off and contention window adaptation are used to regulate the amount of transmitted traffic.

Reference PapersReference Papers M. Li, I. Koutsopoulos, and R. Poovendran, “Optimal

JammingAttacks and Defense Policies in Wireless Sensor Networks,” Proc.IEEE INFOCOM, 2007.

A.D. Wood and J.A. Stankovic, “Denial of Service in Sensor Networks,” Computer, vol. 35, no. 10, pp. 54-62, Oct 2002.

W. Xu, K. Ma, W. Trappe, and Y. Zhang, “Jamming sensor networks:Attack and defense strategies,” IEEE Network, vol. 20, no. 3, pp. 41–47,May/Jun. 2006.

R. Negi and A. Perrig, “Jamming Analysis of MAC Protocols,”Carnegie Mellon Technical Memo, 2003.

ContinuedContinued J.M. McCune, E. Shi, A. Perrig, and M.K. Reiter,

“Detection ofDenial-of-Message Attacks on Sensor Network Broadcasts,” Proc.IEEE Symp. Security and Privacy, 2005.

R. Mallik, R. Scholtz, and G. Papavassilopoulos, “Analysis of an On-Off Jamming Situation as a Dynamic Game,” IEEE Trans.Comm., vol. 48, no. 8, pp. 1360-1373, Aug. 2000.

G. Lin and G. Noubir, “On Link-Layer Denial of Service in DataWireless LANs,” Wiley J. Wireless Comm. and Mobile Computing,vol. 5, no. 3, pp. 273-284, May 2005.

Thank You!Thank You!

Queries..?&