Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs - PowerPoint PPT Presentation

Loading...

PPT – Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs PowerPoint presentation | free to download - id: 683244-YTJmY



Loading


The Adobe Flash plugin is needed to view this content

Get the plugin now

View by Category
About This Presentation
Title:

Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs

Description:

Security analysis for single black hole. To ensure the security of the network, the black hole should not be able tointercept T shares when source node has sent M shares. – PowerPoint PPT presentation

Number of Views:5
Avg rating:3.0/5.0
Slides: 24
Provided by: bbcrUwate
Learn more at: http://bbcr.uwaterloo.ca
Category:

less

Write a Comment
User Comments (0)
Transcript and Presenter's Notes

Title: Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs


1
Secure and Energy-Efficient Disjoint Multi-Path
Routing for WSNs
  • Presented by Zhongming Zheng

2
Introduction
  • Characteristics of wireless sensor nodes
  • Low cost
  • Simplicity
  • Potential safety risks
  • Black hole attacks

3
Black hole attacks
  • Compromised node (CN) attacks
  • Adversaries try to compromise a subset of nodes
    to passively intercept the packets traversing
    these nodes.
  • Denial of service (DOS) attacks
  • Adversaries actively disrupt, change, or even
    paralyze the functionalities of a subset nodes,
    such that the normal operations of WSNs cannot be
    executed.
  • Method to bypass black hole attacks
  • Designing routing strategies

4
Related work
  • Packets delivery
  • Directly transmits packets by various paths
  • Discovering node-disjoint or edge-disjoint paths
    for transmission to enhance the security
  • Shares delivery
  • Transforming each packet into shares, then
    forwarding shares along different routes
  • Adversary can not decode the packet without
    intercepting a required number of shares

5
Related work
  • Shares delivery
  • Deterministic disjoint multi-path routing
  • Route computation is not changed under the same
    topology
  • Randomly disjoint multi-path routing
  • Route path is randomly generated
  • Further strengthen and guarantee the security of
    packet transmission
  • Most works have not considered network lifetime

6
System configurations
  • A circular region of many-to-one high-density
    WSNs
  • Sensors are uniformly and randomly distributed
  • Relative location information of itself and its
    neighbors are known
  • A link key is safe except either side of the link
    is physically compromised by the adversary
  • The adversary is able to compromise multiple
    sensor nodes except the sink and its immediate
    surrounding nodes
  • (T, M)-threshold secret sharing mechanism is used

7
Objective
  • We focus on designing routing protocols to
    maximize the lifetime of WSNs, while guarantee
    the security of the whole network.

8
Objective
  • Maximizing network lifetime
  • Probability that the adversary can acquire at
    least T shares is
  • Objective function

9
Strategy
  • Observation
  • When one of the sensor nodes is out of energy in
    WSNs, the nodes far away from the sink node have
    used only 10 of their batteries
  • Thus, our proposed scheme aims at
  • Utilizing the redundant energy to dispersively
    distribute the shares of packets all over the
    WSNs
  • Forwarding these shares to the sink node along
    the randomized disjoint routes.

10
SEDR scheme
  • Regional dispersive routing
  • Using (T,M)-threshold secret sharing mechanism
  • The M shares are sent to M randomly selected
    sensors located around the source node
  • Disjoint identical-hop routing
  • M shares are transmitted to other sensor nodes
    dispersively distributed in the network
  • Least-hop routing
  • Using the shortest routing path to forward the M
    shares to the sink node

11
An example of the SEDR scheme
12
Energy consumption analysis
  • Calculate the energy consumption of each step
  • To analyze the network lifetime, we focus on the
    sensor node with the maximum energy consumption
  • When the radius of WSNs is larger or equal to 4
    hops, the whole-network dispersive routing does
    not reduce the network lifetime.

13
Security analysis for single black hole
  • To ensure the security of the network, the black
    hole should not be able to intercept T shares
    when source node has sent M shares.
  • Calculate the packet interception probability of
    SEDR scheme under the scenario of single black
    hole.
  • For each packet, if and only if the sink node can
    receive at least T shares and less than T shares
    are intercepted by the black hole, the
    bi-security of the packet is guaranteed.

14
Security analysis for single black hole
  • Derive the least required number of transmitted
    shares M, such that at least T shares are
    received by the sink node, the least required
    number.
  • Get the maximal number of transmitted shares M,
    such that the number of intercepted shares by
    black hole to be less than T.
  • To ensure the security of a packet,

15
Security analysis for single black hole
  • To ensure the bi-security of a packet, the
    minimal physically secured area under bi-security
    requirement of SEDR scheme should ensure
  • The cost of constructing physically secured area
    of SEDR scheme never exceeds the cost of I-walks.

16
Security analysis for multiple black holes
  • Suppose k black holes are uniformly and randomly
    distributed in the network region.
  • Obtain the probability for each share to traverse
    through black holes under the scenario of k black
    holes.
  • Calculate the probability that the packet can be
    successfully decoded by the adversaries.
  • If black holes do not overlap with each other,
    the packet interception probability is

17
Network lifetime analysis
  •  

18
Simulation configuration
19
Simulation results for single black hole
20
Simulation results for multiple black hole
21
Simulation results for network lifetime
22
Conclusions
  • We have studied the problem of secret sharing
    based multi-path routing and formulated it as an
    optimization problem to maximize both the network
    security and lifetime.
  • The SEDR scheme has been proposed to deliver
    sliced shares to the sink node with randomized
    disjoint multi-path routes.
  • Theoretical analysis and extensive simulation
    results show that the SEDR scheme outperforms
    I-walk in both network security and lifetime
    under various parameters.

23
Thank you!
About PowerShow.com