EECS 122 University of California Berkeley Potential Applications Examples of Nodes Architecture Issues Protocols Early Ideas Summary EECS122 Contents Index SENSORS Slide from D Estrin Micro sensors onboard processing and wireless interfaces all feasible at very small scale Seismic Structure response Marine Microorganisms EECS122 Contents Index can monitor phenomena up close Will enable spatially and temporally dense environmental monitoring Embedded Networked Sensing will reveal previously unobservable phenomena SENSORS Applications Contaminant Transport Ecosystems Biocomplexity Slide from D Estrin Middleware Framework Network Sensor Sensor Speech Database Management Management Fusion Recognizer Data Miner WLAN Access Wired Network Point High speed Wireless LAN WLAN WLAN Piconet WLAN Piconet Bridge Bridge Piconet Sensors Modules Piconet Sensor Badge Networked Toys Disaster Response EECS122 Contents Index SENSORS Applications Slide from Mani Srivastava Rockwell Hidra 3 5 x3 5 x3 StrongARM 1100 processor 133 MHz Connexant s RDSSS9M Radio 100 kbps 1 100 mW 40 channels Various sensors on factory floor machinery Monitor Vibrations temperature etc http wins rsc rockwell com EECS122 Contents Index Berkeley Motes Atmel microcontroller temperature light humidity pressure 3 axis magnetometers 3 axis accelerometers 10kbps 20m SENSORS Nodes Slide from Mani Srivastava UCLA iBadge Wearable Sensor Badge acoustic in out DSP temperature pressure humidity magnetometer accelerometer ultrasound localization orientation via magnetometer and accelerometer bluetooth radio Sylph Middleware EECS122 Contents Index UCLA Medusa Localizer Node 40MHz ARM THUMB 1MB FLASH 136KB RAM 0 9MIPS MHz 480MIPS W RS 485 bus Out of band data collection formation of arrays 540mAh Rechargeable Li Ion battery SENSORS Nodes BWRC s PicoNode TripWire Sensor Node Slide from Jan Rabaey Solar Cell PCB 1 Battery 3 6 0 5 mm mm mm 3c Chip encapsulation 1 5 mm 7 6 5c mm m m Version 1 Light Powered Components and battery mounted on back Version 2 Vibration Powered EECS122 Contents Index SENSORS Nodes Slide from Mani Srivastava IPaq Sensor Node 5 66 0 8 0 1 01 23 4 0 1 27 10 0 80 0 0 EECS122 Contents Index 0 0 SENSORS Nodes 9 0 0 9 Sensor Network architecture A Survey on Sensor Networks I Akyildiz W Su Y Sankarasubramaniam and E Cayirci IEEE Comm Magazine August ANSI IEEE Std 802 11 1999 Edition EECS122 Contents Index Key tasks performed by Sensor Nodes Sensing Data Processing Communication Networking is a distinguishing feature A Survey on Sensor Networks I Akyildiz W Su Y Sankarasubramaniam and E Cayirci IEEE Comm Magazine August ANSI IEEE Std 802 11 1999 Edition EECS122 Contents Index Differences between Sensor Networks and traditional Mobile Ad Hoc Networks MANETs Much lager number of nodes Dense deployment Limited in power Mainly use broadcast paradigm Higher failure rate No global identifiers EECS122 Contents Index Low Power special protocols Ex Wake up periodic sleep Small Memory specialized code Ex TinyOS Sylph Localization GPS triangulation Synchronization GPS NTP Addressing Naming Location based Function based Directory Hash Routing Broadcast multicast anycast mobility Transport Intermittent connectivity noisy links error tolerance Observation Protocols should be application specific not generic EECS122 Contents Index SENSORS Issues Slide from D Estrin User Queries External Database Resource constraints call for more tightly integrated layers In network Application processing Data aggregation Query processing Open Question Data dissemination storage caching Can we define an Internet like architecture for such applicationspecific systems Adaptive topology Geo Routing MAC Time Location Phy comm sensing actuation SP EECS122 Contents Index SENSORS Protocols Slide from D Estrin Spatial and Temporal Scale Extent Spatial Density of sensors relative to stimulus Data rate of stimulii Variability Ad hoc vs engineered system structure System task variability Mobility variability in space Frequency spatial and temporal density of events Locality spatial temporal correlation Mobility Rate and pattern Efficiency System lifetime System resources Resolution Fidelity Detection Identification Latency Response time Robustness Vulnerability to node failure and environmental dynamics Autonomy Multiple sensor modalities Computational model complexity Scalability Resource constraints Over space and time Energy BW Storage Computation EECS122 Contents Index SENSORS Protocols Routing Finding Energy Location Most slides from D Estrin EECS122 Contents Index SENSORS Ideas Special Features in Sensor Networks Event and Query Find data somewhere in network Broadcast a request Collect data from all nodes Examples of routing algorithms Grab Gossip Ant Directed Diffusion Data Centric Rumor EECS122 Contents Index SENSORS Ideas Routing 00 PA Power Available at a node i Energy used to transmit over link i Energy efficient routing Maximum PA route SinkA B C T Minimum energy route Sink A B T Minimum hop route SinkD T Maximum minimum PA node route Sink D T A Survey on Sensor Networks I Akyildiz W Su Y Sankarasubramaniam and E Cayirci IEEE Comm Magazine August ANSI IEEE Std 802 11 1999 Edition EECS122 Contents Index 1 2 31 24 Builds a cost field toward a particular node then reliably routing queries across a limited size mesh toward that node Overhead of network flood Queries route along short paths Delivered cheaply and reliably Not designed specifically to support in network processing EECS122 Contents Index SENSORS Ideas Routing Grab 1 Nodes flood by sending message to some of neighbors By the redundancy in the link most nodes receive the flooded packed Used to deliver query or flood events Less overhead than conventional flooding Not be designed specifically for energy constrained contexts EECS122 Contents Index SENSORS Ideas Routing Gossip Agent traverses the network encoding the quality of the path they have traveled and leave the encoded path as state in the nodes At every node an agent picks its next hop probabilistically biased toward already known good paths Very effective in dealing with failure because always some amount of exploration EECS122 Contents Index SENSORS Ideas Routing Ant 00 1 5 Provides a mechanism for doing a limited flooding of a query toward the event Set reverse gradients to send data back along the best route Results in high quality paths But requires an initial flooding of the query for exploration EECS122 Contents Index SENSORS Ideas
View Full Document