Sniper Detection Using Wireless Sensor Networks

Slides:



Advertisements
Similar presentations
Christoph Lenzen Philipp Sommer Philipp Sommer Roger Wattenhofer Roger Wattenhofer Optimal Clock Synchronization in Networks.
Advertisements

The Flooding Time Synchronization Protocol
Gradient Clock Synchronization in Wireless Sensor Networks
HIERARCHY REFERENCING TIME SYNCHRONIZATION PROTOCOL Prepared by : Sunny Kr. Lohani, Roll – 16 Sem – 7, Dept. of Comp. Sc. & Engg.
Wireless Sensor Networks Clock Synchronization Professor Jack Stankovic University of Virginia.
Cisco S3 C5 Routing Protocols. Network Design Characteristics Reliable – provides mechanisms for error detection and correction Connectivity – incorporate.
1 Pattern-Oriented Composition and Synthesis of Middleware Services for NEST PI: Akos Ledeczi – Miklos Maroti – Ken Frampton Affiliation: Vanderbilt University.
PERFORMANCE MEASUREMENTS OF WIRELESS SENSOR NETWORKS Gizem ERDOĞAN.
1 Sniper Detection Using Wireless Sensor Networks Joe Brassard Wing Siu EE-194WIR: Wireless Sensor Networks Presentation #1: February 10, 2005.
Sensor Network-Based Countersniper System Gyula S, Gyorgy B, Gabor P, Miklos M, Branislav K, Janos S, Akos L, Andras N, Ken F Presented by Vikram Reddy.
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
Incremental Network Programming for Wireless Sensors NEST Retreat June 3 rd, 2004 Jaein Jeong UC Berkeley, EECS Introduction Background – Mechanisms of.
Time Synchronization (RBS, Elson et al.) Presenter: Peter Sibley.
He Huang Introduction:The Flooding Time Synchronization Protocol.
The Flooding Time Synchronization Protocol
Time Synchronization Murat Demirbas SUNY Buffalo.
Generic Sensor Platform for Networked Sensors Haywood Ho.
Security in Wireless Sensor Networks Perrig, Stankovic, Wagner Jason Buckingham CSCI 7143: Secure Sensor Networks August 31, 2004.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 13th Lecture Christian Schindelhauer.
TPS: A Time-Based Positioning Scheme for outdoor Wireless Sensor Networks Authors: Xiuzhen Cheng, Andrew Thaeler, Guoliang Xue, Dechang Chen From IEEE.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Sensor Network Design Akos Ledeczi ISIS, Vanderbilt University.
A Transmission Control Scheme for Media Access in Sensor Networks Alec Woo, David Culler (University of California, Berkeley) Special thanks to Wei Ye.
On the Energy Efficient Design of Wireless Sensor Networks Tariq M. Jadoon, PhD Department of Computer Science Lahore University of Management Sciences.
Network Topologies.
Copyright © Vanderbilt University Dr. Akos Ledeczi Institute for Software Integrated Systems Vanderbilt University Network Embedded Systems Technology.
Timing-sync Protocol for Sensor Networks (TPSN) Presenter: Ke Gao Instructor: Yingshu Li.
Routing Algorithms (Ch5 of Computer Network by A. Tanenbaum)
Secure Local Data Aggregation and Delay Tolerant Dissemination in VANETs.
DESIGN & IMPLEMENTATION OF SMALL SCALE WIRELESS SENSOR NETWORK
CS450 Network Embedded Sensing Systems Week 11: Time Synchronization and Reconstruction Jayant Gupchup.
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha.
Introduction to Sensor Networks Rabie A. Ramadan, PhD Cairo University 3.
1 Pattern-Oriented Composition and Synthesis of Middleware Services for NEST PI: Akos Ledeczi – Ken Frampton Affiliation: Vanderbilt University.
Adaptive Control-Based Clock Synchronization in Wireless Sensor Networks Kasım Sinan YILDIRIM *, Ruggero CARLI +, Luca SCHENATO + * Department of Computer.
Routing Protocol Evaluation David Holmer
Ubiquitous Networks WSN Routing Protocols Lynn Choi Korea University.
Clock Synchronization in Sensor Networks for Civil Security Farnaz Moradi Asrin Javaheri.
Crowd Management System A presentation by Abhinav Golas Mohit Rajani Nilay Vaish Pulkit Gambhir.
Scalable and Fully Distributed Localization With Mere Connectivity.
Overview of Sensor Networks David Culler Deborah Estrin Mani Srivastava.
Communication Paradigm for Sensor Networks Sensor Networks Sensor Networks Directed Diffusion Directed Diffusion SPIN SPIN Ishan Banerjee
Wireless Sensor Networks Nov 1, 2006 Jeon Bokgyun
Time synchronization for UWSN. Outline Time synchronization knowledge Typical time sync protocol Time sync in UWSN Discussion.
Topic 2: Communications (Short Lecture) Jorge J. Gómez.
1 Sniper Detection Using Wireless Sensor Networks Joe Brassard Wing Siu EE-194WIR: Wireless Sensor Networks Presentation #3: March 17, 2005.
Computer Science 1 TinySeRSync: Secure and Resilient Time Synchronization in Wireless Sensor Networks Speaker: Sangwon Hyun Acknowledgement: Slides were.
1 Sniper Detection Using Wireless Sensor Networks Joe Brassard Wing Siu EE-194WIR: Wireless Sensor Networks Presentation #4: April 14th, 2005.
Dec 8 th, RTSS 2004, Presented by Ajay TirumalaPower Point created by Qixin Wang and Ajay Tirumala Lightning: A fast and lightweight acoustic localization.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Time Synchronization Protocols in Wireless Sensor Networks.
1 Copyright © 2004 Vanderbilt University Sensor Network-Based Countersniper System Akos Ledeczi Senior Research Scientist Institute for Software Integrated.
1 Order Reconstruction and Data Integrity Testing of Sensor Network Data Matthias Keller, ETH Zürich MICS Workshop,
Computer Science 1 Using Clustering Information for Sensor Network Localization Haowen Chan, Mark Luk, and Adrian Perrig Carnegie Mellon University
Aggregation and Secure Aggregation. Learning Objectives Understand why we need aggregation in WSNs Understand aggregation protocols in WSNs Understand.
Global Clock Synchronization in Sensor Networks Qun Li, Member, IEEE, and Daniela Rus, Member, IEEE IEEE Transactions on Computers 2006 Chien-Ku Lai.
Using Ant Agents to Combine Reactive and Proactive strategies for Routing in Mobile Ad Hoc Networks Fredrick Ducatelle, Gianni di caro, and Luca Maria.
Aggregation and Secure Aggregation. [Aggre_1] Section 12 Why do we need Aggregation? Sensor networks – Event-based Systems Example Query: –What is the.
EmStar: A Software Environment for Developing and Deploying Wireless Sensor Networks CENS Research Review October 28, 2005 UCLA CENS EmStar Team.
Experimental Ranging With Mica2 Motes M. Allen, E. Gaura, R. Newman, S. Mount Cogent Computing, Coventry University The experimental work here makes use.
Routing Semester 2, Chapter 11. Routing Routing Basics Distance Vector Routing Link-State Routing Comparisons of Routing Protocols.
Luis E. Palafox and J.Antonio Garcia-Macias CICESE – Research Center 2009 Proceedings of the 4 th international conference on Wireless pervasive computing.
Distributed Computing
Clock Synchronization
Research: algorithmic solutions for networking
Ajay Vyasapeetam Brijesh Shetty Karol Gryczynski
Protocols.
Aggregation.
Overview: Chapter 4 Infrastructure Establishment
Protocols.
Presentation transcript:

Sniper Detection Using Wireless Sensor Networks Joe Brassard Wing Siu EE-194WIR: Wireless Sensor Networks Presentation #2: March 1st, 2005

Presentation “Bullet” Points To examine wireless sensor networks at an application level, as opposed to only low-level discussion To learn about the BBN “Boomerang” and “Bullet Ears” detection systems To introduce the “PinPtr” system by Vanderbilt University, including a system-level explanation of the sensor network Went over peer comments – our goal is to have an application-level overview of wireless sensor networks. We feel that this is important because we often do not cover applications in detail. Also, since many projects here are low level in nature, we feel it would be a good change of pace in this class. Our goal for this presentation is to give an introduction to two systems: BBN and their Boomerang and Bullet Ears systems PinPtr We will do more low level discussion in the third presentation, so stay tuned if you have questions on that

Applications Numerous systems exist in various stages of deployments BBN Boomerang system is currently deployed in Iraq As mentioned in presentation 1, there is a definite need for sniper detection systems in the world today Iraq and Boomerang

BBN Boomerang Uses Humvee-mounted tetrahedral arrays to sense muzzle blast and shockwave Eventual system deployment will be fully wireless, allowing every commander in Baghdad to be aware of any sniper attacks, anywhere in the city Modified version of the “Bullet Ears” system As an (re) introduction to counter-sniper systems, we’ll show this BBN promotional video on the Boomerang system, which is currently in use in Iraq Boomerang is a production version of the Bullet Ears system, which we will study briefly in the next slides Show video here

“Bullet Ears” Developed in 1996 as part of a DARPA contract Several versions for multiple scenarios Hardwired RF Wearable In 1996, DARPA provided funding to several organizations to develop a sniper detection system How system works One such system: BBN Bullet Ears

Possible Scenarios Designed to be able to handle multiple scenarios in different modes Area protection and monitoring: Sensors most likely stay stationary. Can leave them wired if desired. Convey/motorcade protection: Sensors are moving, but in a predicable fashion. Need wireless, but maybe not as complicated as GPS. Field operations: Sensor locations is dynamic, use GPS.

BBN’s Issues Data Flexibility Might get too much or might not get enough Flexibility Easy to reconfigure, upgrade, setup Some of the primary issues that BBN had to deal with were: Data handling: Singular implementations have to deal with lots of data, requiring high bandwidth. Must be high precision. On the other hand, could have communications malfunction, blocked sensors, etc. What happens if there isn’t enough data?

Data Solutions Spatially distributed system Flexible algorithm Wider area of coverage Less bandwidth (< 8kHz bandwidth) Localized processing Flexible algorithm If more data is received, more information can be determined If not, determine as much as possible The spatially distributed system spreads out the burden of gathering all the data to multiple sensors. This gives the advantage of a wider area of coverage, lesser bandwidth and processing requirements, and the ability to “filter” some of the data at the node, reducing the load at the server (500kB reduces to 1kB). Designed algorithm to be flexible: If muzzle blast and shockwave data are available, can determine a whole realm of information, including exact location. If not, not a big deal, can still give general location

Flexibility Solutions Use all COTS components Allows integration with other components Uses Commercial Off the Shelf products – Pentium laptops, 2.4GHz LANs, etc. Proposal for portable system allows helmet mounted displays, integration with standard helmets, etc.

“PinPtr” By Vanderbilt Ad-Hoc Network Accuracy within 1m, Latency < 2 seconds

PinPtr in Action Overhead sensor layout for shooter localization 3D model of same shooter location On left, Red dot is shooter and big green circles are activated sensors…green dots are sensors that did not activate On right, red sphere is shooter and light blue spheres are activated sensors….dark blue is sensor that does not activate

Technical Data 50 Mica2 motes with customized sensor board Timestamp of shockwave/muzzle blast sent to board Motes send TOA data to base station Read Mica line then: Mica mote has a microcontroller, 4kb Data memory, and a ChicCon radio Additional sensor board- 3 microphones High speed AD converters FPGA for signal processing as shockwave and muzzle blasts are detected on-board Uses two AA batteries After reading TOA: Base station fuses data, and estimates shooter posiiton Leads us to Middleware services to be discussed: Time Synchronization, message routing

Flooding Time Synch Protocol (FTSP) Requirements: Sound travels at one foot per millisecond Time Synchronization error in entire network must be < 1msec Algorithm: Each node has separate global and local time Simple integrated leader election Network global time is synchronized to leader’s local time Message is time stamped in the radio stack Receivers update global time and rebroadcast it Motes keep last 10 local and global time pairs and perform linear regression If leader is lost, new leader is elected Time Synch disscussion for now is bullet points, basic concepts

Flooding Time Synch Protocl (FTSP), Continued Performance: Constant network load: 1 message per 30 seconds per mote Topology change tolerate: motes can move at speeds less than 1 hop per 30 seconds End-to-end accuracy: Average 1.6us per hop

Directed Flood Routing Framework (DFRF) Requirements: Acoustic events trigger many motes at once All need to get data to base station with low latency Mote bandwidth: 20-25 messages per second Flooding Policy: Defines the meaning of “rank” Controls the flooding and retransmission Application: Can change the packet on the way Can drop the packet on the way

Directed Flood Routing Framework (DFRF), Continued Ad-hoc routing Automatic aggregation Implicit acknowledgements Configurable flooding policy Defines gradient Controls retransmission Converge cast to root Table/cache management Very low overhead When max distance from root is 5, base station receives ~15 measurements in the first second Skip if running out of time: Flooding Policy: Defines the meaning of “rank” Controls the flooding and retransmission Application: Can change the packet on the way Can drop the packet on the way When max distance from root is 5, base station receives ~15 measurements in the first second

Directed Flood Routing Framework (DFRF), Continued Data Packet: Fixed length Appid + “rank” = 3 bytes Must contain a unique part Skip this if running out of time

RITS: Routing Integrated Time Synch Combination of Time Synch and Message Routing No extra messages “Stealth” operation Uses time stamping module that has 1.4us average precision per hop No clock skew estimation Precision depends on the hop count of the route and on the total routing time Plug-in replacement for the DFRF

For Next Time In-depth, low-level analysis of Time Synchronization (FTSP) and Message Routing (DFRF) Detailed performance results and observations of the PinPtr sniper-detection system

References Ledeczi, et. al. “Sensor Network Based Counter Sniper System” (Vanderbilt) Ledeczi, et. al. “Network Embedded Systems Technology (NEST) – Shooter Localization” (Vanderbilt) Ledeczi, et. Al. “Pattern-Oriented Composition and Synthesis of Middleware Services for NEST” (Vanderbilt) www.bbn.com (BBN Technologies, Inc.)