Murat Demirbas Youngwhan Song University at Buffalo, SUNY

Slides:



Advertisements
Similar presentations
Chris Karlof and David Wagner
Advertisements

Security in Sensor Networks By : Rohin Sethi Aranika Mahajan Twisha Patel.
SoNIC: Classifying Interference in Sensor Networks Frederik Hermans et al. Uppsala University, Sweden IPSN 2013 Presenter: Jeffrey.
Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.
Distribution and Revocation of Cryptographic Keys in Sensor Networks Amrinder Singh Dept. of Computer Science Virginia Tech.
Presented By: Hathal ALwageed 1.  R. Anderson, H. Chan and A. Perrig. Key Infection: Smart Trust for Smart Dust. In IEEE International Conference on.
Efficient Public Key Infrastructure Implementation in Wireless Sensor Networks Wireless Communication and Sensor Computing, ICWCSC International.
A Distributed Security Framework for Heterogeneous Wireless Sensor Networks Presented by Drew Wichmann Paper by Himali Saxena, Chunyu Ai, Marco Valero,
Presented by : Poorya Ghafoorpoor Yazdi Eastern Mediterranean University Mechanical Engineering Department Master Thesis Presentation Eastern Mediterranean.
Sec-TEEN: Secure Threshold sensitive Energy Efficient sensor Network protocol Ibrahim Alkhori, Tamer Abukhalil & Abdel-shakour A. Abuznied Department of.
LOGO Multi-user Broadcast Authentication in Wireless Sensor Networks ICU Myunghan Yoo.
Using Auxiliary Sensors for Pair-Wise Key Establishment in WSN Source: Lecture Notes in Computer Science (2010) Authors: Qi Dong and Donggang Liu Presenter:
Securing Wireless Sensor Networks Wenliang (Kevin) Du Department of Electrical Engineering and Computer Science Syracuse University.
Edith C. H. Ngai1, Jiangchuan Liu2, and Michael R. Lyu1
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
1 Security in Wireless Sensor Networks Group Meeting Fall 2004 Presented by Edith Ngai.
Roberto Di Pietro, Luigi V. Mancini and Alessandro Mei.
A Pairwise Key Pre-Distribution Scheme for Wireless Sensor Networks Wenliang (Kevin) Du, Jing Deng, Yunghsiang S. Han and Pramod K. Varshney Department.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
Adaptive Security for Wireless Sensor Networks Master Thesis – June 2006.
Random Key Predistribution Schemes for Sensor Networks Authors: Haowen Chan, Adrian Perrig, Dawn Song Carnegie Mellon University Presented by: Johnny Flowers.
Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks (WSNs) Murat Demirbas, Xuming Lu Dept of Computer Science and Engineering, University.
Sencun Zhu Sanjeev Setia Sushil Jajodia Presented by: Harel Carmit
Security in Wireless Sensor Networks Perrig, Stankovic, Wagner Jason Buckingham CSCI 7143: Secure Sensor Networks August 31, 2004.
Revisting Random Key Pre-distribution Schemes for Wireless Sensor Network By Joengmin Hwang and Yongdae Kim, Computer Science and Engineering, University.
Wireless Sensor Network Security Anuj Nagar CS 590.
Establishing Pairwise Keys in Distributed Sensor Networks Donggang Liu, Peng Ning Jason Buckingham CSCI 7143: Secure Sensor Networks October 12, 2004.
1 Sensor networks for traffic monitoring Pravin Varaiya et al.
Computer Science Detecting Malicious Beacon Nodes for Secure Location Discovery in Wireless Sensor Networks Presented by Akshay Lal.
Computer Science 1 Research on Sensor Network Security Peng Ning Cyber Defense Laboratory Department of Computer Science NC State University 2005 TRES.
Sensor Networks Lecture 7. Sensor Networks Special case of the general ad hoc networking problem Much more resource constrained than a network of PDAs.
Data Selection In Ad-Hoc Wireless Sensor Networks Olawoye Oyeyele 11/24/2003.
Secure Localization Algorithms for Wireless Sensor Networks proposed by A. Boukerche, H. Oliveira, E. Nakamura, and A. Loureiro (2008) Maria Berenice Carrasco.
1 Secure Cooperative MIMO Communications Under Active Compromised Nodes Liang Hong, McKenzie McNeal III, Wei Chen College of Engineering, Technology, and.
Intrusion Detection System for Wireless Sensor Networks: Design, Implementation and Evaluation Dr. Huirong Fu.
Authors: Sheng-Po Kuo, Yu-Chee Tseng, Fang-Jing Wu, and Chun-Yu Lin
M-GEAR: Gateway-Based Energy-Aware Multi-Hop Routing Protocol
Secure Cell Relay Routing Protocol for Sensor Networks Xiaojiang Du, Fengiing Lin Department of Computer Science North Dakota State University 24th IEEE.
Challenges & Opportunities in Monitoring of Buildings with Wireless Sensor Networks Murat Demirbas University at Buffalo, SUNY Computer Science & Engineering.
On-Demand Traffic-Embedded Clock Synchronization for Wireless Sensor Networks Sang Hoon Lee.
1 Securing Wireless Sensor Networks Wenliang (Kevin) Du Department of Electrical Engineering and Computer Science Syracuse University Excerpted from
Secure routing in wireless sensor network: attacks and countermeasures Presenter: Haiou Xiang Author: Chris Karlof, David Wagner Appeared at the First.
The Sybil Attack in Sensor Networks: Analysis & Defenses
Securing Distributed Sensor Networks Udayan Kumar Subhajit Sengupta Sharad Sonapeer.
Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols ► Acts as denial of service by disrupting the flow of data between a source and.
Presenter: Abhishek Gupta Dept. of Electrical and Computer Engineering
Selection and Navigation of Mobile sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer.
TinySec : Link Layer Security Architecture for Wireless Sensor Networks Chris Karlof :: Naveen Sastry :: David Wagner Presented by Anil Karamchandani 10/01/2007.
A Passive Approach to Sensor Network Localization Rahul Biswas and Sebastian Thrun International Conference on Intelligent Robots and Systems 2004 Presented.
Computer Science 1 TinySeRSync: Secure and Resilient Time Synchronization in Wireless Sensor Networks Speaker: Sangwon Hyun Acknowledgement: Slides were.
Modeling In-Network Processing and Aggregation in Sensor Networks Ajay Mahimkar The University of Texas at Austin March 24, 2004.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
Aggregation and Secure Aggregation. Learning Objectives Understand why we need aggregation in WSNs Understand aggregation protocols in WSNs Understand.
0.1 IT 601: Mobile Computing Wireless Sensor Network Prof. Anirudha Sahoo IIT Bombay.
1 An Interleaved Hop-by-Hop Authentication Scheme for Filtering of Injected False Data in Sensor Networks Sencun Zhu, Sanjeev Setia, Sushil Jajodia, Peng.
A Key Management Scheme for Distributed Sensor Networks Laurent Eschaenauer and Virgil D. Gligor.
A Key Management Scheme for Wireless Sensor Networks Using Deployment Knowledge Wenliang Du et al.
Efficient Pairwise Key Establishment Scheme Based on Random Pre-Distribution Keys in Wireless Sensor Networks Source: Lecture Notes in Computer Science,
Ben Miller.   A distributed algorithm is a type of parallel algorithm  They are designed to run on multiple interconnected processors  Separate parts.
Aggregation and Secure Aggregation. [Aggre_1] Section 12 Why do we need Aggregation? Sensor networks – Event-based Systems Example Query: –What is the.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
1 Self-Certified Group Key-Generation for Ad Hoc Clusters in Wireless Sensor Networks Ortal Arazi, Hairong Qi Dept. Electrical & Computer Engineering The.
Energy Efficient Data Management in Sensor Networks Sanjay K Madria Web and Wireless Computing Lab (W2C) Department of Computer Science, Missouri University.
Unpredictable Software-based Attestation Solution for Node Compromise Detection in Mobile WSN Xinyu Jin 1 Pasd Putthapipat 1 Deng Pan 1 Niki Pissinou 1.
A Secure Routing Protocol with Intrusion Detection for Clustering Wireless Sensor Networks International Forum on Information Technology and Applications.
Introduction to Wireless Sensor Networks
Securing Wireless Sensor Networks
Aggregation.
Presentation transcript:

Murat Demirbas Youngwhan Song University at Buffalo, SUNY An RSSI-based Scheme for Sybil Attack Detection in Wireless Sensor Networks Murat Demirbas Youngwhan Song University at Buffalo, SUNY

Sensor networks A sensor node (mote) Applications include 4Mhz processor, 128K flash memory magnetism, light, heat, sound, and vibration sensors wireless communication up to 100m costs “in bulk” ~$5 (now $80~$150) Applications include ecology monitoring, precision agriculture, civil engineering traffic monitoring, industrial automation, military and surveillance Energy and resource limitation is a key challenge in WSN communication-efficient, lightweight programs are needed

Sybil attack A sybil node tries to forge multiple identification in a region Sybil attack is particularly easy to perform in WSN the communication medium is broadcast same frequency is shared among all nodes A sybil node can rig the vote on group-based decisions and disrupt network middleware services severely

Existing solutions are costly Existing solutions for sybil attack prevention are too costly for the resource-poor sensor platforms excessive communication burden on nodes are not acceptable since they drain the battery power quickly Solutions that adopt key exchange for identification severely effect the energy consumption due to distribution and piggybacking of randomly generated keys in messages, and consume precious memory space as every node is required to store pairwise keys with neighbors

RSSI-based solution? Upon receiving a message, the receiver will associate the RSSI of the message with the sender-id included, and later when another message with same RSSI but with different sender-id is received, the receiver would detect sybil attack Lightweight solution ! Problem: RSSI is unreliable and time-varying ! Problem: RSSI is a function of transmission power ! a sybil node can send messages with different IDs using varying transmission power to trick the receiver

Our contributions We implement a sybil attack detection technique based on using ratios of RSSIs from multiple nodes The technique was first introduced as a localization solution by Zhong et. al., but this is the first time it is implemented in WSN Our solution is robust & lightweight We detect all sybil attack cases with very little false-positives We show that instead of 4 detectors prescribed in theory, two detectors performs just as well in practice

Outline Problem statement RSSI-based localization RSSI-based sybil detection Experiments with RSSI Variance of RSSI Variance of ratios of RSSI Experiments with sybil detection 4 detectors (completeness / accuracy) 2 detectors (completeness / accuracy)

Problem statement Model Static network: nodes are immobile after initial deployment We assume an initial set of nodes that are trustworthy New nodes are introduced to network (some may be sybil) For repopulation, or due to topology-control and sleep-wake up protocols Sybil nodes can vary transmission power to trick other nodes • Completeness: If there is a sybil attack in the network, detect the attack with probability greater than 99% • Accuracy: Do not identify non-sybil nodes as sybil

RSSI-based localization Using 4 nodes as detectors it is possible to localize any node RSSI at i for a transmission from node 0 with power P0 is RSSI ratio of node i to node j is Since P0 values cancel out in the ratio of RSSIs, this technique is unaffected by the changes to the transmission power P0 The location (x,y) of a node can be calculated if locations of i, j, k, l are known

RSSI-based sybil detection No need to calculate node locations; we can detect sybil attack by comparing the ratio of RSSI for received messages Let D1, D2, D3, D4 be detectors, and sybil node tries to forge ids S1 and S2 at time t1 and t2 Accumulating RSSI messages wrt HELLO(S1), and later HELLO(S2) D1 computes D1 detects a sybil attack iff

Outline Problem statement RSSI-based localization RSSI-based sybil detection Experiments with RSSI Variance of RSSI Variance of ratios of RSSI Experiments with sybil detection 4 detectors (completeness / accuracy) 2 detectors (completeness / accuracy)

Variance of RSSI A node transmits messages >2000 times with constant transmission power Receiver (at 30cm and 1m) records RSSI TinyOS provides RSSI via TOS_Msg->strength Histograms show nonuniform nature of RSSI

Variance of ratios of RSSI A node transmits messages >2000 times with varying transmission power Two receivers record RSSI, difference of ratios of RSSIs for each pair of transmissions are graphed Since ratio of RSSIs are used, varying transmission power does not cause any problem Histograms show uniform distribution Gaussian PDF with std. dev. 0.06 and 0.106

Effect of distance on ratio variance std. dev. is around 0.1, so difference threshold is set to 0.5

Outline Problem statement RSSI-based localization RSSI-based sybil detection Experiments with RSSI Variance of RSSI Variance of ratios of RSSI Experiments with sybil detection 4 detectors (completeness / accuracy) 2 detectors (completeness / accuracy)

Experiment Scenario Node 1 detects sybil node, based on input from 2, 3, 4

4 detectors Completeness: sybil node is detected 100% Accuracy: 0% false-positive rate

2 detectors Completeness: sybil node is detected 100% Accuracy: less than 5% false-positives Completeness is more critical than the accuracy Not detecting a sybil node has severe implications for security, whereas falsely detecting upto 5% nodes as sybil only reduces the system performance Since 2 detectors has much less communication overhead and still acceptable false-positive rate, 2 detector case is more suitable than 4 detector case

Evaluation Without authentication or encryption technology, our implementation exposes sybil attack The scheme is lightweight: only single message commn Accuracy is great even for small distances (1cm)

Future work Design a distributed sybil attack detection protocol that tolerates existing sybil nodes in the network Existing sybil nodes may be modeled as Byzantine nodes Broadcast medium can make it easier to detect Byzantine nodes

Video Clip

RSSI value instead of Power According to [2], the received power can be gotten in mica 2 by Since the power is linear to RSSI value, and the ratio will be used, there is no problem to adopt RSSI value instead of power when we detect sybil node. We denote Rik as RSSI value which is from node k to node i.