Loading in 2 Seconds...
Loading in 2 Seconds...
Detecting Malicious Beacon Nodes for Secure Location Discovery in Wireless Sensor Networks. Presented by Akshay Lal. Roadmap. Official terminology. THE sensor network. What’s the problem ? A practical solution. Detection of malicious beacon nodes. Special considerations.
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.
Reply beacon signal containing its location - (x’,y’)Detection of Malicious Beacon Nodes (contd.)
If difference between the two values > maximum distance error :
received signal is malicious hence, target node is malicious
t1: time to finish sending first byte of request
t2: time to finish receiving first byte of request
t3: time to finish sending first byte of reply
t4: time to finish receiving first byte of reply
t3Special Considerations – Thwarting Locally Replayed Beacon Signals
Detecting node calculates RTT = (t4 - t1) – (t3 - t2)
Xmin = maximum value for X such that F(x) = 0
Xmax = minimum value for X such that F(x) = 1
Transmission time per clock
pulse = 384 clock cycles
Xmin = 1,951
Xmax = 7,506
Detection is possible for any replayed signal if delay introduced
is longer than transmission time for 14.5 bits
Reply beacon signal containing its location - (x’,y’)The Algorithm Thus Far
Cannot increase P without simultaneously
ґ = 4Performance Review – Notations for Node Revocation
Detection rate increase as a node
continues to behave maliciously.
As Γincreases detection rate
And as m increases detection rate
As the number of requesting nodes to a
malicious node increase, detection rate
increases due to the increase in number
of alerts sent.
As Γ increases N` and P` increase.
As m increases N` and P` decrease.
Initially N` increases fast but after a point it decreases due to the increase in the number of request serviced.
N` decreases when threshold Γ decreases.
The threshold for Ѓ and Γ can be obtained by the above analysis, which should satisfy the condition on low Nf or by chosing Ѓ and Γ that yield a minimum Nf, given Pd, Nw and Na.
Most of the beacon nodes are detected with small false positives however, as the network continues to get compromised, the performance degrades accordingly.
Γ and Ѓ were varied and P is configured such that N` is maximized.