The Community for Technology Leaders
2011 IEEE Symposium on Computers and Communications (ISCC) (2011)
June 28, 2011 to July 1, 2011
ISBN: 978-1-4577-0680-6
pp: 802-808
A. Shamsaie , Dept. of Comput. Eng., Sharif Univ. of Technol., Tehran, Iran
J. Habibi , Dept. of Comput. Eng., Sharif Univ. of Technol., Tehran, Iran
One of the arising issues in wireless sensor networks is running multiple applications to reduce deployment, administrative and management costs. In this paper we assume a sensor network in which nodes of a group have a set of same applications in their external flash memory that some of them are loaded and running. Occasionally, these applications should be updated for reasons that are manifold ranging from fixing software bugs to retasking. It is often that updates for a subset of applications happen at the same time, for example when a routing protocol shared among a subset of applications is changed. To bring the sensor nodes up to date with the new versions of the applications, existing strategies transfer the delta code, a smaller code obtained from the differential compression between the binary representations of the old and the new version of each application, and let the sensor nodes rebuild the new version from the received delta and the old version. We discuss that these strategies are blind to the order of updates when a set of updates occurs simultaneously. We introduce a heuristic planner that yields a sequence for a set of simultaneous updates, which minimizes the total delta size without adding overhead on the sensor nodes. We illustrate the efficiency of our planner on some TinyOS applications.
TinyOS application, planning updates, multiapplication wireless sensor networks, flash memory, differential compression

A. Shamsaie and J. Habibi, "Planning updates in multi-application wireless sensor networks," 2011 IEEE Symposium on Computers and Communications (ISCC), Kerkyra, 2011, pp. 802-808.
187 ms
(Ver 3.3 (11022016))