Efficient Incremental Code Update for Sensor Networks

Rajesh Panta

doi:10.1145/1921621.1921624

Return

Efficient Incremental Code Update for Sensor Networks

2011-02-04

PRE

Rajesh Panta *

Saurabh Bagchi

Samuel P. Midkiff

DOI：10.1145/1921621.1921624

Original

Original request for help

Save

Abstract

En 中文

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:

Design

Performance

Network reprogramming

Rsync

Deluge

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.