Jaein Jeong

EECS Department, University of California, Berkeley

Technical Report No. UCB/EECS-2005-17

November 21, 2005

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2005/EECS-2005-17.pdf

One problem of the current network programming implementation of TinyOS is that it takes much longer than the traditional in-system programming due to the slow radio connection. We extended the network programming implementation of TinyOS 1.1 release so that it can reduce the programming time using the program code history. The host program generates the difference of the two program images using the Rsync algorithm and it sends the difference to the sensor nodes as script messages. The sensor nodes rebuild the program image based on the previous program version and the received script messages. The Rsync algorithm compares the two binary files and finds the matching blocks even though they are located in an arbitrary location within the files. We were able to get speed up of 9.1 for changing a constant and 2.1 to 2.5 for changing a few lines in the source code.

Advisors: David E. Culler

---

BibTeX citation:

@mastersthesis{Jeong:EECS-2005-17,
    Author= {Jeong, Jaein},
    Title= {Incremental Network Programming for Wireless Sensors},
    School= {EECS Department, University of California, Berkeley},
    Year= {2005},
    Month= {Nov},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2005/EECS-2005-17.html},
    Number= {UCB/EECS-2005-17},
    Abstract= {One problem of the current network programming implementation of TinyOS is that it takes much longer than the traditional in-system programming due to the slow radio connection. We extended the network programming implementation of TinyOS 1.1 release so that it can reduce the programming time using the program code history. The host program generates the difference of the two program images using the Rsync algorithm and it sends the difference to the sensor nodes as script messages. The sensor nodes rebuild the program image based on the previous program version and the received script messages. The Rsync algorithm compares the two binary files and finds the matching blocks even though they are located in an arbitrary location within the files. We were able to get speed up of 9.1 for changing a constant and 2.1 to 2.5 for changing a few lines in the source code.},
}

EndNote citation:

%0 Thesis
%A Jeong, Jaein 
%T Incremental Network Programming for Wireless Sensors
%I EECS Department, University of California, Berkeley
%D 2005
%8 November 21
%@ UCB/EECS-2005-17
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2005/EECS-2005-17.html
%F Jeong:EECS-2005-17