Secure In-Network Aggregation for Wireless Sensor Networks

Slides:



Advertisements
Similar presentations
Is There Light at the Ends of the Tunnel? Wireless Sensor Networks for Adaptive Lighting in Road Tunnels IPSN 2011 Sean.
Advertisements

1 ECE 776 Project Information-theoretic Approaches for Sensor Selection and Placement in Sensor Networks for Target Localization and Tracking Renita Machado.
A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
Computer Science Dr. Peng NingCSC 774 Adv. Net. Security1 CSC 774 Advanced Network Security Topic 7.3 Secure and Resilient Location Discovery in Wireless.
Fault-Tolerant Target Detection in Sensor Networks Min Ding +, Dechang Chen *, Andrew Thaeler +, and Xiuzhen Cheng + + Department of Computer Science,
Intrusion Detection Techniques in Mobile Ad Hoc and Wireless Sensor Networks - IEEE October 2007 CMSC Advanced Computer Networks Oleg Aulov CMSC.
Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du Department of Computer.
1 Mobility-assisted Spatiotemporal Detection in Wireless Sensor Networks Guoliang Xing 1 ; JianpingWang 1 ; Ke Shen 3 ; Qingfeng Huang 2 ; Xiaohua Jia.
Adaptive Data Collection Strategies for Lifetime-Constrained Wireless Sensor Networks Xueyan Tang Jianliang Xu Sch. of Comput. Eng., Nanyang Technol. Univ.,
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
Probabilistic Data Aggregation Ling Huang, Ben Zhao, Anthony Joseph Sahara Retreat January, 2004.
Extending Network Lifetime for Precision-Constrained Data Aggregation in Wireless Sensor Networks Xueyan Tang School of Computer Engineering Nanyang Technological.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
Energy-efficient Self-adapting Online Linear Forecasting for Wireless Sensor Network Applications Jai-Jin Lim and Kang G. Shin Real-Time Computing Laboratory,
Opportunistic Routing Based Scheme with Multi-layer Relay Sets in Cognitive Radio Networks Ying Dai and Jie Wu Department of Computer and Information Sciences.
Signal Strength based Communication in Wireless Sensor Networks (Sensor Network Estimation) Imran S. Ansari EE 242 Digital Communications and Coding (Fall.
1. Introduction Generally Intrusion Detection Systems (IDSs), as special-purpose devices to detect network anomalies and attacks, are using two approaches.
Kalman filter and SLAM problem
Presented by: Chaitanya K. Sambhara Paper by: Maarten Ditzel, Caspar Lageweg, Johan Janssen, Arne Theil TNO Defence, Security and Safety, The Hague, The.
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.
Authors: Sheng-Po Kuo, Yu-Chee Tseng, Fang-Jing Wu, and Chun-Yu Lin
2008/2/191 Customizing a Geographical Routing Protocol for Wireless Sensor Networks Proceedings of the th International Conference on Information.
Alert Aggregation in Mobile Ad-Hoc Networks By Bo Sun, Kui Wu, Udo W. Pooch.
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
Distributed Anomaly Detection in Wireless Sensor Networks Ksutharshan Rajasegarar, Christopher Leckie, Marimutha Palaniswami, James C. Bezdek IEEE ICCS2006(Institutions.
Trust- and Clustering-Based Authentication Service in Mobile Ad Hoc Networks Presented by Edith Ngai 28 October 2003.
Adaptive Data Aggregation for Wireless Sensor Networks S. Jagannathan Rutledge-Emerson Distinguished Professor Department of Electrical and Computer Engineering.
Coordinated Sensor Deployment for Improving Secure Communications and Sensing Coverage Yinian Mao, Min Wu Security of ad hoc and Sensor Networks, Proceedings.
Multi-hop-based Monte Carlo Localization for Mobile Sensor Networks
Distributed Monitoring and Aggregation in Wireless Sensor Networks INFOCOM 2010 Changlei Liu and Guohong Cao Speaker: Wun-Cheng Li.
Distributed State-Estimation Using Quantized Measurement Data from Wireless Sensor Networks Li Chai with Bocheng Hu Professor College of.
Multi-Criteria Routing in Pervasive Environment with Sensors Santhanakrishnan, G., Li, Q., Beaver, J., Chrysanthis, P.K., Amer, A. and Labrinidis, A Department.
College of Engineering Grid-based Coordinated Routing in Wireless Sensor Networks Uttara Sawant Major Advisor : Dr. Robert Akl Department of Computer Science.
Collision-free Time Slot Reuse in Multi-hop Wireless Sensor Networks
A new Ad Hoc Positioning System 컴퓨터 공학과 오영준.
Using Polynomial Approximation as Compression and Aggregation Technique in Wireless Sensor Networks Bouabdellah KECHAR Oran University.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
Differential Ad Hoc Positioning Systems Presented By: Ramesh Tumati Feb 18, 2004.
High-integrity Sensor Networks Mani Srivastava UCLA.
1 RealProct: Reliable Protocol Conformance Testing with Real Nodes for Wireless Sensor Networks Junjie Xiong, Edith C.-Ngai, Yangfan Zhou, Michael R. Lyu.
Maximizing Lifetime per Unit Cost in Wireless Sensor Networks
Performance of Adaptive Beam Nulling in Multihop Ad Hoc Networks Under Jamming Suman Bhunia, Vahid Behzadan, Paulo Alexandre Regis, Shamik Sengupta.
A Wakeup Scheme for Sensor Networks: Achieving Balance between Energy Saving and End-to-end Delay Xue Yang, Nitin H.Vaidya Department of Electrical and.
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
Adaptive Tracking in Distributed Wireless Sensor Networks Lizhi Yang, Chuan Feng, Jerzy W. Rozenblit, Haiyan Qiao The University of Arizona Electrical.
Po-Yu Chen, Zan-Feng Kao, Wen-Tsuen Chen, Chi-Han Lin Department of Computer Science National Tsing Hua University IEEE ICPP 2011 A Distributed Flow-Based.
Aggregation and Secure Aggregation. Learning Objectives Understand why we need aggregation in WSNs Understand aggregation protocols in WSNs Understand.
By: Aaron Dyreson Supervising Professor: Dr. Ioannis Schizas
Global Clock Synchronization in Sensor Networks Qun Li, Member, IEEE, and Daniela Rus, Member, IEEE IEEE Transactions on Computers 2006 Chien-Ku Lai.
Cameron Rowe.  Introduction  Purpose  Implementation  Simple Example Problem  Extended Kalman Filters  Conclusion  Real World Examples.
Hierarchical Trust Management for Wireless Sensor Networks and Its Applications to Trust-Based Routing and Intrusion Detection Wenhai Sun & Ruide Zhang.
Bing Wang, Wei Wei, Hieu Dinh, Wei Zeng, Krishna R. Pattipati (Fellow IEEE) IEEE Transactions on Mobile Computing, March 2012.
EM-MAC: A Dynamic Multichannel Energy-Efficient MAC Protocol for Wireless Sensor Networks ACM MobiHoc 2011 (Best Paper Award) Lei Tang 1, Yanjun Sun 2,
Data funneling : routing with aggregation and compression for wireless sensor networks Petrovic, D.; Shah, R.C.; Ramchandran, K.; Rabaey, J. ; SNPA 2003.
Wireless Sensor Networks
Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.
I-Hsin Liu1 Event-to-Sink Directed Clustering in Wireless Sensor Networks Alper Bereketli and Ozgur B. Akan Department of Electrical and Electronics Engineering.
Aggregation and Secure Aggregation. [Aggre_1] Section 12 Why do we need Aggregation? Sensor networks – Event-based Systems Example Query: –What is the.
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
Zijian Wang, Eyuphan Bulut, and Boleslaw K. Szymanski Center for Pervasive Computing and Networking and Department of Computer Science Rensselaer Polytechnic.
A Spatial-based Multi-resolution Data Dissemination Scheme for Wireless Sensor Networks Jian Chen, Udo Pooch Department of Computer Science Texas A&M University.
Ing-Ray Chen, Member, IEEE, Hamid Al-Hamadi Haili Dong Secure and Reliable Multisource Multipath Routing in Clustered Wireless Sensor Networks 1.
Straight Line Routing for Wireless Sensor Networks Cheng-Fu Chou, Jia-Jang Su, and Chao-Yu Chen Computer Science and Information Engineering Dept., National.
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Protocols.
Aggregation.
Protocols.
Presentation transcript:

Secure In-Network Aggregation for Wireless Sensor Networks Bo Sun Department of Computer Science Lamar University Research Supported by Texas Advanced Research Program under Grant 003581-0006-2006

Outline of Presentation Introduction and Motivation Assumptions and Network Model Local Detection Challenges Extended Kalman Filter based Monitoring CUSUM GLR based Monitoring Collaboration between Intrusion Detection Module (IDM) and System Monitoring Module (SMM) Performance Evaluation Conclusions and Future work

Introduction and Motivation

Wireless Sensor Networks (WSNs) Many simple nodes with sensors deployed throughout an environment Sensing + CPU +Radio = Thousands of Potential Applications

Why do we need Aggregation in WSNs? Example Query: What is the maximum temperature in area A between 10am and 11am? Redundancy in the event data Solution: Combine the data coming from different sources Eliminate redundancy Minimize the number of transmissions 2 1 3 4 5 Individual sensor readings of limit use Information redundancy Forwarding raw information too expensive Scarce energy Scarce bandwidth

Secure In-Network Aggregation Problem

Observation There is very little work that aims at addressing secure in-network aggregation problem from the intrusion detection perspective Our Work We set up the normal range of the neighbor’s future transmitted values We propose the integration between System Monitoring Modules and Intrusion Detection Modules

Intrusion Detection Systems (IDSs) Goal: Highly secured Information Systems Why do we need IDSs? Security has become one of the main concerns when we deploy information systems in reality. Intrusion prevention measures, such as encryption and authentication, can be used in ad-hoc networks to reduce intrusions, but cannot eliminate them. For example, encryption and authentication cannot defend against compromised mobile nodes, especially the internal or insider attackers, which often carry the private keys. The history of security research has taught us a valuable lesson { no matter how many intrusion prevention measures are inserted in a network, there are always some weak links that one could exploit to break in. What is intrusion? Intrusion detection. Layered mechanism Security has become one of the main concerns when we deploy MANET in reality. Our goal is to construct highly secured MANET. Intrusion detection presents a second wall of defense and is necessary in a highly-survivable network. Intrusion detection is not introduced to replace the prevention-based techniques such as authentication and access control. Instead, it is intended to be used along with the existing security measures. This is my research focus. As we can see, another layer of protection is intrusion tolerance, that is, the tolerance of security policy violation. Based on this model, an attack can only be successful if the corresponding vulnerability exists and no additional precautions have been taken to prevent the security policy violation.

Intrusion Detection Systems Intrusions in an information system are the activities that violate the security policy of the information system, and intrusion detection is the process to identify intrusions. Intrusions are any set of actions that try to compromise the integrity, confidentiality, availability of the system. Analysis of the behaviors of users and applications for evidence of malicious activities Intrusion detection is a security technology that attempts to identify individuals who are trying to break into and misuse a system without authorization and those who have legitimate access to the system but are abusing their privileges An intrusion detection system (IDS) is a computer system that dynamically monitors the system and user actions in the network and computer systems in order to detect the intrusions. First, we have the detection engine, here different detection techniques can be deployed. which send probes to and collect audit information describe the events that occur on the system. Intrusion detection system needs to have a database to store the long term information related to the technique used to detect intrusions (a knowledge base of attacks, for example) and configuration information describe the current state of the system. Intrusion response can be used to minimize the attack damages, gather evidence for prosecution, or even launch counter attacks.

Challenges It is difficult to achieve the real aggregated values High packet loss rate Individual sensor readings are subject to environmental noise Uncertainty of the aggregation function Sensor nodes suffer from stringent resources

Challenges

Assumptions and Network Models

Assumptions The majority of nodes around some unusual events are not compromised Falsified data inserted by compromised nodes are significantly different from real values

Network Models

Local Detection

Kalman Filter A set of mathematical equations Recursively estimate the state of a process Time Update: Project the current state estimate ahead of time Measurement Update: Adjust the projected estimate by an actual measurement

Extended Kalman Filter based Monitoring

Extended Kalman Filter based Monitoring – System Dynamic Model Process Model Measurement Model

Extended Kalman Filter based Monitoring – System Equations Time Update State Estimate Equations: Error Project Equations: Measurement Update Kalman Gain Equation: Estimate Update with Measurement: Error Covariance Update Equation:

EKF based Local Detection Algorithm

CUSUM GLR based Location Detection EKF based solution ignores the information given by the entire data sequence EKF based solution is not suitable if an attacker continuously forge values with small deviations Solution Cumulative Summation (CUSUM) Generalized Likelihood Ratio (GLR)

An Example of CUSUM Cumulative sum: Source: D.C. Montgomery (2004).

CUSUM GLR based Location Detection

Collaboration between IDM and SMM to Differentiate Malicious Events from Emergency Events

Performance Evaluation

Simulation Setup Aggregation Function Simulation Performance Metric Average, Sum, Min, and Max Simulation Different packet loss ratio: 0.1, 0.25, 0.5 D: Attack Intensity The difference between attack data and normal data Performance Metric False Positive Rate Detection Rate

Performance Evaluation – Average of EKF

Performance Evaluation – Average of CUSUM GLR

Performance Evaluation – Sum of EKF

Performance of Evaluation – Sum of CUSUM GLR

Performance Evaluation – Min of EKF

Performance Evaluation – Min of CUSUM GLR

Performance Evaluation – Max of EKF

Performance Evaluation – Max of CUSUM GLR

Related Work Hu and Evans’ secure Aggregation Secure Information Aggregation Secure Hierarchical In-Network Aggregation Secure hop-by-hop data aggregation Topological Constraints based Aggregation Resilient Aggregation

Conclusions and Future Work Extended Kalman Filter based approach can provide an effective local detection algorithm Intrusion Detection Module and System Monitoring Modules should work together to provide intrusion detection capabilities Future Work Large scale test of the proposed approach Further elaboration of interactions between IDM and SMM

Thank You !