Power Efficient System for Sensor Networks S Coleri

Power Efficient System for Sensor Networks S. Coleri, A. Puri and P. Varaiya UC Berkeley Eighth IEEE International Symposium on Computers and Communications (ISCC’ 03) PEDS Seminar Presenter – Bob Kinicki PEDS September 18, 2006 Power Efficient System for Sensor Networks 1

Outline • • • Introduction to Wireless Sensor Networks Previous Work The Berkeley System Simulation Results Conclusions PEDS September 18, 2006 Power Efficient System for Sensor Networks 2

Wireless Sensor Networks • Sensors – small devices with low-power transmissions and energy limitations (e. g. , battery lifetime concerns) • The main distinction from traditional wireless networks is that the data traffic originates at the sensor node and is sent ‘upstream’ towards the access point (AP) that collects the data. • While the nature of data collection at the sensor is likely to be event driven, for robustness, the generation of sensor packets should be periodic if possible. PEDS September 18, 2006 Power Efficient System for Sensor Networks 3

Power Consumption Components • Primary source of power consumption is the radio – transmitting, receiving and listening. • Key tenet of this paper: Sensor nodes must only be awake to receive packets destined to themselves or to transmit. At all other times, the sensors need to sleep to conserve power. PEDS September 18, 2006 Power Efficient System for Sensor Networks 4

The Goal A system for sensor networks that achieves power efficiency in a robust and adaptive manner. PEDS September 18, 2006 Power Efficient System for Sensor Networks 5

Previous Work – Contention Based • A separate wake-up radio (channel) to power up and down the normal channel • The key idea is that the wake-up listen mode is ultra-low power. • Uses a wake-up beacon. • S-MAC (sensor MAC) • Uses RTS/CTS such that “interfering” node goes to sleep upon “overhearing” either an RTS or CTS. • Problems Here? ? PEDS September 18, 2006 Power Efficient System for Sensor Networks 6

Previous Work – Contention Based • STEM (Sparse Topology and Energy Management) trades energy savings for latency through listen/sleep modes. – Uses a separate paging channel. – Sending node must first poll the target node by sending a wakeup message over the paging channel. – Target receiving node would then turn on primary radio channel to receive regular transmission. – This scheme prevents collisions between polling and data transmissions. – This scheme is effective only for sensor scenarios where the sensor spends most of its time waiting for events to happen! PEDS September 18, 2006 Power Efficient System for Sensor Networks 7

Previous Work – TDMA Based • TDMA schemes eliminate overhearing, collisions and idle listening. • However, proposed TDMA schemes require dealing with communication “clusters”. • One solution – a high power AP that can accomplish all the TDMA scheduling. PEDS September 18, 2006 Power Efficient System for Sensor Networks 8

The Berkeley System AP AP sensor Multiple hop tree topology sensor PEDS September 18, 2006 AP sensor sensor Power Efficient System for Sensor Networks 9

The Berkeley System AP AP sensor AP range sensor Sensor range sensor PEDS September 18, 2006 sensor sensor Power Efficient System for Sensor Networks 10

Sensor Hardware • UCB Mica motes – Support adjusting transmission power – Sensors run on AA batteries that can supply 2200 m. Ah at 3 V. PEDS September 18, 2006 Power Efficient System for Sensor Networks 11

Three Transmission Ranges 1. Long – used for coordination AP frames and reaches all the sensors in one hop. 2. Short – used to transmit data packets from sensor nodes to the AP. • Key idea: choose the lowest possible range that still assures network connectivity. 3. Medium – used in tree construction to learn the interferers of each sensor node, namely, nodes with signal strength too weak to be decoded but strong enough to interfere. PEDS September 18, 2006 Power Efficient System for Sensor Networks 12

Three Communication Phases • Topology Learning Phase • Topology Collecting Phase • Scheduling Phase PEDS September 18, 2006 Power Efficient System for Sensor Networks 13

Topology Learning Phase • During this phase each node identifies interferers, neighbors and parent. • AP transmits the topology learning packet [ current time, incoming packet time] over longest range in one hop to all sensor nodes the AP will coordinate. • AP floods the tree construction packet [hop count] over the medium range. PEDS September 18, 2006 Power Efficient System for Sensor Networks 14

Topology Learning Phase • Random access scheme is used with an interfering threshold to decide on neighbors, interferers and the parent on the smallest hop path to the AP. PEDS September 18, 2006 Power Efficient System for Sensor Networks 15

Topology Collection Phase • By the end of this phase, the AP has received complete topology information. • AP transmits the topology collection packet [ current time, incoming packet time] over the longest range at the announced time. • Each node transmits topology packet [parent, neighbors, interferers]. Vague scheme used is CSMA with implicit ACK. PEDS September 18, 2006 Power Efficient System for Sensor Networks 16

Scheduling Phase • Sensor node transmissions are explicitly scheduled by AP based on complete topology information. • The AP announces the TDMA schedule by sending the time-slotted scheduling packet [current time, incoming packet time] by broadcasting over the longest range. • Scheduling algorithm can vary. • Using a threshold for percentage of successfully scheduled sensor nodes, the idea is to keep the system in the scheduling phase until the percentage falls below the threshold where upon the system will switch to the learning phase. • High performance comes when the ratio of scheduling phases to the other two phases is high. PEDS September 18, 2006 Power Efficient System for Sensor Networks 17

Simulations • Used TOSSIM, a Tiny. OS simulator. • Nodes are randomly distributed in circular area. • Transmission rate = 50 kbps • 10 Monte Carlo Simulations • Best possible random access result reached by adjusting CSMA listening window sizes and the backoff settings. PEDS September 18, 2006 Power Efficient System for Sensor Networks 18

Power Consumption Comparisons • Assumptions: – Clock interrupt every millisecond (1 ms. ) – Sensor sampled once per packet generation period (30 seconds). PEDS September 18, 2006 Power Efficient System for Sensor Networks 19

Random Access versus TDMA Battery Lifetimes Random access – 10 days Berkeley TDMA scheme – 2 years PEDS September 18, 2006 Power Efficient System for Sensor Networks 20

Random Access versus TDMA • Listening takes power! • Random access yields retransmissions. • Overhearing affects reception power. PEDS September 18, 2006 Power Efficient System for Sensor Networks 21

Varying Sensor Sampling Rates The slope is less than one due to the high power cost associated with clock interrupts. PEDS September 18, 2006 Power Efficient System for Sensor Networks 22

Redundant Sensor Nodes The important assumption with redundant sensor nodes and TDMA is that sharing of the scheduled slot allows redundant not-scheduled nodes to reduce their clocking rate and then increase it back during the last part of the packet generation period. PEDS September 18, 2006 Power Efficient System for Sensor Networks 23

Conclusions • IF Access Point is not power –limited then asymmetric transmission power between AP and sensor nodes is a good idea. • Base on ONLY simulations, the Berkeley System with TDMA consumes much less power compared to random access. • Redundant sensor groups also has potential to save sensor power in the Berkeley System. PEDS September 18, 2006 Power Efficient System for Sensor Networks 24