Iowa State University Department of Computer Science Software Engineering Laboratory Compromising Location Privacy in Wireless Networks Using Sensors with.

Slides:



Advertisements
Similar presentations
Independent Component Analysis
Advertisements

Technical Troubleshooting 1. Disclaimer Vendor technology is being shared to illustrate this field and is not an endorsement of the product or vendor.
Simon Fraser University Computational Vision Lab Lilong Shi, Brian Funt and Tim Lee.
Issues of Security and Privacy in Networking in the CBA Karen Sollins Laboratory for Computer Science July 17, 2002.
Security and Privacy Issues in Wireless Communication By: Michael Glus, MSEE EEL
Prof. Ramin Zabih (CS) Prof. Ashish Raj (Radiology) CS5540: Computational Techniques for Analyzing Clinical Data.
Principal Component Analysis
Independent Component Analysis (ICA)
An Authentication Service Based on Trust and Clustering in Wireless Ad Hoc Networks: Description and Security Evaluation Edith C.H. Ngai and Michael R.
Class 5: Thurs., Sep. 23 Example of using regression to make predictions and understand the likely errors in the predictions: salaries of teachers and.
Prénom Nom Document Analysis: Data Analysis and Clustering Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
(c) 2007 Mauro Pezzè & Michal Young Ch 16, slide 1 Fault-Based Testing.
SARAH SPENCE ADAMS ASSOC. PROFESSOR OF MATHEMATICS AND ELECTRICAL & COMPUTER ENGINEERING Combinatorial Designs and Related Discrete Combinatorial Structures.
Lecture 4 Unsupervised Learning Clustering & Dimensionality Reduction
Future Research Directions Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
1 Deriving Private Information from Randomized Data Zhengli Huang Wenliang (Kevin) Du Biao Chen Syracuse University.
Bayesian belief networks 2. PCA and ICA
1 When Does Randomization Fail to Protect Privacy? Wenliang (Kevin) Du Department of EECS, Syracuse University.
Laurent Itti: CS599 – Computational Architectures in Biological Vision, USC Lecture 7: Coding and Representation 1 Computational Architectures in.
Collaborative Signal Processing CS 691 – Wireless Sensor Networks Mohammad Ali Salahuddin 04/22/03.
Biomedical Image Analysis and Machine Learning BMI 731 Winter 2005 Kun Huang Department of Biomedical Informatics Ohio State University.
Multimedia Data Mining Arvind Balasubramanian Multimedia Lab (ECSS 4.416) The University of Texas at Dallas.
Problem Solving Unit 2. Problem Solving 1. Define the problem – What is the problem? 2. Generate possible solutions – What are some things I can do to.
Principal Components Analysis BMTRY 726 3/27/14. Uses Goal: Explain the variability of a set of variables using a “small” set of linear combinations of.
1 Secure Cooperative MIMO Communications Under Active Compromised Nodes Liang Hong, McKenzie McNeal III, Wei Chen College of Engineering, Technology, and.
Information Security Principles (ESGD4222)
Key Words: File systems, Steganography, Encrypted Communications, RAID, Information Hiding, Intelligence, Instagram, flickr Original can be found at:
Unit 2: Engineering Design Process
Chapter 14: SEGMENTATION BY CLUSTERING 1. 2 Outline Introduction Human Vision & Gestalt Properties Applications – Background Subtraction – Shot Boundary.
P2P SIP Names & Security Cullen Jennings
Chandrika Kamath and Imola K. Fodor Center for Applied Scientific Computing Lawrence Livermore National Laboratory Gatlinburg, TN March 26-27, 2002 Dimension.
Architectures and Applications for Wireless Sensor Networks ( ) Localization Chaiporn Jaikaeo Department of Computer Engineering.
COMPUTING AGGREGATES FOR MONITORING WIRELESS SENSOR NETWORKS Jerry Zhao, Ramesh Govindan, Deborah Estrin Presented by Hiren Shah.
Copyright John C. Knight SOFTWARE ENGINEERING FOR DEPENDABLE SYSTEMS John C. Knight Department of Computer Science University of Virginia.
ICT IGCSE.  Introducing or changing a system needs careful planning  Why?
Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.
ECE 8443 – Pattern Recognition LECTURE 10: HETEROSCEDASTIC LINEAR DISCRIMINANT ANALYSIS AND INDEPENDENT COMPONENT ANALYSIS Objectives: Generalization of.
Cmpe 589 Spring Sampling Target population Cost Sample is representative of population (measure statistical average age is 37- if you get 20 for.
Xiaobing Wu, Guihai Chen
1 Security for distributed wireless sensor nodes Ingrid Verbauwhede Department of Electrical Engineering University of California Los Angeles
1 Choosing a Computer Science Research Problem. 2 Choosing a Computer Science Research Problem One of the hardest problems with doing research in any.
Wireless Network Keys Management What is WSN ? Steven Du ID: CSI 5148.
Multi-target Detection in Sensor Networks Xiaoling Wang ECE691, Fall 2003.
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition LECTURE 12: Advanced Discriminant Analysis Objectives:
End-to-End Principle Brad Karp UCL Computer Science CS 6007/GC15/GA07 25 th February, 2009.
Lecture 17 Page 1 CS 236 Online Onion Routing Meant to handle issue of people knowing who you’re talking to Basic idea is to conceal sources and destinations.
Feature Selection and Extraction Michael J. Watts
Introduction to Independent Component Analysis Math 285 project Fall 2015 Jingmei Lu Xixi Lu 12/10/2015.
Comparative Analysis of Spectral Unmixing Algorithms Lidan Miao Nov. 10, 2005.
WHAT IS DATA MINING?  The process of automatically extracting useful information from large amounts of data.  Uses traditional data analysis techniques.
Erik Jonsson School of Engineering and Computer Science The University of Texas at Dallas Cyber Security Research on Engineering Solutions Dr. Bhavani.
Collecting and Processing Information Foundations of Technology Collecting and Processing Information © 2013 International Technology and Engineering Educators.
WHAT IS DATA MINING?  The process of automatically extracting useful information from large amounts of data.  Uses traditional data analysis techniques.
Jose Quistian There are 16 career clusters I like being a dentist because you get a lot of money and help people.
Module 6 Problems Unit 2 If you tell him the truth now, you will show that you are honest. ask for advice give advice.
Dirk Grunwald Dept. of Computer Science, ECEE and ITP University of Colorado, Boulder.
LECTURE 14: DIMENSIONALITY REDUCTION: PRINCIPAL COMPONENT REGRESSION March 21, 2016 SDS 293 Machine Learning B.A. Miller.
Data statistics and transformation revision Michael J. Watts
Unsupervised Learning
A Key Pre-Distribution Scheme Using Deployment Knowledge for Wireless Sensor Networks Zhen Yu & Yong Guan Department of Electrical and Computer Engineering.
LECTURE 11: Advanced Discriminant Analysis
Scatter-plot Based Blind Estimation of Mixed Noise Parameters
Debugging Intermittent Issues
Location Cloaking for Location Safety Protection of Ad Hoc Networks
Development History Granularity Transformations
Blind Signal Separation using Principal Components Analysis
Bayesian belief networks 2. PCA and ICA
Quadratic Equations.
Unsupervised Learning
Presentation transcript:

Iowa State University Department of Computer Science Software Engineering Laboratory Compromising Location Privacy in Wireless Networks Using Sensors with Limited Information Author: Ye Zhu and Riccardo Bettati Department of computer science, Texas A&M University Presenter: Kai-shin Lu

Iowa State University Department of Computer Science Software Engineering Laboratory The Problem How to find out the positions of fixed wireless nodes?

Iowa State University Department of Computer Science Software Engineering Laboratory Naïve Solution 1 He tells me (eavesdrop) I am in Atanosoff. I want to order one pizza. If I can protect my position information? (e.g. cloaking, encrypting) If I don’t need any location service?

Iowa State University Department of Computer Science Software Engineering Laboratory Naïve Solution 2 Directive sender If I don't’ have enough money to buy directive sensors?

Iowa State University Department of Computer Science Software Engineering Laboratory Problem How to compromising location privacy in wireless networks using sensors with Limited Information ?

Iowa State University Department of Computer Science Software Engineering Laboratory Solution Step 1. Deploy sensors (spies) among wireless nodes to eavesdrop data –We know the position of deployed sensors Nodes Nodes + Sensors

Iowa State University Department of Computer Science Software Engineering Laboratory Solution Step 1. (Continue) –The sensors only collect the time series of packet counts – E.g. [100,200,13] I got 100 packets during 0-10 seconds. I got 200 packets during seconds. I got 13 packets during the next 10 seconds. Control center

Iowa State University Department of Computer Science Software Engineering Laboratory Solution Step 2. Use Principal Component Analysis (PCA) to estimate node numbers in this area

Iowa State University Department of Computer Science Software Engineering Laboratory Principal Component Analysis (PCA) An important statistics technique 511 grade 531 grade Mike IQ 511 grade 531 grade The first (principal) component The second component

Iowa State University Department of Computer Science Software Engineering Laboratory Principal Component Analysis (PCA) This skill can be applied to 3 or more dimensional data

Iowa State University Department of Computer Science Software Engineering Laboratory What can we do with PCA? Suppose we draw a point for a time period... Packet # of Sensor 1 [x,x,13,x,x,…] Packet # of Sensor 2 Packet # of Sensor [x,x,8,x,x,…] [x,x,6,x,x,…] The red point represents the 3rd time period’s data. Its coordinate is (13,8,6)

Iowa State University Department of Computer Science Software Engineering Laboratory What can we do with PCA? Draw all points –Is there any hidden factor behind these data? There are 2 wireless nodes in this area !! Yes! There are 2 hidden factors which greatly affect the data !!

Iowa State University Department of Computer Science Software Engineering Laboratory Solution Step 2. Use Principal Component Analysis (PCA) to estimate node numbers in this area Step 3. Then use Blind Source Separation (BSS) to estimate the positions of nodes

Iowa State University Department of Computer Science Software Engineering Laboratory Blind Source Separation (BSS) BSS was originally developed to solve the cocktail party problem –Which can extract one person’s voice signal given a mixtures of voices at a cocktail party Hi Mike, how are you doing today? …So I went to HyVee yesterday.

Iowa State University Department of Computer Science Software Engineering Laboratory Nice property of BSS Get unmixed singles from mixed signals Suppose sensor 1 got : [5, 0, 1, 0, 1 ] –Apply BSS, we can get unmixed signals One is [3,0,0,0,0] – which might come from Node A One is [2,0,0,0,1] – which might come from Node B One is [0,0,1,0,0] – which might be noise Sensor 1 Node A Node B

Iowa State University Department of Computer Science Software Engineering Laboratory What can we do with BSS? Trick: We cut the whole area into many overlapped blocks 1

Iowa State University Department of Computer Science Software Engineering Laboratory What can we do with BSS? Trick: We cut the whole area into many overlapped blocks 2

Iowa State University Department of Computer Science Software Engineering Laboratory What can we do with BSS? Trick: We cut the whole area into many overlapped blocks 3

Iowa State University Department of Computer Science Software Engineering Laboratory What can we do with BSS? Trick: We cut the whole area into many overlapped blocks 4

Iowa State University Department of Computer Science Software Engineering Laboratory What can we do with BSS? Trick: We cut the whole area into many overlapped blocks This square belongs to 4 blocks

Iowa State University Department of Computer Science Software Engineering Laboratory What can we do with BSS? For each block, we apply BSS to get many separated signals [How are you]

Iowa State University Department of Computer Science Software Engineering Laboratory What can we do with BSS? For each block, we apply BSS to get many separated signals [How are you] [How or you] {Cab sin}

Iowa State University Department of Computer Science Software Engineering Laboratory What can we do with BSS? For each block, we apply BSS to get many separated signals [How are you] [How or you] {Cab sin} [How are youth]

Iowa State University Department of Computer Science Software Engineering Laboratory What can we do with BSS? For each block, we apply BSS to get many separated signals [How are you] [How or you] {Cab sin} [How are youth] [haha you]

Iowa State University Department of Computer Science Software Engineering Laboratory What can we do with BSS? Cluster the separated signals together based on similarity [How are you] [How or you] {Cab sin} [How are youth] [haha you] noise, ignore Cluster 1

Iowa State University Department of Computer Science Software Engineering Laboratory What can we do with BSS? By analyzing the overlap of signals, we can estimate the position of them. [How are you]

Iowa State University Department of Computer Science Software Engineering Laboratory Solution summary By PCA, we know that there are n nodes Cut whole area into many overlapped blocks Apply BSS in each block –Get many separated (unmixed) signals Cluster them together based on similarity Pick up n largest clusters Use overlap analysis to estimate the positions of nodes

Iowa State University Department of Computer Science Software Engineering Laboratory Discuss Good: –If the nodes are fixed, then it provides a cheap way to get their positions even though the data are perfectly encrypted Bad: –The nodes should be fixed –If nodes can manipulate signal power, the overlap analysis part will fail –It assume that the communications among sensors won’t affect normal data collecting

Iowa State University Department of Computer Science Software Engineering Laboratory Q & A