A Remote Code Update Mechanism for Wireless Sensor Networks Thanos Stathopoulos, John Heidemann and Deborah Estrin CEG 790 Presentation By: Trevor Smith.

Slides:



Advertisements
Similar presentations
Advisor : Prof. Yu-Chee Tseng Student : Yi-Chen Lu 12009/06/26.
Advertisements

1 S4: Small State and Small Stretch Routing for Large Wireless Sensor Networks Yun Mao 2, Feng Wang 1, Lili Qiu 1, Simon S. Lam 1, Jonathan M. Smith 2.
Directed Diffusion for Wireless Sensor Networking
Optimal Jamming Attacks and Network Defense Policies in Wireless Sensor Networks Mingyan Li, Iordanis Koutsopoulos, Radha Poovendran (InfoComm ’07) Presented.
An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Network
S-MAC Sensor Medium Access Control Protocol An Energy Efficient MAC protocol for Wireless Sensor Networks.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Investigating Mac Power Consumption in Wireless Sensor Network
Leveraging IP for Sensor Network Deployment Simon Duquennoy, Niklas Wirstrom, Nicolas Tsiftes, Adam Dunkels Swedish Institute of Computer Science Presenter.
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Transport Protocols.
Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz.
PEDS September 18, 2006 Power Efficient System for Sensor Networks1 S. Coleri, A. Puri and P. Varaiya UC Berkeley Eighth IEEE International Symposium on.
Random Access MAC for Efficient Broadcast Support in Ad Hoc Networks Ken Tang, Mario Gerla Computer Science Department University of California, Los Angeles.
DTNLite: Reliable Data Delivery in Sensornets Rabin Patra and Sergiu Nedevschi UCB Nest Retreat 2004.
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
Multihop Over the Air Programming Thanos Stathopoulos LECS Lab, UCLA.
CS 599 Intelligent Embedded Systems1 Adaptive Protocols for Information Dissemination in Wireless Sensor Networks W.R.Heinzelman, J.kulik, H.Balakrishnan.
1 Ultra-Low Duty Cycle MAC with Scheduled Channel Polling Wei Ye Fabio Silva John Heidemann Presented by: Ronak Bhuta Date: 4 th December 2007.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Adaptive Self-Configuring Sensor Network Topologies ns-2 simulation & performance analysis Zhenghua Fu Ben Greenstein Petros Zerfos.
1 A Novel Mechanism for Flooding Based Route Discovery in Ad hoc Networks Jian Li and Prasant Mohapatra Networks Lab, UC Davis.
A Cross Layer Approach for Power Heterogeneous Ad hoc Networks Vasudev Shah and Srikanth Krishnamurthy ICDCS 2005.
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha Presented by Ray Lam Oct 23, 2004.
MAC Reliable Broadcast in Ad Hoc Networks Ken Tang, Mario Gerla University of California, Los Angeles (ktang,
1 Semester 2 Module 10 Intermediate TCP/IP Yuda college of business James Chen
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha.
Securing Every Bit: Authenticated Broadcast in Wireless Networks Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zarko Milosevic, and Calvin Newport.
Secure Cell Relay Routing Protocol for Sensor Networks Xiaojiang Du, Fengiing Lin Department of Computer Science North Dakota State University 24th IEEE.
2008/2/191 Customizing a Geographical Routing Protocol for Wireless Sensor Networks Proceedings of the th International Conference on Information.
BMAC - Versatile Low Power Media Access for Wireless Sensor Networks.
Power Save Mechanisms for Multi-Hop Wireless Networks Matthew J. Miller and Nitin H. Vaidya University of Illinois at Urbana-Champaign BROADNETS October.
Switching breaks up large collision domains into smaller ones Collision domain is a network segment with two or more devices sharing the same Introduction.
Copyright: S.Krishnamurthy, UCR Power Controlled Medium Access Control in Wireless Networks – The story continues.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Lan F.Akyildiz,Weilian Su, Erdal Cayirci,and Yogesh sankarasubramaniam IEEE Communications Magazine 2002 Speaker:earl A Survey on Sensor Networks.
 SNU INC Lab MOBICOM 2002 Directed Diffusion for Wireless Sensor Networking C. Intanagonwiwat, R. Govindan, D. Estrin, John Heidemann, and Fabio Silva.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols ► Acts as denial of service by disrupting the flow of data between a source and.
Presenter: Abhishek Gupta Dept. of Electrical and Computer Engineering
11/15/20051 ASCENT: Adaptive Self- Configuring sEnsor Networks Topologies Authors: Alberto Cerpa, Deborah Estrin Presented by Suganthie Shanmugam.
1 REED: Robust, Efficient Filtering and Event Detection in Sensor Networks Daniel Abadi, Samuel Madden, Wolfgang Lindner MIT United States VLDB 2005.
Energy-Efficient Shortest Path Self-Stabilizing Multicast Protocol for Mobile Ad Hoc Networks Ganesh Sridharan
Minimizing Energy Consumption in Sensor Networks Using a Wakeup Radio Matthew J. Miller and Nitin H. Vaidya IEEE WCNC March 25, 2004.
Data Collection and Dissemination. Learning Objectives Understand Trickle – an data dissemination protocol for WSNs Understand data collection protocols.
Efficient Energy Management Protocol for Target Tracking Sensor Networks X. Du, F. Lin Department of Computer Science North Dakota State University Fargo,
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
Chapter 24 Transport Control Protocol (TCP) Layer 4 protocol Responsible for reliable end-to-end transmission Provides illusion of reliable network to.
Opportunistic Flooding in Low-Duty- Cycle Wireless Sensor Networks with Unreliable Links Shuo Goo, Yu Gu, Bo Jiang and Tian He University of Minnesota,
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
1 An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Networks Tijs van Dam, Koen Langendoen In ACM SenSys /1/2005 Hong-Shi Wang.
An Energy-Efficient MAC Protocol for Wireless Sensor Networks Speaker: hsiwei Wei Ye, John Heidemann and Deborah Estrin. IEEE INFOCOM 2002 Page
0.1 IT 601: Mobile Computing Wireless Sensor Network Prof. Anirudha Sahoo IIT Bombay.
RBP: Robust Broadcast Propagation in Wireless Networks Fred Stann, John Heidemann, Rajesh Shroff, Muhammad Zaki Murtaza USC/ISI In SenSys 2006.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Energy-Efficient Communication Protocol for Wireless Microsensor Networks by Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Presented.
MAC Protocols for Sensor Networks
How to minimize energy consumption of Sensors in WSN Dileep Kumar HMCL 30 th Jan, 2015.
MAC Protocols for Sensor Networks
Data Collection and Dissemination
Energy-Efficient Communication Protocol for Wireless Microsensor Networks by Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Presented.
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Trickle: Code Propagation and Maintenance
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Ultra-Low Duty Cycle MAC with Scheduled Channel Polling
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Application-Based Collision Avoidance in Wireless Sensor Networks
Investigating Mac Power Consumption in Wireless Sensor Network
Hongchao Zhou, Xiaohong Guan, Chengjie Wu
Presentation transcript:

A Remote Code Update Mechanism for Wireless Sensor Networks Thanos Stathopoulos, John Heidemann and Deborah Estrin CEG 790 Presentation By: Trevor Smith

Outline ● Introduction ● Problem Description ● Design Decisions ● Evaluation ● Conclusions ● Future Work Outline

What is Wireless Sensor Network ● Sensor networks integrate sensing, computing and communication ● Can be used for monitoring environmental changes, water contamination, seismic activity or structural building integrity ● Sensor resource constraints – Low Power – Limited Memory – Short range, low power radios Intro

Once Deployed What Happens? ● After deployment, motes might not be accessible again? ● Also, we can’t always predict full range of sensor actions or might not have a full set of environment knowledge. ● What is the solution? Reprogram! ● How do we handle post deployment reprogramming? ● How do we deal with the limited mote resources (battery, memory, etc.)? Intro

Solution ● Remote Code Distribution Mechanism ● Author proposes MOAP (Multihop Over-the-Air Programming) – Discuss different design alternatives: Data Dissemination protocols, retransmission policies and storage management – Design Goals? Focus on energy consumption, memory usage and latency ● Compare with flooding Intro

Outline ● Introduction ● Problem Description ● Design Decisions ● Evaluation ● Conclusions ● Future Work Outline

Code Distribution Properties ● 100% of image must reach all nodes – Reliability mechanism required ● If image cannot fit into single packet, it must be kept in stable storage until the transfer is complete ● Network lifetime should not be severely affected ● Memory and storage requirements should not severely affect the space required by the normal operations of the device Prob Desc.

Resource Prioritization ● Energy is most important resource – Radio transmission is expensive ● Transmit 3x cost of Recieve – Stable storage access ● Write is 1/8 the cost of transmitting the same number of bytes ● EEPROM is optimized for read operations and read is an order of magnitude cheaper than write Prob Desc.

Resource Prioritization ● Memory Utilization is a close second – Static RAM in specific ● Only about 4K on current gen. Motes – Must keep in mind reprogramming isn’t the motes only operation ● Main Goal: Limit energy consumption – Optimizations aren’t free – Trade latency for battery optimization – Is latency that important in reprogramming? Prob Desc.

Outline ● Introduction ● Problem Description ● Design Decisions ● Evaluation ● Conclusions ● Future Work Outline

Dissemination Protocol ● How is the data propagated ● All nodes must be reached ● Concurrently – Flooding ● Minimal state requirements ● Low energy prioritization ● Step by Step – Ripple (neighborhood-by-neighborhood) ● Slow Design Decisions

Assumptions

Definitions

Flooding Dissemination Protocol ● Flooding does a receive and forward type of mechanism – Once packet is received the node retransmits it ● Expected # of transmissions for the network is: ● The average time for node i at distance h i from the source is: Design Decisions

Flooding Dissemination Protocol Design Decisions

Ripple Dissemination Protocol ● Transfer data Neighborhood-by-Neighborhood – Neighborhood is all nodes in the broadcast domain – Single hop – Multihop handled recursively ● Receiver will attempt to become a source after entire image is received – Use PUBLISH-SUBSCRIBE mechanism ● Since a source is in the same network – Require all repairs to be local (one hop away) Design Decisions

Ripple Dissemination Protocol Design Decisions

Ripple Dissemination Protocol ● Expected # of transmissions for the network is: ● k i can be no more than (o i / 2) + 1 ● The average time for node i at distance h i from the source is: Design Decisions

Reliability Mechanism ● Requires 100% of image delivery ● Who is responsible for detecting loss – Sender (ACK) – Receiver (NACK) ● NACK based approach cuts down on control traffic ● Require repairs local – Neighbors will have entire image in due time – Reduce complexity by not routing NACKs ● What is our Retransmission Policy? – Broadcast or Unicast Design Decisions

Retransmission Policy ● Broadcast RREQ, no suppression – Simple – High Probability of Reception – Highly Inefficient – Zero Latency ● Broadcast RREQ, suppression based on randomized timers – Efficient – Complex – Reply if timer interval expires and no one else has replied Design Alts

Retransmission Policy (cont’d) ● Broadcast RREQ, fixed reply probability – Simple – Good Probability of Reception – Latency depends on probability of reply – Avg efficiency ● Broadcast RREQ, adaptive reply probability – More complex than static case – Latency and reception similar Design Alts

Retransmission Policy (cont’d) ● Unicast RREQ, single reply – Has the smallest prob. of successful reception – Highest Efficiency – Simple, as long as source doesn’t fail – Zero latency, if source doesn’t fail Design Alts

Segment Management ● No Indexing – Read EEPROM to find if segment is missing ● Full Indexing – Bitmap in RAM, if entry i in RAM is empty, segment i is missing Design Alts RAM EEPROM

Segment Management (cont’d) ● Partial Indexing – Bitmap kept in RAM – i/k and check if entry in RAM is empty or full – If empty, need to do k consecutive reads to find missing segment Design Alts RAM EEPROM

Segment Management (cont’d) ● Hierarchical Full Indexing – First level map kept in RAM, points to a page in EEPROM – Consider EEPROM data to be same as physical page size – i div m finds page, i mod m in particular page finds segment Design Alts RAM

Segment Management (cont’d) ● Sliding Window – Bitmap of up to w segments kept in RAM – Limited out of order tolerance – Last segment received starting point of window Design Alts BaseOffset

Segment Management Comparison Design Alts

Outline ● Introduction ● Problem Description ● Design Decisions ● Evaluation ● Conclusions ● Future Work Outline

Emulation ● EmStar emulation environment ● 30 Mica1 Motes – Attached via serial cables ● Transmitted image consists of 100 segments – 1 segment per packet ● Methods using sliding window – Window size = 16bits Eval

Emulation ● Neighborhood size vs Power setting Design Alts

Energy Consumption ● Ripple w/ Sliding Window ● Flooding w/ Sliding Window ● Ripple w/ Full Indexing Eval

Energy Consumption ● Flooding hangs around 100 transmissions – Changes to power settings doesn’t affect it ● Ripple produces large power savings in terms of transmissions...WHY? ● Ripple w/ Full Indexing performs better for sparse networks – Dense networks savings isn’t sufficient to justify using Full Indexing Eval

Latency ● As we stated earlier – We will trade latency for power efficiency Eval

Latency ● Tx rate of 2 packets/sec ● A faster Tx rate will note saturate the channel for ripple – However it would increase the number of collisions in flooding, resulting in more retransmissions ● Again Ripple w/ Full Indexing performs better than Ripple w/ Sliding Window Eval

Retransmission Policies ● Using ripple w/ sliding window – Compare broadcast vs unicast ● Why is Unicast less than Broadcast Eval

Retransmission Policies ● Unicast performs better than Broadcast ● But what happens if the link fails in Unicast – Receiver must locate another source – Author proposes MAC to do link level retransmissions Eval

Mote Implementation ● 15 Mica2 Motes ● 100 segments, 1 segment per packet ● Mica2 Motes have a stronger radio than the Mica1 motes – This results in better link qualities, fewer retransmissions and more rapid change in neighborhood size ● No Full Indexing scheme in TinyOS Eval

Mote Implementation ● Retransmissions significantly smaller than emulation ● Power settings not as high either Eval

MOAP Implementation ● Ripple disseminations, Unicast retransmission and Sliding Window segment Management ● Code is split up via packetizer ● Nodes use link statistics mechanism – Don’t subscribe to sources that are lossy, intermittent or unreliable ● Once complete image is stored, send PUBLISH messages – If no SUBSCRIBERS commit code with bootloader to program memory Eval

MOAP Implementation (cont’d) ● Active sources – After predetermined time has passed and retransmissions have been handled – Commit the code ● Nodes detect lost segments with sliding window – Retransmission have higher priority than Data packets – Duplicate request suppressed ● Node keeps track of sources activity with a keep alive timer Eval

MOAP Implementation (cont’d) ● Node keeps track of sources activity with a keep alive timer – Solves NACK’s “Last Packet Problem” – If source dies the keep alive timer will broadcast a repair request ● Late joiner mechanism allows nodes that have just recovered from a failure to get the new version of code – This requires that nodes advertise their version periodically Eval

Outline ● Introduction ● Problem Description ● Design Decisions ● Evaluation ● Conclusions ● Future Work Outline

Conclusions ● As sensor networks grow remote programmability will become a more critical service ● MOAP is designed to be more energy and memory efficient – While trading latency ● Ripple dissemination achieves significant reductions in traffic – 60-90% better ● Sliding Window performs adequately compared to more complex solutions Conclusions

Outline ● Introduction ● Problem Description ● Design Decisions ● Evaluation ● Conclusions ● Future Work Outline

Future Work ● Sending differences between code versions – Only transmit the differences between the code – Need a bootloader to reconstruct the image in EEPROM before committing it – Results in an even larger amount of energy savings ● Support for selective node updates – Don’t require every node to commit the code after receiving it. – Intermediate nodes that are not interested just forward the image on. Future Work