Presented by Guillaume Marceau

21
Presented by Guillaume Marceau Using slides from Ivor Rodrigues Secure Routing in Wireless Secure Routing in Wireless Sensor Sensor Networks: Attacks and Networks: Attacks and Countermeasures Countermeasures by by Chris Karlof, David Chris Karlof, David Wagner Wagner

description

Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures by Chris Karlof , David Wagner. Presented by Guillaume Marceau. Using slides from Ivor Rodrigues. Directed diffusion. Data Centric Sensor Node don’t need global identity Application Specific - PowerPoint PPT Presentation

Transcript of Presented by Guillaume Marceau

Page 1: Presented by Guillaume Marceau

Presented by Guillaume Marceau

Using slides from Ivor Rodrigues

Secure Routing in Wireless Secure Routing in Wireless SensorSensor

Networks: Attacks andNetworks: Attacks andCountermeasuresCountermeasures

by by Chris Karlof, David WagnerChris Karlof, David Wagner

Page 2: Presented by Guillaume Marceau

Directed diffusion

•Data Centric

•Sensor Node don’t need global identity•Application Specific•Traditional Networks perform wide variety of tasks.•Sensor Networks are designed for specific task.•Data aggregation & caching.•Positive reinforcement increases the data rate of the responses while negative reinforcement decreases it.

Page 3: Presented by Guillaume Marceau

Directed diffusion Suppression Cloning Path Influence

Page 4: Presented by Guillaume Marceau

Selective Forwarding― Worming and Sybiling on directed diffusion WSN's

Page 5: Presented by Guillaume Marceau

GEAR and GPSR― GPSR: unbalanced energy consumption― GEAR: balanced energy consumption― GPSR: routing using same nodes around the

perimeter of a void― GEAR: weighs the remaining energy and distance

from the target― GPSR: Greedy routing to Base station― GEAR: distributed routing, energy and distance aware

routing.― Construct a topology on demand using localized

interactions and information without initiation of the base station

Page 6: Presented by Guillaume Marceau

Geographical Attacks and Attackers

― Forging fake nodes to try to plug itself into the data path.

Page 7: Presented by Guillaume Marceau

Geographical Attacks and Attackers

― GPSR.

Page 8: Presented by Guillaume Marceau

Minimum cost forwarding― Compute a distributed shortest-path

― Attacks― Very susceptible to sinkholes attacks

― Very easy to stage a HELLO flood

Page 9: Presented by Guillaume Marceau

LEACH: low-energy adaptive clustering hierarchy

― Assumes that transmission to the base station is always possible, but costly

― Aggregate motes into cluster. Rotate the cluster-head

― Attacks― HELLO flood― Sybil attack to impersonate all the cluster heads

Page 10: Presented by Guillaume Marceau

Rumor routing― Similar to the vehicular routing paper― Remembers the route taken― To return packets reverse the recorded route

― Attacks:― Sink messages passing by― Jellyfish attack: Forward multiple copies of the agent― Reset TTL, keep previously seen nodes

Page 11: Presented by Guillaume Marceau

GAF, geography-informed energy conservation

― Only one mote awake per square

― Attacks:― Spoof messages, disable the entire network

Page 12: Presented by Guillaume Marceau

SPAN― Coordinators always stay awake― Negotiated step up and step down

― Attacks:― Fake a message, wins the coordinator election

Page 13: Presented by Guillaume Marceau

Countermeasures

Sybil attack: ― Unique symmetric key― Needham-Schroeder― Restrict near neighbors of nodes by

Base station

Page 14: Presented by Guillaume Marceau

Countermeasures

Hello Flooding: ― Bi-directionality tests― Restricting the number

of nodes by the base station

Page 15: Presented by Guillaume Marceau

Countermeasures

Wormhole andsinkhole attacks:

― Use time and distance― Geographic routing resists such

attacks well― Traffic directed towards Base

station and not elsewhere like sinkholes

Page 16: Presented by Guillaume Marceau

Leveraging Global knowledge― Fixed number of nodes― Fixed topology.

Page 17: Presented by Guillaume Marceau

Selective Forwarding― Messages routed over n disjoint paths protected from n

compromised nodes

Image Source: http://wiki.uni.lu/secan-lab/Braided+Multipath+Routing.html

Page 18: Presented by Guillaume Marceau

Conclusions― The Authors state that for secure routing, networks should

have security as the goal― Infiltrators can easily attack, modify or capture vulnerable

nodes. ― Limiting the number of nodes, using public/global/local key

are some of the ways to counter being attacked by adversaries.

Page 19: Presented by Guillaume Marceau

Few Observations― More insight on capturing packets of the air― Foes or Friends?― What happens when data is captured, copied and

forwarded unnoticed?

Page 20: Presented by Guillaume Marceau

Few Observations― What happens if someone spoofs a legitimate node

identity and paralyze it. What are the countermeasures? Is it detectable?

― Should sensor networks provide security or is it their goal to be secure?

Page 21: Presented by Guillaume Marceau

References

― Securities in Sensor networks-Yang Xiao― Mobicom 2002 Wireless Sensor Networks-Deborah

Estrin― On the Intruder Detection for Sinkhole Attack in

Wireless Sensor Networks-Edith C. H. Ngai Jiangchuan Liu, and Michael R. Lyu

― The Sybil Attack – John Douceur (Microsoft)

e