ℛ2: Incremental ℛeprogramming using ℛelocatable code in networked embedded systems

We present ℛ<sup>2</sup>, an incremental ℛeprogramming approach using Relocatable code, to improve program similarity for efficient incremental reprogramming in networked embedded systems. ℛ<sup>2</sup> achieves a higher degree of similarity than existing approaches by mitigating the effects of both function shifts and data shifts. ℛ<sup>2</sup> makes efficient use of memory and does not degrade program quality. It adopts an optimized differencing algorithm to generate small delta files for efficient dissemination. We demonstrate ℛ<sup>2</sup>'s advantages through detailed analysis of TinyOS examples. We also present case studies on the software programs of a large-scale and long-term sensor system—GreenOrbs. Results show that ℛ<sup>2</sup> reduces the dissemination cost by approximately 65% compared to Deluge—state-of-the-art network reprogramming approach, and reduces the dissemination cost by approximately 20% compared to Zephyr and Hermes—the latest works on incremental reprogramming.

[1]  Gyula Simon,et al.  The flooding time synchronization protocol , 2004, SenSys '04.

[2]  David E. Culler,et al.  Incremental network programming for wireless sensors , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[3]  Yi He,et al.  Reprogramming with Minimal Transferred Data on Wireless Sensor Network , 2009, 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems.

[4]  Indranil Gupta,et al.  AdapCode: Adaptive Network Coding for Code Updates in Wireless Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[5]  Matt Welsh,et al.  Fidelity and yield in a volcano monitoring sensor network , 2006, OSDI '06.

[6]  Fred Douglis,et al.  USENIX Association Proceedings of the General Track : 2003 USENIX Annual , 2003 .

[7]  Himabindu Pucha,et al.  Efficient Similarity Estimation for Systems Exploiting Data Redundancy , 2010, 2010 Proceedings IEEE INFOCOM.

[8]  Issa M. Khalil,et al.  Stream: Low Overhead Wireless Reprogramming for Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[9]  Joel Koshy,et al.  Remote incremental linking for energy-efficient reprogramming of sensor networks , 2005, Proceeedings of the Second European Workshop on Wireless Sensor Networks, 2005..

[10]  Ronald Fagin,et al.  Compactly encoding unstructured inputs with differential compression , 2002, JACM.

[11]  Saurabh Bagchi,et al.  Zephyr: efficient incremental reprogramming of sensor nodes using function call indirections and difference computation , 2009 .

[12]  Margaret Martonosi,et al.  Data compression algorithms for energy-constrained devices in delay tolerant networks , 2006, SenSys '06.

[13]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[14]  Philip Levis,et al.  Collection tree protocol , 2009, SenSys '09.

[15]  Michele Zorzi,et al.  SYNAPSE++: Code Dissemination in Wireless Sensor Networks Using Fountain Codes , 2010, IEEE Transactions on Mobile Computing.

[16]  Limin Wang,et al.  MNP: Multihop Network Reprogramming Service for Sensor Networks , 2004, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[17]  Qiang Wang,et al.  Reprogramming wireless sensor networks: challenges and approaches , 2006, IEEE Network.

[18]  Sanjeev Setia,et al.  CORD: Energy-Efficient Reliable Bulk Data Dissemination in Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[19]  David E. Culler,et al.  The dynamic behavior of a data dissemination protocol for network programming at scale , 2004, SenSys '04.

[20]  David E. Culler,et al.  Design of an application-cooperative management system for wireless sensor networks , 2005, Proceeedings of the Second European Workshop on Wireless Sensor Networks, 2005..

[21]  Weijia Li,et al.  UCC: update-conscious compilation for energy efficiency in wireless sensor networks , 2007, PLDI '07.

[22]  Himabindu Pucha,et al.  Exploiting Similarity for Multi-Source Downloads Using File Handprints , 2007, NSDI.

[23]  Yunhao Liu,et al.  Link quality aware code dissemination in wireless sensor networks , 2011, 2011 19th IEEE International Conference on Network Protocols.

[24]  Michele Zorzi,et al.  SYNAPSE: A Network Reprogramming Protocol for Wireless Sensor Networks Using Fountain Codes , 2008, 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[25]  John R. Levine.  Linkers and Loaders , 1999 .

[26]  David Starobinski,et al.  Rateless Deluge: Over-the-Air Programming of Wireless Sensor Networks Using Random Linear Codes , 2008, 2008 International Conference on Information Processing in Sensor Networks (ipsn 2008).

[27]  Adam Dunkels,et al.  Efficient Sensor Network Reprogramming through Compression of Executable Modules , 2008, 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[28]  Shaojie Tang,et al.  Canopy closure estimates with GreenOrbs: sustainable sensing in the forest , 2009, SenSys '09.

[29]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[30]  Saurabh Bagchi,et al.  Hermes: Fast and Energy Efficient Incremental Code Updates for Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.

[31]  Wei Dong,et al.  A Lightweight and Density-Aware Reprogramming Protocol for Wireless Sensor Networks , 2011, IEEE Transactions on Mobile Computing.

[32]  Gang Zhou,et al.  Achieving Long-Term Surveillance in VigilNet , 2006, INFOCOM.