Watermarking in WSNs Anuj Nagar CS 590. Introduction WSNs provide computational and Internet interfaces to the physical world. They also pose a number.

Slides:



Advertisements
Similar presentations
S YSTEM -W IDE E NERGY M ANAGEMENT FOR R EAL -T IME T ASKS : L OWER B OUND AND A PPROXIMATION Xiliang Zhong and Cheng-Zhong Xu ICCAD 2006, ACM Trans. on.
Advertisements

Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Computer Science Dr. Peng NingCSC 774 Adv. Net. Security1 CSC 774 Advanced Network Security Topic 7.3 Secure and Resilient Location Discovery in Wireless.
Support Vector Machines
Manipulator’s Inverse kinematics
Enhancing Secrecy With Channel Knowledge
Packet Leashes: Defense Against Wormhole Attacks Authors: Yih-Chun Hu (CMU), Adrian Perrig (CMU), David Johnson (Rice)
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross Set 22 By Herbert I. Gross and Richard A. Medeiros next.
One-Shot Multi-Set Non-rigid Feature-Spatial Matching
3D Position Determination Hasti AhleHagh Professor. W.R. Michalson.
3D Geometry for Computer Graphics. 2 The plan today Least squares approach  General / Polynomial fitting  Linear systems of equations  Local polynomial.
Dealing with NP-Complete Problems
Approximation Algorithms
Computational Complexity of Approximate Area Minimization in Channel Routing PRESENTED BY: S. A. AHSAN RAJON Department of Computer Science and Engineering,
Sensor Node Architecture Issues Stefan Dulman
Visual Recognition Tutorial
Maximum Network lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Mihaela Cardei, Jie Wu, Mingming Lu, and Mohammad O. Pervaiz Department.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems
Collaborative Signal Processing CS 691 – Wireless Sensor Networks Mohammad Ali Salahuddin 04/22/03.
Computer Graphics Recitation The plan today Least squares approach  General / Polynomial fitting  Linear systems of equations  Local polynomial.
Calibration & Curve Fitting
1 Secure Cooperative MIMO Communications Under Active Compromised Nodes Liang Hong, McKenzie McNeal III, Wei Chen College of Engineering, Technology, and.
Lifetime and Coverage Guarantees Through Distributed Coordinate- Free Sensor Activation ACM MOBICOM 2009.
EM and expected complete log-likelihood Mixture of Experts
CS 3343: Analysis of Algorithms Lecture 21: Introduction to Graphs.
Topology aggregation and Multi-constraint QoS routing Presented by Almas Ansari.
ITGD4207 Operations Research
Department Of Industrial Engineering Duality And Sensitivity Analysis presented by: Taha Ben Omar Supervisor: Prof. Dr. Sahand Daneshvar.
Multi-hop-based Monte Carlo Localization for Mobile Sensor Networks
CHAPTER 7: Clustering Eick: K-Means and EM (modified Alpaydin transparencies and new transparencies added) Last updated: February 25, 2014.
1 Mobile-Assisted Localization in Wireless Sensor Networks Nissanka B.Priyantha, Hari Balakrishnan, Eric D. Demaine, Seth Teller IEEE INFOCOM 2005 March.
Week 10Complexity of Algorithms1 Hard Computational Problems Some computational problems are hard Despite a numerous attempts we do not know any efficient.
Copyright © Cengage Learning. All rights reserved. 17 Second-Order Differential Equations.
ECE 8443 – Pattern Recognition LECTURE 10: HETEROSCEDASTIC LINEAR DISCRIMINANT ANALYSIS AND INDEPENDENT COMPONENT ANALYSIS Objectives: Generalization of.
First topic: clustering and pattern recognition Marc Sobel.
Relative Accuracy based Location Estimation in Wireless Ad Hoc Sensor Networks May Wong 1 Demet Aksoy 2 1 Intel, Inc. 2 University of California, Davis.
A new Ad Hoc Positioning System 컴퓨터 공학과 오영준.
Vehicle Segmentation and Tracking From a Low-Angle Off-Axis Camera Neeraj K. Kanhere Committee members Dr. Stanley Birchfield Dr. Robert Schalkoff Dr.
A Passive Approach to Sensor Network Localization Rahul Biswas and Sebastian Thrun International Conference on Intelligent Robots and Systems 2004 Presented.
CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.
Computer Science 1 TinySeRSync: Secure and Resilient Time Synchronization in Wireless Sensor Networks Speaker: Sangwon Hyun Acknowledgement: Slides were.
A Logic of Partially Satisfied Constraints Nic Wilson Cork Constraint Computation Centre Computer Science, UCC.
COMP322/S2000/L281 Task Planning Three types of planning: l Gross Motion Planning concerns objects being moved from point A to point B without problems,
OR Chapter 8. General LP Problems Converting other forms to general LP problem : min c’x  - max (-c)’x   = by adding a nonnegative slack variable.
Robust Estimation With Sampling and Approximate Pre-Aggregation Author: Christopher Jermaine Presented by: Bill Eberle.
Cooperative Location- Sensing for Wireless Networks Authors : Haris Fretzagias Maria Papadopouli Presented by cychen IEEE International Conference on Pervasive.
CSE 589 Part V One of the symptoms of an approaching nervous breakdown is the belief that one’s work is terribly important. Bertrand Russell.
C. Savarese, J. Beutel, J. Rabaey; UC BerkeleyICASSP Locationing in Distributed Ad-hoc Wireless Sensor Networks Chris Savarese, Jan Beutel, Jan Rabaey.
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition LECTURE 12: Advanced Discriminant Analysis Objectives:
Aggregation and Secure Aggregation. Learning Objectives Understand why we need aggregation in WSNs Understand aggregation protocols in WSNs Understand.
Concepts and Realization of a Diagram Editor Generator Based on Hypergraph Transformation Author: Mark Minas Presenter: Song Gu.
Bell Ringer: Simplify each expression
Submitted by: Sounak Paul Computer Science & Engineering 4 th Year, 7 th semester Roll No:
HCRL: A Hop-Count-Ratio based Localization in Wireless Sensor Networks Sungwon Yang, Jiyoung Yi and Hojung Cha Department of Computer Science, Yonsei University,
Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
R. Kass/W03 P416 Lecture 5 l Suppose we are trying to measure the true value of some quantity (x T ). u We make repeated measurements of this quantity.
Computacion Inteligente Least-Square Methods for System Identification.
Wireless Sensor Network: A Promising Approach for Distributed Sensing Tasks.
11/25/03 3D Model Acquisition by Tracking 2D Wireframes Presenter: Jing Han Shiau M. Brown, T. Drummond and R. Cipolla Department of Engineering University.
SAT/ACT MATH UNIT 10 Equation with More Than One Variable.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Real-Time Watermarking Techniques for Sensor Networks 4th, December Tae woo Oh Jessica Feng, Miodrag Potkonjak Dept. of Computer Science Univ. of California.
LECTURE 11: Advanced Discriminant Analysis
Task: It is necessary to choose the most suitable variant from some set of objects by those or other criteria.
کاربرد نگاشت با حفظ تنکی در شناسایی چهره
CS 3343: Analysis of Algorithms
Numerical Analysis Lecture 37.
for Vision-Based Navigation
Information Theoretical Analysis of Digital Watermarking
Presentation transcript:

Watermarking in WSNs Anuj Nagar CS 590

Introduction WSNs provide computational and Internet interfaces to the physical world. They also pose a number of important security issues – Digital Rights Management. Current techniques for achieving authentication consume too much power.

Watermarking in WSNs Key idea is to impose additional constraints during acquisition or processing of data. Constraints selected to provide a suitable tradeoff between accuracy of sensing process and the strength of proof of the authorship.

Watermarking in WSNs - continued Embedding the signature into processing data: –Modulate by imposing additional constraints on parameters that define sensor relationship with the physical world. –E.g. Location and orientation of sensor, time management(freq. and phase between data capturing), resolution and intentional addition of obstacles.

Watermarking in WSNs - continued Embed signature during data processing: –Atleast three degrees of freedom that can be exploited: error minimization procedures and solving computationally intractable problems. –In the first scenario, there are usually a large number of solutions that have similar level of error. The task is to choose one that maintains the maximal consistency in measured data and also –contains strong strength of the signature. –Typical examples of this type of tasks are location discovery and tracking.

Watermarking in WSNs - continued –In the second scenario, we add additional constraints during the model building of the physical world. –In the final scenario, since we are dealing with the NP-complete problems, and therefore it is impossible to find the provably optimal solution. –Therefore, the goal here is to find a high quality solution that also has convincing strength of the signature.

Embedding Watermarks During Atomic Trilateration Process Atomic trilateration is a widely used basic algorithmic block for location discovery that can be formulated in the following way. Problem: There are four sensors: A, B, C, and D. Sensors A, B, and C know their locations in terms of x and y coordinates. The distances between themselves and node D are measured with a certain level of accuracy and are reported by A, B, and C. Goal: The objective is to discover the location of sensor D in term of its x and y coordinates.

Embedding Watermarks During Atomic Trilateration Process

Known values: (Ax, Ay), (Bx, By), (Cx, Cy), MAD, MBD, MCD where (Ax, Ay), (Bx, By), (Cx, Cy) are the x and y coordinates of sensor node A, B and C respectively. MAD, MBD, MCD are the measured distances from A to D, B to D and C to D respectively. Unknown variables: (Dx, Dy); that are components of the location of sensor node D that it suppose to conclude from the measured distances from all other three nodes to itself.

Embedding Watermarks During Atomic Trilateration Process Possible ways to achieve maximum consistency:

Embedding Watermarks During Atomic Trilateration Process Assigning weights:

Generic procedure for a watermark

Conclusion While there is work going on in this area it is still a very much open field. This is partly due to the fact that there isn’t a standard watermarking procedure for WSNs yet.