Efficient incremental code update for sensor networks
Authors:
Open Access
- 4 February 2011
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Sensor Networks
- Vol. 7 (4) , 1-32
Abstract
Wireless reprogramming of sensor nodes is an essential requirement for long-lived networks since software functionality needs to be changed over time. During reprogramming, the number of radio transmissions should be minimized, since reprogramming time and energy depend chiefly on the number of radio transmissions. In this article, we present a multihop incremental reprogramming protocol called Zephyr that transfers the delta between old and new software versions, and lets the sensor nodes rebuild the new software using the received delta and the old software. Zephyr reduces the delta size by using application-level modifications to mitigate the effects of function shifts. Then it compares the two binary images at the byte level to generate a small delta, that is then sent over the wireless network to all the nodes. For the wide range of software change cases that we used as benchmarks, Zephyr transfers 1.83 to 1987 times less traffic through the network than Deluge (the standard nonincremental reprogramming protocol for TinyOS) and 1.14 to 49 times less traffic than an existing incremental reprogramming protocol by Jeong and Culler [2004].Keywords
This publication has 20 references indexed in Scilit:
- Darjeeling, a feature-rich VM for the resource poor2009
- TOSThreads2009
- X-MAC2006
- Growth codes2006
- VMSTAR2005
- Low Power Downlink MAC Protocols for Infrastructure Wireless Sensor NetworksMobile Networks and Applications, 2005
- A dynamic operating system for sensor nodes2005
- Contiki - a lightweight and flexible operating system for tiny networked sensors2004
- The dynamic behavior of a data dissemination protocol for network programming at scale2004
- Application isolation in the Java Virtual Machine2000