Loading in 2 Seconds...
Loading in 2 Seconds...
Security in Wireless Sensor Networks: Key Management Approaches. Vasyl A. Radzevych and Sunu Mathew. Overview. Wireless Sensor Networks (WSN) Security issues in WSN Key management approaches in WSN: Overview Pre-Deployed Keying Key pre-deployment Key derivation information pre-deployment
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Vasyl A. Radzevych and Sunu Mathew
A4False routing information
Example: captured node attracts traffic by advertising shortest path to sink, high battery power, etc
1000 nodes, 40 nodes neighborhood, P=10000
number of hops
Path length to neighbors
Expected degree of node vs. number of nodes, where
Pc=Pr[G(n,p) is connected]
Probability of sharing at least one key when two nodes
choose k keys from a pool of size P
Experimental results on id notification and pseudorandom key id generation: Number of sensors to corrupt in order to compromise an arbitrary channel.
Experimental results on challenge response:
Number of sensors to corrupt in order to compromise an arbitrary channel.
z≡0 mod( P/K ). All other entities gets no information from z. This is exactly the same information revealed by challenge response
Experimental results on PRK algorithm: number of sensors to corrupt in order to compromise an arbitrary channel. The PRK algorithm is as secure as challenge response and in the same time as efficient as pseudorandom key id generation
where an= (a + brU) mod p and bn= (b + crU) mod p is formed and pre-distributed
gw(x) = 15+9x
The probability p that 2 sensors share a polynomial vs
size s of the polynomial pool (s’ – number of polynomial
shares in each sensor)
Fraction of compromised links between non compromised nodes
vs number of compromised nodes
(20000 nodes, nodes can store equivalent of 200 keys)
and N is the size of the network
and each column is associated with polynomial
Node assignment in the grid
Establishing a path through the grid
Distribution of sensor energy consumption with our
|Sc| = 1770
2)Probability that resides around the point Z(x,y) *
3)Probability that is a neighbor of
Plocal is the average of this value across the whole region
Once a peer node is selected, it cannot select another node in the same group