Mohamed Hauter CMPE 259 – Sensor Networks UCSC 1.

Slides:



Advertisements
Similar presentations
Numbers Treasure Hunt Following each question, click on the answer. If correct, the next page will load with a graphic first – these can be used to check.
Advertisements

1 A B C
1 ZonicBook/618EZ-Analyst Resonance Testing & Data Recording.
16-1 ©2006 Raj JainCSE574sWashington University in St. Louis Energy Management in Ad Hoc Wireless Networks Raj Jain Washington University in Saint Louis.
1 UNIT I (Contd..) High-Speed LANs. 2 Introduction Fast Ethernet and Gigabit Ethernet Fast Ethernet and Gigabit Ethernet Fibre Channel Fibre Channel High-speed.
AP STUDY SESSION 2.
1
Distributed Systems Architectures
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 10 User.
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 12 Cross-Layer.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 4 Computing Platforms.
Processes and Operating Systems
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 6 Author: Julia Richards and R. Scott Hawley.
Author: Julia Richards and R. Scott Hawley
Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.
UNITED NATIONS Shipment Details Report – January 2006.
RXQ Customer Enrollment Using a Registration Agent (RA) Process Flow Diagram (Move-In) Customer Supplier Customer authorizes Enrollment ( )
1 Hyades Command Routing Message flow and data translation.
David Burdett May 11, 2004 Package Binding for WS CDL.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination. Introduction to the Business.
Scalable Routing In Delay Tolerant Networks
1 RA I Sub-Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Casablanca, Morocco, 20 – 22 December 2005 Status of observing programmes in RA I.
Properties of Real Numbers CommutativeAssociativeDistributive Identity + × Inverse + ×
Custom Statutory Programs Chapter 3. Customary Statutory Programs and Titles 3-2 Objectives Add Local Statutory Programs Create Customer Application For.
CALENDAR.
1 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt BlendsDigraphsShort.
Chapter 5 Input/Output 5.1 Principles of I/O hardware
Chapter 6 File Systems 6.1 Files 6.2 Directories
Multipath Routing for Video Delivery over Bandwidth-Limited Networks S.-H. Gary Chan Jiancong Chen Department of Computer Science Hong Kong University.
1 Click here to End Presentation Software: Installation and Updates Internet Download CD release NACIS Updates.
Break Time Remaining 10:00.
Improving DRAM Performance by Parallelizing Refreshes with Accesses
Turing Machines.
Table 12.1: Cash Flows to a Cash and Carry Trading Strategy.
ATNAC 2010, Auckland, NZ By: Mohd Ezanee Rusli & Richard Harris An Adaptive Coordination Scheme for the Opportunistic.
PP Test Review Sections 6-1 to 6-6
Bright Futures Guidelines Priorities and Screening Tables
EIS Bridge Tool and Staging Tables September 1, 2009 Instructor: Way Poteat Slide: 1.
1 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. On the Capacity of Wireless CSMA/CA Multihop Networks Rafael Laufer and Leonard Kleinrock Bell.
Bellwork Do the following problem on a ½ sheet of paper and turn in.
CS 6143 COMPUTER ARCHITECTURE II SPRING 2014 ACM Principles and Practice of Parallel Programming, PPoPP, 2006 Panel Presentations Parallel Processing is.
IP Multicast Information management 2 Groep T Leuven – Information department 2/14 Agenda •Why IP Multicast ? •Multicast fundamentals •Intradomain.
Exarte Bezoek aan de Mediacampus Bachelor in de grafische en digitale media April 2014.
Chapter 20 Network Layer: Internet Protocol
Chapter 6 File Systems 6.1 Files 6.2 Directories
Copyright © 2012, Elsevier Inc. All rights Reserved. 1 Chapter 7 Modeling Structure with Blocks.
1 RA III - Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Buenos Aires, Argentina, 25 – 27 October 2006 Status of observing programmes in RA.
Basel-ICU-Journal Challenge18/20/ Basel-ICU-Journal Challenge8/20/2014.
1..
CONTROL VISION Set-up. Step 1 Step 2 Step 3 Step 5 Step 4.
Adding Up In Chunks.
1 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt Synthetic.
Subtraction: Adding UP
1 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit.
Analyzing Genes and Genomes
Speak Up for Safety Dr. Susan Strauss Harassment & Bullying Consultant November 9, 2012.
Essential Cell Biology
Converting a Fraction to %
Clock will move after 1 minute
PSSA Preparation.
Essential Cell Biology
Immunobiology: The Immune System in Health & Disease Sixth Edition
Physics for Scientists & Engineers, 3rd Edition
Energy Generation in Mitochondria and Chlorplasts
Select a time to count down from the clock above
Murach’s OS/390 and z/OS JCLChapter 16, Slide 1 © 2002, Mike Murach & Associates, Inc.
Sensor Network 教育部資通訊科技人才培育先導型計畫. 1.Introduction General Purpose  A wireless sensor network (WSN) is a wireless network using sensors to cooperatively.
Wireless Sensor Network Protocols Dr. Monir Hossen ECE, KUET Department of Electronics and Communication Engineering, KUET.
Presentation transcript:

Mohamed Hauter CMPE 259 – Sensor Networks UCSC 1

* Introduction * Objectives * Proposals and approaches * Related Work * Simulations and Results * Strengths and weaknesses 2

* An energy-efficient sensor network * Minimal number of sensor nodes in active mode * Increase the lifetime of the sensor network * Prevent connection degradation 3

* Terminology: * DPM: Dynamic Power Management * OGDC: Optimal Geographical Density Control * ACPI: Advanced Configuration and Power Interface 4

* Approach: * Tackle energy efficiency on all levels of the entire network * Dynamic power management = shutting down nodes when not needed and wake them up when necessary * Consideration of the state of components ( microprocessor, A/D converter, memory, transceiver, etc.) when making a decision to turn off a node 5

* Approach (continue): * Density control while maintaining: a. Coverage b. Connectivity * Localized density control algorithm 6

* Approach (continue): * Consideration of battery status and energy wasted in the process of node-awakening * Incorporate OGDC in the control logic 7

* Verity of DPM techniques * Dynamic Voltage Scaling * Dynamic Voltage and Frequency Scaling * Sentry based power management (application driven) * Software and operating system power management 8

* Weaknesses of traditional predictive techniques: * Cannot provide an accurate tradeoff between energy saving and performance degradation * Does not deal with systems in which requests can be queued 9

* Power aware sensor node model: * Node components: processor, memory, AD converter, and transceiver (radio) * Components of each node can be in different states: active, idle, or sleep * Different combinations of component power modes 10

11

* Sleep-state transition policy: * P = Power Consumption * t = Time of event * s = sleep state * Tau = transition mode 12

* System Parameters: 13

* 50x50 meters area of coverage * 100 nodes * Uniformly and randomly distributed * Nodes are capable of directly communicating with the host * Each nodes initial energy is 100 joules 14

15

Strengths: * An energy-efficient sensor network * Minimal number of sensor nodes in active mode * Increase the lifetime of the sensor network * Prevent connection degradation Weaknesses: *Analysis did not take latency into account * Events missed during deepest-sleep state * OGDC requires knowledge of nodes location (extra processing and memory overhead) 16

* Utilize natural sources of energy (solar, motion, vibration, etc.) to recharge nodes batteries * Employ energy-saving mechanisms * Determine the sleep and wake up probabilities of nodes using a bargaining game 17

18

1.Solar 2. Thermoelectric 3. Vibration Based 19

Two types of buffers: 1.Local buffer: gathers data collected locally (through sensors). 2. External buffer: gathers data from other nodes to be relayed. 20

To find the optimal path to deliver data packets while considering: 1. Energy level 2. Path length 3. Path reliability Avoid: 1. Idle listening 2. Overhearing 3. Packet collisions 21

Using Explicit Signaling: A node notifying the access point that it is going into power-saving (PS) mode Dual Channel MAC Protocols (Avoid Collisions): Signaling channel Data transmission channel 22

Lazy packet-scheduling scheme Determine beginning and duration of transmission Transmit at a low data rate Save energy Packet delay and reduced throughput Tradeoffs! 23

QoS vs. Energy Constrains Energy harvesting limitations Integration of energy harvesting techniques across layers 24

Radio modes: Active – 25mW Listen – 14mW Sleep – 0.01mW Channel and queue-aware strategy Radio - Listen when queue is empty Sensor – sleep when channel quality is bad 25

Players: Player 1: node Player 2: data receiving entity Strategy: Player 1: select wakeup probability when in sleep mode Player 2: select wakeup probability when in listen mode Payoff: Player 1: packet blocking probability Player 2: packet dropping probability 26

27

28

29

Strengths: 1. Energy efficient 2. Incorporates the states of different components of the network Weaknesses: 1. battery energy level is not taken into consideration when making a sleep/wakeup decisions 2. Data transmission delay – low data transmission rates 3. The assumption of one-hop routing model in which all nodes can reach the sink is not practical 30

* Prolong the lifetime of the network * Minimizing the data processing and communication costs * Employ multi-hop communications effectively 31

* LEACH: dividing the sensor network into cluster heads (CH) which can communicate with sinks and amongst themselves. Cluster Heads are constantly changing (random selection) to prevent draining its energy. * SOP: a tree of cluster heads is built using fixed nodes. * EDETA: builds a hierarchal tree among cluster heads to avoid direct communication with sink. 32

* HARP can save more energy by forming intra- cluster hierarchal architectures in conjunction with inter-cluster trees. * Leverage node mobility to enhance network performance in terms of coverage, lifetime, energy efficiency, and latency. 33

* Two hierarchal tree structure: 1. Between CHs and the sinks 2. Within the cluster * HARP has a local reconfiguration scheme in case of a failure * Supports more than one sink - scalability 34

35

36

37

38

* Causes of failure: * Battery depletion, node malfunction, multipath fading, low link quality, or node mobility. * Mechanisms; 1. The recovery slot 2. The substitute node 39

* Unlike the LEACH approach, HARP ensures that nodes all die at the same time * Solves the problem of the extra energy waste of CHs * CHs are randomly selected, unless new node has less energy than existing CH. 40

41

42

43

* Strengths: * Very high level of energy efficiency * Scalable design * Efficient Local recovery capability * Optimizes routing of both upstream and downstream traffic flows * Weakness: * Increased complexity in terms of resource scheduling and network topology management * Increased memory overhead 44

45